# 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/datasets/10orplus//pybackpack.cudf # Using output file /home/competition/tmp/p2cudf-trendy/pybackpack.cudf.10orplus.result # Using criteria trendy # Parsing ... # Parsing done (2.369s). # 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, trendy # Projection completed: 1669ms. # Invoking solver ... # Solver first solution found: 2103ms. # Current objective function value: 1423545219(2.159s) # Current objective function value: 1183312841(3.598s) # Current objective function value: 924672068(4.726s) # Current objective function value: 796527090(5.599s) # Current objective function value: 796497005(6.396s) # Solver best solution decoded: 282598ms. # p cnf 102697 85880 # starts : 24 # conflicts : 352634 # decisions : 586254 # propagations : 530557487 # inspects : 270064955 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 352634 # 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) : 1921564.7810450294 # non guided choices 4716 # learnt constraints type # Solving done (285.691s). # Solution contains:3157