#Using input file /home/competition/data/random/rand.newlist/randf66c83.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid2/randf66c83.cudf.rand.newlist.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:1551 #Parsing done (1.554s). #Solving ... #Request size: 581 #Number of packages after slice: 3001 #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@a46701 # 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 5673 24765 # Current objective function value: 25455(0.396s) # Current objective function value: 6558(0.824s) # Current objective function value: 6515(0.886s) # Current objective function value: 4947(0.921s) # Current objective function value: 4922(0.946s) # Current objective function value: 4921(1.125s) # Current objective function value: 4920(1.164s) # Current objective function value: 4918(1.179s) # starts : 13 # conflicts : 1234 # decisions : 148542 # propagations : 1037495 # inspects : 2705929 # learnt literals : 0 # learnt binary clauses : 309 # learnt ternary clauses : 48 # learnt clauses : 1233 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 58951 # 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) : 3106272.45508982 # non guided choices 4722 # learnt constraints type #Solving done (2.795s). #Solution contains:725