#Using input file /home/competition/data/datasets/10orplus/libmail-spf-perl.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid/libmail-spf-perl.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:1378 #Parsing done (1.381s). #Solving ... #Request size: 2961 #Number of packages after slice: 9561 #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@120cc56 # 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 19781 96330 # Current objective function value: 567934(0.947s) # Current objective function value: 318388(1.519s) # Current objective function value: 318387(3.094s) # Current objective function value: 193630(3.33s) # Current objective function value: 193629(3.477s) # cleaning 2495 clauses out of 4997 with flag 5001/5001 # cleaning 4252 clauses out of 8504 with flag 11003/11003 # cleaning 5618 clauses out of 11250 with flag 18001/18001 # cleaning 6817 clauses out of 13633 with flag 26002/26002 # cleaning 7908 clauses out of 15815 with flag 35001/35001 # cleaning 8940 clauses out of 17906 with flag 45000/45000 # cleaning 9972 clauses out of 19966 with flag 56000/56000 # cleaning 10989 clauses out of 21994 with flag 68000/68000 # cleaning 11999 clauses out of 24006 with flag 81001/81001 # cleaning 13000 clauses out of 26006 with flag 95000/95000 # cleaning 13990 clauses out of 28006 with flag 110000/110000 # cleaning 15008 clauses out of 30019 with flag 126003/126003 # cleaning 15992 clauses out of 32009 with flag 143001/143001 # cleaning 16999 clauses out of 34018 with flag 161002/161002 # cleaning 18009 clauses out of 36018 with flag 180001/180001 # cleaning 19004 clauses out of 38008 with flag 200000/200000 # cleaning 19999 clauses out of 40004 with flag 221000/221000 # cleaning 20991 clauses out of 42006 with flag 243001/243001 # cleaning 21998 clauses out of 44015 with flag 266001/266001 # cleaning 23000 clauses out of 46016 with flag 290000/290000 # cleaning 24008 clauses out of 48017 with flag 315001/315001 # cleaning 24994 clauses out of 50008 with flag 341000/341000 # cleaning 26007 clauses out of 52014 with flag 368000/368000 # cleaning 27000 clauses out of 54008 with flag 396001/396001 # cleaning 28003 clauses out of 56010 with flag 425003/425003 # cleaning 28992 clauses out of 58005 with flag 455001/455001 # cleaning 30002 clauses out of 60012 with flag 486000/486000 # starts : 32 # conflicts : 504753 # decisions : 904270 # propagations : 592321749 # inspects : 268259846 # learnt literals : 4 # learnt binary clauses : 701 # learnt ternary clauses : 414 # learnt clauses : 504749 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 14336019 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 27 # 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) : 2219306.277749677 # non guided choices 22846 # learnt constraints type #Solving done (271.932s). #Solution contains:2933