#Using input file /home/competition/data/datasets/9orless/libevolution3.0-cil.cudf #Using ouput file /home/competition/tmp/p2cudf-trendy/libevolution3.0-cil.cudf.9orless.result #Objective function trendy #Timeout 270s #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 720163048 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:1501 #Parsing done (1.511s). #Solving ... #Request size: 2961 #Number of packages after slice: 9555 #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@1c9b9ca # 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=270s # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: misc 2010, trendy #p cnf 16811 86108 # Current objective function value: 1920832120(0.869s) # Current objective function value: 685152129(1.256s) # cleaning 2496 clauses out of 4998 with flag 5000/5000 # cleaning 4252 clauses out of 8503 with flag 11001/11001 # cleaning 5618 clauses out of 11250 with flag 18000/18000 # cleaning 6815 clauses out of 13632 with flag 26000/26000 # cleaning 7898 clauses out of 15818 with flag 35001/35001 # starts : 15 # conflicts : 38942 # decisions : 135923 # propagations : 34394894 # inspects : 13479735 # learnt literals : 2 # learnt binary clauses : 93 # learnt ternary clauses : 37 # learnt clauses : 38940 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 5764839 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 5 # 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) : 127859.20760131745 # non guided choices 4238 # learnt constraints type #Solving done (271.878s). #Solution contains:3195