# 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 720166288 # Max memory 723845120 # Total memory 723845120 # Number of processors 2 # Using input file /home/competition/data/datasets/9orless//fcron.cudf # Using output file /home/competition/tmp/p2cudf-paranoid2/fcron.cudf.9orless.result # Using criteria paranoid # Parsing ... # Parsing done (2.659s). # Solving ... # Starting projection ... # 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 # No reason simplification # MiniSAT restarts strategy # Memory based learned constraints deletion strategy # timeout=1000 conflicts # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: misc 2010 paranoid # Projection completed: 2096ms. # Invoking solver ... # Solver first solution found: 2598ms. # Current objective function value: 481321(2.653s) # Current objective function value: 399711(4.116s) # Current objective function value: 167577(5.22s) # Current objective function value: 163270(6.02s) # Solver best solution decoded: 6693ms. # p cnf 115826 96057 # starts : 9 # conflicts : 1000 # decisions : 238884 # propagations : 1779370 # inspects : 2699295 # learnt literals : 0 # learnt binary clauses : 0 # learnt ternary clauses : 0 # learnt clauses : 1000 # ignored clauses : 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) : 2737492.3076923075 # non guided choices 11353 # learnt constraints type # Solving done (9.843s). # Solution contains:2931