# Solver launched on Mon Sep 03 06:37:33 UTC 2012
# Using input file /home/competition/data/upgrade/difficult/rand752.cudf
# Using ouput file /tmp/misc2012/2012-09-02-22:42/full/p2cudf-full-1.15/trendy-size/upgrade/difficult/rand752.cudf.result
# Objective function -count(removed),-sum(solution,installedsize),-notuptodate(solution),-unsat_recommends(solution),-count(new)
# Timeout 285s
# java.runtime.name	OpenJDK Runtime Environment
# java.vm.name		OpenJDK 64-Bit Server VM
# java.vm.version	20.0-b12
# java.vm.vendor	Sun Microsystems Inc.
# sun.arch.data.model	64
# java.version		1.6.0_24
# os.name		Linux
# os.version		2.6.32-5-amd64
# os.arch		amd64
# Free memory 		655262992
# Max memory 		658898944
# Total memory 		658898944
# Number of processors 	1
# Parsing ...
# Time to parse:7924
# Parsing done (7.931s).
# Solving ...
# Request size: 1027
# Number of  packages after slice: 13237
# Slice efficiency: 85%
# --- Begin Solver configuration ---
# org.sat4j.pb.constraints.CompetResolutionPBLongMixedWLClauseCardConstrDataStructure@64482923
# 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 2 learned constraints deletion strategy
# timeout=285s
# DB Simplification allowed=false
# --- End Solver configuration ---
# Optimization function: User defined:-count(removed),-sum(solution,installedsize),-notuptodate(solution),-unsat_recommends(solution),-count(new)
# criteria removed size is 950 using new vars 18034 to 18984
# criteria sum(installedsize) size is 0
Skipping unknown criteria:-notuptodate()
# criteria notuptodate() size is 0 using new vars 18984 to 18984
Skipping unknown criteria:-unsat_recommends()
# criteria unsat_recommends() size is 0 using new vars 18984 to 18984
# criteria new size is 4404 using new vars 18984 to 23388
# p cnf 23387 122597
# Current objective function value: 36(1.645s)
# Current objective function value: 35(2.297s)
# Current objective function value: 18(2.422s)
# Found optimal criterion number 1
# Found optimal criterion number 2
# Current objective function value: 0(2.444s)
# Found optimal criterion number 3
# Current objective function value: 0(2.569s)
# Found optimal criterion number 4
# Current objective function value: 10(2.603s)
# Current objective function value: 10(2.704s)
# Found optimal solution for the last criterion 
# -removed criteria value: 18
# Removed packages: [atlantikdesigner, bind9-host, gedit, gedit-common, gnome, gnome-core, gnome-desktop-environment, gnome-office, kcharselect, kde, kde-amusements, kde-core, kde-devel, kde-devel-extras, kdeaddons, kdebase, kdeutils, ksplash]
# -sum(installedsize) criteria value: 0
# -new criteria value: 10
# Newly installed packages: [aylet, dracut, host, linux-image-2.6.26-1-vserver-686, module-init-tools, redhat-cluster-modules-2.6.26-1-vserver-686, socks4-clients, tzdata, xfonts-100dpi-transcoded, xmms-xf86audio]
# starts		: 8
# conflicts		: 253
# decisions		: 393383
# propagations		: 1810208
# inspects		: 4874560
# shortcuts		: 0
# learnt literals	: 9
# learnt binary clauses	: 165
# learnt ternary clauses	: 36
# learnt constraints	: 242
# ignored constraints	: 0
# root simplifications	: 0
# removed literals (reason simplification)	: 2
# reason swapping (by a shorter reason)	: 0
# Calls to reduceDB	: 0
# Number of update (reduction) of LBD	: 11
# 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)	: 684647.5037821482
# non guided choices	290335
# learnt constraints type 
# Solving done (7.643s).
# The solution found IS optimal
# Solution contains:942