#Using input file /home/competition/data/random/rand.newlist/rand085d8a.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid/rand085d8a.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:1587 #Parsing done (1.59s). #Solving ... #Request size: 581 #Number of packages after slice: 2815 #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@1ff7a1e # 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 5388 23979 # Current objective function value: 50423(0.513s) # Current objective function value: 44491(0.945s) # Current objective function value: 17995(1.018s) # Current objective function value: 17959(1.075s) # Current objective function value: 10609(1.1s) # Current objective function value: 10602(1.123s) # Current objective function value: 10601(1.28s) # Current objective function value: 10582(1.294s) # Current objective function value: 10581(1.572s) # starts : 11 # conflicts : 794 # decisions : 191182 # propagations : 870508 # inspects : 2082445 # learnt literals : 0 # learnt binary clauses : 312 # learnt ternary clauses : 41 # learnt clauses : 793 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 35811 # 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) : 4.14527619047619E7 # non guided choices 5392 # learnt constraints type #Solving done (2.88s). #Solution contains:733