#Using input file /home/competition/data/random/rand.biglist/randa6997e.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid2/randa6997e.cudf.rand.biglist.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:1542 #Parsing done (1.551s). #Solving ... #Request size: 631 #Number of packages after slice: 3377 #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 6253 27390 # Current objective function value: 30909(0.562s) # Current objective function value: 9516(1.205s) # Current objective function value: 9499(1.365s) # Current objective function value: 5943(1.415s) # Current objective function value: 5915(1.453s) # Current objective function value: 5905(1.49s) # Current objective function value: 5904(1.516s) # Current objective function value: 5903(1.558s) # Current objective function value: 5902(1.59s) # starts : 14 # conflicts : 2000 # decisions : 356198 # propagations : 2008175 # inspects : 5182966 # learnt literals : 0 # learnt binary clauses : 661 # learnt ternary clauses : 73 # learnt clauses : 2000 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 105964 # 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) : 2966285.081240768 # non guided choices 6088 # learnt constraints type #Solving done (3.57s). #Solution contains:1072