# 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 720172160 # Max memory 723845120 # Total memory 723845120 # Number of processors 2 # Using input file /home/competition/data/random/rand.newlist/randf66c83.cudf # Using output file /home/competition/tmp/p2cudf-trendy/randf66c83.cudf.rand.newlist.result # Using criteria trendy # Parsing ... # Parsing done (2.246s). # 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@120cc56 # 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, trendy # Projection completed: 595ms. # Invoking solver ... # Solver first solution found: 814ms. # Current objective function value: 29699980(0.9s) # Current objective function value: 7539413(1.227s) # Current objective function value: 7539412(197.801s) # cleaning 285397 clauses out of 571001 # Solver best solution decoded: 294231ms. # p cnf 28057 22935 # starts : 36 # conflicts : 571001 # decisions : 768042 # propagations : 187997849 # inspects : 337115107 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 571001 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 0 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 1 # 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) : 1949659.3138779998 # non guided choices 871 # learnt constraints type # Solving done (295.416s). # Solution contains:819