#Using input file /home/competition/data/random/rand.smallist/rand601ba8.cudf #Using ouput file /home/competition/tmp/p2cudf-trendy/rand601ba8.cudf.rand.smallist.result #Objective function trendy #Timeout 270s #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 720163048 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:1059 #Parsing done (1.062s). #Solving ... #Request size: 1225 #Number of packages after slice: 2401 #Slice efficiency: 93% ## 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 # Expensive reason simplification # MiniSAT restarts strategy # Glucose learned constraints deletion strategy # timeout=270s # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: misc 2010, trendy #p cnf 5586 19119 # Current objective function value: 41618615(0.231s) # Current objective function value: 41618613(0.452s) # cleaning 2500 clauses out of 5001 with flag 5001/5001 # starts : 11 # conflicts : 6590 # decisions : 15889 # propagations : 1855050 # inspects : 3523291 # learnt literals : 0 # learnt binary clauses : 2 # learnt ternary clauses : 0 # learnt clauses : 6589 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 127673 # 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) : 118389.81428297913 # non guided choices 2270 # learnt constraints type #Solving done (17.067s). #Solution contains:1707