Trace number 1884817

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)SAT 2.53361 2.53626

General information on the benchmark

Name/PURE-SAT/SAT09/CRAFTED/sgi/
satsgi-n19himBHm22-p0-q181.opb
MD5SUMf675e6db1aa0b6ce80d0e74411609276
Bench CategoryPURE-SAT (instances containing only clauses)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.027995
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables418
Total number of constraints8170
Number of constraints which are clauses8170
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint22
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 23
Number of bits of the biggest sum of numbers5
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.09/0.11	c SCIP version 1.1.0.7
0.09/0.11	c LP-Solver SoPlex 1.4.1
0.09/0.11	c user parameter file <scip.set> not found - using default parameters
0.09/0.11	c read problem <HOME/instance-1884817-1245260531.opb>
0.09/0.11	c original problem has 418 variables (418 bin, 0 int, 0 impl, 0 cont) and 8170 constraints
0.09/0.13	c No objective function, only one solution is needed.
0.09/0.13	c start presolving problem
0.09/0.13	c presolving:
0.19/0.23	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8170 upgd conss, 16302 impls, 0 clqs
0.19/0.25	c presolving (2 rounds):
0.19/0.25	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.25	c  16302 implications, 0 cliques
0.19/0.25	c presolved problem has 418 variables (418 bin, 0 int, 0 impl, 0 cont) and 8170 constraints
0.19/0.25	c    8170 constraints of type <logicor>
0.19/0.25	c transformed objective value is always integral (scale: 1)
0.19/0.25	c Presolving Time: 0.10
0.19/0.25	c PURESAT
0.19/0.25	c -----------------------------------------------------------------------------------------------
0.19/0.25	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25	c separating/flowcover/freq = c -1
0.19/0.25	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25	c separating/cmir/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.25	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/veclendiving/freq = c -1
0.19/0.25	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25	c heuristics/simplerounding/freq = c -1
0.19/0.25	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/shifting/freq = c -1
0.19/0.25	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25	c heuristics/rounding/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.25	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.25	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.25	c heuristics/rootsoldiving/freq = c -1
0.19/0.25	c # number of nodes added to the contingent of the total nodes
0.19/0.25	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.25	c heuristics/rens/nodesofs = c 2000
0.19/0.25	c # minimum percentage of integer variables that have to be fixable 
0.19/0.25	c # [type: real, range: [0,1], default: 0.5]
0.19/0.25	c heuristics/rens/minfixingrate = c 0.3
0.19/0.25	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25	c heuristics/rens/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.25	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/pscostdiving/freq = c -1
0.19/0.25	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25	c heuristics/oneopt/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.25	c # [type: real, range: [0,1], default: 0.01]
0.19/0.25	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.25	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.25	c heuristics/objpscostdiving/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.25	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/linesearchdiving/freq = c -1
0.19/0.25	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/intshifting/freq = c -1
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.25	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/guideddiving/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.25	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/fracdiving/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.25	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.25	c heuristics/feaspump/freq = c -1
0.19/0.25	c # minimum percentage of integer variables that have to be fixed 
0.19/0.25	c # [type: real, range: [0,1], default: 0.666]
0.19/0.25	c heuristics/crossover/minfixingrate = c 0.5
0.19/0.25	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.25	c # [type: real, range: [0,1], default: 0.1]
0.19/0.25	c heuristics/crossover/nodesquot = c 0.15
0.19/0.25	c # number of nodes without incumbent change that heuristic should wait
0.19/0.25	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.25	c heuristics/crossover/nwaitingnodes = c 100
0.19/0.25	c # number of nodes added to the contingent of the total nodes
0.19/0.25	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.25	c heuristics/crossover/nodesofs = c 750
0.19/0.25	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.25	c heuristics/crossover/freq = c -1
0.19/0.25	c # additional number of allowed LP iterations
0.19/0.25	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.25	c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.25	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.25	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.25	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.25	c heuristics/coefdiving/freq = c -1
0.19/0.25	c # priority of node selection rule <dfs> in standard mode
0.19/0.25	c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.25	c nodeselection/dfs/stdpriority = c 1000000
0.19/0.25	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25	c presolving/probing/maxrounds = c 0
0.19/0.25	c # should presolving try to simplify knapsacks
0.19/0.25	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25	c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.25	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.25	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.25	c constraints/knapsack/disaggregation = c FALSE
0.19/0.25	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25	c constraints/knapsack/maxnumcardlift = c 0
0.19/0.25	c # should presolving try to simplify inequalities
0.19/0.25	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25	c constraints/linear/simplifyinequalities = c TRUE
0.19/0.25	c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25	c separating/maxroundsroot = c 5
0.19/0.25	c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.25	c separating/maxrounds = c 1
0.19/0.25	c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.19/0.25	c # [type: char, range: {lafpsqd}, default: l]
0.19/0.25	c lp/pricing = c a
0.19/0.25	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.25	c lp/solvefreq = c 0
0.19/0.25	c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25	c limits/solutions = c 1
0.19/0.25	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.25	c limits/memory = c 1620
0.19/0.25	c # maximal time in seconds to run
0.19/0.25	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.25	c limits/time = c 1791
0.19/0.25	c # frequency for displaying node information lines
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.25	c display/freq = c 10000
0.19/0.25	c # should enforcement of pseudo solution be disabled?
0.19/0.25	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25	c constraints/disableenfops = c TRUE
0.19/0.25	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.25	c constraints/agelimit = c 1
0.19/0.25	c # should binary conflicts be preferred?
0.19/0.25	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.25	c conflict/preferbinary = c TRUE
0.19/0.25	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.25	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.25	c conflict/interconss = c 0
0.19/0.25	c -----------------------------------------------------------------------------------------------
0.19/0.25	c start solving problem
0.19/0.25	c 
0.29/0.30	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.29/0.30	c   0.1s|     1 |     0 |    38 |  10M|   0 |  38 | 418 |8170 |8170 | 418 |8170 |   0 |   0 |   0 | 1.900000e+01 |      --      |    Inf 
0.49/0.54	c   0.4s|     1 |     0 |   129 |  10M|   0 |  34 | 418 |8170 |8170 | 418 |8173 |   3 |   0 |   0 | 1.900000e+01 |      --      |    Inf 
0.69/0.78	c   0.6s|     1 |     0 |   219 |  10M|   0 |  30 | 418 |8170 |8170 | 418 |8177 |   7 |   0 |   0 | 1.900000e+01 |      --      |    Inf 
1.10/1.11	c   0.9s|     1 |     0 |   352 |  10M|   0 |  26 | 418 |8170 |8170 | 418 |8182 |  12 |   0 |   0 | 1.900000e+01 |      --      |    Inf 
1.29/1.40	c   1.2s|     1 |     0 |   462 |  10M|   0 |  16 | 418 |8170 |8170 | 418 |8187 |  17 |   0 |   0 | 1.900000e+01 |      --      |    Inf 
1.69/1.72	c   1.5s|     1 |     0 |   610 |  10M|   0 |  10 | 418 |8170 |8170 | 418 |8193 |  23 |   0 |   0 | 1.900000e+01 |      --      |    Inf 
2.38/2.46	c   2.3s|     1 |     2 |   610 |  10M|   0 |  10 | 418 |8170 |8170 | 418 |8193 |  23 |   0 |  10 | 1.900000e+01 |      --      |    Inf 
2.38/2.49	c * 2.3s|   252 |     0 |   610 |  10M| 251 |   - | 418 |8170 |7410 |   0 |   0 |  23 |   0 |  10 | 1.900000e+01 | 1.900000e+01 |   0.00%
2.38/2.50	c 
2.38/2.50	c SCIP Status        : problem is solved [optimal solution found]
2.38/2.50	c Solving Time (sec) : 2.30
2.38/2.50	c Solving Nodes      : 252
2.38/2.50	c Primal Bound       : +1.90000000000000e+01 (1 solutions)
2.38/2.50	c Dual Bound         : +1.90000000000000e+01
2.38/2.50	c Gap                : 0.00 %
2.49/2.50	c NODE         252
2.49/2.50	c DUAL BOUND   19
2.49/2.50	c PRIMAL BOUND 19
2.49/2.50	c GAP          0
2.49/2.50	s SATISFIABLE
2.49/2.50	v -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 
2.49/2.50	v -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 x382 -x381 -x380 -x379 -x378 -x377 -x376 
2.49/2.50	v -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 
2.49/2.50	v -x354 x353 -x352 -x351 x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 
2.49/2.50	v -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 
2.49/2.50	v -x312 -x311 x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 
2.49/2.50	v -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 
2.49/2.50	v -x270 -x269 -x268 x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 
2.49/2.50	v -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 
2.49/2.50	v -x228 -x227 -x226 -x225 x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 
2.49/2.50	v -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 
2.49/2.50	v -x186 -x185 -x184 -x183 -x182 x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 x171 -x170 -x169 -x168 -x167 -x166 
2.49/2.50	v -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 
2.49/2.50	v -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 
2.49/2.50	v -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 x109 -x108 -x107 -x106 -x105 -x104 -x103 
2.49/2.50	v -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 -x82 -x81 -x80 -x79 
2.49/2.50	v -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 
2.49/2.50	v -x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 x31 -x30 -x29 -x28 
2.49/2.50	v -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 
2.49/2.50	v -x1 
2.49/2.50	c SCIP Status        : problem is solved [optimal solution found]
2.49/2.50	c Solving Time       :       2.30
2.49/2.50	c Original Problem   :
2.49/2.50	c   Problem name     : HOME/instance-1884817-1245260531.opb
2.49/2.50	c   Variables        : 418 (418 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.50	c   Constraints      : 8170 initial, 8170 maximal
2.49/2.50	c Presolved Problem  :
2.49/2.50	c   Problem name     : t_HOME/instance-1884817-1245260531.opb
2.49/2.50	c   Variables        : 418 (418 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.50	c   Constraints      : 8170 initial, 8170 maximal
2.49/2.50	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.49/2.50	c   trivial          :       0.00          0          0          0          0          0          0          0          0
2.49/2.50	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.49/2.50	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.49/2.50	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.49/2.50	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.49/2.50	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.49/2.50	c   logicor          :       0.03          0          0          0          0          0          0          0          0
2.49/2.50	c   root node        :          -          0          -          -          0          -          -          -          -
2.49/2.50	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.49/2.50	c   integral         :          0          0          0          1          0          0          0          0          0          2
2.49/2.50	c   logicor          :       8170          5         99          0          1          0        167          0          0          0
2.49/2.50	c   countsols        :          0          0          0          0          1          0          0          0          0          0
2.49/2.50	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.49/2.50	c   integral         :       0.74       0.00       0.00       0.74       0.00
2.49/2.50	c   logicor          :       0.00       0.00       0.00       0.00       0.00
2.49/2.50	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.49/2.50	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.49/2.50	c   rootredcost      :       0.00          0          0          0
2.49/2.50	c   pseudoobj        :       0.00        289          0          0
2.49/2.50	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.49/2.50	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
2.49/2.50	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.49/2.50	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.49/2.50	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.49/2.50	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.49/2.50	c   applied globally :          -          -          -          0        0.0          -          -          -
2.49/2.50	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.49/2.50	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.49/2.50	c   cut pool         :       0.00          4          -          -          0          -    (maximal pool size: 105)
2.49/2.50	c   redcost          :       0.00          5          0          0          0          0
2.49/2.50	c   impliedbounds    :       0.00          5          0          0          0          0
2.49/2.50	c   intobj           :       0.00          0          0          0          0          0
2.49/2.50	c   gomory           :       0.47          5          0          0       2500          0
2.49/2.50	c   strongcg         :       0.45          5          0          0       2500          0
2.49/2.50	c   cmir             :       0.00          0          0          0          0          0
2.49/2.50	c   flowcover        :       0.00          0          0          0          0          0
2.49/2.50	c   clique           :       0.03          5          0          0         10          0
2.49/2.50	c   zerohalf         :       0.00          0          0          0          0          0
2.49/2.50	c   mcf              :       0.00          1          0          0          0          0
2.49/2.50	c Pricers            :       Time      Calls       Vars
2.49/2.50	c   problem variables:       0.00          0          0
2.49/2.50	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.49/2.50	c   relpscost        :       0.74          1          0          0          0          0          2
2.49/2.50	c   pscost           :       0.00          0          0          0          0          0          0
2.49/2.50	c   inference        :       0.02        250          0          0          0          0        500
2.49/2.50	c   mostinf          :       0.00          0          0          0          0          0          0
2.49/2.50	c   leastinf         :       0.00          0          0          0          0          0          0
2.49/2.50	c   fullstrong       :       0.00          0          0          0          0          0          0
2.49/2.50	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.49/2.50	c   random           :       0.00          0          0          0          0          0          0
2.49/2.50	c Primal Heuristics  :       Time      Calls      Found
2.49/2.50	c   LP solutions     :       0.00          -          0
2.49/2.50	c   pseudo solutions :       0.00          -          1
2.49/2.50	c   simplerounding   :       0.00          0          0
2.49/2.50	c   rounding         :       0.00          0          0
2.49/2.50	c   shifting         :       0.00          0          0
2.49/2.50	c   intshifting      :       0.00          0          0
2.49/2.50	c   oneopt           :       0.00          0          0
2.49/2.50	c   fixandinfer      :       0.00          0          0
2.49/2.50	c   feaspump         :       0.00          0          0
2.49/2.50	c   coefdiving       :       0.00          0          0
2.49/2.50	c   pscostdiving     :       0.00          0          0
2.49/2.50	c   fracdiving       :       0.00          0          0
2.49/2.50	c   veclendiving     :       0.00          0          0
2.49/2.50	c   intdiving        :       0.00          0          0
2.49/2.50	c   actconsdiving    :       0.00          0          0
2.49/2.50	c   objpscostdiving  :       0.00          0          0
2.49/2.50	c   rootsoldiving    :       0.00          0          0
2.49/2.50	c   linesearchdiving :       0.00          0          0
2.49/2.50	c   guideddiving     :       0.00          0          0
2.49/2.50	c   octane           :       0.00          0          0
2.49/2.50	c   rens             :       0.00          0          0
2.49/2.50	c   rins             :       0.00          0          0
2.49/2.50	c   localbranching   :       0.00          0          0
2.49/2.50	c   mutation         :       0.00          0          0
2.49/2.50	c   crossover        :       0.00          0          0
2.49/2.50	c   dins             :       0.00          0          0
2.49/2.50	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.49/2.50	c   primal LP        :       0.01          0          0       0.00       0.00
2.49/2.50	c   dual LP          :       0.44          6        610     101.67    1386.36
2.49/2.50	c   barrier LP       :       0.00          0          0       0.00          -
2.49/2.50	c   diving/probing LP:       0.00          0          0       0.00          -
2.49/2.50	c   strong branching :       0.74         10        919      91.90    1241.89
2.49/2.50	c     (at root node) :          -         10        919      91.90          -
2.49/2.50	c   conflict analysis:       0.00          0          0       0.00          -
2.49/2.50	c B&B Tree           :
2.49/2.50	c   number of runs   :          1
2.49/2.50	c   nodes            :        252
2.49/2.50	c   nodes (total)    :        252
2.49/2.50	c   nodes left       :          0
2.49/2.50	c   max depth        :        251
2.49/2.50	c   max depth (total):        251
2.49/2.50	c   backtracks       :          0 (0.0%)
2.49/2.50	c   delayed cutoffs  :          0
2.49/2.50	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
2.49/2.50	c   avg switch length:       2.00
2.49/2.50	c   switching time   :       0.01
2.49/2.50	c Solution           :
2.49/2.50	c   Solutions found  :          1 (1 improvements)
2.49/2.50	c   Primal Bound     : +1.90000000000000e+01   (in run 1, after 252 nodes, 2.30 seconds, depth 251, found by <relaxation>)
2.49/2.50	c   Dual Bound       : +1.90000000000000e+01
2.49/2.50	c   Gap              :       0.00 %
2.49/2.50	c   Root Dual Bound  : +1.90000000000000e+01
2.49/2.53	c Time complete: 2.52.

Verifier Data 

OK	0

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-1884817-1245260531/watcher-1884817-1245260531 -o /tmp/evaluation-result-1884817-1245260531/solver-1884817-1245260531 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1884817-1245260531.opb 

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): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.00 1.00 0.94 3/64 12057
/proc/meminfo: memFree=1789816/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=4648 CPUtime=0
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 493 0 0 0 0 0 0 0 18 0 1 0 193653771 4759552 477 1992294400 4194304 7823515 548682068736 18446744073709551615 5898624 0 0 4096 0 0 0 0 17 1 0 0
/proc/12057/statm: 1162 485 318 886 0 272 0

[startup+0.100726 s]
/proc/loadavg: 1.00 1.00 0.94 3/64 12057
/proc/meminfo: memFree=1789816/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=12092 CPUtime=0.09
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 2344 0 0 0 8 1 0 0 18 0 1 0 193653771 12382208 2326 1992294400 4194304 7823515 548682068736 18446744073709551615 6957168 0 0 4096 0 0 0 0 17 1 0 0
/proc/12057/statm: 3023 2326 351 886 0 2133 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 12092

[startup+0.201743 s]
/proc/loadavg: 1.00 1.00 0.94 3/64 12057
/proc/meminfo: memFree=1789816/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=22940 CPUtime=0.19
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 5137 0 0 0 17 2 0 0 18 0 1 0 193653771 23490560 4765 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 5735 4765 421 886 0 4845 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 22940

[startup+0.30176 s]
/proc/loadavg: 1.00 1.00 0.94 3/64 12057
/proc/meminfo: memFree=1789816/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=31400 CPUtime=0.29
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 7433 0 0 0 25 4 0 0 17 0 1 0 193653771 32153600 7038 1992294400 4194304 7823515 548682068736 18446744073709551615 6237507 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 8066 7041 499 886 0 7176 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 31400

[startup+0.701833 s]
/proc/loadavg: 1.00 1.00 0.94 3/64 12057
/proc/meminfo: memFree=1789816/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=34812 CPUtime=0.69
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 8184 0 0 0 63 6 0 0 19 0 1 0 193653771 35647488 7762 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 8703 7762 532 886 0 7813 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 34812

[startup+1.50197 s]
/proc/loadavg: 1.00 1.00 0.94 2/65 12058
/proc/meminfo: memFree=1757488/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=39304 CPUtime=1.49
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 9308 0 0 0 141 8 0 0 25 0 1 0 193653771 40247296 8886 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 9826 8886 533 886 0 8936 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 39304

Solver just ended. Dumping a history of the last processes samples

[startup+1.60199 s]
/proc/loadavg: 1.00 1.00 0.94 2/65 12058
/proc/meminfo: memFree=1757488/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=39304 CPUtime=1.59
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 9400 0 0 0 151 8 0 0 25 0 1 0 193653771 40247296 8978 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 9826 8978 533 886 0 8936 0
Current children cumulated CPU time (s) 1.59
Current children cumulated vsize (KiB) 39304

[startup+2.00106 s]
/proc/loadavg: 1.00 1.00 0.94 2/65 12058
/proc/meminfo: memFree=1757488/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=39880 CPUtime=1.99
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 9469 0 0 0 191 8 0 0 25 0 1 0 193653771 40837120 9047 1992294400 4194304 7823515 548682068736 18446744073709551615 6211582 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 9970 9047 536 886 0 9080 0
Current children cumulated CPU time (s) 1.99
Current children cumulated vsize (KiB) 39880

[startup+2.40114 s]
/proc/loadavg: 1.00 1.00 0.94 2/65 12058
/proc/meminfo: memFree=1755312/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=39880 CPUtime=2.38
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 9501 0 0 0 230 8 0 0 25 0 1 0 193653771 40837120 9079 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/12057/statm: 9970 9079 536 886 0 9080 0
Current children cumulated CPU time (s) 2.38
Current children cumulated vsize (KiB) 39880

[startup+2.50115 s]
/proc/loadavg: 1.00 1.00 0.94 2/65 12058
/proc/meminfo: memFree=1755312/2055920 swapFree=4180900/4192956
[pid=12057] ppid=12055 vsize=39880 CPUtime=2.49
/proc/12057/stat : 12057 (pbscip.linux.x8) R 12055 12057 11699 0 -1 4194304 9507 0 0 0 240 9 0 0 25 0 1 0 193653771 40837120 9085 1992294400 4194304 7823515 548682068736 18446744073709551615 5022662 0 0 4096 0 0 0 0 17 1 0 0
/proc/12057/statm: 9970 9085 541 886 0 9080 0
Current children cumulated CPU time (s) 2.49
Current children cumulated vsize (KiB) 39880

Child status: 0
Real time (s): 2.53626
CPU time (s): 2.53361
CPU user time (s): 2.43563
CPU system time (s): 0.097985
CPU usage (%): 99.8955
Max. virtual memory (cumulated for all children) (KiB): 39880

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.43563
system time used= 0.097985
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9518
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= 5
involuntary context switches= 4

runsolver used 0.003999 second user time and 0.017997 second system time

The end

Launcher Data 

Begin job on node12 at 2009-06-17 19:42:11
IDJOB=1884817
IDBENCH=71995
IDSOLVER=683
FILE ID=node12/1884817-1245260531
PBS_JOBID= 9372441
Free space on /tmp= 66232 MiB

SOLVER NAME= SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB09/normalized-PB09/PURE-SAT/SAT09/CRAFTED/sgi/satsgi-n19himBHm22-p0-q181.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-1884817-1245260531/watcher-1884817-1245260531 -o /tmp/evaluation-result-1884817-1245260531/solver-1884817-1245260531 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1884817-1245260531.opb

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= f675e6db1aa0b6ce80d0e74411609276
RANDOM SEED=1814943015

node12.alineos.net Linux 2.6.9-22.EL.rootsmp #1 SMP Mon Oct 3 08:59:52 CEST 2005

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.281
cache size	: 2048 KB
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5914.62
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.281
cache size	: 2048 KB
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5586.94
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1790232 kB
Buffers:         60772 kB
Cached:         152400 kB
SwapCached:       6264 kB
Active:         114256 kB
Inactive:       107320 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1790232 kB
SwapTotal:     4192956 kB
SwapFree:      4180900 kB
Dirty:           10028 kB
Writeback:           0 kB
Mapped:          13604 kB
Slab:            30120 kB
Committed_AS:   198412 kB
PageTables:       1380 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66224 MiB
End job on node12 at 2009-06-17 19:42:14