# Checking available version of Java # Java(TM) SE Runtime Environment (build 1.6.0_22-b04) # Running really p2cudf # Solver launched on Thu Aug 25 18:10:05 CEST 2011 # Using input file /home/misc2010/data/2011/dudf-real/6b0d1da0-c730-11df-a7c5-00163e3d3b7c.cudf # Using ouput file /home/misc2010/tmp/201108251442/p2cudf-paranoid-1.13/6b0d1da0-c730-11df-a7c5-00163e3d3b7c.cudf.dudf-real.result # Objective function -removed,-changed # Timeout 280s # java.runtime.name Java(TM) SE Runtime Environment # java.vm.name Java HotSpot(TM) Server VM # java.vm.version 17.1-b03 # java.vm.vendor Sun Microsystems Inc. # sun.arch.data.model 32 # java.version 1.6.0_22 # os.name Linux # os.version 2.6.18-6-xen-amd64 # os.arch i386 # Free memory 705643136 # Max memory 709558272 # Total memory 709558272 # Number of processors 1 # Parsing ... # Time to parse:2682 # Parsing done (2.684s). # Solving ... # Request size: 3018 # Number of packages after slice: 9006 # Slice efficiency: 84% # --- Begin Solver configuration --- # org.sat4j.pb.constraints.CompetResolutionPBLongMixedWLClauseCardConstrDataStructure@152544e # 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 lightweight component caching from RSAT taking into account the objective function # Simple reason simplification # luby style (SATZ_rand, TiniSAT) restarts strategy with factor 512 # Glucose learned constraints deletion strategy # timeout=280s # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: User defined:-removed,-changed # criteria removed size is 2994 using new vars 12001 to 14995 # criteria changed size is 4204 using new vars 14995 to 19199 # p cnf 19198 85712 # Current objective function value: 41(0.628s) # Found optimal criterion number 1 # Current objective function value: 292(0.908s) # Current objective function value: 2(1.063s) # Found optimal solution for the last criterion # -removed criteria value: 0 # Removed packages: [] # -changed criteria value: 2 # Changed packages: [hplip, hplip-data] # starts : 3 # conflicts : 45 # decisions : 69772 # propagations : 196374 # inspects : 537657 # shortcuts : 0 # learnt literals : 1 # learnt binary clauses : 28 # learnt ternary clauses : 9 # learnt constraints : 44 # ignored constraints : 0 # root simplifications : 0 # removed literals (reason simplification) : 1 # reason swapping (by a shorter reason) : 0 # Calls to reduceDB : 0 # 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) : 4566837.209302326 # non guided choices 30896 # learnt constraints type # Solving done (3.661s). # The solution found IS optimal # Solution contains:2996