#Using input file /home/competition/data/datasets/9orless/tasque.cudf #Using ouput file /home/competition/tmp/p2cudf-trendy2/tasque.cudf.9orless.result #Objective function trendy #Timeout 2000c #java.runtime.name Java(TM) SE Runtime Environment #java.vm.name Java HotSpot(TM) Server VM #java.vm.version 11.2-b01 #java.vm.vendor Sun Microsystems Inc. #sun.arch.data.model 32 #java.version 1.6.0_12 #os.name Linux #os.version 2.6.18-6-xen-amd64 #os.arch i386 #Free memory 720163000 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:3139 #Parsing done (3.142s). #Solving ... #Request size: 2961 #Number of packages after slice: 9560 #Slice efficiency: 80% ## Optimization to Pseudo Boolean adapter # Pseudo Boolean Optimization # --- Begin Solver configuration --- # Stops conflict analysis at the first Unique Implication Point # org.sat4j.pb.constraints.CompetResolutionPBMixedHTClauseCardConstrDataStructure@1bfc93a # Learn all clauses as in MiniSAT # claDecay=0.999 varDecay=0.95 conflictBoundIncFactor=1.5 initConflictBound=100 # VSIDS like heuristics from MiniSAT using a heap phase appearing in latest learned clause taking into account the objective function # Expensive reason simplification # MiniSAT restarts strategy # Glucose learned constraints deletion strategy # timeout=2000 conflicts # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: misc 2010, trendy #p cnf 16819 86177 # Current objective function value: 1627937042(1.038s) # Current objective function value: 704129235(1.372s) # Current objective function value: 686112075(1.619s) # starts : 8 # conflicts : 2000 # decisions : 99826 # propagations : 3224823 # inspects : 1580957 # learnt literals : 1 # learnt binary clauses : 68 # learnt ternary clauses : 14 # learnt clauses : 1999 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 24416 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 0 # number of reductions to clauses (during analyze) : 0 # number of learned constraints concerned by reduction : 0 # number of learning phase by resolution : 0 # number of learning phase by cutting planes : 0 # speed (assignments/second) : 2087264.077669903 # non guided choices 3056 # learnt constraints type #Solving done (6.0s). #Solution contains:3195