# 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.newlist/randc5fe62.cudf # Using output file /home/competition/tmp/p2cudf-paranoid/randc5fe62.cudf.rand.newlist.result # Using criteria paranoid # Parsing ... # Parsing done (2.629s). # 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: 796ms. # Invoking solver ... # Solver first solution found: 1216ms. # Current objective function value: 16295(1.284s) # Current objective function value: 13071(2.062s) # Current objective function value: 8299(2.332s) # Current objective function value: 1921(2.451s) # Current objective function value: 1920(2.638s) # Current objective function value: 1907(2.749s) # Current objective function value: 1906(2.95s) # Current objective function value: 1905(3.137s) # Current objective function value: 1904(3.318s) # Current objective function value: 1903(3.482s) # Current objective function value: 1901(3.587s) # Current objective function value: 1900(3.887s) # Current objective function value: 1899(4.37s) # Current objective function value: 1898(4.558s) # Current objective function value: 1897(4.99s) # Current objective function value: 1896(5.458s) # Current objective function value: 1895(6.118s) # Current objective function value: 1893(6.224s) # Current objective function value: 1892(6.513s) # Current objective function value: 1891(10.352s) # Current objective function value: 1890(10.808s) # Current objective function value: 1889(13.405s) # Current objective function value: 1888(14.567s) # Current objective function value: 1887(16.123s) # Current objective function value: 1886(21.614s) # Current objective function value: 1885(24.562s) # Current objective function value: 1884(24.814s) # Current objective function value: 1883(27.136s) # Solver best solution decoded: 29866ms. # p cnf 31281 25524 # starts : 123 # conflicts : 59612 # decisions : 329321 # propagations : 15708347 # inspects : 45233043 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 59611 # 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) : 5792163.3480825955 # non guided choices 18754 # learnt constraints type # Solving done (31.671s). # Solution contains:812