# Solver launched on Mon Sep 03 06:39:15 UTC 2012
# Using input file /home/competition/data/upgrade/difficult/rand981.cudf
# Using ouput file /tmp/misc2012/2012-09-02-22:42/full/p2cudf-full-1.15/trendy-size/upgrade/difficult/rand981.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:7741
# Parsing done (7.748s).
# Solving ...
# Request size: 1027
# Number of  packages after slice: 13241
# 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 18038 to 18988
# criteria sum(installedsize) size is 0
Skipping unknown criteria:-notuptodate()
# criteria notuptodate() size is 0 using new vars 18988 to 18988
Skipping unknown criteria:-unsat_recommends()
# criteria unsat_recommends() size is 0 using new vars 18988 to 18988
# criteria new size is 4403 using new vars 18988 to 23391
# p cnf 23390 122643
# Current objective function value: 10(0.894s)
# Found optimal criterion number 1
# Found optimal criterion number 2
# Current objective function value: 0(0.926s)
# Found optimal criterion number 3
# Current objective function value: 0(1.2s)
# Found optimal criterion number 4
# Current objective function value: 15(1.284s)
# Current objective function value: 14(1.436s)
# Found optimal solution for the last criterion 
# -removed criteria value: 10
# Removed packages: [dirmngr, g++-2.95, kde, kdepim, kdeutils, kfloppy, kleopatra, libglut3, libstdc++2.10-dev, linux-kernel-headers]
# -sum(installedsize) criteria value: 0
# -new criteria value: 14
# Newly installed packages: [ecasound, g++-3.3, gcc-3.3, gutenprint-doc, libecasound-ruby1.8, libruby1.8, libsndfile1, libstdc++5-3.3-dev, linux-libc-dev, module-init-tools, oxygencursors, python-ecasound2.2, ruby1.8, xinit]
# starts		: 5
# conflicts		: 103
# decisions		: 94317
# propagations		: 609809
# inspects		: 2173300
# shortcuts		: 0
# learnt literals	: 13
# learnt binary clauses	: 34
# learnt ternary clauses	: 10
# learnt constraints	: 89
# ignored constraints	: 0
# root simplifications	: 0
# removed literals (reason simplification)	: 45
# reason swapping (by a shorter reason)	: 0
# Calls to reduceDB	: 0
# Number of update (reduction) of LBD	: 18
# 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)	: 414554.0448674371
# non guided choices	78257
# learnt constraints type 
# Solving done (7.415s).
# The solution found IS optimal
# Solution contains:954