#Using input file /home/competition/data/datasets/10orplus/mercurial-common.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid2/mercurial-common.cudf.10orplus.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:1533 #Parsing done (1.536s). #Solving ... #Request size: 2961 #Number of packages after slice: 9556 #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@763f5d # 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 19772 96296 # Current objective function value: 236375(0.768s) # Current objective function value: 171908(0.977s) # Current objective function value: 159012(1.117s) # Current objective function value: 159011(1.216s) # starts : 10 # conflicts : 2000 # decisions : 83325 # propagations : 4146673 # inspects : 2564210 # learnt literals : 2 # learnt binary clauses : 71 # learnt ternary clauses : 9 # learnt clauses : 1998 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 27797 # 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) : 3517110.2629346903 # non guided choices 11779 # learnt constraints type #Solving done (3.944s). #Solution contains:2932