0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2663677-1276649800.opb>
0.00/0.01 c original problem has 54 variables (54 bin, 0 int, 0 impl, 0 cont) and 39 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 1 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 8 chg coeffs, 0 upgd conss, 144 impls, 0 clqs
0.00/0.02 c (round 2) 13 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 2 upgd conss, 144 impls, 0 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 13 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 18 changed coefficients
0.00/0.02 c 150 implications, 0 cliques
0.00/0.02 c presolved problem has 41 variables (41 bin, 0 int, 0 impl, 0 cont) and 28 constraints
0.00/0.02 c 25 constraints of type <and>
0.00/0.02 c 1 constraints of type <linear>
0.00/0.02 c 2 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 2)
0.00/0.02 c Presolving Time: 0.00
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.2
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = -1
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c heuristics/undercover/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 2 | 0 | - | 231k| 0 | - | 41 | 28 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.00/0.03 o 5
0.00/0.03 c * 0.0s| 73 | 25 | 0 | 0.0 | 253k| 11 | - | 41 | 32 | 0 | 0 | 0 | 4 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
0.00/0.03 o 3
0.00/0.03 c * 0.0s| 79 | 8 | 0 | 0.0 | 239k| 11 | - | 41 | 9 | 0 | 0 | 0 | 8 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.00/0.03 c
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time (sec) : 0.01
0.00/0.03 c Solving Nodes : 79
0.00/0.03 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.00/0.03 c Dual Bound : +3.00000000000000e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v -x18 -x17 -x16 -x15 -x14 x13 x12 -x11 -x10 x9 -x8 x7 -x6 -x5 -x4 -x3 x2 x1
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time : 0.01
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-2663677-1276649800.opb
0.00/0.03 c Variables : 54 (54 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 39 initial, 39 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-2663677-1276649800.opb
0.00/0.03 c Variables : 41 (41 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 28 initial, 35 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c and : 0.00 2 10 0 0 0 10 0 10
0.00/0.03 c linear : 0.00 1 0 0 0 0 0 0 8
0.00/0.03 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c root node : - 29 - - 29 - - - -
0.00/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.03 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.03 c and : 25 0 233 0 59 2 212 0 0 0
0.00/0.03 c linear : 1 0 230 0 59 19 75 0 0 0
0.00/0.03 c logicor : 2+ 0 66 0 54 0 8 0 0 0
0.00/0.03 c countsols : 0 0 0 0 61 0 0 0 0 0
0.00/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.03 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c and : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c Propagators : Time Calls Cutoffs DomReds
0.00/0.03 c vbounds : 0.00 2 0 0
0.00/0.03 c rootredcost : 0.00 0 0 0
0.00/0.03 c pseudoobj : 0.00 156 4 15
0.00/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.03 c propagation : 0.00 25 7 37 17.8 1 8.0 -
0.00/0.03 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c applied globally : - - - 8 6.0 - - -
0.00/0.03 c applied locally : - - - 0 0.0 - - -
0.00/0.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.03 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.03 c redcost : 0.00 0 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.03 c intobj : 0.00 0 0 0 0 0
0.00/0.03 c cgmip : 0.00 0 0 0 0 0
0.00/0.03 c gomory : 0.00 0 0 0 0 0
0.00/0.03 c strongcg : 0.00 0 0 0 0 0
0.00/0.03 c cmir : 0.00 0 0 0 0 0
0.00/0.03 c flowcover : 0.00 0 0 0 0 0
0.00/0.03 c clique : 0.00 0 0 0 0 0
0.00/0.03 c zerohalf : 0.00 0 0 0 0 0
0.00/0.03 c mcf : 0.00 0 0 0 0 0
0.00/0.03 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.03 c Pricers : Time Calls Vars
0.00/0.03 c problem variables: 0.00 0 0
0.00/0.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.03 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.03 c pscost : 0.00 0 0 0 0 0 0
0.00/0.03 c inference : 0.00 59 0 0 0 0 118
0.00/0.03 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.03 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.03 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c random : 0.00 0 0 0 0 0 0
0.00/0.03 c Primal Heuristics : Time Calls Found
0.00/0.03 c LP solutions : 0.00 - 0
0.00/0.03 c pseudo solutions : 0.00 - 2
0.00/0.03 c oneopt : 0.00 0 0
0.00/0.03 c trivial : 0.00 2 0
0.00/0.03 c simplerounding : 0.00 0 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 0 0
0.00/0.03 c shifting : 0.00 0 0
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c twoopt : 0.00 0 0
0.00/0.03 c fixandinfer : 0.00 0 0
0.00/0.03 c feaspump : 0.00 0 0
0.00/0.03 c coefdiving : 0.00 0 0
0.00/0.03 c pscostdiving : 0.00 0 0
0.00/0.03 c fracdiving : 0.00 0 0
0.00/0.03 c veclendiving : 0.00 0 0
0.00/0.03 c intdiving : 0.00 0 0
0.00/0.03 c actconsdiving : 0.00 0 0
0.00/0.03 c objpscostdiving : 0.00 0 0
0.00/0.03 c rootsoldiving : 0.00 0 0
0.00/0.03 c linesearchdiving : 0.00 0 0
0.00/0.03 c guideddiving : 0.00 0 0
0.00/0.03 c octane : 0.00 0 0
0.00/0.03 c rens : 0.00 0 0
0.00/0.03 c rins : 0.00 0 0
0.00/0.03 c localbranching : 0.00 0 0
0.00/0.03 c mutation : 0.00 0 0
0.00/0.03 c crossover : 0.00 0 0
0.00/0.03 c dins : 0.00 0 0
0.00/0.03 c undercover : 0.00 0 0
0.00/0.03 c nlp : 0.00 0 0
0.00/0.03 c trysol : 0.00 0 0
0.00/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.03 c primal LP : 0.00 0 0 0.00 -
0.00/0.03 c dual LP : 0.00 0 0 0.00 -
0.00/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.03 c barrier LP : 0.00 0 0 0.00 -
0.00/0.03 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
0.00/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.03 c B&B Tree :
0.00/0.03 c number of runs : 1
0.00/0.03 c nodes : 79
0.00/0.03 c nodes (total) : 79
0.00/0.03 c nodes left : 0
0.00/0.03 c max depth : 11
0.00/0.03 c max depth (total): 11
0.00/0.03 c backtracks : 21 (26.6%)
0.00/0.03 c delayed cutoffs : 14
0.00/0.03 c repropagations : 16 (50 domain reductions, 7 cutoffs)
0.00/0.03 c avg switch length: 3.70
0.00/0.03 c switching time : 0.00
0.00/0.03 c Solution :
0.00/0.03 c Solutions found : 2 (2 improvements)
0.00/0.03 c First Solution : +5.00000000000000e+00 (in run 1, after 73 nodes, 0.01 seconds, depth 9, found by <relaxation>)
0.00/0.03 c Primal Bound : +3.00000000000000e+00 (in run 1, after 79 nodes, 0.01 seconds, depth 7, found by <relaxation>)
0.00/0.03 c Dual Bound : +3.00000000000000e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +1.00000000000000e+00
0.00/0.03 c Root Iterations : 0
0.00/0.04 c Time complete: 0.03.
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2663677-1276649800/watcher-2663677-1276649800 -o /tmp/evaluation-result-2663677-1276649800/solver-2663677-1276649800 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663677-1276649800.opb -t 1800 -m 1800
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 0.92 0.98 0.99 3/106 13343
/proc/meminfo: memFree=1779592/2059040 swapFree=4192956/4192956
[pid=13343] ppid=13341 vsize=6584 CPUtime=0
/proc/13343/stat : 13343 (pbscip.linux.x8) R 13341 13343 12076 0 -1 4202496 971 0 0 0 0 0 0 0 20 0 1 0 6275155 6742016 894 1992294400 4194304 7136930 140735253294896 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/13343/statm: 1646 905 254 719 0 925 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.04356
CPU time (s): 0.043992
CPU user time (s): 0.022996
CPU system time (s): 0.020996
CPU usage (%): 100.992
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.022996
system time used= 0.020996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3719
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 2
involuntary context switches= 1
runsolver used 0.002999 second user time and 0.009998 second system time
The end