#Using input file /home/competition/data/datasets/9orless/libmono-relaxng1.0-cil.cudf #Using ouput file /home/competition/tmp/p2cudf-trendy/libmono-relaxng1.0-cil.cudf.9orless.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:1546 #Parsing done (1.549s). #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@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, trendy #p cnf 16809 86091 # Current objective function value: 1790787658(0.86s) # Current objective function value: 1422122061(1.196s) # Current objective function value: 684838020(1.372s) # cleaning 2496 clauses out of 5000 with flag 5003/5003 # cleaning 4251 clauses out of 8501 with flag 11000/11000 # cleaning 5621 clauses out of 11251 with flag 18001/18001 # cleaning 6813 clauses out of 13629 with flag 26000/26000 # cleaning 7902 clauses out of 15816 with flag 35000/35000 # cleaning 8951 clauses out of 17916 with flag 45002/45002 # cleaning 9974 clauses out of 19964 with flag 56001/56001 # cleaning 10987 clauses out of 21990 with flag 68001/68001 # cleaning 12001 clauses out of 24003 with flag 81001/81001 # cleaning 12994 clauses out of 26001 with flag 95000/95000 # cleaning 13999 clauses out of 28007 with flag 110000/110000 # cleaning 15001 clauses out of 30008 with flag 126000/126000 # cleaning 15995 clauses out of 32007 with flag 143000/143000 # cleaning 17002 clauses out of 34012 with flag 161000/161000 # cleaning 17998 clauses out of 36010 with flag 180000/180000 # cleaning 19007 clauses out of 38013 with flag 200001/200001 # cleaning 20003 clauses out of 40005 with flag 221000/221000 # cleaning 20999 clauses out of 42002 with flag 243000/243000 # cleaning 22001 clauses out of 44003 with flag 266000/266000 # cleaning 22995 clauses out of 46002 with flag 290000/290000 # cleaning 23994 clauses out of 48007 with flag 315000/315000 # cleaning 25006 clauses out of 50013 with flag 341000/341000 # cleaning 25997 clauses out of 52007 with flag 368000/368000 # starts : 22 # conflicts : 368000 # decisions : 565586 # propagations : 398379992 # inspects : 158428370 # learnt literals : 3 # learnt binary clauses : 312 # learnt ternary clauses : 205 # learnt clauses : 367997 # ignored clauses : 0 # root simplifications : 0 # removed literals (reason simplification) : 17190095 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 23 # 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) : 1480938.9862641958 # non guided choices 5698 # learnt constraints type #Solving done (272.075s). #Solution contains:3192