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