# 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 720172152 # Max memory 723845120 # Total memory 723845120 # Number of processors 2 # Using input file /home/competition/data/datasets/10orplus//evolution-dev.cudf # Using output file /home/competition/tmp/p2cudf-p2/evolution-dev.cudf.10orplus.result # Using criteria p2 # Parsing ... # Parsing done (2.57s). # 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=1000 conflicts # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: p2 # Projection completed: 1906ms. # Invoking solver ... # Solver first solution found: 1930ms. # Current objective function value: -8789662(2.028s) # Current objective function value: -8829628(3.568s) # Current objective function value: -8841871(4.604s) # Current objective function value: -8841872(6.162s) # Solver best solution decoded: 231296ms. # p cnf 84607 72076 # starts : 9 # conflicts : 1000 # decisions : 40656 # propagations : 546995 # inspects : 744639 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 1000 # 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) : 2429.8253796914496 # non guided choices 1159 # learnt constraints type # Solving done (234.572s). # Solution contains:2911