0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690487-1338016918.opb>
0.00/0.00 c original problem has 784 variables (784 bin, 0 int, 0 impl, 0 cont) and 256 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 112 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 32 upgd conss, 0 impls, 112 clqs
0.00/0.02 c (round 2) 0 del vars, 112 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 144 upgd conss, 0 impls, 112 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 112 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 112 cliques
0.00/0.02 c presolved problem has 784 variables (784 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.00/0.02 c 32 constraints of type <knapsack>
0.00/0.02 c 112 constraints of type <setppc>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.02
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.1.1.4
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 = 1797
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 = 13950
0.00/0.02 c
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = 5
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = FALSE
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = -1
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = 750
0.00/0.02 c
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = 100
0.00/0.02 c
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = 0.15
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = 0.5
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = -1
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-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/oneopt/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = -1
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = 0.3
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-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/rounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/shiftandpropagate/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <subnlp> (-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/subnlp/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/trivial/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
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: 0]
0.00/0.02 c heuristics/undercover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <zirounding> (-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/zirounding/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c propagating/probing/maxprerounds = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = -1
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 # frequency for calling primal heuristic <indoneopt> (-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/indoneopt/freq = -1
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.04 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.04 c 0.0s| 1 | 0 | 288 | - |3202k| 0 | 108 | 784 | 144 | 784 | 144 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 342 | - |5635k| 0 | 134 | 784 | 361 | 784 | 209 | 65 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 514 | - |5643k| 0 | 154 | 784 | 361 | 784 | 217 | 73 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 751 | - |5654k| 0 | 163 | 784 | 361 | 784 | 226 | 82 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 1090 | - |5661k| 0 | 160 | 784 | 361 | 784 | 234 | 90 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 1318 | - |5669k| 0 | 167 | 784 | 361 | 784 | 241 | 97 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 2 | 1318 | - |5670k| 0 | 167 | 784 | 361 | 784 | 241 | 97 | 0 | 9 | 0.000000e+00 | -- | Inf
1.99/2.00 c * 2.0s| 19 | 0 | 2846 | 84.9 |5922k| 14 | - | 784 | 361 | 784 | 198 | 97 | 0 | 184 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.99/2.00 c
1.99/2.00 c SCIP Status : problem is solved [optimal solution found]
1.99/2.00 c Solving Time (sec) : 2.01
1.99/2.00 c Solving Nodes : 19
1.99/2.00 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.99/2.00 c Dual Bound : +0.00000000000000e+00
1.99/2.00 c Gap : 0.00 %
1.99/2.01 s SATISFIABLE
1.99/2.01 v -x784 -x783 -x782 -x781 -x780 -x779 -x778 -x777 x776 -x775 -x774 -x773 -x772 -x771 -x770 -x769 -x768 -x767 -x766 -x765 -x764 -x763
1.99/2.01 v -x762 -x761 -x760 -x759 -x758 -x757 -x756 -x755 -x754 -x753 -x752 -x751 -x750 -x749 -x748 -x747 -x746 x745 -x744 -x743 -x742
1.99/2.01 v -x741 -x740 -x739 -x738 -x737 -x736 -x735 -x734 -x733 -x732 -x731 -x730 -x729 -x728 -x727 -x726 x725 -x724 -x723 -x722 -x721
1.99/2.01 v -x720 -x719 -x718 -x717 -x716 -x715 -x714 -x713 -x712 -x711 -x710 -x709 -x708 -x707 -x706 -x705 -x704 -x703 -x702 -x701 -x700
1.99/2.01 v -x699 -x698 -x697 -x696 -x695 -x694 -x693 -x692 -x691 -x690 -x689 -x688 -x687 -x686 -x685 -x684 -x683 -x682 -x681 -x680
1.99/2.01 v -x679 -x678 -x677 -x676 -x675 -x674 x673 -x672 -x671 -x670 -x669 -x668 -x667 -x666 -x665 -x664 -x663 -x662 -x661 -x660 -x659
1.99/2.01 v -x658 -x657 -x656 -x655 -x654 -x653 -x652 -x651 -x650 -x649 -x648 -x647 x646 -x645 -x644 -x643 -x642 -x641 x640 -x639 -x638 -x637
1.99/2.01 v -x636 -x635 -x634 -x633 -x632 -x631 -x630 -x629 -x628 -x627 -x626 -x625 -x624 -x623 -x622 -x621 -x620 -x619 -x618 -x617
1.99/2.01 v -x616 -x615 -x614 -x613 -x612 -x611 -x610 -x609 -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 -x600 -x599 -x598 x597 -x596
1.99/2.01 v -x595 -x594 -x593 -x592 -x591 -x590 -x589 -x588 x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578 -x577 -x576 -x575
1.99/2.01 v -x574 -x573 -x572 -x571 -x570 -x569 -x568 -x567 -x566 -x565 -x564 -x563 -x562 -x561 -x560 -x559 x558 -x557 -x556 -x555 -x554
1.99/2.01 v -x553 -x552 -x551 -x550 -x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 -x541 -x540 -x539 -x538 -x537 -x536 -x535 -x534 -x533
1.99/2.01 v -x532 -x531 -x530 -x529 -x528 -x527 -x526 -x525 -x524 -x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516 -x515 -x514 -x513 -x512
1.99/2.01 v -x511 -x510 -x509 -x508 x507 -x506 -x505 -x504 -x503 -x502 -x501 -x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491
1.99/2.01 v -x490 x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 -x471 -x470
1.99/2.01 v -x469 -x468 -x467 -x466 -x465 -x464 x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452 -x451 -x450 -x449
1.99/2.01 v -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 x430 -x429 -x428
1.99/2.01 v -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 x410 -x409 -x408 -x407
1.99/2.01 v -x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386
1.99/2.01 v -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 x369 -x368 -x367 -x366 -x365
1.99/2.01 v -x364 -x363 -x362 -x361 -x360 -x359 -x358 x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344
1.99/2.01 v -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 x327 -x326 -x325 -x324 -x323
1.99/2.01 v -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302
1.99/2.01 v -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 x287 -x286 -x285 -x284 -x283 -x282 -x281
1.99/2.01 v -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260
1.99/2.01 v -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239
1.99/2.01 v -x238 -x237 x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 x224 -x223 -x222 -x221 -x220 -x219 -x218
1.99/2.01 v -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197
1.99/2.01 v -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 x179 -x178 -x177 -x176
1.99/2.01 v -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156
1.99/2.01 v -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135
1.99/2.01 v -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 -x114
1.99/2.01 v -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91
1.99/2.01 v -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66
1.99/2.01 v -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41
1.99/2.01 v -x40 -x39 -x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16
1.99/2.01 v -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.99/2.01 c SCIP Status : problem is solved [optimal solution found]
1.99/2.01 c Total Time : 2.01
1.99/2.01 c solving : 2.01
1.99/2.01 c presolving : 0.02 (included in solving)
1.99/2.01 c reading : 0.00 (included in solving)
1.99/2.01 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
1.99/2.01 c Original Problem :
1.99/2.01 c Problem name : HOME/instance-3690487-1338016918.opb
1.99/2.01 c Variables : 784 (784 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.01 c Constraints : 256 initial, 256 maximal
1.99/2.01 c Objective sense : minimize
1.99/2.01 c Presolved Problem :
1.99/2.01 c Problem name : t_HOME/instance-3690487-1338016918.opb
1.99/2.01 c Variables : 784 (784 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.01 c Constraints : 144 initial, 361 maximal
1.99/2.01 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.99/2.01 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.99/2.01 c linear : 0.00 0.00 0 0 0 0 0 112 0 0 0
1.99/2.01 c root node : - - 0 - - 0 - - - - -
1.99/2.01 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.99/2.01 c integral : 0 0 0 0 21 0 3 0 0 18 0 0 30
1.99/2.01 c knapsack : 32 32 5 46 1 0 0 0 0 193 0 0 0
1.99/2.01 c setppc : 112 112 5 46 1 0 0 0 0 679 0 0 0
1.99/2.01 c linear : 0+ 217 5 45 0 0 0 0 0 0 0 0 0
1.99/2.01 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
1.99/2.01 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.99/2.01 c integral : 1.50 0.00 0.00 0.00 1.50 0.00 0.00 0.00
1.99/2.01 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.99/2.01 c rootredcost : 0 0 0 0
1.99/2.01 c pseudoobj : 0 0 0 0
1.99/2.01 c vbounds : 0 0 0 0
1.99/2.01 c redcost : 26 0 0 0
1.99/2.01 c probing : 0 0 0 0
1.99/2.01 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.99/2.01 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c redcost : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c probing : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.99/2.01 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.01 c infeasible LP : 0.00 3 0 0 0.0 0 0.0 0
1.99/2.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.01 c applied globally : - - - 0 0.0 - - -
1.99/2.01 c applied locally : - - - 0 0.0 - - -
1.99/2.01 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.99/2.01 c cut pool : 0.00 4 - - 2 - (maximal pool size: 142)
1.99/2.01 c closecuts : 0.00 0.00 0 0 0 0 0
1.99/2.01 c impliedbounds : 0.00 0.00 5 0 0 0 0
1.99/2.01 c intobj : 0.00 0.00 0 0 0 0 0
1.99/2.01 c gomory : 0.03 0.00 5 0 0 0 0
1.99/2.01 c cgmip : 0.00 0.00 0 0 0 0 0
1.99/2.01 c strongcg : 0.03 0.00 5 0 0 102 0
1.99/2.01 c cmir : 0.00 0.00 0 0 0 0 0
1.99/2.01 c flowcover : 0.00 0.00 0 0 0 0 0
1.99/2.01 c clique : 0.01 0.00 5 0 0 41 0
1.99/2.01 c zerohalf : 0.00 0.00 0 0 0 0 0
1.99/2.01 c mcf : 0.00 0.00 1 0 0 0 0
1.99/2.01 c oddcycle : 0.00 0.00 0 0 0 0 0
1.99/2.01 c rapidlearning : 0.09 0.00 1 0 0 0 217
1.99/2.01 c Pricers : ExecTime SetupTime Calls Vars
1.99/2.01 c problem variables: 0.00 - 0 0
1.99/2.01 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.99/2.01 c relpscost : 1.50 0.00 20 0 18 0 0 30
1.99/2.01 c pscost : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c inference : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c random : 0.00 0.00 0 0 0 0 0 0
1.99/2.01 c Primal Heuristics : ExecTime SetupTime Calls Found
1.99/2.01 c LP solutions : 0.00 - - 1
1.99/2.01 c pseudo solutions : 0.00 - - 0
1.99/2.01 c smallcard : 0.00 0.00 0 0
1.99/2.01 c trivial : 0.00 0.00 1 0
1.99/2.01 c shiftandpropagate: 0.00 0.00 0 0
1.99/2.01 c simplerounding : 0.00 0.00 0 0
1.99/2.01 c zirounding : 0.00 0.00 0 0
1.99/2.01 c rounding : 0.00 0.00 0 0
1.99/2.01 c shifting : 0.00 0.00 0 0
1.99/2.01 c intshifting : 0.00 0.00 0 0
1.99/2.01 c oneopt : 0.00 0.00 0 0
1.99/2.01 c twoopt : 0.00 0.00 0 0
1.99/2.01 c indtwoopt : 0.00 0.00 0 0
1.99/2.01 c indoneopt : 0.00 0.00 0 0
1.99/2.01 c fixandinfer : 0.00 0.00 0 0
1.99/2.01 c feaspump : 0.00 0.00 0 0
1.99/2.01 c clique : 0.00 0.00 0 0
1.99/2.01 c indrounding : 0.00 0.00 0 0
1.99/2.01 c indcoefdiving : 0.00 0.00 0 0
1.99/2.01 c coefdiving : 0.00 0.00 0 0
1.99/2.01 c pscostdiving : 0.00 0.00 0 0
1.99/2.01 c nlpdiving : 0.00 0.00 0 0
1.99/2.01 c fracdiving : 0.00 0.00 0 0
1.99/2.01 c veclendiving : 0.00 0.00 0 0
1.99/2.01 c intdiving : 0.00 0.00 0 0
1.99/2.01 c actconsdiving : 0.00 0.00 0 0
1.99/2.01 c objpscostdiving : 0.00 0.00 0 0
1.99/2.01 c rootsoldiving : 0.00 0.00 0 0
1.99/2.01 c linesearchdiving : 0.00 0.00 0 0
1.99/2.01 c guideddiving : 0.00 0.00 0 0
1.99/2.01 c octane : 0.00 0.00 0 0
1.99/2.01 c rens : 0.00 0.00 0 0
1.99/2.01 c rins : 0.00 0.00 0 0
1.99/2.01 c localbranching : 0.00 0.00 0 0
1.99/2.01 c mutation : 0.00 0.00 0 0
1.99/2.01 c crossover : 0.00 0.00 0 0
1.99/2.01 c dins : 0.00 0.00 0 0
1.99/2.01 c vbounds : 0.00 0.00 0 0
1.99/2.01 c undercover : 0.00 0.00 0 0
1.99/2.01 c subnlp : 0.00 0.00 0 0
1.99/2.01 c trysol : 0.00 0.00 0 0
1.99/2.01 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.99/2.01 c primal LP : 0.00 1 0 0.00 - 0.00 1
1.99/2.01 c dual LP : 0.29 29 2846 98.14 9960.24 0.00 0
1.99/2.01 c lex dual LP : 0.00 0 0 0.00 -
1.99/2.01 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.99/2.01 c diving/probing LP: 0.00 0 0 0.00 -
1.99/2.01 c strong branching : 1.49 184 14641 79.57 9799.43
1.99/2.01 c (at root node) : - 9 5305 589.44 -
1.99/2.01 c conflict analysis: 0.00 0 0 0.00 -
1.99/2.01 c B&B Tree :
1.99/2.01 c number of runs : 1
1.99/2.01 c nodes : 19
1.99/2.01 c nodes (total) : 19
1.99/2.01 c nodes left : 0
1.99/2.01 c max depth : 14
1.99/2.01 c max depth (total): 14
1.99/2.01 c backtracks : 1 (5.3%)
1.99/2.01 c delayed cutoffs : 0
1.99/2.01 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.99/2.01 c avg switch length: 2.00
1.99/2.01 c switching time : 0.00
1.99/2.01 c Solution :
1.99/2.01 c Solutions found : 1 (1 improvements)
1.99/2.01 c First Solution : +0.00000000000000e+00 (in run 1, after 19 nodes, 2.01 seconds, depth 14, found by <relaxation>)
1.99/2.01 c Primal Bound : +0.00000000000000e+00 (in run 1, after 19 nodes, 2.01 seconds, depth 14, found by <relaxation>)
1.99/2.01 c Dual Bound : +0.00000000000000e+00
1.99/2.01 c Gap : 0.00 %
1.99/2.01 c Root Dual Bound : +0.00000000000000e+00
1.99/2.01 c Root Iterations : 1318
1.99/2.01 c Time complete: 2.01.