# 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 720172360 # Max memory 723845120 # Total memory 723845120 # Number of processors 2 # Using input file /home/competition/data/random/rand.biglist/rand0c02bc.cudf # Using output file /home/competition/tmp/p2cudf-paranoid/rand0c02bc.cudf.rand.biglist.result # Using criteria paranoid # Parsing ... # Parsing done (2.514s). # Solving ... # Starting projection ... # 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@1bc887b # 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 # No reason simplification # MiniSAT restarts strategy # Memory based learned constraints deletion strategy # timeout=270s # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: misc 2010 paranoid # Projection completed: 946ms. # Invoking solver ... # Solver first solution found: 1487ms. # Current objective function value: 33930(1.528s) # Current objective function value: 17251(2.269s) # Current objective function value: 8798(2.522s) # Current objective function value: 8777(2.75s) # Current objective function value: 8765(3.034s) # Current objective function value: 8764(3.234s) # Current objective function value: 8763(3.469s) # Current objective function value: 8757(3.556s) # Current objective function value: 8756(3.698s) # Current objective function value: 8754(3.807s) # Current objective function value: 8753(3.97s) # Current objective function value: 8752(4.265s) # Current objective function value: 8751(4.424s) # Current objective function value: 8750(5.029s) # Current objective function value: 8749(5.423s) # Current objective function value: 8748(5.693s) # Current objective function value: 8747(5.919s) # Current objective function value: 8746(6.172s) # Current objective function value: 8745(6.412s) # Current objective function value: 8744(6.69s) # Current objective function value: 8743(7.005s) # Current objective function value: 8742(7.202s) # Current objective function value: 8741(7.309s) # Current objective function value: 8740(8.567s) # Current objective function value: 8739(10.064s) # Current objective function value: 8738(24.539s) # Current objective function value: 8737(25.864s) # Current objective function value: 8736(28.154s) # Current objective function value: 8735(28.794s) # Current objective function value: 8734(44.886s) # Current objective function value: 8733(48.987s) # Current objective function value: 8732(58.05s) # Current objective function value: 8731(84.3s) # Solver best solution decoded: 93725ms. # p cnf 32801 26802 # starts : 137 # conflicts : 95680 # decisions : 656264 # propagations : 72678963 # inspects : 199392814 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 95679 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 0 # 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) : 7715388.853503184 # non guided choices 23437 # learnt constraints type # Solving done (95.68s). # Solution contains:882