| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) | UNSAT | 1.38079 | 1.38233 |
| Name | /DEC-SMALLINT-LIN/oliveras/j30/ normalized-j3046_4-unsat.opb |
| MD5SUM | 194fc06f7c21580ad88e7dc6177066b4 |
| Bench Category | DEC-SMALLINT-LIN (no optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.012997 |
| Has Objective Function | NO |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 3968 |
| Total number of constraints | 13430 |
| Number of constraints which are clauses | 13178 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 252 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 30 |
| Number of terms in the objective function | 0 |
| Biggest coefficient in the objective function | 0 |
| Number of bits for the biggest coefficient in the objective function | 0 |
| Sum of the numbers in the objective function | 0 |
| Number of bits of the sum of numbers in the objective function | 0 |
| Biggest number in a constraint | 25 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 187 |
| Number of bits of the biggest sum of numbers | 8 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
0.05/0.08 c SCIP version 1.1.0.7
0.05/0.08 c LP-Solver SoPlex 1.4.1
0.05/0.08 c user parameter file <scip.set> not found - using default parameters
0.05/0.08 c read problem <HOME/instance-3739444-1338756322.opb>
0.05/0.08 c original problem has 3968 variables (3968 bin, 0 int, 0 impl, 0 cont) and 13430 constraints
0.09/0.11 c No objective function, only one solution is needed.
0.09/0.11 c start presolving problem
0.09/0.11 c presolving:
0.29/0.32 c (round 1) 1414 del vars, 3677 del conss, 1043 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 598350 impls, 0 clqs
0.38/0.40 c (round 2) 2752 del vars, 8895 del conss, 2265 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 606298 impls, 0 clqs
0.38/0.41 c (round 3) 3070 del vars, 10632 del conss, 2429 chg bounds, 56 chg sides, 49 chg coeffs, 0 upgd conss, 608750 impls, 0 clqs
0.38/0.42 c (round 4) 3276 del vars, 11219 del conss, 2552 chg bounds, 75 chg sides, 68 chg coeffs, 0 upgd conss, 611624 impls, 0 clqs
0.38/0.42 c (round 5) 3402 del vars, 11758 del conss, 2635 chg bounds, 79 chg sides, 72 chg coeffs, 0 upgd conss, 613180 impls, 0 clqs
0.38/0.43 c (round 6) 3478 del vars, 11993 del conss, 2692 chg bounds, 98 chg sides, 90 chg coeffs, 0 upgd conss, 613520 impls, 0 clqs
0.38/0.43 c (round 7) 3499 del vars, 12084 del conss, 2697 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613708 impls, 0 clqs
0.38/0.43 c (round 8) 3499 del vars, 12110 del conss, 2697 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613708 impls, 0 clqs
0.38/0.45 c (round 9) 3499 del vars, 12113 del conss, 2697 chg bounds, 110 chg sides, 102 chg coeffs, 1320 upgd conss, 613708 impls, 0 clqs
0.38/0.46 c (round 10) 3499 del vars, 12113 del conss, 2697 chg bounds, 122 chg sides, 241 chg coeffs, 1320 upgd conss, 614508 impls, 66 clqs
0.38/0.47 c (round 11) 3499 del vars, 12115 del conss, 2697 chg bounds, 126 chg sides, 377 chg coeffs, 1320 upgd conss, 614610 impls, 77 clqs
0.38/0.47 c (round 12) 3499 del vars, 12115 del conss, 2697 chg bounds, 132 chg sides, 468 chg coeffs, 1320 upgd conss, 614712 impls, 96 clqs
0.38/0.47 c (round 13) 3499 del vars, 12115 del conss, 2697 chg bounds, 132 chg sides, 496 chg coeffs, 1320 upgd conss, 614752 impls, 112 clqs
0.38/0.47 c (round 14) 3499 del vars, 12115 del conss, 2697 chg bounds, 132 chg sides, 508 chg coeffs, 1320 upgd conss, 614752 impls, 114 clqs
0.38/0.47 c (round 15) 3499 del vars, 12115 del conss, 2697 chg bounds, 132 chg sides, 510 chg coeffs, 1320 upgd conss, 614752 impls, 115 clqs
0.38/0.47 c presolving (16 rounds):
0.38/0.47 c 3499 deleted vars, 12115 deleted constraints, 2697 tightened bounds, 0 added holes, 132 changed sides, 510 changed coefficients
0.38/0.47 c 614752 implications, 115 cliques
0.38/0.47 c presolved problem has 469 variables (469 bin, 0 int, 0 impl, 0 cont) and 1315 constraints
0.38/0.47 c 192 constraints of type <knapsack>
0.38/0.47 c 1123 constraints of type <logicor>
0.38/0.47 c transformed objective value is always integral (scale: 1)
0.38/0.47 c Presolving Time: 0.35
0.38/0.47 c SATUNSAT-LIN
0.38/0.47 c -----------------------------------------------------------------------------------------------
0.38/0.47 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.38/0.47 c separating/flowcover/freq = c -1
0.38/0.47 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.38/0.47 c separating/cmir/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/veclendiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.38/0.47 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/veclendiving/freq = c -1
0.38/0.47 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.38/0.47 c heuristics/simplerounding/freq = c -1
0.38/0.47 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/shifting/freq = c -1
0.38/0.47 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.38/0.47 c heuristics/rounding/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.38/0.47 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.38/0.47 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 20]
0.38/0.47 c heuristics/rootsoldiving/freq = c -1
0.38/0.47 c # number of nodes added to the contingent of the total nodes
0.38/0.47 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.38/0.47 c heuristics/rens/nodesofs = c 2000
0.38/0.47 c # minimum percentage of integer variables that have to be fixable
0.38/0.47 c # [type: real, range: [0,1], default: 0.5]
0.38/0.47 c heuristics/rens/minfixingrate = c 0.3
0.38/0.47 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 0]
0.38/0.47 c heuristics/rens/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.38/0.47 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/pscostdiving/freq = c -1
0.38/0.47 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 1]
0.38/0.47 c heuristics/oneopt/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to total iteration number
0.38/0.47 c # [type: real, range: [0,1], default: 0.01]
0.38/0.47 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.38/0.47 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 20]
0.38/0.47 c heuristics/objpscostdiving/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.38/0.47 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/linesearchdiving/freq = c -1
0.38/0.47 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/intshifting/freq = c -1
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/intdiving/maxlpiterquot = c 0.075
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/guideddiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.38/0.47 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/guideddiving/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/fracdiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.38/0.47 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/fracdiving/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/feaspump/maxlpiterofs = c 2000
0.38/0.47 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 20]
0.38/0.47 c heuristics/feaspump/freq = c -1
0.38/0.47 c # minimum percentage of integer variables that have to be fixed
0.38/0.47 c # [type: real, range: [0,1], default: 0.666]
0.38/0.47 c heuristics/crossover/minfixingrate = c 0.5
0.38/0.47 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.38/0.47 c # [type: real, range: [0,1], default: 0.1]
0.38/0.47 c heuristics/crossover/nodesquot = c 0.15
0.38/0.47 c # number of nodes without incumbent change that heuristic should wait
0.38/0.47 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.38/0.47 c heuristics/crossover/nwaitingnodes = c 100
0.38/0.47 c # number of nodes added to the contingent of the total nodes
0.38/0.47 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.38/0.47 c heuristics/crossover/nodesofs = c 750
0.38/0.47 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 30]
0.38/0.47 c heuristics/crossover/freq = c -1
0.38/0.47 c # additional number of allowed LP iterations
0.38/0.47 c # [type: int, range: [0,2147483647], default: 1000]
0.38/0.47 c heuristics/coefdiving/maxlpiterofs = c 1500
0.38/0.47 c # maximal fraction of diving LP iterations compared to node LP iterations
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.38/0.47 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.38/0.47 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 10]
0.38/0.47 c heuristics/coefdiving/freq = c -1
0.38/0.47 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.38/0.47 c presolving/probing/maxrounds = c 0
0.38/0.47 c # should presolving try to simplify knapsacks
0.38/0.47 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.38/0.47 c constraints/knapsack/simplifyinequalities = c TRUE
0.38/0.47 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.38/0.47 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.38/0.47 c constraints/knapsack/disaggregation = c FALSE
0.38/0.47 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.38/0.47 c constraints/knapsack/maxnumcardlift = c 0
0.38/0.47 c # should presolving try to simplify inequalities
0.38/0.47 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.38/0.47 c constraints/linear/simplifyinequalities = c TRUE
0.38/0.47 c # maximal number of separation rounds in the root node (-1: unlimited)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.38/0.47 c separating/maxroundsroot = c 5
0.38/0.47 c # maximal number of separation rounds per node (-1: unlimited)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 5]
0.38/0.47 c separating/maxrounds = c 1
0.38/0.47 c # solving stops, if the given number of solutions were found (-1: no limit)
0.38/0.47 c # [type: int, range: [-1,2147483647], default: -1]
0.38/0.47 c limits/solutions = c 1
0.38/0.47 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.38/0.47 c limits/memory = c 13950
0.38/0.47 c # maximal time in seconds to run
0.38/0.47 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.38/0.47 c limits/time = c 1791
0.38/0.47 c # frequency for displaying node information lines
0.38/0.47 c # [type: int, range: [-1,2147483647], default: 100]
0.38/0.47 c display/freq = c 10000
0.38/0.47 c -----------------------------------------------------------------------------------------------
0.38/0.47 c start solving problem
0.38/0.47 c
0.38/0.49 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.38/0.49 c 0.4s| 1 | 0 | 214 | 14M| 0 | 90 | 469 |1315 |1315 | 469 |1315 | 0 | 0 | 0 | 1.188912e+03 | -- | Inf
0.48/0.54 c 0.4s| 1 | 0 | 399 | 15M| 0 | 142 | 469 |1315 |1315 | 469 |1357 | 42 | 0 | 0 | 1.208349e+03 | -- | Inf
0.59/0.61 c 0.5s| 1 | 0 | 507 | 15M| 0 | 133 | 469 |1315 |1315 | 469 |1386 | 71 | 0 | 0 | 1.216430e+03 | -- | Inf
0.59/0.66 c 0.5s| 1 | 0 | 614 | 15M| 0 | 171 | 469 |1315 |1315 | 469 |1401 | 86 | 0 | 0 | 1.218749e+03 | -- | Inf
0.69/0.72 c 0.6s| 1 | 0 | 675 | 16M| 0 | 182 | 469 |1315 |1315 | 469 |1411 | 96 | 0 | 0 | 1.220019e+03 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 723 | 16M| 0 | 175 | 469 |1315 |1315 | 469 |1417 | 102 | 0 | 0 | 1.220294e+03 | -- | Inf
1.29/1.35 c 1.2s| 1 | 0 | 894 | 14M| 0 | 48 | 469 | 930 | 930 | 469 |1417 | 102 | 0 | 16 | 1.233149e+03 | -- | Inf
1.29/1.36 c 1.2s| 1 | 0 | 894 | 14M| 0 | 48 | 469 | 930 | 930 | 469 |1417 | 102 | 0 | 17 | -- | -- | 0.00%
1.29/1.36 c
1.29/1.36 c SCIP Status : problem is solved [infeasible]
1.29/1.36 c Solving Time (sec) : 1.23
1.29/1.36 c Solving Nodes : 1
1.29/1.36 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.29/1.36 c Dual Bound : +1.00000000000000e+20
1.29/1.36 c Gap : 0.00 %
1.29/1.36 c NODE 1
1.29/1.36 c DUAL BOUND 1e+20
1.29/1.36 c PRIMAL BOUND 1e+20
1.29/1.36 c GAP 0
1.29/1.36 s UNSATISFIABLE
1.29/1.36 c SCIP Status : problem is solved [infeasible]
1.29/1.36 c Solving Time : 1.23
1.29/1.36 c Original Problem :
1.29/1.36 c Problem name : HOME/instance-3739444-1338756322.opb
1.29/1.36 c Variables : 3968 (3968 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 13430 initial, 13430 maximal
1.29/1.36 c Presolved Problem :
1.29/1.36 c Problem name : t_HOME/instance-3739444-1338756322.opb
1.29/1.36 c Variables : 469 (469 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 1315 initial, 1315 maximal
1.29/1.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.36 c trivial : 0.00 124 0 0 0 0 0 0 0
1.29/1.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c implics : 0.00 0 23 0 0 0 0 0 0
1.29/1.36 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c knapsack : 0.01 0 0 0 0 0 0 22 408
1.29/1.36 c linear : 0.30 2573 779 0 2697 0 12110 110 102
1.29/1.36 c logicor : 0.02 0 0 0 0 0 5 0 0
1.29/1.36 c root node : - 249 - - 249 - - - -
1.29/1.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.36 c integral : 0 0 0 2 0 1 5 0 0 0
1.29/1.36 c knapsack : 192 5 19 0 0 0 80 110 0 0
1.29/1.36 c logicor : 1123 5 19 0 0 0 164 0 0 0
1.29/1.36 c countsols : 0 0 0 0 0 0 0 0 0 0
1.29/1.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.36 c integral : 0.54 0.00 0.00 0.54 0.00
1.29/1.36 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c Propagators : Time Calls Cutoffs DomReds
1.29/1.36 c rootredcost : 0.00 0 0 0
1.29/1.36 c pseudoobj : 0.00 26 0 0
1.29/1.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.36 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.36 c applied globally : - - - 0 0.0 - - -
1.29/1.36 c applied locally : - - - 0 0.0 - - -
1.29/1.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.36 c cut pool : 0.00 4 - - 84 - (maximal pool size: 932)
1.29/1.36 c redcost : 0.00 5 0 0 0 0
1.29/1.36 c impliedbounds : 0.01 5 0 0 24 0
1.29/1.36 c intobj : 0.00 0 0 0 0 0
1.29/1.36 c gomory : 0.10 5 0 0 1312 0
1.29/1.36 c strongcg : 0.08 5 0 0 1789 0
1.29/1.36 c cmir : 0.00 0 0 0 0 0
1.29/1.36 c flowcover : 0.00 0 0 0 0 0
1.29/1.36 c clique : 0.01 5 0 0 21 0
1.29/1.36 c zerohalf : 0.00 0 0 0 0 0
1.29/1.36 c mcf : 0.00 1 0 0 0 0
1.29/1.36 c Pricers : Time Calls Vars
1.29/1.36 c problem variables: 0.00 0 0
1.29/1.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.36 c relpscost : 0.54 2 1 5 0 0 0
1.29/1.36 c pscost : 0.00 0 0 0 0 0 0
1.29/1.36 c inference : 0.00 0 0 0 0 0 0
1.29/1.36 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.36 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.36 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.36 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.36 c random : 0.00 0 0 0 0 0 0
1.29/1.36 c Primal Heuristics : Time Calls Found
1.29/1.36 c LP solutions : 0.00 - 0
1.29/1.36 c pseudo solutions : 0.00 - 0
1.29/1.36 c simplerounding : 0.00 0 0
1.29/1.36 c rounding : 0.00 0 0
1.29/1.36 c shifting : 0.00 0 0
1.29/1.36 c intshifting : 0.00 0 0
1.29/1.36 c oneopt : 0.00 0 0
1.29/1.36 c fixandinfer : 0.00 0 0
1.29/1.36 c feaspump : 0.00 0 0
1.29/1.36 c coefdiving : 0.00 0 0
1.29/1.36 c pscostdiving : 0.00 0 0
1.29/1.36 c fracdiving : 0.00 0 0
1.29/1.36 c veclendiving : 0.00 0 0
1.29/1.36 c intdiving : 0.00 0 0
1.29/1.36 c actconsdiving : 0.00 0 0
1.29/1.36 c objpscostdiving : 0.00 0 0
1.29/1.36 c rootsoldiving : 0.00 0 0
1.29/1.36 c linesearchdiving : 0.00 0 0
1.29/1.36 c guideddiving : 0.00 0 0
1.29/1.36 c octane : 0.00 0 0
1.29/1.36 c rens : 0.00 0 0
1.29/1.36 c rins : 0.00 0 0
1.29/1.36 c localbranching : 0.00 0 0
1.29/1.36 c mutation : 0.00 0 0
1.29/1.36 c crossover : 0.00 0 0
1.29/1.36 c dins : 0.00 0 0
1.29/1.36 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.36 c primal LP : 0.00 0 0 0.00 -
1.29/1.36 c dual LP : 0.12 7 894 127.71 7450.00
1.29/1.36 c barrier LP : 0.00 0 0 0.00 -
1.29/1.36 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.36 c strong branching : 0.54 17 3647 214.53 6753.70
1.29/1.36 c (at root node) : - 17 3647 214.53 -
1.29/1.36 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.36 c B&B Tree :
1.29/1.36 c number of runs : 1
1.29/1.36 c nodes : 1
1.29/1.36 c nodes (total) : 1
1.29/1.36 c nodes left : 0
1.29/1.36 c max depth : 0
1.29/1.36 c max depth (total): 0
1.29/1.36 c backtracks : 0 (0.0%)
1.29/1.36 c delayed cutoffs : 0
1.29/1.36 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.36 c avg switch length: 2.00
1.29/1.36 c switching time : 0.00
1.29/1.36 c Solution :
1.29/1.36 c Solutions found : 0 (0 improvements)
1.29/1.36 c Primal Bound : infeasible
1.29/1.36 c Dual Bound : -
1.29/1.36 c Gap : 0.00 %
1.29/1.36 c Root Dual Bound : -
1.29/1.38 c Time complete: 1.37.
ERROR: no interpretation found !
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL This is runsolver version 3.3.1 (svn: 989) This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3739444-1338756322/watcher-3739444-1338756322 -o /tmp/evaluation-result-3739444-1338756322/solver-3739444-1338756322 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3739444-1338756322.opb running on 4 cores: 1,3,5,7 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): 1900 seconds Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB Current StackSize limit: 10240 KiB [startup+0 s] /proc/loadavg: 2.00 2.00 2.00 3/176 27979 /proc/meminfo: memFree=28031768/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=8708 CPUtime=0 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 1527 0 0 0 0 0 0 0 20 0 1 0 341756748 8916992 1479 33554432000 4194304 7823515 140735611636416 140737147616424 5878822 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 2177 1479 351 887 0 1287 0 [startup+0.06775 s] /proc/loadavg: 2.00 2.00 2.00 3/176 27979 /proc/meminfo: memFree=28031768/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=16416 CPUtime=0.05 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 3458 0 0 0 5 0 0 0 20 0 1 0 341756748 16809984 3410 33554432000 4194304 7823515 140735611636416 140737147616424 6957168 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 4104 3410 351 887 0 3214 0 Current children cumulated CPU time (s) 0.05 Current children cumulated vsize (KiB) 16416 [startup+0.100344 s] /proc/loadavg: 2.00 2.00 2.00 3/176 27979 /proc/meminfo: memFree=28031768/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=27892 CPUtime=0.09 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 6598 0 0 0 8 1 0 0 20 0 1 0 341756748 28561408 6196 33554432000 4194304 7823515 140735611636416 140737147616424 4511625 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 6973 6196 370 887 0 6083 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 27892 [startup+0.300299 s] /proc/loadavg: 2.00 2.00 2.00 3/176 27979 /proc/meminfo: memFree=28031768/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=53332 CPUtime=0.29 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 12703 0 0 0 27 2 0 0 20 0 1 0 341756748 54611968 12301 33554432000 4194304 7823515 140735611636416 140735611633352 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 13333 12301 432 887 0 12443 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 53332 [startup+0.70024 s] /proc/loadavg: 2.00 2.00 2.00 3/176 27979 /proc/meminfo: memFree=28031768/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=59724 CPUtime=0.69 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 14514 0 0 0 65 4 0 0 20 0 1 0 341756748 61157376 14083 33554432000 4194304 7823515 140735611636416 140735611633352 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 14931 14083 552 887 0 14041 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 59724 Solver just ended. Dumping a history of the last processes samples [startup+1.10662 s] /proc/loadavg: 2.00 2.00 2.00 3/177 27980 /proc/meminfo: memFree=27977812/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=59724 CPUtime=1.1 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 14542 0 0 0 105 5 0 0 20 0 1 0 341756748 61157376 14111 33554432000 4194304 7823515 140735611636416 140735611633352 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 14931 14111 556 887 0 14041 0 Current children cumulated CPU time (s) 1.1 Current children cumulated vsize (KiB) 59724 [startup+1.30023 s] /proc/loadavg: 2.00 2.00 2.00 3/177 27980 /proc/meminfo: memFree=27977812/32873844 swapFree=7108/7108 [pid=27979] ppid=27977 vsize=59724 CPUtime=1.29 cores=1,3,5,7 /proc/27979/stat : 27979 (pbscip.linux.x8) R 27977 27979 26990 0 -1 4202496 14542 0 0 0 124 5 0 0 20 0 1 0 341756748 61157376 14111 33554432000 4194304 7823515 140735611636416 140735611631528 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/27979/statm: 14931 14111 556 887 0 14041 0 Current children cumulated CPU time (s) 1.29 Current children cumulated vsize (KiB) 59724 Child status: 0 Real time (s): 1.38233 CPU time (s): 1.38079 CPU user time (s): 1.3218 CPU system time (s): 0.058991 CPU usage (%): 99.8887 Max. virtual memory (cumulated for all children) (KiB): 59724 getrusage(RUSAGE_CHILDREN,...) data: user time used= 1.3218 system time used= 0.058991 maximum resident set size= 56468 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 14553 page faults= 0 swaps= 0 block input operations= 0 block output operations= 0 messages sent= 0 messages received= 0 signals received= 0 voluntary context switches= 3 involuntary context switches= 3 runsolver used 0.002999 second user time and 0.010998 second system time The end
Begin job on node139 at 2012-06-03 22:45:22 IDJOB=3739444 IDBENCH=72884 IDSOLVER=2321 FILE ID=node139/3739444-1338756322 RUNJOBID= node139-1338748983-27007 PBS_JOBID= 14636794 Free space on /tmp= 71088 MiB SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j30/normalized-j3046_4-unsat.opb COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3739444-1338756322/watcher-3739444-1338756322 -o /tmp/evaluation-result-3739444-1338756322/solver-3739444-1338756322 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3739444-1338756322.opb TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 194fc06f7c21580ad88e7dc6177066b4 RANDOM SEED=192030972 node139.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011 /proc/cpuinfo: processor : 0 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 0 cpu cores : 4 apicid : 0 initial apicid : 0 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5333.50 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 1 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 0 cpu cores : 4 apicid : 16 initial apicid : 16 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 2 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 1 cpu cores : 4 apicid : 2 initial apicid : 2 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.90 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 3 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 1 cpu cores : 4 apicid : 18 initial apicid : 18 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 4 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 2 cpu cores : 4 apicid : 4 initial apicid : 4 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 5 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 2 cpu cores : 4 apicid : 20 initial apicid : 20 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 6 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 3 cpu cores : 4 apicid : 6 initial apicid : 6 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 7 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 initial apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873844 kB MemFree: 28032040 kB Buffers: 511756 kB Cached: 3359208 kB SwapCached: 828 kB Active: 1832172 kB Inactive: 2132688 kB Active(anon): 87684 kB Inactive(anon): 7952 kB Active(file): 1744488 kB Inactive(file): 2124736 kB Unevictable: 7108 kB Mlocked: 7108 kB SwapTotal: 67108856 kB SwapFree: 67104688 kB Dirty: 10256 kB Writeback: 0 kB AnonPages: 99436 kB Mapped: 13752 kB Shmem: 8 kB Slab: 734836 kB SReclaimable: 176724 kB SUnreclaim: 558112 kB KernelStack: 1472 kB PageTables: 3988 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 210496 kB VmallocTotal: 34359738367 kB VmallocUsed: 346368 kB VmallocChunk: 34341987984 kB HardwareCorrupted: 0 kB AnonHugePages: 75776 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7872 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 71080 MiB End job on node139 at 2012-06-03 22:45:23