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-2663447-1276679126.opb>
0.20/0.20 c original problem has 16706 variables (16706 bin, 0 int, 0 impl, 0 cont) and 17208 constraints
0.20/0.20 c problem read
0.20/0.21 c No objective function, only one solution is needed.
0.20/0.21 c presolving settings loaded
0.20/0.21 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.39/0.42 c presolving:
0.89/0.98 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1501 upgd conss, 126648 impls, 1000 clqs
1.29/1.38 c presolving (2 rounds):
1.29/1.38 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.29/1.38 c 126648 implications, 1000 cliques
1.29/1.38 c presolved problem has 16706 variables (16706 bin, 0 int, 0 impl, 0 cont) and 17208 constraints
1.29/1.38 c 1 constraints of type <knapsack>
1.29/1.38 c 1000 constraints of type <setppc>
1.29/1.38 c 15706 constraints of type <and>
1.29/1.38 c 1 constraints of type <linear>
1.29/1.38 c 500 constraints of type <logicor>
1.29/1.38 c transformed objective value is always integral (scale: 1)
1.29/1.38 c Presolving Time: 0.86
1.29/1.38 c - non default parameters ----------------------------------------------------------------------
1.29/1.38 c # SCIP version 1.2.1.2
1.29/1.38 c
1.29/1.38 c # frequency for displaying node information lines
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 100]
1.29/1.38 c display/freq = 10000
1.29/1.38 c
1.29/1.38 c # maximal time in seconds to run
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.29/1.38 c limits/time = 1799.79
1.29/1.38 c
1.29/1.38 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.29/1.38 c limits/memory = 1620
1.29/1.38 c
1.29/1.38 c # solving stops, if the given number of solutions were found (-1: no limit)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.38 c limits/solutions = 1
1.29/1.38 c
1.29/1.38 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c lp/solvefreq = -1
1.29/1.38 c
1.29/1.38 c # maximal number of separation rounds per node (-1: unlimited)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 5]
1.29/1.38 c separating/maxrounds = 1
1.29/1.38 c
1.29/1.38 c # maximal number of separation rounds in the root node (-1: unlimited)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.38 c separating/maxroundsroot = 5
1.29/1.38 c
1.29/1.38 c # should presolving try to simplify inequalities
1.29/1.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.29/1.38 c constraints/linear/simplifyinequalities = TRUE
1.29/1.38 c
1.29/1.38 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.29/1.38 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.29/1.38 c constraints/knapsack/disaggregation = FALSE
1.29/1.38 c
1.29/1.38 c # should presolving try to simplify knapsacks
1.29/1.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.29/1.38 c constraints/knapsack/simplifyinequalities = TRUE
1.29/1.38 c
1.29/1.38 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.38 c presolving/probing/maxrounds = 0
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/coefdiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/coefdiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/coefdiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 30]
1.29/1.38 c heuristics/crossover/freq = -1
1.29/1.38 c
1.29/1.38 c # number of nodes added to the contingent of the total nodes
1.29/1.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.29/1.38 c heuristics/crossover/nodesofs = 750
1.29/1.38 c
1.29/1.38 c # number of nodes without incumbent change that heuristic should wait
1.29/1.38 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.29/1.38 c heuristics/crossover/nwaitingnodes = 100
1.29/1.38 c
1.29/1.38 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.29/1.38 c # [type: real, range: [0,1], default: 0.1]
1.29/1.38 c heuristics/crossover/nodesquot = 0.15
1.29/1.38 c
1.29/1.38 c # minimum percentage of integer variables that have to be fixed
1.29/1.38 c # [type: real, range: [0,1], default: 0.666]
1.29/1.38 c heuristics/crossover/minfixingrate = 0.5
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 20]
1.29/1.38 c heuristics/feaspump/freq = -1
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/feaspump/maxlpiterofs = 2000
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/fracdiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/fracdiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/fracdiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/guideddiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/guideddiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/guideddiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/intdiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/intshifting/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/linesearchdiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c heuristics/nlp/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 20]
1.29/1.38 c heuristics/objpscostdiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to total iteration number
1.29/1.38 c # [type: real, range: [0,1], default: 0.01]
1.29/1.38 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c heuristics/oneopt/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/pscostdiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/pscostdiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.38 c heuristics/rens/freq = -1
1.29/1.38 c
1.29/1.38 c # minimum percentage of integer variables that have to be fixable
1.29/1.38 c # [type: real, range: [0,1], default: 0.5]
1.29/1.38 c heuristics/rens/minfixingrate = 0.3
1.29/1.38 c
1.29/1.38 c # number of nodes added to the contingent of the total nodes
1.29/1.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.29/1.38 c heuristics/rens/nodesofs = 2000
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 20]
1.29/1.38 c heuristics/rootsoldiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.29/1.38 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c heuristics/rounding/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/shifting/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c heuristics/simplerounding/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.38 c heuristics/trivial/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c heuristics/trysol/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.38 c heuristics/veclendiving/freq = -1
1.29/1.38 c
1.29/1.38 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.38 c heuristics/veclendiving/maxlpiterquot = 0.075
1.29/1.38 c
1.29/1.38 c # additional number of allowed LP iterations
1.29/1.38 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.38 c heuristics/veclendiving/maxlpiterofs = 1500
1.29/1.38 c
1.29/1.38 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.38 c heuristics/zirounding/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.38 c separating/cmir/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.38 c separating/flowcover/freq = -1
1.29/1.38 c
1.29/1.38 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.29/1.38 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.38 c separating/rapidlearning/freq = 0
1.29/1.38 c
1.29/1.38 c -----------------------------------------------------------------------------------------------
1.29/1.38 c start solving
1.39/1.40 c
1.39/1.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.42 c 1.0s| 1 | 2 | 0 | - | 44M| 0 | - | 16k| 17k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
23.29/23.39 c *22.8s| 3401 | 0 | 0 | 0.0 | 50M|1376 | - | 16k| 17k| 0 | 0 | 0 | 16 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
23.39/23.43 c
23.39/23.43 c SCIP Status : problem is solved [optimal solution found]
23.39/23.43 c Solving Time (sec) : 22.84
23.39/23.43 c Solving Nodes : 3401
23.39/23.43 c Primal Bound : +0.00000000000000e+00 (1 solutions)
23.39/23.43 c Dual Bound : +0.00000000000000e+00
23.39/23.43 c Gap : 0.00 %
23.39/23.47 s SATISFIABLE
23.39/23.47 v -x726 -x703 -x618 -x817 -x772 -x819 -x997 -x896 -x846 -x873 -x852 -x986 -x690 -x929 x982 -x893 -x972 -x999 x993 -x632 -x712 -x686
23.39/23.47 v -x643 -x658 -x925 -x707 -x697 -x848 -x621 -x588 -x891 -x661 -x675 -x752 -x706 -x973 -x814 -x894 -x784 -x614 -x858 -x943 -x994
23.39/23.47 v -x885 -x645 -x531 -x918 -x841 -x673 -x1000 -x808 -x755 -x547 -x831 -x526 -x906 -x674 -x644 -x783 -x951 -x630 -x606 -x905
23.39/23.47 v -x985 -x575 -x791 -x907 -x754 -x603 x995 -x562 -x670 -x693 -x691 -x584 -x583 -x942 -x780 -x880 -x582 -x845 -x668 -x913 -x678
23.39/23.47 v -x524 -x623 -x842 -x788 -x773 -x682 -x967 -x560 -x900 -x877 -x522 -x909 -x741 -x544 -x763 -x818 -x916 -x856 -x687 -x816 -x671
23.39/23.47 v -x656 -x796 -x976 -x749 -x930 -x834 -x737 -x750 -x600 -x952 -x927 -x825 -x767 -x549 -x700 -x948 -x701 -x977 -x872 -x760 -x805
23.39/23.47 v -x855 -x655 -x565 -x519 -x924 -x748 -x962 -x955 x969 -x708 -x597 -x642 -x933 -x860 -x770 -x689 -x683 -x620 -x539 -x729 -x546
23.39/23.47 v -x698 -x786 -x759 -x513 -x957 -x950 -x910 -x798 -x732 -x721 -x631 -x604 -x983 -x865 -x771 -x537 -x826 -x939 -x932 -x580 -x803
23.39/23.47 v -x838 -x853 -x753 -x638 -x512 -x971 -x947 -x904 -x824 -x782 -x757 -x657 -x593 -x802 -x965 -x713 -x599 -x696 -x790 -x840 -x778
23.39/23.47 v -x555 -x801 -x734 -x733 -x903 -x892 -x797 -x641 -x557 -x864 x984 -x960 -x949 x839 -x854 -x958 -x589 -x615 -x890 -x863 -x830
23.39/23.47 v -x810 -x775 -x665 -x648 -x576 -x836 -x953 -x883 -x881 -x540 -x895 -x917 -x607 -x970 -x609 -x914 -x946 x959 -x509 x988 -x876
23.39/23.47 v -x850 -x833 -x828 -x821 -x812 -x768 -x685 -x637 -x550 -x920 -x931 -x725 -x936 x981 -x718 -x835 -x806 -x811 -x534 -x556 -x923
23.39/23.47 v -x695 -x787 -x966 -x964 -x945 -x879 -x875 -x837 -x744 -x743 -x710 -x634 -x563 -x536 -x919 -x651 -x912 -x677 -x756 -x857 -x561
23.39/23.47 v -x639 -x709 -x926 x991 -x518 -x569 -x507 -x974 -x898 -x781 -x738 -x694 -x684 -x612 -x652 -x886 -x822 -x899 -x751 -x516 -x820
23.39/23.47 v -x764 -x578 -x716 -x815 -x570 -x889 -x795 -x793 -x704 -x692 -x669 -x640 -x613 -x601 -x558 -x530 -x529 x514 -x765 -x545 -x998
23.39/23.47 v -x626 -x956 -x636 -x758 -x542 -x622 -x564 -x619 -x602 -x742 x978 x938 -x996 -x868 -x859 -x794 -x761 -x740 -x730 -x722 -x679
23.39/23.47 v -x663 -x654 -x587 -x571 -x552 -x646 -x627 -x715 -x922 -x568 -x508 -x533 -x901 -x897 -x979 -x870 -x963 -x525 -x937 -x908 -x823
23.39/23.47 v -x789 -x711 -x705 -x688 -x667 -x662 -x629 -x605 -x559 -x541 -x532 -x510 -x505 -x747 -x610 -x551 -x592 -x871 -x807 -x647 -x844
23.39/23.47 v -x579 -x719 -x659 -x590 -x792 -x935 -x887 -x528 -x503 -x944 -x769 -x746 -x735 -x672 -x566 -x523 -x520 -x515 -x664 -x980 -x799
23.39/23.47 v -x779 -x975 -x762 -x804 -x888 -x745 -x591 -x851 -x940 -x869 -x934 -x628 -x717 -x543 x990 -x928 -x724 -x586 -x554 -x989 -x774
23.39/23.47 v -x502 -x992 -x902 -x843 -x827 -x813 -x785 -x776 -x720 -x660 -x653 -x635 -x625 -x617 -x596 -x577 -x567 -x548 -x535 -x504
23.39/23.47 v -x723 -x616 -x594 -x702 -x608 -x624 -x736 -x666 -x714 -x538 x954 -x866 -x511 -x941 -x862 -x800 -x809 -x585 -x728 -x847 -x968
23.39/23.47 v -x553 -x884 -x501 -x878 -x867 -x739 -x731 -x681 -x649 -x598 -x595 -x581 -x572 -x517 -x961 -x832 -x874 -x680 -x506 -x915 -x987
23.39/23.47 v -x829 -x727 -x521 -x911 -x699 -x861 -x849 -x527 -x882 -x574 -x650 -x921 -x633 -x777 -x573 -x611 -x766 -x676 -x500 -x499 x498
23.39/23.47 v -x497 -x496 -x495 -x494 -x493 x492 -x491 -x490 -x489 -x488 x487 -x486 -x485 -x484 x483 -x482 -x481 -x480 x479 -x478 -x477 -x476
23.39/23.47 v -x475 -x474 -x473 -x472 x471 x470 -x469 -x468 -x467 -x466 x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455
23.39/23.47 v -x454 -x453 -x452 -x451 -x450 -x449 x448 -x447 x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 x437 x436 -x435 -x434 -x433
23.39/23.47 v -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412
23.39/23.47 v -x411 -x410 -x409 -x408 -x407 x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391
23.39/23.47 v -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371
23.39/23.47 v -x370 x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350
23.39/23.47 v -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329
23.39/23.47 v -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308
23.39/23.47 v -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287
23.39/23.47 v -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266
23.39/23.47 v -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245
23.39/23.47 v -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225
23.39/23.47 v -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204
23.39/23.47 v -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183
23.39/23.47 v -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162
23.39/23.47 v -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141
23.39/23.47 v -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120
23.39/23.47 v -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100
23.39/23.47 v -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
23.39/23.47 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
23.39/23.47 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25
23.39/23.47 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
23.39/23.47 c SCIP Status : problem is solved [optimal solution found]
23.39/23.47 c Solving Time : 22.84
23.39/23.47 c Original Problem :
23.39/23.47 c Problem name : HOME/instance-2663447-1276679126.opb
23.39/23.47 c Variables : 16706 (16706 binary, 0 integer, 0 implicit integer, 0 continuous)
23.39/23.47 c Constraints : 17208 initial, 17208 maximal
23.39/23.47 c Presolved Problem :
23.39/23.47 c Problem name : t_HOME/instance-2663447-1276679126.opb
23.39/23.47 c Variables : 16706 (16706 binary, 0 integer, 0 implicit integer, 0 continuous)
23.39/23.47 c Constraints : 17208 initial, 17224 maximal
23.39/23.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
23.39/23.47 c trivial : 0.01 0 0 0 0 0 0 0 0
23.39/23.47 c dualfix : 0.01 0 0 0 0 0 0 0 0
23.39/23.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
23.39/23.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
23.39/23.47 c implics : 0.01 0 0 0 0 0 0 0 0
23.39/23.47 c probing : 0.00 0 0 0 0 0 0 0 0
23.39/23.47 c knapsack : 0.04 0 0 0 0 0 0 0 0
23.39/23.47 c setppc : 0.03 0 0 0 0 0 0 0 0
23.39/23.47 c and : 0.49 0 0 0 0 0 0 0 0
23.39/23.47 c linear : 0.12 0 0 0 0 0 0 0 0
23.39/23.47 c logicor : 0.01 0 0 0 0 0 0 0 0
23.39/23.47 c root node : - 0 - - 0 - - - -
23.39/23.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
23.39/23.47 c integral : 0 0 0 0 0 0 0 0 0 0
23.39/23.47 c knapsack : 1 0 6106 0 3363 2 231 0 0 0
23.39/23.47 c setppc : 1000 0 5857 0 3189 0 0 0 0 0
23.39/23.47 c and : 15706 0 6031 0 3362 0 46609 0 0 0
23.39/23.47 c linear : 1 0 6127 0 3375 23 61 0 0 0
23.39/23.47 c logicor : 500+ 0 38 0 3376 1 66 0 0 0
23.39/23.47 c countsols : 0 0 0 0 3376 0 0 0 0 0
23.39/23.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
23.39/23.47 c integral : 0.00 0.00 0.00 0.00 0.00
23.39/23.47 c knapsack : 0.27 0.00 0.03 0.00 0.24
23.39/23.47 c setppc : 5.41 0.00 0.26 0.00 5.15
23.39/23.47 c and : 7.30 0.00 2.56 0.00 4.74
23.39/23.47 c linear : 0.85 0.00 0.84 0.00 0.01
23.39/23.47 c logicor : 0.33 0.00 0.00 0.00 0.33
23.39/23.47 c countsols : 0.01 0.00 0.00 0.00 0.01
23.39/23.47 c Propagators : Time Calls Cutoffs DomReds
23.39/23.47 c vbounds : 0.00 1 0 0
23.39/23.47 c rootredcost : 0.00 0 0 0
23.39/23.47 c pseudoobj : 0.00 0 0 0
23.39/23.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
23.39/23.47 c propagation : 0.13 26 13 35 968.2 0 0.0 -
23.39/23.47 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
23.39/23.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
23.39/23.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
23.39/23.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
23.39/23.47 c applied globally : - - - 16 968.6 - - -
23.39/23.47 c applied locally : - - - 0 0.0 - - -
23.39/23.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
23.39/23.47 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
23.39/23.47 c redcost : 0.00 0 0 0 0 0
23.39/23.47 c impliedbounds : 0.00 0 0 0 0 0
23.39/23.47 c intobj : 0.00 0 0 0 0 0
23.39/23.47 c cgmip : 0.00 0 0 0 0 0
23.39/23.47 c gomory : 0.00 0 0 0 0 0
23.39/23.47 c strongcg : 0.00 0 0 0 0 0
23.39/23.47 c cmir : 0.00 0 0 0 0 0
23.39/23.47 c flowcover : 0.00 0 0 0 0 0
23.39/23.47 c clique : 0.00 0 0 0 0 0
23.39/23.47 c zerohalf : 0.00 0 0 0 0 0
23.39/23.47 c mcf : 0.00 0 0 0 0 0
23.39/23.47 c rapidlearning : 0.00 0 0 0 0 0
23.39/23.48 c Pricers : Time Calls Vars
23.39/23.48 c problem variables: 0.00 0 0
23.39/23.48 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
23.39/23.48 c relpscost : 0.00 0 0 0 0 0 0
23.39/23.48 c pscost : 0.00 0 0 0 0 0 0
23.39/23.48 c inference : 7.40 3375 0 0 0 0 6750
23.39/23.48 c mostinf : 0.00 0 0 0 0 0 0
23.39/23.48 c leastinf : 0.00 0 0 0 0 0 0
23.39/23.48 c fullstrong : 0.00 0 0 0 0 0 0
23.39/23.48 c allfullstrong : 0.00 0 0 0 0 0 0
23.39/23.48 c random : 0.00 0 0 0 0 0 0
23.39/23.48 c Primal Heuristics : Time Calls Found
23.39/23.48 c LP solutions : 0.00 - 0
23.39/23.48 c pseudo solutions : 0.01 - 1
23.39/23.48 c trivial : 0.03 1 0
23.39/23.48 c simplerounding : 0.00 0 0
23.39/23.48 c zirounding : 0.00 0 0
23.39/23.48 c rounding : 0.00 0 0
23.39/23.48 c shifting : 0.00 0 0
23.39/23.48 c intshifting : 0.00 0 0
23.39/23.48 c oneopt : 0.00 0 0
23.39/23.48 c twoopt : 0.00 0 0
23.39/23.48 c fixandinfer : 0.00 0 0
23.39/23.48 c feaspump : 0.00 0 0
23.39/23.48 c coefdiving : 0.00 0 0
23.39/23.48 c pscostdiving : 0.00 0 0
23.39/23.48 c fracdiving : 0.00 0 0
23.39/23.48 c veclendiving : 0.00 0 0
23.39/23.48 c intdiving : 0.00 0 0
23.39/23.48 c actconsdiving : 0.00 0 0
23.39/23.48 c objpscostdiving : 0.00 0 0
23.39/23.48 c rootsoldiving : 0.00 0 0
23.39/23.48 c linesearchdiving : 0.00 0 0
23.39/23.48 c guideddiving : 0.00 0 0
23.39/23.48 c octane : 0.00 0 0
23.39/23.48 c rens : 0.00 0 0
23.39/23.48 c rins : 0.00 0 0
23.39/23.48 c localbranching : 0.00 0 0
23.39/23.48 c mutation : 0.00 0 0
23.39/23.48 c crossover : 0.00 0 0
23.39/23.48 c dins : 0.00 0 0
23.39/23.48 c undercover : 0.00 0 0
23.39/23.48 c nlp : 0.00 0 0
23.39/23.48 c trysol : 0.00 0 0
23.39/23.48 c LP : Time Calls Iterations Iter/call Iter/sec
23.39/23.48 c primal LP : 0.00 0 0 0.00 -
23.39/23.48 c dual LP : 0.00 0 0 0.00 -
23.39/23.48 c lex dual LP : 0.00 0 0 0.00 -
23.39/23.48 c barrier LP : 0.00 0 0 0.00 -
23.39/23.48 c diving/probing LP: 0.00 0 0 0.00 -
23.39/23.48 c strong branching : 0.00 0 0 0.00 -
23.39/23.48 c (at root node) : - 0 0 0.00 -
23.39/23.48 c conflict analysis: 0.00 0 0 0.00 -
23.39/23.48 c B&B Tree :
23.39/23.48 c number of runs : 1
23.39/23.48 c nodes : 3401
23.39/23.48 c nodes (total) : 3401
23.39/23.48 c nodes left : 0
23.39/23.48 c max depth : 1376
23.39/23.48 c max depth (total): 1376
23.39/23.48 c backtracks : 2 (0.1%)
23.39/23.48 c delayed cutoffs : 1
23.39/23.48 c repropagations : 56 (35 domain reductions, 1 cutoffs)
23.39/23.48 c avg switch length: 2.03
23.39/23.48 c switching time : 0.12
23.39/23.48 c Solution :
23.39/23.48 c Solutions found : 1 (1 improvements)
23.39/23.48 c First Solution : +0.00000000000000e+00 (in run 1, after 3401 nodes, 22.80 seconds, depth 1019, found by <relaxation>)
23.39/23.48 c Primal Bound : +0.00000000000000e+00 (in run 1, after 3401 nodes, 22.80 seconds, depth 1019, found by <relaxation>)
23.39/23.48 c Dual Bound : +0.00000000000000e+00
23.39/23.48 c Gap : 0.00 %
23.39/23.48 c Root Dual Bound : +0.00000000000000e+00
23.39/23.48 c Root Iterations : 0
23.59/23.61 c Time complete: 23.59.