# 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/9orless//libgnokii4.cudf # Using output file /home/competition/tmp/p2cudf-trendy/libgnokii4.cudf.9orless.result # Using criteria trendy # Parsing ... # Parsing done (2.972s). # 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@a46701 # 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: 1831ms. # Invoking solver ... # Solver first solution found: 2249ms. # Current objective function value: 1532907268(2.324s) # Current objective function value: 832439938(3.642s) # Current objective function value: 721276843(4.75s) # Current objective function value: 703280699(5.701s) # Solver best solution decoded: 277247ms. # p cnf 102649 85840 # starts : 23 # conflicts : 431587 # decisions : 660838 # propagations : 566485910 # inspects : 221741900 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 431587 # 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) : 2086304.4791290704 # non guided choices 4131 # learnt constraints type # Solving done (279.963s). # Solution contains:3140