0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664962-1276646495.opb>
0.00/0.01 c original problem has 40 variables (40 bin, 0 int, 0 impl, 0 cont) and 28 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 112 impls, 0 clqs
0.00/0.02 c (round 2) 14 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 14 chg coeffs, 0 upgd conss, 143 impls, 0 clqs
0.00/0.02 c (round 3) 15 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 2 upgd conss, 143 impls, 0 clqs
0.00/0.03 c presolving (4 rounds):
0.00/0.03 c 15 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 15 changed coefficients
0.00/0.03 c 149 implications, 0 cliques
0.00/0.03 c presolved problem has 25 variables (25 bin, 0 int, 0 impl, 0 cont) and 18 constraints
0.00/0.03 c 14 constraints of type <and>
0.00/0.03 c 1 constraints of type <linear>
0.00/0.03 c 3 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 2)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c heuristics/undercover/freq = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 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.03 c 0.0s| 1 | 0 | 4 | - | 224k| 0 | 0 | 25 | 18 | 25 | 31 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.06 o 9
0.00/0.06 c y 0.0s| 1 | 0 | 4 | - | 225k| 0 | 0 | 25 | 18 | 25 | 31 | 0 | 0 | 0 | 3.000000e+00 | 9.000000e+00 | 200.00%
0.00/0.06 o 3
0.00/0.06 c * 0.0s| 1 | 0 | 4 | - | 225k| 0 | - | 25 | 18 | 25 | 31 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.03
0.00/0.06 c Solving Nodes : 1
0.00/0.07 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.00/0.07 c Dual Bound : +3.00000000000000e+00
0.00/0.07 c Gap : 0.00 %
0.00/0.07 s OPTIMUM FOUND
0.00/0.07 v -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 x6 -x5 -x4 -x3 x2 x1
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Solving Time : 0.03
0.00/0.07 c Original Problem :
0.00/0.07 c Problem name : HOME/instance-2664962-1276646495.opb
0.00/0.07 c Variables : 40 (40 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.07 c Constraints : 28 initial, 28 maximal
0.00/0.07 c Presolved Problem :
0.00/0.07 c Problem name : t_HOME/instance-2664962-1276646495.opb
0.00/0.07 c Variables : 25 (25 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.07 c Constraints : 18 initial, 18 maximal
0.00/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.07 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c and : 0.00 2 9 0 0 0 9 0 9
0.00/0.07 c linear : 0.01 2 2 0 0 0 0 0 6
0.00/0.07 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.07 c root node : - 0 - - 0 - - - -
0.00/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.07 c integral : 0 0 0 1 0 0 0 0 0 0
0.00/0.07 c and : 14 1 54 1 0 0 0 0 0 0
0.00/0.07 c linear : 1 1 54 1 0 0 0 0 0 0
0.00/0.07 c logicor : 3 1 25 1 0 0 0 0 0 0
0.00/0.07 c countsols : 0 0 0 1 0 0 0 0 0 0
0.00/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.07 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c and : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c Propagators : Time Calls Cutoffs DomReds
0.00/0.07 c vbounds : 0.00 2 0 0
0.00/0.07 c rootredcost : 0.00 0 0 0
0.00/0.07 c pseudoobj : 0.00 2 0 0
0.00/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.07 c applied globally : - - - 0 0.0 - - -
0.00/0.07 c applied locally : - - - 0 0.0 - - -
0.00/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.07 c redcost : 0.00 1 0 0 0 0
0.00/0.07 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.07 c intobj : 0.00 0 0 0 0 0
0.00/0.07 c cgmip : 0.00 0 0 0 0 0
0.00/0.07 c gomory : 0.00 0 0 0 0 0
0.00/0.07 c strongcg : 0.00 0 0 0 0 0
0.00/0.07 c cmir : 0.00 0 0 0 0 0
0.00/0.07 c flowcover : 0.00 0 0 0 0 0
0.00/0.07 c clique : 0.00 0 0 0 0 0
0.00/0.07 c zerohalf : 0.00 0 0 0 0 0
0.00/0.07 c mcf : 0.00 0 0 0 0 0
0.00/0.07 c rapidlearning : 0.01 1 0 0 0 0
0.00/0.07 c Pricers : Time Calls Vars
0.00/0.07 c problem variables: 0.00 0 0
0.00/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.07 c pscost : 0.00 0 0 0 0 0 0
0.00/0.07 c inference : 0.00 0 0 0 0 0 0
0.00/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.07 c random : 0.00 0 0 0 0 0 0
0.00/0.07 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.07 c Primal Heuristics : Time Calls Found
0.00/0.07 c LP solutions : 0.00 - 1
0.00/0.07 c pseudo solutions : 0.00 - 0
0.00/0.07 c oneopt : 0.00 0 0
0.00/0.07 c crossover : 0.00 0 0
0.00/0.07 c trivial : 0.00 2 0
0.00/0.07 c simplerounding : 0.00 0 0
0.00/0.07 c zirounding : 0.00 0 0
0.00/0.07 c rounding : 0.00 0 0
0.00/0.07 c shifting : 0.00 0 0
0.00/0.07 c intshifting : 0.00 0 0
0.00/0.07 c twoopt : 0.00 0 0
0.00/0.07 c fixandinfer : 0.00 0 0
0.00/0.07 c feaspump : 0.00 0 0
0.00/0.07 c coefdiving : 0.00 0 0
0.00/0.07 c pscostdiving : 0.00 0 0
0.00/0.07 c fracdiving : 0.00 0 0
0.00/0.07 c veclendiving : 0.00 0 0
0.00/0.07 c intdiving : 0.00 0 0
0.00/0.07 c actconsdiving : 0.00 0 0
0.00/0.07 c objpscostdiving : 0.00 0 0
0.00/0.07 c rootsoldiving : 0.00 0 0
0.00/0.07 c linesearchdiving : 0.00 0 0
0.00/0.07 c guideddiving : 0.00 0 0
0.00/0.07 c octane : 0.00 0 0
0.00/0.07 c rens : 0.00 0 0
0.00/0.07 c rins : 0.00 0 0
0.00/0.07 c localbranching : 0.00 0 0
0.00/0.07 c mutation : 0.00 0 0
0.00/0.07 c dins : 0.00 0 0
0.00/0.07 c undercover : 0.01 1 0
0.00/0.07 c nlp : 0.00 0 0
0.00/0.07 c trysol : 0.00 0 0
0.00/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.07 c primal LP : 0.00 0 0 0.00 -
0.00/0.07 c dual LP : 0.00 1 4 4.00 -
0.00/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.07 c barrier LP : 0.00 0 0 0.00 -
0.00/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.07 c strong branching : 0.00 0 0 0.00 -
0.00/0.07 c (at root node) : - 0 0 0.00 -
0.00/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.07 c B&B Tree :
0.00/0.07 c number of runs : 1
0.00/0.07 c nodes : 1
0.00/0.07 c nodes (total) : 1
0.00/0.07 c nodes left : 0
0.00/0.07 c max depth : 0
0.00/0.07 c max depth (total): 0
0.00/0.07 c backtracks : 0 (0.0%)
0.00/0.07 c delayed cutoffs : 0
0.00/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.07 c avg switch length: 2.00
0.00/0.07 c switching time : 0.00
0.00/0.07 c Solution :
0.00/0.07 c Solutions found : 2 (2 improvements)
0.00/0.07 c First Solution : +9.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <trysol>)
0.00/0.07 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.00/0.07 c Dual Bound : +3.00000000000000e+00
0.00/0.07 c Gap : 0.00 %
0.00/0.07 c Root Dual Bound : +3.00000000000000e+00
0.00/0.07 c Root Iterations : 4
0.00/0.07 c Time complete: 0.06.
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2664962-1276646495/watcher-2664962-1276646495 -o /tmp/evaluation-result-2664962-1276646495/solver-2664962-1276646495 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2664962-1276646495.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: 1.28 1.85 1.83 3/106 4727
/proc/meminfo: memFree=1811376/2059040 swapFree=4140468/4192956
[pid=4727] ppid=4725 vsize=8256 CPUtime=0
/proc/4727/stat : 4727 (pbscip.linux.x8) R 4725 4727 3937 0 -1 4202496 880 0 0 0 0 0 0 0 19 0 1 0 40253268 8454144 800 1992294400 4194304 9819077 140736074328096 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/4727/statm: 2064 809 359 1374 0 685 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.076825
CPU time (s): 0.076988
CPU user time (s): 0.045993
CPU system time (s): 0.030995
CPU usage (%): 100.212
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.045993
system time used= 0.030995
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 8841
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= 3
involuntary context switches= 3
runsolver used 0.001999 second user time and 0.009998 second system time
The end