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-2663629-1276648533.opb>
0.00/0.01 c original problem has 80 variables (80 bin, 0 int, 0 impl, 0 cont) and 55 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.02 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 0 upgd conss, 244 impls, 0 clqs
0.00/0.02 c (round 2) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 3 upgd conss, 266 impls, 0 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 5 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 9 changed coefficients
0.00/0.03 c 308 implications, 0 cliques
0.00/0.03 c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.03 c 49 constraints of type <and>
0.00/0.03 c 2 constraints of type <linear>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -1
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 | 2 | 0 | - | 311k| 0 | - | 75 | 55 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 o 3
0.00/0.06 c * 0.0s| 234 | 125 | 0 | 0.0 | 442k| 23 | - | 75 | 151 | 0 | 0 | 0 | 96 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.00/0.06 o 2
0.00/0.06 c * 0.0s| 263 | 96 | 0 | 0.0 | 430k| 23 | - | 75 | 136 | 0 | 0 | 0 | 111 | 0 | 0.000000e+00 | 2.000000e+00 | Inf
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.04
0.00/0.06 c Solving Nodes : 263
0.00/0.06 c Primal Bound : +2.00000000000000e+00 (2 solutions)
0.00/0.06 c Dual Bound : +2.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x30 -x29 -x28 -x27 x26 -x25 -x24 -x23 -x22 x21 -x20 -x19 -x18 x17 -x16 x15 -x14 x13 x12 x11 x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 x2
0.00/0.06 v -x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time : 0.04
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-2663629-1276648533.opb
0.00/0.06 c Variables : 80 (80 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 55 initial, 55 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-2663629-1276648533.opb
0.00/0.06 c Variables : 75 (75 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 55 initial, 154 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 2 0 0 0 0 0 0
0.00/0.06 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c and : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c linear : 0.00 1 2 0 0 0 0 0 9
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 33 - - 33 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c and : 49 0 796 0 216 4 713 0 0 0
0.00/0.06 c linear : 2 0 789 0 216 52 343 0 0 0
0.00/0.06 c logicor : 4+ 0 271 0 217 7 62 0 0 0
0.00/0.06 c countsols : 0 0 0 0 218 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c and : 0.01 0.00 0.00 0.00 0.01
0.00/0.06 c linear : 0.01 0.00 0.01 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c vbounds : 0.00 2 0 0
0.00/0.06 c rootredcost : 0.00 0 0 0
0.00/0.06 c pseudoobj : 0.00 650 10 19
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.01 73 54 301 16.6 3 13.7 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 111 14.4 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 0 0 0 0 0
0.00/0.06 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 0 0 0 0 0
0.00/0.06 c strongcg : 0.00 0 0 0 0 0
0.00/0.06 c cmir : 0.00 0 0 0 0 0
0.00/0.06 c flowcover : 0.00 0 0 0 0 0
0.00/0.06 c clique : 0.00 0 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 0 0 0 0 0
0.00/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.01 216 0 0 0 0 432
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 0
0.00/0.06 c pseudo solutions : 0.00 - 2
0.00/0.06 c oneopt : 0.00 0 0
0.00/0.06 c trivial : 0.00 2 0
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 0 0
0.00/0.06 c shifting : 0.00 0 0
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c undercover : 0.00 0 0
0.00/0.06 c nlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.00 0 0 0.00 -
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 263
0.00/0.06 c nodes (total) : 263
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 23
0.00/0.06 c max depth (total): 23
0.00/0.06 c backtracks : 53 (20.2%)
0.00/0.06 c delayed cutoffs : 131
0.00/0.06 c repropagations : 80 (277 domain reductions, 28 cutoffs)
0.00/0.06 c avg switch length: 3.08
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 2 (2 improvements)
0.00/0.06 c First Solution : +3.00000000000000e+00 (in run 1, after 234 nodes, 0.04 seconds, depth 21, found by <relaxation>)
0.00/0.06 c Primal Bound : +2.00000000000000e+00 (in run 1, after 263 nodes, 0.04 seconds, depth 9, found by <relaxation>)
0.00/0.06 c Dual Bound : +2.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +0.00000000000000e+00
0.00/0.06 c Root Iterations : 0
0.00/0.07 c Time complete: 0.07.
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2663629-1276648533/watcher-2663629-1276648533 -o /tmp/evaluation-result-2663629-1276648533/solver-2663629-1276648533 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663629-1276648533.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.75 1.27 1.15 3/106 13491
/proc/meminfo: memFree=1723068/2059040 swapFree=4192956/4192956
[pid=13491] ppid=13489 vsize=6584 CPUtime=0
/proc/13491/stat : 13491 (pbscip.linux.x8) R 13489 13491 12511 0 -1 4202496 1002 0 0 0 0 0 0 0 25 0 1 0 6145339 6742016 924 1992294400 4194304 7136930 140737309062800 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/13491/statm: 1646 934 254 719 0 925 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0737479
CPU time (s): 0.074987
CPU user time (s): 0.053991
CPU system time (s): 0.020996
CPU usage (%): 101.68
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.053991
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= 3803
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= 2
runsolver used 0.001999 second user time and 0.011998 second system time
The end