| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) | UNSAT | 0.100983 | 0.102375 |
| Name | normalized-PB06/SATUNSAT-SMALLINT/ submitted-PB06/roussel/normalized-pigeon-cardinality-75-70.opb |
| MD5SUM | 51456bad41bf92f026526861ffdd231e |
| Bench Category | DEC-SMALLINT (no optimisation, small integers) |
| 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.092985 |
| Has Objective Function | NO |
| Satisfiable | NO |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 5250 |
| Total number of constraints | 145 |
| Number of constraints which are clauses | 75 |
| Number of constraints which are cardinality constraints (but not clauses) | 70 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 70 |
| Maximum length of a constraint | 75 |
| 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 | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 76 |
| Number of bits of the biggest sum of numbers | 7 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-3733579-1338701173.opb>
0.00/0.01 c original problem has 5250 variables (5250 bin, 0 int, 0 impl, 0 cont) and 145 constraints
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c start presolving problem
0.01/0.02 c presolving:
0.01/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 75 upgd conss, 0 impls, 70 clqs
0.01/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 145 upgd conss, 0 impls, 70 clqs
0.01/0.04 c presolving (3 rounds):
0.01/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 0 implications, 70 cliques
0.01/0.04 c presolved problem has 5250 variables (5250 bin, 0 int, 0 impl, 0 cont) and 145 constraints
0.01/0.04 c 70 constraints of type <setppc>
0.01/0.04 c 75 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.01
0.01/0.04 c SATUNSAT-LIN
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c separating/flowcover/freq = c -1
0.01/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c separating/cmir/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/veclendiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/veclendiving/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/simplerounding/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/shifting/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/rounding/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.04 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.01/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/rootsoldiving/freq = c -1
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/rens/nodesofs = c 2000
0.01/0.04 c # minimum percentage of integer variables that have to be fixable
0.01/0.04 c # [type: real, range: [0,1], default: 0.5]
0.01/0.04 c heuristics/rens/minfixingrate = c 0.3
0.01/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c heuristics/rens/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/pscostdiving/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/oneopt/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.04 c # [type: real, range: [0,1], default: 0.01]
0.01/0.04 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.01/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/objpscostdiving/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/linesearchdiving/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/intshifting/freq = c -1
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/intdiving/maxlpiterquot = c 0.075
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/guideddiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/guideddiving/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/fracdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/fracdiving/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/feaspump/maxlpiterofs = c 2000
0.01/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/feaspump/freq = c -1
0.01/0.04 c # minimum percentage of integer variables that have to be fixed
0.01/0.04 c # [type: real, range: [0,1], default: 0.666]
0.01/0.04 c heuristics/crossover/minfixingrate = c 0.5
0.01/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.04 c # [type: real, range: [0,1], default: 0.1]
0.01/0.04 c heuristics/crossover/nodesquot = c 0.15
0.01/0.04 c # number of nodes without incumbent change that heuristic should wait
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.04 c heuristics/crossover/nwaitingnodes = c 100
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/crossover/nodesofs = c 750
0.01/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.04 c heuristics/crossover/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/coefdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/coefdiving/freq = c -1
0.01/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c presolving/probing/maxrounds = c 0
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = c TRUE
0.01/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.04 c constraints/knapsack/disaggregation = c FALSE
0.01/0.04 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c constraints/knapsack/maxnumcardlift = c 0
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = c TRUE
0.01/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/maxroundsroot = c 5
0.01/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.04 c separating/maxrounds = c 1
0.01/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c limits/solutions = c 1
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = c 13950
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = c 1791
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = c 10000
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving problem
0.01/0.04 c
0.01/0.09 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.09 c 0.1s| 1 | 0 | 1456 | 10M| 0 | - |5250 | 145 | 145 |5250 | 145 | 0 | 0 | 0 | -- | -- | 0.00%
0.01/0.09 c 0.1s| 1 | 0 | 1456 | 10M| 0 | - |5250 | 145 | 145 |5250 | 145 | 0 | 0 | 0 | -- | -- | 0.00%
0.01/0.09 c
0.01/0.09 c SCIP Status : problem is solved [infeasible]
0.01/0.09 c Solving Time (sec) : 0.07
0.01/0.09 c Solving Nodes : 1
0.01/0.09 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.01/0.09 c Dual Bound : +1.00000000000000e+20
0.01/0.09 c Gap : 0.00 %
0.01/0.09 c NODE 1
0.01/0.09 c DUAL BOUND 1e+20
0.01/0.09 c PRIMAL BOUND 1e+20
0.01/0.09 c GAP 0
0.01/0.09 s UNSATISFIABLE
0.01/0.09 c SCIP Status : problem is solved [infeasible]
0.01/0.09 c Solving Time : 0.07
0.01/0.09 c Original Problem :
0.01/0.09 c Problem name : HOME/instance-3733579-1338701173.opb
0.01/0.09 c Variables : 5250 (5250 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09 c Constraints : 145 initial, 145 maximal
0.01/0.09 c Presolved Problem :
0.01/0.09 c Problem name : t_HOME/instance-3733579-1338701173.opb
0.01/0.09 c Variables : 5250 (5250 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.09 c Constraints : 145 initial, 145 maximal
0.01/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.01/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c probing : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c setppc : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.01/0.09 c root node : - 0 - - 0 - - - -
0.01/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.01/0.09 c integral : 0 0 0 0 0 0 0 0 0 0
0.01/0.09 c setppc : 70 0 1 0 0 0 0 0 0 0
0.01/0.09 c logicor : 75 0 1 0 0 0 0 0 0 0
0.01/0.09 c countsols : 0 0 0 0 0 0 0 0 0 0
0.01/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.01/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c setppc : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.01/0.09 c Propagators : Time Calls Cutoffs DomReds
0.01/0.09 c rootredcost : 0.00 0 0 0
0.01/0.09 c pseudoobj : 0.00 2 1 0
0.01/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.01/0.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.09 c applied globally : - - - 0 0.0 - - -
0.01/0.09 c applied locally : - - - 0 0.0 - - -
0.01/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.01/0.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.01/0.09 c redcost : 0.00 0 0 0 0 0
0.01/0.09 c impliedbounds : 0.00 0 0 0 0 0
0.01/0.09 c intobj : 0.00 0 0 0 0 0
0.01/0.09 c gomory : 0.00 0 0 0 0 0
0.01/0.09 c strongcg : 0.00 0 0 0 0 0
0.01/0.09 c cmir : 0.00 0 0 0 0 0
0.01/0.09 c flowcover : 0.00 0 0 0 0 0
0.01/0.09 c clique : 0.00 0 0 0 0 0
0.01/0.09 c zerohalf : 0.00 0 0 0 0 0
0.01/0.09 c mcf : 0.00 0 0 0 0 0
0.01/0.09 c Pricers : Time Calls Vars
0.01/0.09 c problem variables: 0.00 0 0
0.01/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.01/0.09 c pscost : 0.00 0 0 0 0 0 0
0.01/0.09 c inference : 0.00 0 0 0 0 0 0
0.01/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.01/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.01/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.01/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.01/0.09 c random : 0.00 0 0 0 0 0 0
0.01/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.01/0.09 c Primal Heuristics : Time Calls Found
0.01/0.09 c LP solutions : 0.00 - 0
0.01/0.09 c pseudo solutions : 0.00 - 0
0.01/0.09 c simplerounding : 0.00 0 0
0.01/0.09 c rounding : 0.00 0 0
0.01/0.09 c shifting : 0.00 0 0
0.01/0.09 c intshifting : 0.00 0 0
0.01/0.09 c oneopt : 0.00 0 0
0.01/0.09 c fixandinfer : 0.00 0 0
0.01/0.09 c feaspump : 0.00 0 0
0.01/0.09 c coefdiving : 0.00 0 0
0.01/0.09 c pscostdiving : 0.00 0 0
0.01/0.09 c fracdiving : 0.00 0 0
0.01/0.09 c veclendiving : 0.00 0 0
0.01/0.09 c intdiving : 0.00 0 0
0.01/0.09 c actconsdiving : 0.00 0 0
0.01/0.09 c objpscostdiving : 0.00 0 0
0.01/0.09 c rootsoldiving : 0.00 0 0
0.01/0.09 c linesearchdiving : 0.00 0 0
0.01/0.09 c guideddiving : 0.00 0 0
0.01/0.09 c octane : 0.00 0 0
0.01/0.09 c rens : 0.00 0 0
0.01/0.09 c rins : 0.00 0 0
0.01/0.09 c localbranching : 0.00 0 0
0.01/0.09 c mutation : 0.00 0 0
0.01/0.09 c crossover : 0.00 0 0
0.01/0.09 c dins : 0.00 0 0
0.01/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.01/0.09 c primal LP : 0.00 0 0 0.00 -
0.01/0.09 c dual LP : 0.04 1 1456 1456.00 36400.00
0.01/0.09 c barrier LP : 0.00 0 0 0.00 -
0.01/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.01/0.09 c strong branching : 0.00 0 0 0.00 -
0.01/0.09 c (at root node) : - 0 0 0.00 -
0.01/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.01/0.09 c B&B Tree :
0.01/0.09 c number of runs : 1
0.01/0.09 c nodes : 1
0.01/0.09 c nodes (total) : 1
0.01/0.09 c nodes left : 0
0.01/0.09 c max depth : 0
0.01/0.09 c max depth (total): 0
0.01/0.09 c backtracks : 0 (0.0%)
0.01/0.09 c delayed cutoffs : 0
0.01/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.01/0.09 c avg switch length: 2.00
0.01/0.09 c switching time : 0.00
0.01/0.09 c Solution :
0.01/0.09 c Solutions found : 0 (0 improvements)
0.01/0.09 c Primal Bound : infeasible
0.01/0.09 c Dual Bound : -
0.01/0.09 c Gap : 0.00 %
0.01/0.09 c Root Dual Bound : -
0.09/0.10 c Time complete: 0.09.
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-3733579-1338701173/watcher-3733579-1338701173 -o /tmp/evaluation-result-3733579-1338701173/solver-3733579-1338701173 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3733579-1338701173.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/175 30124 /proc/meminfo: memFree=28170408/32873648 swapFree=6864/6864 [pid=30124] ppid=30122 vsize=9140 CPUtime=0 cores=1,3,5,7 /proc/30124/stat : 30124 (pbscip.linux.x8) R 30122 30124 19043 0 -1 4202496 1629 0 0 0 0 0 0 0 20 0 1 0 336243330 9359360 1582 33554432000 4194304 7823515 140736616671664 140735930701496 6911387 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/30124/statm: 2285 1582 351 887 0 1395 0 [startup+0.0237251 s] /proc/loadavg: 2.00 2.00 2.00 3/175 30124 /proc/meminfo: memFree=28170408/32873648 swapFree=6864/6864 [pid=30124] ppid=30122 vsize=20192 CPUtime=0.01 cores=1,3,5,7 /proc/30124/stat : 30124 (pbscip.linux.x8) R 30122 30124 19043 0 -1 4202496 4680 0 0 0 1 0 0 0 20 0 1 0 336243330 20676608 4279 33554432000 4194304 7823515 140736616671664 140736616536280 5878822 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/30124/statm: 5048 4279 370 887 0 4158 0 Current children cumulated CPU time (s) 0.01 Current children cumulated vsize (KiB) 20192 [startup+0.100237 s] /proc/loadavg: 2.00 2.00 2.00 3/175 30124 /proc/meminfo: memFree=28170408/32873648 swapFree=6864/6864 [pid=30124] ppid=30122 vsize=26336 CPUtime=0.09 cores=1,3,5,7 /proc/30124/stat : 30124 (pbscip.linux.x8) R 30122 30124 19043 0 -1 4202496 6823 0 0 0 9 0 0 0 20 0 1 0 336243330 26968064 5786 33554432000 4194304 7823515 140736616671664 140736616536280 4401518 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/30124/statm: 6584 5529 518 887 0 5694 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 26336 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.102375 CPU time (s): 0.100983 CPU user time (s): 0.092985 CPU system time (s): 0.007998 CPU usage (%): 98.6404 Max. virtual memory (cumulated for all children) (KiB): 26336 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.092985 system time used= 0.007998 maximum resident set size= 25472 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 6830 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= 2 runsolver used 0.003999 second user time and 0.003999 second system time The end
Begin job on node120 at 2012-06-03 07:26:13 IDJOB=3733579 IDBENCH=2567 IDSOLVER=2321 FILE ID=node120/3733579-1338701173 RUNJOBID= node120-1338679216-27544 PBS_JOBID= 14636693 Free space on /tmp= 70764 MiB SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) BENCH NAME= PB06/final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/roussel/normalized-pigeon-cardinality-75-70.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-3733579-1338701173/watcher-3733579-1338701173 -o /tmp/evaluation-result-3733579-1338701173/solver-3733579-1338701173 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3733579-1338701173.opb TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 51456bad41bf92f026526861ffdd231e RANDOM SEED=1794394115 node120.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.456 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 : 5332.91 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.456 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.456 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.456 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.88 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.456 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.456 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.83 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.456 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.456 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: 32873648 kB MemFree: 28171556 kB Buffers: 559860 kB Cached: 3116728 kB SwapCached: 1580 kB Active: 1794508 kB Inactive: 1978232 kB Active(anon): 88140 kB Inactive(anon): 9224 kB Active(file): 1706368 kB Inactive(file): 1969008 kB Unevictable: 6864 kB Mlocked: 6864 kB SwapTotal: 67108856 kB SwapFree: 67103516 kB Dirty: 20376 kB Writeback: 0 kB AnonPages: 100260 kB Mapped: 13020 kB Shmem: 32 kB Slab: 794576 kB SReclaimable: 238320 kB SUnreclaim: 556256 kB KernelStack: 1440 kB PageTables: 4508 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545680 kB Committed_AS: 214820 kB VmallocTotal: 34359738367 kB VmallocUsed: 346400 kB VmallocChunk: 34341988052 kB HardwareCorrupted: 0 kB AnonHugePages: 4096 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7680 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 70756 MiB End job on node120 at 2012-06-03 07:26:14