#Using input file /home/competition/data/datasets/10orplus/kdebase-bin.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid/kdebase-bin.cudf.10orplus.result #Objective function paranoid #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 720163024 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:1333 #Parsing done (1.336s). #Solving ... #Request size: 2961 #Number of packages after slice: 9554 #Slice efficiency: 80% ## 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@47393f # 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 paranoid #p cnf 19769 96288 # Current objective function value: 244964(0.863s) # Current objective function value: 244963(2.664s) # Current objective function value: 158973(2.864s) # cleaning 2499 clauses out of 4997 with flag 5000/5000 # cleaning 4246 clauses out of 8498 with flag 11000/11000 # cleaning 5627 clauses out of 11253 with flag 18001/18001 # cleaning 6813 clauses out of 13625 with flag 26000/26000 # cleaning 7906 clauses out of 15812 with flag 35000/35000 # cleaning 8954 clauses out of 17907 with flag 45001/45001 # cleaning 9974 clauses out of 19952 with flag 56000/56000 # cleaning 10986 clauses out of 21978 with flag 68000/68000 # cleaning 11996 clauses out of 23993 with flag 81001/81001 # cleaning 12986 clauses out of 25996 with flag 95000/95000 # cleaning 13999 clauses out of 28010 with flag 110000/110000 # cleaning 15006 clauses out of 30012 with flag 126001/126001 # cleaning 16001 clauses out of 32007 with flag 143002/143002 # cleaning 16995 clauses out of 34005 with flag 161001/161001 # cleaning 17998 clauses out of 36010 with flag 180001/180001 # cleaning 19006 clauses out of 38011 with flag 200000/200000 # cleaning 19993 clauses out of 40005 with flag 221000/221000 # cleaning 21002 clauses out of 42012 with flag 243000/243000 # cleaning 22002 clauses out of 44012 with flag 266002/266002 # cleaning 23002 clauses out of 46008 with flag 290000/290000 # cleaning 24000 clauses out of 48006 with flag 315000/315000 # cleaning 24994 clauses out of 50006 with flag 341000/341000 # cleaning 25994 clauses out of 52012 with flag 368000/368000 # cleaning 27001 clauses out of 54019 with flag 396001/396001 # cleaning 28005 clauses out of 56019 with flag 425002/425002 # cleaning 28996 clauses out of 58012 with flag 455000/455000 # cleaning 30005 clauses out of 60017 with flag 486001/486001 # cleaning 31005 clauses out of 62012 with flag 518001/518001 # starts : 28 # conflicts : 519054 # decisions : 759922 # propagations : 866532642 # inspects : 378175670 # learnt literals : 3 # learnt binary clauses : 364 # learnt ternary clauses : 205 # learnt clauses : 519051 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 10324933 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 28 # 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) : 3240367.6715853084 # non guided choices 8618 # learnt constraints type #Solving done (271.758s). #Solution contains:2931