#Using input file /home/competition/data/random/rand.newlist/randf794d2.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid/randf794d2.cudf.rand.newlist.result #Objective function paranoid #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 720163024 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:1624 #Parsing done (1.627s). #Solving ... #Request size: 581 #Number of packages after slice: 3025 #Slice efficiency: 95% ## 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@1aa57fb # 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 paranoid #p cnf 5716 25543 # Current objective function value: 24234(0.438s) # Current objective function value: 17812(0.902s) # Current objective function value: 13018(0.947s) # Current objective function value: 9858(0.969s) # Current objective function value: 9854(1.042s) # Current objective function value: 9851(1.749s) # Current objective function value: 9850(1.995s) # Current objective function value: 9849(2.182s) # Current objective function value: 9844(2.538s) # Current objective function value: 8272(2.684s) # Current objective function value: 8238(2.699s) # Current objective function value: 8237(2.716s) # Current objective function value: 8236(2.746s) # Current objective function value: 8235(2.763s) # Current objective function value: 8234(3.793s) # cleaning 2501 clauses out of 5001 with flag 5001/5001 # Current objective function value: 8233(4.864s) # cleaning 4250 clauses out of 8499 with flag 11000/11000 # Current objective function value: 8232(9.151s) # Current objective function value: 8231(10.821s) # cleaning 5625 clauses out of 11249 with flag 18000/18000 # Current objective function value: 8230(16.047s) # Current objective function value: 8229(16.101s) # cleaning 6812 clauses out of 13624 with flag 26000/26000 # starts : 71 # conflicts : 26080 # decisions : 210628 # propagations : 25826213 # inspects : 65460173 # learnt literals : 0 # learnt binary clauses : 310 # learnt ternary clauses : 78 # learnt clauses : 26079 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 2677582 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 4 # 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) : 2.5672179920477137E7 # non guided choices 11669 # learnt constraints type #Solving done (18.05s). #Solution contains:770