# 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/9orless//libmono-relaxng1.0-cil.cudf # Using output file /home/competition/tmp/p2cudf-p2/libmono-relaxng1.0-cil.cudf.9orless.result # Using criteria p2 # Parsing ... # Parsing done (2.36s). # 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: 2060ms. # Invoking solver ... # Solver first solution found: 1827ms. # Current objective function value: -8875699(1.963s) # Current objective function value: -8927919(3.471s) # Current objective function value: -8927920(4.989s) # Solver best solution decoded: 234503ms. # p cnf 84507 71992 # starts : 8 # conflicts : 1000 # decisions : 28166 # propagations : 416915 # inspects : 548796 # 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) : 1816.6310092854435 # non guided choices 868 # learnt constraints type # Solving done (237.586s). # Solution contains:2922