Trace number 1885197

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)? (MO) 66.7329 66.7739

General information on the benchmark

Name/PURE-SAT/SAT09/APPLICATIONS/
c32sat/post-c32s-col400-16.opb
MD5SUMf38f3d39b504b3bf3f8ecc24c6e23888
Bench CategoryPURE-SAT (instances containing only clauses)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark288.134
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables286329
Total number of constraints839692
Number of constraints which are clauses839692
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 constraint1
Maximum length of a constraint3
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 4
Number of bits of the biggest sum of numbers3
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

12.69/12.71	c SCIP version 1.1.0.7
12.69/12.71	c LP-Solver SoPlex 1.4.1
12.69/12.71	c user parameter file <scip.set> not found - using default parameters
12.69/12.71	c read problem <HOME/instance-1885197-1245264217.opb>
12.69/12.71	c original problem has 286329 variables (286329 bin, 0 int, 0 impl, 0 cont) and 839692 constraints
16.08/16.16	c No objective function, only one solution is needed.
16.08/16.16	c start presolving problem
16.08/16.16	c presolving:
24.39/24.40	c (round 1) 807 del vars, 2011 del conss, 806 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 9283367 impls, 0 clqs
28.49/28.56	c (round 2) 25407 del vars, 42514 del conss, 13214 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 11181914 impls, 0 clqs
32.08/32.19	c (round 3) 46395 del vars, 104187 del conss, 20683 chg bounds, 0 chg sides, 240 chg coeffs, 0 upgd conss, 12651645 impls, 0 clqs
34.38/34.45	c (round 4) 58020 del vars, 152589 del conss, 24315 chg bounds, 0 chg sides, 258 chg coeffs, 0 upgd conss, 13230922 impls, 0 clqs
35.57/35.68	c (round 5) 62159 del vars, 175353 del conss, 25360 chg bounds, 0 chg sides, 266 chg coeffs, 0 upgd conss, 13340934 impls, 0 clqs
36.58/36.62	c (round 6) 64733 del vars, 184875 del conss, 26227 chg bounds, 0 chg sides, 272 chg coeffs, 0 upgd conss, 13422833 impls, 0 clqs
37.37/37.45	c (round 7) 66420 del vars, 191039 del conss, 26777 chg bounds, 1 chg sides, 280 chg coeffs, 0 upgd conss, 13480885 impls, 0 clqs
38.17/38.25	c (round 8) 67951 del vars, 195690 del conss, 27306 chg bounds, 2 chg sides, 284 chg coeffs, 0 upgd conss, 13523548 impls, 0 clqs
38.97/39.00	c (round 9) 68847 del vars, 199208 del conss, 27578 chg bounds, 2 chg sides, 288 chg coeffs, 0 upgd conss, 13553528 impls, 0 clqs
39.67/39.73	c (round 10) 69676 del vars, 201808 del conss, 27860 chg bounds, 2 chg sides, 288 chg coeffs, 0 upgd conss, 13583574 impls, 0 clqs
40.37/40.46	c (round 11) 70527 del vars, 204153 del conss, 28176 chg bounds, 2 chg sides, 294 chg coeffs, 0 upgd conss, 13609474 impls, 0 clqs
41.07/41.16	c (round 12) 71103 del vars, 206241 del conss, 28348 chg bounds, 2 chg sides, 294 chg coeffs, 0 upgd conss, 13626562 impls, 0 clqs
41.77/41.84	c (round 13) 71534 del vars, 207737 del conss, 28500 chg bounds, 2 chg sides, 296 chg coeffs, 0 upgd conss, 13641968 impls, 0 clqs
42.47/42.54	c (round 14) 72120 del vars, 209182 del conss, 28724 chg bounds, 2 chg sides, 298 chg coeffs, 0 upgd conss, 13660854 impls, 0 clqs
43.17/43.22	c (round 15) 72598 del vars, 210792 del conss, 28861 chg bounds, 3 chg sides, 302 chg coeffs, 0 upgd conss, 13672577 impls, 0 clqs
43.77/43.89	c (round 16) 72969 del vars, 212027 del conss, 28970 chg bounds, 3 chg sides, 304 chg coeffs, 0 upgd conss, 13685320 impls, 0 clqs
44.47/44.56	c (round 17) 73321 del vars, 213078 del conss, 29088 chg bounds, 3 chg sides, 306 chg coeffs, 0 upgd conss, 13697398 impls, 0 clqs
45.17/45.22	c (round 18) 73660 del vars, 214067 del conss, 29200 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13706708 impls, 0 clqs
45.77/45.88	c (round 19) 73841 del vars, 214807 del conss, 29252 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13712318 impls, 0 clqs
46.47/46.52	c (round 20) 73983 del vars, 215276 del conss, 29304 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13717011 impls, 0 clqs
47.07/47.16	c (round 21) 74014 del vars, 215500 del conss, 29308 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13719156 impls, 0 clqs
47.67/47.80	c (round 22) 74120 del vars, 215717 del conss, 29349 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13722383 impls, 0 clqs
48.37/48.43	c (round 23) 74144 del vars, 215896 del conss, 29352 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13723415 impls, 0 clqs
48.97/49.06	c (round 24) 74197 del vars, 216023 del conss, 29377 chg bounds, 4 chg sides, 310 chg coeffs, 0 upgd conss, 13725857 impls, 0 clqs
49.56/49.70	c (round 25) 74314 del vars, 216252 del conss, 29435 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13729591 impls, 0 clqs
50.27/50.33	c (round 26) 74408 del vars, 216588 del conss, 29459 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13732130 impls, 0 clqs
50.87/50.96	c (round 27) 74465 del vars, 216795 del conss, 29483 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13733370 impls, 0 clqs
51.47/51.59	c (round 28) 74485 del vars, 216902 del conss, 29485 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13734656 impls, 0 clqs
52.16/52.22	c (round 29) 74538 del vars, 217009 del conss, 29500 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13735797 impls, 0 clqs
52.77/52.85	c (round 30) 74550 del vars, 217111 del conss, 29502 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13736700 impls, 0 clqs
53.37/53.48	c (round 31) 74599 del vars, 217195 del conss, 29526 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13737694 impls, 0 clqs
54.07/54.11	c (round 32) 74617 del vars, 217297 del conss, 29528 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13738946 impls, 0 clqs
54.67/54.74	c (round 33) 74669 del vars, 217406 del conss, 29551 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13740728 impls, 0 clqs
55.26/55.36	c (round 34) 74684 del vars, 217497 del conss, 29553 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13741685 impls, 0 clqs
55.87/55.99	c (round 35) 74734 del vars, 217593 del conss, 29574 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13742987 impls, 0 clqs
56.57/56.62	c (round 36) 74749 del vars, 217693 del conss, 29576 chg bounds, 6 chg sides, 314 chg coeffs, 0 upgd conss, 13743157 impls, 0 clqs
62.17/62.20	c (round 37) 74749 del vars, 218714 del conss, 29576 chg bounds, 6 chg sides, 314 chg coeffs, 620978 upgd conss, 13743157 impls, 0 clqs
63.96/64.07	c presolving (38 rounds):
63.96/64.07	c  74749 deleted vars, 218714 deleted constraints, 29576 tightened bounds, 0 added holes, 6 changed sides, 314 changed coefficients
63.96/64.07	c  13743157 implications, 0 cliques
63.96/64.07	c presolved problem has 211559 variables (211559 bin, 0 int, 0 impl, 0 cont) and 620978 constraints
63.96/64.07	c  620978 constraints of type <logicor>
63.96/64.07	c transformed objective value is always integral (scale: 1)
63.96/64.07	c Presolving Time: 37.25
63.96/64.07	c PURESAT
63.96/64.07	c -----------------------------------------------------------------------------------------------
63.96/64.07	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 0]
63.96/64.07	c separating/flowcover/freq = c -1
63.96/64.07	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 0]
63.96/64.07	c separating/cmir/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/veclendiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/veclendiving/maxlpiterquot = c 0.075
63.96/64.07	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/veclendiving/freq = c -1
63.96/64.07	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 1]
63.96/64.07	c heuristics/simplerounding/freq = c -1
63.96/64.07	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/shifting/freq = c -1
63.96/64.07	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 1]
63.96/64.07	c heuristics/rounding/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/rootsoldiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
63.96/64.07	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
63.96/64.07	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 20]
63.96/64.07	c heuristics/rootsoldiving/freq = c -1
63.96/64.07	c # number of nodes added to the contingent of the total nodes
63.96/64.07	c # [type: longint, range: [0,9223372036854775807], default: 500]
63.96/64.07	c heuristics/rens/nodesofs = c 2000
63.96/64.07	c # minimum percentage of integer variables that have to be fixable 
63.96/64.07	c # [type: real, range: [0,1], default: 0.5]
63.96/64.07	c heuristics/rens/minfixingrate = c 0.3
63.96/64.07	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 0]
63.96/64.07	c heuristics/rens/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/pscostdiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/pscostdiving/maxlpiterquot = c 0.075
63.96/64.07	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/pscostdiving/freq = c -1
63.96/64.07	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 1]
63.96/64.07	c heuristics/oneopt/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/objpscostdiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to total iteration number
63.96/64.07	c # [type: real, range: [0,1], default: 0.01]
63.96/64.07	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
63.96/64.07	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 20]
63.96/64.07	c heuristics/objpscostdiving/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/linesearchdiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
63.96/64.07	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/linesearchdiving/freq = c -1
63.96/64.07	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/intshifting/freq = c -1
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/intdiving/maxlpiterquot = c 0.075
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/guideddiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/guideddiving/maxlpiterquot = c 0.075
63.96/64.07	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/guideddiving/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/fracdiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/fracdiving/maxlpiterquot = c 0.075
63.96/64.07	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/fracdiving/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/feaspump/maxlpiterofs = c 2000
63.96/64.07	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 20]
63.96/64.07	c heuristics/feaspump/freq = c -1
63.96/64.07	c # minimum percentage of integer variables that have to be fixed 
63.96/64.07	c # [type: real, range: [0,1], default: 0.666]
63.96/64.07	c heuristics/crossover/minfixingrate = c 0.5
63.96/64.07	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
63.96/64.07	c # [type: real, range: [0,1], default: 0.1]
63.96/64.07	c heuristics/crossover/nodesquot = c 0.15
63.96/64.07	c # number of nodes without incumbent change that heuristic should wait
63.96/64.07	c # [type: longint, range: [0,9223372036854775807], default: 200]
63.96/64.07	c heuristics/crossover/nwaitingnodes = c 100
63.96/64.07	c # number of nodes added to the contingent of the total nodes
63.96/64.07	c # [type: longint, range: [0,9223372036854775807], default: 500]
63.96/64.07	c heuristics/crossover/nodesofs = c 750
63.96/64.07	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 30]
63.96/64.07	c heuristics/crossover/freq = c -1
63.96/64.07	c # additional number of allowed LP iterations
63.96/64.07	c # [type: int, range: [0,2147483647], default: 1000]
63.96/64.07	c heuristics/coefdiving/maxlpiterofs = c 1500
63.96/64.07	c # maximal fraction of diving LP iterations compared to node LP iterations
63.96/64.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
63.96/64.07	c heuristics/coefdiving/maxlpiterquot = c 0.075
63.96/64.07	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: 10]
63.96/64.07	c heuristics/coefdiving/freq = c -1
63.96/64.07	c # priority of node selection rule <dfs> in standard mode
63.96/64.07	c # [type: int, range: [-536870912,536870911], default: 0]
63.96/64.07	c nodeselection/dfs/stdpriority = c 1000000
63.96/64.07	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
63.96/64.07	c # [type: int, range: [-1,2147483647], default: -1]
63.96/64.07	c presolving/probing/maxrounds = c 0
63.96/64.07	c # should presolving try to simplify knapsacks
63.96/64.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
63.96/64.07	c constraints/knapsack/simplifyinequalities = c TRUE
63.96/64.07	c # should disaggregation of knapsack constraints be allowed in preprocessing?
63.96/64.07	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
63.96/64.07	c constraints/knapsack/disaggregation = c FALSE
63.96/64.07	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: -1]
64.26/64.30	c constraints/knapsack/maxnumcardlift = c 0
64.26/64.30	c # should presolving try to simplify inequalities
64.26/64.30	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.26/64.30	c constraints/linear/simplifyinequalities = c TRUE
64.26/64.30	c # maximal number of separation rounds in the root node (-1: unlimited)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: -1]
64.26/64.30	c separating/maxroundsroot = c 5
64.26/64.30	c # maximal number of separation rounds per node (-1: unlimited)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: 5]
64.26/64.30	c separating/maxrounds = c 1
64.26/64.30	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)
64.26/64.30	c # [type: char, range: {lafpsqd}, default: l]
64.26/64.30	c lp/pricing = c a
64.26/64.30	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: 1]
64.26/64.30	c lp/solvefreq = c 0
64.26/64.30	c # solving stops, if the given number of solutions were found (-1: no limit)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: -1]
64.26/64.30	c limits/solutions = c 1
64.26/64.30	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
64.26/64.30	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
64.26/64.30	c limits/memory = c 1620
64.26/64.30	c # maximal time in seconds to run
64.26/64.30	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
64.26/64.30	c limits/time = c 1791
64.26/64.30	c # frequency for displaying node information lines
64.26/64.30	c # [type: int, range: [-1,2147483647], default: 100]
64.26/64.30	c display/freq = c 10000
64.26/64.30	c # should enforcement of pseudo solution be disabled?
64.26/64.30	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.26/64.30	c constraints/disableenfops = c TRUE
64.26/64.30	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: 0]
64.26/64.30	c constraints/agelimit = c 1
64.26/64.30	c # should binary conflicts be preferred?
64.26/64.30	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.26/64.30	c conflict/preferbinary = c TRUE
64.26/64.30	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
64.26/64.30	c # [type: int, range: [-1,2147483647], default: -1]
64.26/64.30	c conflict/interconss = c 0
64.26/64.30	c -----------------------------------------------------------------------------------------------
64.26/64.30	c start solving problem
64.26/64.30	c 
66.35/66.48	c [src/scip/sepastore.c:62] ERROR: Insufficient memory for reallocation of 5578168 bytes
66.35/66.48	c [src/scip/sepastore.c:62] ERROR: No memory in function call
66.35/66.48	c [src/scip/sepastore.c:258] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/sepastore.c:375] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/scip.c:10714] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/cons_logicor.c:886] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/cons_logicor.c:1590] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/cons.c:2290] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/solve.c:582] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/solve.c:624] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/solve.c:661] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/solve.c:1842] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/solve.c:2513] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/solve.c:3110] ERROR: Error <-1> in function call
66.35/66.48	c [src/scip/scip.c:5251] ERROR: Error <-1> in function call
66.35/66.48	c [src/cmain.c:772] ERROR: Error <-1> in function call
66.35/66.48	c [src/cmain.c:1137] ERROR: Error <-1> in function call
66.35/66.48	c [src/cmain.c:1217] ERROR: Error <-1> in function call
66.35/66.48	c SCIP Error (-1): c insufficient memory errorc 
66.35/66.48	c Time complete: 66.43.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-1885197-1245264217/watcher-1885197-1245264217 -o /tmp/evaluation-result-1885197-1245264217/solver-1885197-1245264217 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1885197-1245264217.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.96 3/64 4567
/proc/meminfo: memFree=1822024/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=4324 CPUtime=0
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 476 0 0 0 0 0 0 0 18 0 1 0 194021654 4427776 461 1992294400 4194304 7823515 548682068736 18446744073709551615 4493352 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 1082 469 305 886 0 192 0

