# 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 17:59:08 CEST 2011 # Using input file /home/misc2010/data/2011/dudf-real/412959c6-e965-11de-8ebf-00163e6585dd.cudf # Using ouput file /home/misc2010/tmp/201108251442/p2cudf-paranoid-1.13/412959c6-e965-11de-8ebf-00163e6585dd.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:2074 # Parsing done (2.077s). # Solving ... # Request size: 0 # Number of packages after slice: 1 # Slice efficiency: 100% # --- Begin Solver configuration --- # org.sat4j.pb.constraints.CompetResolutionPBLongMixedWLClauseCardConstrDataStructure@6f7ce9 # 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 0 using new vars 2 to 2 # criteria changed size is 0 using new vars 2 to 2 # p cnf 1 2 # Found optimal criterion number 1 # Current objective function value: 0(0.0030s) # Found optimal solution for the last criterion # -removed criteria value: 0 # Removed packages: [] # -changed criteria value: 0 # Changed packages: [] # starts : 2 # conflicts : 0 # decisions : 0 # propagations : 1 # inspects : 0 # shortcuts : 0 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt constraints : 0 # ignored constraints : 0 # root simplifications : 0 # removed literals (reason simplification) : 0 # 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) : 500.0 # non guided choices 0 # learnt constraints type # Solving done (0.686s).