#Using input file /home/competition/data/datasets/9orless/libevolution3.0-cil.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid2/libevolution3.0-cil.cudf.9orless.result #Objective function paranoid #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 720163024 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:1818 #Parsing done (1.828s). #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@120cc56 # 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 paranoid #p cnf 19771 96305 # Current objective function value: 236448(0.903s) # Current objective function value: 159082(1.171s) # Current objective function value: 159078(1.301s) # starts : 9 # conflicts : 2000 # decisions : 129172 # propagations : 4114919 # inspects : 3288354 # learnt literals : 2 # learnt binary clauses : 114 # learnt ternary clauses : 17 # learnt clauses : 1998 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 34732 # 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) : 3487219.4915254237 # non guided choices 10937 # learnt constraints type #Solving done (4.196s). #Solution contains:2974