#Using input file /home/competition/data/datasets/caixa/581.cudf #Using ouput file /home/competition/tmp/p2cudf-p2/581.cudf.caixa.result #Objective function p2 #Timeout 1000c #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 720163120 #Max memory 723845120 #Total memory 723845120 #Number of processors 2 #Parsing ... #Time to parse:1531 #Parsing done (1.541s). #Solving ... #Request size: 1482 #Number of packages after slice: 2080 #Slice efficiency: 91% ## 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=1000 conflicts # DB Simplification allowed=false # --- End Solver configuration --- # Optimization function: p2 #p cnf 22362 18800 #Solving done (1.114s). # Current objective function value: null(0.164s)