#Using input file /home/competition/data/datasets/10orplus/libcurses-perl.cudf #Using ouput file /home/competition/tmp/p2cudf-paranoid/libcurses-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:1428 #Parsing done (1.431s). #Solving ... #Request size: 2961 #Number of packages after slice: 9556 #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 19772 96300 # Current objective function value: 369654(0.784s) # Current objective function value: 365396(1.866s) # Current objective function value: 193450(2.01s) # Current objective function value: 193445(2.148s) # cleaning 2496 clauses out of 4999 with flag 5002/5002 # cleaning 4248 clauses out of 8502 with flag 11001/11001 # cleaning 5620 clauses out of 11253 with flag 18000/18000 # cleaning 6814 clauses out of 13634 with flag 26001/26001 # cleaning 7907 clauses out of 15819 with flag 35000/35000 # cleaning 8946 clauses out of 17912 with flag 45000/45000 # cleaning 9984 clauses out of 19967 with flag 56001/56001 # cleaning 10986 clauses out of 21982 with flag 68000/68000 # cleaning 11991 clauses out of 23996 with flag 81000/81000 # cleaning 12994 clauses out of 26005 with flag 95000/95000 # cleaning 14005 clauses out of 28011 with flag 110000/110000 # cleaning 15000 clauses out of 30007 with flag 126001/126001 # cleaning 16001 clauses out of 32006 with flag 143000/143000 # cleaning 17003 clauses out of 34005 with flag 161000/161000 # cleaning 17998 clauses out of 36004 with flag 180002/180002 # cleaning 18998 clauses out of 38004 with flag 200000/200000 # cleaning 20001 clauses out of 40007 with flag 221001/221001 # cleaning 20998 clauses out of 42005 with flag 243000/243000 # cleaning 21999 clauses out of 44007 with flag 266000/266000 # cleaning 23003 clauses out of 46009 with flag 290001/290001 # cleaning 23995 clauses out of 48006 with flag 315001/315001 # cleaning 25003 clauses out of 50010 with flag 341000/341000 # cleaning 25994 clauses out of 52007 with flag 368000/368000 # cleaning 26997 clauses out of 54014 with flag 396001/396001 # cleaning 28000 clauses out of 56016 with flag 425000/425000 # cleaning 29004 clauses out of 58018 with flag 455002/455002 # cleaning 29996 clauses out of 60012 with flag 486000/486000 # starts : 28 # conflicts : 513326 # decisions : 803829 # propagations : 710085021 # inspects : 302595406 # learnt literals : 3 # learnt binary clauses : 434 # learnt ternary clauses : 281 # learnt clauses : 513323 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 12445853 # 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) : 2646549.1677413103 # non guided choices 11483 # learnt constraints type #Solving done (272.036s). #Solution contains:2929