[startup+0.031296 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 4567
/proc/meminfo: memFree=1822024/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=9972 CPUtime=0.02
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 1783 0 0 0 2 0 0 0 18 0 1 0 194021654 10211328 1766 1992294400 4194304 7823515 548682068736 18446744073709551615 5878822 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 2493 1774 351 886 0 1603 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 9972

[startup+0.101301 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 4567
/proc/meminfo: memFree=1822024/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=14436 CPUtime=0.09
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 2942 0 0 0 9 0 0 0 18 0 1 0 194021654 14782464 2924 1992294400 4194304 7823515 548682068736 18446744073709551615 6908062 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 3609 2924 351 886 0 2719 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14436

[startup+0.301319 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 4567
/proc/meminfo: memFree=1822024/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=21456 CPUtime=0.29
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 4667 0 0 0 28 1 0 0 19 0 1 0 194021654 21970944 4649 1992294400 4194304 7823515 548682068736 18446744073709551615 4363792 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 5364 4649 351 886 0 4474 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 21456

[startup+0.701356 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 4567
/proc/meminfo: memFree=1822024/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=37928 CPUtime=0.69
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 8802 0 0 0 66 3 0 0 22 0 1 0 194021654 38838272 8784 1992294400 4194304 7823515 548682068736 18446744073709551615 6908062 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 9482 8784 351 886 0 8592 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 37928

[startup+1.50143 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=1776192/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=68780 CPUtime=1.49
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 16474 0 0 0 142 7 0 0 25 0 1 0 194021654 70430720 16456 1992294400 4194304 7823515 548682068736 18446744073709551615 6896774 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 17195 16456 351 886 0 16305 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 68780

[startup+3.10157 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=1733952/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=129732 CPUtime=3.09
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 31680 0 0 0 295 14 0 0 25 0 1 0 194021654 132845568 31662 1992294400 4194304 7823515 548682068736 18446744073709551615 6957168 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 32433 31662 351 886 0 31543 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 129732

[startup+6.30186 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=1609088/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=251396 CPUtime=6.29
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 62014 0 0 0 601 28 0 0 25 0 1 0 194021654 257429504 61996 1992294400 4194304 7823515 548682068736 18446744073709551615 5537665 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 62849 61996 351 886 0 61959 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 251396

[startup+12.7014 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=1364808/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=487560 CPUtime=12.69
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 120792 0 0 0 1216 53 0 0 25 0 1 0 194021654 499261440 120774 1992294400 4194304 7823515 548682068736 18446744073709551615 6957168 0 0 4096 0 0 0 0 17 1 0 0
/proc/4567/statm: 121890 120774 351 886 0 121000 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 487560

[startup+25.5016 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=379976/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=1456732 CPUtime=25.49
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 360559 0 0 0 2313 236 0 0 25 0 1 0 194021654 1491693568 360187 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/4567/statm: 364183 360187 431 886 0 363293 0
Current children cumulated CPU time (s) 25.49
Current children cumulated vsize (KiB) 1456732

[startup+51.1019 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=336712/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=1499860 CPUtime=51.07
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 371380 0 0 0 4184 923 0 0 25 0 1 0 194021654 1535856640 371008 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/4567/statm: 374965 371008 432 886 0 374075 0
Current children cumulated CPU time (s) 51.07
Current children cumulated vsize (KiB) 1499860



Maximum VSize exceeded: sending SIGTERM then SIGKILL

[startup+66.1013 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=15304/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=1846212 CPUtime=66.06
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 490936 0 0 0 5316 1290 0 0 25 0 1 0 194021654 1890521088 456641 1992294400 4194304 7823515 548682068736 18446744073709551615 4639770 0 0 4096 16384 0 0 0 17 1 0 0
/proc/4567/statm: 461553 456641 481 886 0 460663 0
Current children cumulated CPU time (s) 66.06
Current children cumulated vsize (KiB) 1846212

Sending SIGTERM to process tree (bottom up)
Sleeping 2 seconds

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

[startup+66.2053 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=15304/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=1865976 CPUtime=66.15
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194304 494827 0 0 0 5322 1293 0 0 25 0 1 0 194021654 1910759424 460394 1992294400 4194304 7823515 548682068736 18446744073709551615 6912029 0 0 4096 16384 0 0 0 17 1 0 0
/proc/4567/statm: 466494 460401 481 886 0 465604 0
Current children cumulated CPU time (s) 66.15
Current children cumulated vsize (KiB) 1865976

[startup+66.6013 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=15304/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=0 CPUtime=66.55
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194308 502579 0 0 0 5343 1312 0 0 25 0 1 0 194021654 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 0 0 0 17 1 0 0
/proc/4567/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 66.55
Current children cumulated vsize (KiB) 0

[startup+66.7013 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 4568
/proc/meminfo: memFree=15304/2055920 swapFree=4181500/4192956
[pid=4567] ppid=4565 vsize=0 CPUtime=66.65
/proc/4567/stat : 4567 (pbscip.linux.x8) R 4565 4567 3841 0 -1 4194308 502579 0 0 0 5343 1322 0 0 25 0 1 0 194021654 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 0 0 0 17 1 0 0
/proc/4567/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 66.65
Current children cumulated vsize (KiB) 0

Child status: 255
Real time (s): 66.7739
CPU time (s): 66.7329
CPU user time (s): 53.4379
CPU system time (s): 13.295
CPU usage (%): 99.9385
Max. virtual memory (cumulated for all children) (KiB): 1876216

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

runsolver used 0.06299 second user time and 0.158975 second system time

The end

Launcher Data 

Begin job on node25 at 2009-06-17 20:43:39
IDJOB=1885197
IDBENCH=72033
IDSOLVER=683
FILE ID=node25/1885197-1245264217
PBS_JOBID= 9372428
Free space on /tmp= 66284 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/APPLICATIONS/c32sat/post-c32s-col400-16.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-1885197-1245264217/watcher-1885197-1245264217 -o /tmp/evaluation-result-1885197-1245264217/solver-1885197-1245264217 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1885197-1245264217.opb

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

MD5SUM BENCH= f38f3d39b504b3bf3f8ecc24c6e23888
RANDOM SEED=597939871

node25.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.238
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.238
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:       1822504 kB
Buffers:         26368 kB
Cached:         129636 kB
SwapCached:       5224 kB
Active:          94916 kB
Inactive:        68940 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1822504 kB
SwapTotal:     4192956 kB
SwapFree:      4181500 kB
Dirty:           36040 kB
Writeback:           0 kB
Mapped:          13652 kB
Slab:            55572 kB
Committed_AS:   235132 kB
PageTables:       1464 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= 66276 MiB
End job on node25 at 2009-06-17 20:44:47