| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) | SAT | 0.113981 | 0.114687 |
| Name | normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/ manquinho/dbsg/normalized-dbsg_50_10_3_5.opb |
| MD5SUM | fc9ce1424c6f1721fc38c4993287363b |
| Bench Category | DEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 0.004998 |
| Has Objective Function | NO |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | NO |
| Number of variables | 100 |
| Total number of constraints | 152 |
| Number of constraints which are clauses | 50 |
| Number of constraints which are cardinality constraints (but not clauses) | 1 |
| Number of constraints which are nor clauses,nor cardinality constraints | 101 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 100 |
| 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 | 5 |
| Number of bits of the biggest number in a constraint | 3 |
| Biggest sum of numbers in a constraint | 100 |
| Number of bits of the biggest sum of numbers | 7 |
| Number of products (including duplicates) | 1236 |
| Sum of products size (including duplicates) | 2472 |
| Number of different products | 618 |
| Sum of products size | 1236 |
0.00/0.00 c SCIP version 1.1.0.7
0.00/0.00 c LP-Solver SoPlex 1.4.1
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c read problem <HOME/instance-3737712-1338751027.opb>
0.00/0.00 c original problem has 718 variables (718 bin, 0 int, 0 impl, 0 cont) and 770 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.04/0.06 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5044 impls, 100 clqs
0.04/0.06 c presolving (2 rounds):
0.04/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.04/0.06 c 5044 implications, 100 cliques
0.04/0.06 c presolved problem has 718 variables (718 bin, 0 int, 0 impl, 0 cont) and 770 constraints
0.04/0.06 c 1 constraints of type <knapsack>
0.04/0.06 c 100 constraints of type <setppc>
0.04/0.06 c 618 constraints of type <and>
0.04/0.06 c 1 constraints of type <linear>
0.04/0.06 c 50 constraints of type <logicor>
0.04/0.06 c transformed objective value is always integral (scale: 1)
0.04/0.06 c Presolving Time: 0.02
0.04/0.06 c SATUNSAT-NLC
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/flowcover/freq = c -1
0.04/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/cmir/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/veclendiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/veclendiving/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/simplerounding/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/shifting/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/rounding/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.04/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/rootsoldiving/freq = c -1
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/rens/nodesofs = c 2000
0.04/0.06 c # minimum percentage of integer variables that have to be fixable
0.04/0.06 c # [type: real, range: [0,1], default: 0.5]
0.04/0.06 c heuristics/rens/minfixingrate = c 0.3
0.04/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/rens/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/pscostdiving/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/oneopt/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.04/0.06 c # [type: real, range: [0,1], default: 0.01]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.04/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/objpscostdiving/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/linesearchdiving/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/intshifting/freq = c -1
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/intdiving/maxlpiterquot = c 0.075
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/guideddiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/guideddiving/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/fracdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/fracdiving/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/feaspump/maxlpiterofs = c 2000
0.04/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/feaspump/freq = c -1
0.04/0.06 c # minimum percentage of integer variables that have to be fixed
0.04/0.06 c # [type: real, range: [0,1], default: 0.666]
0.04/0.06 c heuristics/crossover/minfixingrate = c 0.5
0.04/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.04/0.06 c # [type: real, range: [0,1], default: 0.1]
0.04/0.06 c heuristics/crossover/nodesquot = c 0.15
0.04/0.06 c # number of nodes without incumbent change that heuristic should wait
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.04/0.06 c heuristics/crossover/nwaitingnodes = c 100
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/crossover/nodesofs = c 750
0.04/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.04/0.06 c heuristics/crossover/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/coefdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/coefdiving/freq = c -1
0.04/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c presolving/probing/maxrounds = c 0
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = c TRUE
0.04/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.04/0.06 c constraints/knapsack/disaggregation = c FALSE
0.04/0.06 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c constraints/knapsack/maxnumcardlift = c 0
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = c TRUE
0.04/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/maxroundsroot = c 5
0.04/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.04/0.06 c separating/maxrounds = c 1
0.04/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c limits/solutions = c 1
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = c 13950
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = c 1791
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = c 10000
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving problem
0.04/0.06 c
0.04/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.06 c 0.0s| 1 | 0 | 30 |3258k| 0 | 19 | 718 | 770 | 770 | 718 |1388 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 33 |3290k| 0 | 0 | 718 | 770 | 770 | 718 |1390 | 2 | 0 | 0 | 1.000000e+01 | -- | Inf
0.09/0.10 c * 0.1s| 1 | 0 | 33 |3291k| 0 | - | 718 | 770 | 770 | 718 |1390 | 2 | 0 | 0 | 1.000000e+01 | 1.000000e+01 | 0.00%
0.09/0.10 c
0.09/0.10 c SCIP Status : problem is solved [optimal solution found]
0.09/0.10 c Solving Time (sec) : 0.06
0.09/0.10 c Solving Nodes : 1
0.09/0.10 c Primal Bound : +1.00000000000000e+01 (1 solutions)
0.09/0.10 c Dual Bound : +1.00000000000000e+01
0.09/0.10 c Gap : 0.00 %
0.09/0.10 c NODE 1
0.09/0.10 c DUAL BOUND 10
0.09/0.10 c PRIMAL BOUND 10
0.09/0.10 c GAP 0
0.09/0.10 s SATISFIABLE
0.09/0.10 v -x81 -x67 -x84 -x72 -x60 -x100 -x83 -x56 -x82 -x95 -x54 -x80 -x61 -x79 -x62 -x57 -x87 -x85 -x63 -x55 -x99 -x88 -x98 -x74 -x89 -x93
0.09/0.10 v -x78 -x70 -x68 -x64 -x66 -x96 -x92 -x53 -x90 -x94 -x51 -x75 -x71 -x58 -x59 -x65 x52 x77 -x73 x76 x91 x69 -x86 -x97 -x50 -x49
0.09/0.10 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
0.09/0.10 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 x12 x11 -x10 -x9 -x8 x7 x6 x5 -x4 -x3 -x2 -x1
0.09/0.10 c SCIP Status : problem is solved [optimal solution found]
0.09/0.10 c Solving Time : 0.06
0.09/0.10 c Original Problem :
0.09/0.10 c Problem name : HOME/instance-3737712-1338751027.opb
0.09/0.10 c Variables : 718 (718 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.10 c Constraints : 770 initial, 770 maximal
0.09/0.10 c Presolved Problem :
0.09/0.10 c Problem name : t_HOME/instance-3737712-1338751027.opb
0.09/0.10 c Variables : 718 (718 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.10 c Constraints : 770 initial, 770 maximal
0.09/0.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.10 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c probing : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c setppc : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c and : 0.02 0 0 0 0 0 0 0 0
0.09/0.10 c linear : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c logicor : 0.00 0 0 0 0 0 0 0 0
0.09/0.10 c root node : - 0 - - 0 - - - -
0.09/0.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.10 c integral : 0 0 0 1 0 0 0 0 0 0
0.09/0.10 c knapsack : 1 2 1 1 0 0 0 0 0 0
0.09/0.10 c setppc : 100 2 1 1 0 0 0 0 0 0
0.09/0.10 c and : 618 2 1 1 0 0 0 0 0 0
0.09/0.10 c linear : 1 2 1 1 0 0 0 0 0 0
0.09/0.10 c logicor : 50 2 1 1 0 0 0 0 0 0
0.09/0.10 c countsols : 0 0 0 1 0 0 0 0 0 0
0.09/0.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.10 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c setppc : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c and : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c linear : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.10 c Propagators : Time Calls Cutoffs DomReds
0.09/0.10 c rootredcost : 0.00 0 0 0
0.09/0.10 c pseudoobj : 0.00 2 0 0
0.09/0.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.10 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.10 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.10 c applied globally : - - - 0 0.0 - - -
0.09/0.10 c applied locally : - - - 0 0.0 - - -
0.09/0.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.10 c cut pool : 0.00 1 - - 0 - (maximal pool size: 10)
0.09/0.10 c redcost : 0.00 2 0 0 0 0
0.09/0.10 c impliedbounds : 0.00 1 0 0 0 0
0.09/0.10 c intobj : 0.00 0 0 0 0 0
0.09/0.10 c gomory : 0.01 2 0 0 436 0
0.09/0.10 c strongcg : 0.02 2 0 0 436 0
0.09/0.10 c cmir : 0.00 0 0 0 0 0
0.09/0.10 c flowcover : 0.00 0 0 0 0 0
0.09/0.10 c clique : 0.00 2 0 0 0 0
0.09/0.10 c zerohalf : 0.00 0 0 0 0 0
0.09/0.10 c mcf : 0.00 1 0 0 0 0
0.09/0.10 c Pricers : Time Calls Vars
0.09/0.10 c problem variables: 0.00 0 0
0.09/0.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.10 c pscost : 0.00 0 0 0 0 0 0
0.09/0.10 c inference : 0.00 0 0 0 0 0 0
0.09/0.10 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.10 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.10 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.10 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.10 c random : 0.00 0 0 0 0 0 0
0.09/0.10 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.10 c Primal Heuristics : Time Calls Found
0.09/0.10 c LP solutions : 0.00 - 1
0.09/0.10 c pseudo solutions : 0.00 - 0
0.09/0.10 c simplerounding : 0.00 0 0
0.09/0.10 c rounding : 0.00 0 0
0.09/0.10 c shifting : 0.00 0 0
0.09/0.10 c intshifting : 0.00 0 0
0.09/0.10 c oneopt : 0.00 0 0
0.09/0.10 c fixandinfer : 0.00 0 0
0.09/0.10 c feaspump : 0.00 0 0
0.09/0.10 c coefdiving : 0.00 0 0
0.09/0.10 c pscostdiving : 0.00 0 0
0.09/0.10 c fracdiving : 0.00 0 0
0.09/0.10 c veclendiving : 0.00 0 0
0.09/0.10 c intdiving : 0.00 0 0
0.09/0.10 c actconsdiving : 0.00 0 0
0.09/0.10 c objpscostdiving : 0.00 0 0
0.09/0.10 c rootsoldiving : 0.00 0 0
0.09/0.10 c linesearchdiving : 0.00 0 0
0.09/0.10 c guideddiving : 0.00 0 0
0.09/0.10 c octane : 0.00 0 0
0.09/0.10 c rens : 0.00 0 0
0.09/0.10 c rins : 0.00 0 0
0.09/0.10 c localbranching : 0.00 0 0
0.09/0.10 c mutation : 0.00 0 0
0.09/0.10 c crossover : 0.00 0 0
0.09/0.10 c dins : 0.00 0 0
0.09/0.10 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.10 c primal LP : 0.00 0 0 0.00 -
0.09/0.10 c dual LP : 0.00 2 33 16.50 -
0.09/0.10 c barrier LP : 0.00 0 0 0.00 -
0.09/0.10 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.10 c strong branching : 0.00 0 0 0.00 -
0.09/0.10 c (at root node) : - 0 0 0.00 -
0.09/0.10 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.10 c B&B Tree :
0.09/0.10 c number of runs : 1
0.09/0.10 c nodes : 1
0.09/0.10 c nodes (total) : 1
0.09/0.10 c nodes left : 0
0.09/0.10 c max depth : 0
0.09/0.10 c max depth (total): 0
0.09/0.10 c backtracks : 0 (0.0%)
0.09/0.10 c delayed cutoffs : 0
0.09/0.10 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.10 c avg switch length: 2.00
0.09/0.10 c switching time : 0.00
0.09/0.10 c Solution :
0.09/0.10 c Solutions found : 1 (1 improvements)
0.09/0.10 c Primal Bound : +1.00000000000000e+01 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <relaxation>)
0.09/0.10 c Dual Bound : +1.00000000000000e+01
0.09/0.10 c Gap : 0.00 %
0.09/0.10 c Root Dual Bound : +1.00000000000000e+01
0.09/0.11 c Time complete: 0.1.
OK 0
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-3737712-1338751027/watcher-3737712-1338751027 -o /tmp/evaluation-result-3737712-1338751027/solver-3737712-1338751027 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3737712-1338751027.opb running on 4 cores: 0,2,4,6 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.01 2.00 3/178 21621 /proc/meminfo: memFree=28294120/32873844 swapFree=7380/7380 [pid=21621] ppid=21619 vsize=9112 CPUtime=0 cores=0,2,4,6 /proc/21621/stat : 21621 (pbscip.linux.x8) R 21619 21621 21332 0 -1 4202496 1615 0 0 0 0 0 0 0 20 0 1 0 341227524 9330688 1567 33554432000 4194304 7823515 140733473645376 140737420083048 6883856 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/21621/statm: 2278 1568 351 887 0 1388 0 [startup+0.0542531 s] /proc/loadavg: 2.00 2.01 2.00 3/178 21621 /proc/meminfo: memFree=28294120/32873844 swapFree=7380/7380 [pid=21621] ppid=21619 vsize=13988 CPUtime=0.04 cores=0,2,4,6 /proc/21621/stat : 21621 (pbscip.linux.x8) R 21619 21621 21332 0 -1 4202496 2911 0 0 0 1 3 0 0 20 0 1 0 341227524 14323712 2509 33554432000 4194304 7823515 140733473645376 140737420083048 6954986 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/21621/statm: 3497 2509 404 887 0 2607 0 Current children cumulated CPU time (s) 0.04 Current children cumulated vsize (KiB) 13988 [startup+0.100276 s] /proc/loadavg: 2.00 2.01 2.00 3/178 21621 /proc/meminfo: memFree=28294120/32873844 swapFree=7380/7380 [pid=21621] ppid=21619 vsize=19936 CPUtime=0.09 cores=0,2,4,6 /proc/21621/stat : 21621 (pbscip.linux.x8) R 21619 21621 21332 0 -1 4202496 4656 0 0 0 6 3 0 0 20 0 1 0 341227524 20414464 4215 33554432000 4194304 7823515 140733473645376 140737420083048 6954986 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/21621/statm: 4984 4215 539 887 0 4094 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 19936 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.114687 CPU time (s): 0.113981 CPU user time (s): 0.072988 CPU system time (s): 0.040993 CPU usage (%): 99.3843 Max. virtual memory (cumulated for all children) (KiB): 19936 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.072988 system time used= 0.040993 maximum resident set size= 17648 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 4858 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= 1 runsolver used 0.002999 second user time and 0.005999 second system time The end
Begin job on node133 at 2012-06-03 21:17:07 IDJOB=3737712 IDBENCH=48300 IDSOLVER=2321 FILE ID=node133/3737712-1338751027 RUNJOBID= node133-1338747083-21348 PBS_JOBID= 14636776 Free space on /tmp= 70476 MiB SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_50_10_3_5.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-3737712-1338751027/watcher-3737712-1338751027 -o /tmp/evaluation-result-3737712-1338751027/solver-3737712-1338751027 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3737712-1338751027.opb TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= fc9ce1424c6f1721fc38c4993287363b RANDOM SEED=251304131 node133.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.540 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.08 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.540 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.92 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.540 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.92 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.540 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.540 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.91 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.540 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.90 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.540 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.540 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: 28294484 kB Buffers: 489180 kB Cached: 2846056 kB SwapCached: 676 kB Active: 1858636 kB Inactive: 1817612 kB Active(anon): 332180 kB Inactive(anon): 10220 kB Active(file): 1526456 kB Inactive(file): 1807392 kB Unevictable: 7380 kB Mlocked: 7380 kB SwapTotal: 67108856 kB SwapFree: 67107040 kB Dirty: 9740 kB Writeback: 0 kB AnonPages: 348736 kB Mapped: 12448 kB Shmem: 0 kB Slab: 759700 kB SReclaimable: 201592 kB SUnreclaim: 558108 kB KernelStack: 1472 kB PageTables: 4640 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 461912 kB VmallocTotal: 34359738367 kB VmallocUsed: 346376 kB VmallocChunk: 34341987860 kB HardwareCorrupted: 0 kB AnonHugePages: 311296 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= 70464 MiB End job on node133 at 2012-06-03 21:17:08