#Using input file /home/competition/data/random/rand.newlist/rand0a62b6.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid2/rand0a62b6.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:1796 #Parsing done (1.806s). #Solving ... #Request size: 581 #Number of packages after slice: 3214 #Slice efficiency: 94% ## 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 5981 26838 # Current objective function value: 8780(0.57s) # Current objective function value: 8652(1.027s) # Current objective function value: 6978(1.098s) # Current objective function value: 6975(1.274s) # Current objective function value: 6965(1.303s) # Current objective function value: 6964(1.355s) # Current objective function value: 6945(1.372s) # Current objective function value: 6944(1.396s) # starts : 9 # conflicts : 646 # decisions : 154594 # propagations : 751921 # inspects : 1997593 # learnt literals : 0 # learnt binary clauses : 420 # learnt ternary clauses : 58 # learnt clauses : 645 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 15188 # 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) : 1.748653488372093E7 # non guided choices 4365 # learnt constraints type #Solving done (2.634s). #Solution contains:757