Trace number 1885198

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
SCIPclp SCIP 1.1.0.7 with CLP 1.8.2? (MO) 67.5317 68.2764

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 

13.01/13.62	c SCIP version 1.1.0.7
13.01/13.62	c LP-Solver Clp 1.8.2
13.01/13.62	c user parameter file <scip.set> not found - using default parameters
13.01/13.62	c read problem <HOME/instance-1885198-1245264218.opb>
13.01/13.62	c original problem has 286329 variables (286329 bin, 0 int, 0 impl, 0 cont) and 839692 constraints
16.34/17.05	c No objective function, only one solution is needed.
16.34/17.05	c start presolving problem
16.34/17.05	c presolving:
24.53/25.25	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.64/29.40	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.33/33.05	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.62/35.34	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.82/36.57	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.82/37.51	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.63/38.35	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.42/39.14	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
39.11/39.89	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.91/40.60	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.61/41.33	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.31/42.03	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
42.01/42.71	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.71/43.41	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.31/44.09	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
44.02/44.76	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.71/45.44	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.40/46.10	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
46.00/46.75	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.70/47.40	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.31/48.03	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.90/48.67	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.61/49.30	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
49.21/49.93	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.80/50.58	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.51/51.21	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
51.11/51.84	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.71/52.47	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.41/53.11	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
53.00/53.74	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.60/54.37	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.20/54.99	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.90/55.63	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.50/56.24	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
56.11/56.87	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.70/57.49	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.39/63.14	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
64.39/65.16	c presolving (38 rounds):
64.39/65.16	c  74749 deleted vars, 218714 deleted constraints, 29576 tightened bounds, 0 added holes, 6 changed sides, 314 changed coefficients
64.39/65.16	c  13743157 implications, 0 cliques
64.39/65.16	c presolved problem has 211559 variables (211559 bin, 0 int, 0 impl, 0 cont) and 620978 constraints
64.39/65.16	c  620978 constraints of type <logicor>
64.39/65.16	c transformed objective value is always integral (scale: 1)
64.39/65.16	c Presolving Time: 37.42
64.39/65.16	c PURESAT
64.39/65.16	c -----------------------------------------------------------------------------------------------
64.39/65.16	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 0]
64.39/65.16	c separating/flowcover/freq = c -1
64.39/65.16	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 0]
64.39/65.16	c separating/cmir/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/veclendiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/veclendiving/maxlpiterquot = c 0.075
64.39/65.16	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/veclendiving/freq = c -1
64.39/65.16	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 1]
64.39/65.16	c heuristics/simplerounding/freq = c -1
64.39/65.16	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/shifting/freq = c -1
64.39/65.16	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 1]
64.39/65.16	c heuristics/rounding/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/rootsoldiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
64.39/65.16	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
64.39/65.16	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 20]
64.39/65.16	c heuristics/rootsoldiving/freq = c -1
64.39/65.16	c # number of nodes added to the contingent of the total nodes
64.39/65.16	c # [type: longint, range: [0,9223372036854775807], default: 500]
64.39/65.16	c heuristics/rens/nodesofs = c 2000
64.39/65.16	c # minimum percentage of integer variables that have to be fixable 
64.39/65.16	c # [type: real, range: [0,1], default: 0.5]
64.39/65.16	c heuristics/rens/minfixingrate = c 0.3
64.39/65.16	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 0]
64.39/65.16	c heuristics/rens/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/pscostdiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/pscostdiving/maxlpiterquot = c 0.075
64.39/65.16	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/pscostdiving/freq = c -1
64.39/65.16	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 1]
64.39/65.16	c heuristics/oneopt/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/objpscostdiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to total iteration number
64.39/65.16	c # [type: real, range: [0,1], default: 0.01]
64.39/65.16	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
64.39/65.16	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 20]
64.39/65.16	c heuristics/objpscostdiving/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/linesearchdiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
64.39/65.16	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/linesearchdiving/freq = c -1
64.39/65.16	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/intshifting/freq = c -1
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/intdiving/maxlpiterquot = c 0.075
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/guideddiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/guideddiving/maxlpiterquot = c 0.075
64.39/65.16	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/guideddiving/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/fracdiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/fracdiving/maxlpiterquot = c 0.075
64.39/65.16	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/fracdiving/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/feaspump/maxlpiterofs = c 2000
64.39/65.16	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 20]
64.39/65.16	c heuristics/feaspump/freq = c -1
64.39/65.16	c # minimum percentage of integer variables that have to be fixed 
64.39/65.16	c # [type: real, range: [0,1], default: 0.666]
64.39/65.16	c heuristics/crossover/minfixingrate = c 0.5
64.39/65.16	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
64.39/65.16	c # [type: real, range: [0,1], default: 0.1]
64.39/65.16	c heuristics/crossover/nodesquot = c 0.15
64.39/65.16	c # number of nodes without incumbent change that heuristic should wait
64.39/65.16	c # [type: longint, range: [0,9223372036854775807], default: 200]
64.39/65.16	c heuristics/crossover/nwaitingnodes = c 100
64.39/65.16	c # number of nodes added to the contingent of the total nodes
64.39/65.16	c # [type: longint, range: [0,9223372036854775807], default: 500]
64.39/65.16	c heuristics/crossover/nodesofs = c 750
64.39/65.16	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 30]
64.39/65.16	c heuristics/crossover/freq = c -1
64.39/65.16	c # additional number of allowed LP iterations
64.39/65.16	c # [type: int, range: [0,2147483647], default: 1000]
64.39/65.16	c heuristics/coefdiving/maxlpiterofs = c 1500
64.39/65.16	c # maximal fraction of diving LP iterations compared to node LP iterations
64.39/65.16	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
64.39/65.16	c heuristics/coefdiving/maxlpiterquot = c 0.075
64.39/65.16	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: 10]
64.39/65.16	c heuristics/coefdiving/freq = c -1
64.39/65.16	c # priority of node selection rule <dfs> in standard mode
64.39/65.16	c # [type: int, range: [-536870912,536870911], default: 0]
64.39/65.16	c nodeselection/dfs/stdpriority = c 1000000
64.39/65.16	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
64.39/65.16	c # [type: int, range: [-1,2147483647], default: -1]
64.39/65.16	c presolving/probing/maxrounds = c 0
64.39/65.16	c # should presolving try to simplify knapsacks
64.39/65.16	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.39/65.16	c constraints/knapsack/simplifyinequalities = c TRUE
64.39/65.16	c # should disaggregation of knapsack constraints be allowed in preprocessing?
64.39/65.16	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
64.39/65.16	c constraints/knapsack/disaggregation = c FALSE
64.39/65.16	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: -1]
64.69/65.41	c constraints/knapsack/maxnumcardlift = c 0
64.69/65.41	c # should presolving try to simplify inequalities
64.69/65.41	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.69/65.41	c constraints/linear/simplifyinequalities = c TRUE
64.69/65.41	c # maximal number of separation rounds in the root node (-1: unlimited)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: -1]
64.69/65.41	c separating/maxroundsroot = c 5
64.69/65.41	c # maximal number of separation rounds per node (-1: unlimited)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: 5]
64.69/65.41	c separating/maxrounds = c 1
64.69/65.41	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.69/65.41	c # [type: char, range: {lafpsqd}, default: l]
64.69/65.41	c lp/pricing = c a
64.69/65.41	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: 1]
64.69/65.41	c lp/solvefreq = c 0
64.69/65.41	c # solving stops, if the given number of solutions were found (-1: no limit)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: -1]
64.69/65.41	c limits/solutions = c 1
64.69/65.41	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
64.69/65.41	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
64.69/65.41	c limits/memory = c 1620
64.69/65.41	c # maximal time in seconds to run
64.69/65.41	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
64.69/65.41	c limits/time = c 1791
64.69/65.41	c # frequency for displaying node information lines
64.69/65.41	c # [type: int, range: [-1,2147483647], default: 100]
64.69/65.41	c display/freq = c 10000
64.69/65.41	c # should enforcement of pseudo solution be disabled?
64.69/65.41	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.69/65.41	c constraints/disableenfops = c TRUE
64.69/65.41	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: 0]
64.69/65.41	c constraints/agelimit = c 1
64.69/65.41	c # should binary conflicts be preferred?
64.69/65.41	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
64.69/65.41	c conflict/preferbinary = c TRUE
64.69/65.41	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
64.69/65.41	c # [type: int, range: [-1,2147483647], default: -1]
64.69/65.41	c conflict/interconss = c 0
64.69/65.41	c -----------------------------------------------------------------------------------------------
64.69/65.41	c start solving problem
64.69/65.41	c 
67.15/67.98	c [src/scip/lp.c:212] ERROR: Insufficient memory for reallocation of 5578168 bytes
67.15/67.98	c [src/scip/lp.c:212] ERROR: No memory in function call
67.15/67.98	c [src/scip/lp.c:6381] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/sepastore.c:610] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/sepastore.c:713] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/solve.c:584] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/solve.c:624] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/solve.c:661] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/solve.c:1842] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/solve.c:2513] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/solve.c:3110] ERROR: Error <-1> in function call
67.15/67.98	c [src/scip/scip.c:5251] ERROR: Error <-1> in function call
67.15/67.98	c [src/cmain.c:772] ERROR: Error <-1> in function call
67.15/67.98	c [src/cmain.c:1137] ERROR: Error <-1> in function call
67.15/67.98	c [src/cmain.c:1217] ERROR: Error <-1> in function call
67.15/67.98	c SCIP Error (-1): c insufficient memory errorc 
67.15/67.98	c Time complete: 67.22.

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-1885198-1245264218/watcher-1885198-1245264218 -o /tmp/evaluation-result-1885198-1245264218/solver-1885198-1245264218 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1885198-1245264218.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 17800
/proc/meminfo: memFree=1562072/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=7616 CPUtime=0
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 642 0 0 0 0 0 0 0 18 0 1 0 194021970 7798784 626 1992294400 4194304 9342243 548682068736 18446744073709551615 4402248 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 1904 637 353 1256 0 643 0

[startup+0.091991 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 17800
/proc/meminfo: memFree=1562072/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=15912 CPUtime=0.08
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 2817 0 0 0 8 0 0 0 18 0 1 0 194021970 16293888 2801 1992294400 4194304 9342243 548682068736 18446744073709551615 5858006 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 3978 2811 376 1256 0 2717 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 15912

[startup+0.10199 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 17800
/proc/meminfo: memFree=1562072/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=16084 CPUtime=0.09
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 2978 0 0 0 9 0 0 0 18 0 1 0 194021970 16470016 2962 1992294400 4194304 9342243 548682068736 18446744073709551615 8247743 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 4021 2962 376 1256 0 2760 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 16084

[startup+0.302011 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 17800
/proc/meminfo: memFree=1562072/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=24796 CPUtime=0.29
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 5187 0 0 0 28 1 0 0 19 0 1 0 194021970 25391104 5171 1992294400 4194304 9342243 548682068736 18446744073709551615 8247773 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 6246 5171 376 1256 0 4985 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 24796

[startup+0.701057 s]
/proc/loadavg: 1.00 1.00 0.96 3/64 17800
/proc/meminfo: memFree=1562072/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=40588 CPUtime=0.69
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 9127 0 0 0 66 3 0 0 23 0 1 0 194021970 41562112 9111 1992294400 4194304 9342243 548682068736 18446744073709551615 8247739 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 10147 9111 376 1256 0 8886 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40588

[startup+1.50115 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 17801
/proc/meminfo: memFree=1514960/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=73740 CPUtime=1.49
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 17383 0 0 0 143 6 0 0 25 0 1 0 194021970 75509760 17367 1992294400 4194304 9342243 548682068736 18446744073709551615 8247758 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 18435 17367 376 1256 0 17174 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 73740

[startup+3.10133 s]
/proc/loadavg: 1.00 1.00 0.96 2/65 17801
/proc/meminfo: memFree=1468624/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=139660 CPUtime=3.09
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 33884 0 0 0 296 13 0 0 25 0 1 0 194021970 143011840 33868 1992294400 4194304 9342243 548682068736 18446744073709551615 4511625 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 34915 33868 376 1256 0 33654 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 139660

[startup+6.30271 s]
/proc/loadavg: 1.24 1.05 0.98 4/65 17801
/proc/meminfo: memFree=1342224/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=258476 CPUtime=6.27
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 63449 0 0 0 601 26 0 0 25 0 1 0 194021970 264679424 63433 1992294400 4194304 9342243 548682068736 18446744073709551615 8247753 0 0 4096 0 0 0 0 17 1 0 0
/proc/17800/statm: 64619 63433 376 1256 0 63358 0
Current children cumulated CPU time (s) 6.27
Current children cumulated vsize (KiB) 258476

[startup+12.7012 s]
/proc/loadavg: 1.30 1.07 0.98 2/65 17801
/proc/meminfo: memFree=1134352/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=457024 CPUtime=12.1
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 113112 0 0 0 1159 51 0 0 25 0 1 0 194021970 467992576 113096 1992294400 4194304 9342243 548682068736 18446744073709551615 5537520 0 0 4096 0 0 0 0 17 0 0 0
/proc/17800/statm: 114256 113096 376 1256 0 112995 0
Current children cumulated CPU time (s) 12.1
Current children cumulated vsize (KiB) 457024

[startup+25.5017 s]
/proc/loadavg: 1.23 1.06 0.98 2/65 17801
/proc/meminfo: memFree=127248/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=1458116 CPUtime=24.83
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 360651 0 0 0 2268 215 0 0 25 0 1 0 194021970 1493110784 360281 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/17800/statm: 364529 360281 473 1256 0 363268 0
Current children cumulated CPU time (s) 24.83
Current children cumulated vsize (KiB) 1458116

[startup+51.1016 s]
/proc/loadavg: 1.22 1.07 0.99 2/65 17801
/proc/meminfo: memFree=76624/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=1501240 CPUtime=50.41
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194304 371470 0 0 0 4164 877 0 0 25 0 1 0 194021970 1537269760 371100 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/17800/statm: 375310 371100 474 1256 0 374049 0
Current children cumulated CPU time (s) 50.41
Current children cumulated vsize (KiB) 1501240



Maximum VSize exceeded: sending SIGTERM then SIGKILL

[startup+67.4025 s]
/proc/loadavg: 1.17 1.07 0.99 3/65 17801
/proc/meminfo: memFree=13456/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=1862660 CPUtime=66.7
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4196352 493593 0 0 0 5375 1295 0 0 25 0 1 0 194021970 1907363840 459356 1992294400 4194304 9342243 548682068736 18446744073709551615 8251797 0 0 4096 16384 0 0 0 17 1 0 0
/proc/17800/statm: 465665 459356 524 1256 0 464404 0
Current children cumulated CPU time (s) 66.7
Current children cumulated vsize (KiB) 1862660

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

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

[startup+67.7015 s]
/proc/loadavg: 1.17 1.07 0.99 3/65 17801
/proc/meminfo: memFree=13456/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=1887892 CPUtime=66.96
/proc/17800/stat : 17800 (pbscip.linux.x8) D 17798 17800 17370 0 -1 4194304 500352 0 0 0 5396 1300 0 0 25 0 1 0 194021970 1933201408 465551 1992294400 4194304 9342243 548682068736 18446744073709551615 8251767 0 0 4096 16384 18446744071564464661 0 0 17 1 0 0
/proc/17800/statm: 471973 465551 524 1256 0 470712 0
Current children cumulated CPU time (s) 66.96
Current children cumulated vsize (KiB) 1887892

[startup+68.1026 s]
/proc/loadavg: 1.17 1.07 0.99 2/66 17802
/proc/meminfo: memFree=16136/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=0 CPUtime=67.34
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194308 504040 0 0 0 5419 1315 0 0 25 0 1 0 194021970 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 0 0 0 17 1 0 0
/proc/17800/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 67.34
Current children cumulated vsize (KiB) 0

[startup+68.2016 s]
/proc/loadavg: 1.17 1.07 0.99 2/66 17802
/proc/meminfo: memFree=16136/2055920 swapFree=4181368/4192956
[pid=17800] ppid=17798 vsize=0 CPUtime=67.44
/proc/17800/stat : 17800 (pbscip.linux.x8) R 17798 17800 17370 0 -1 4194308 504040 0 0 0 5419 1325 0 0 25 0 1 0 194021970 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 0 0 0 17 1 0 0
/proc/17800/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 67.44
Current children cumulated vsize (KiB) 0

Child status: 255
Real time (s): 68.2764
CPU time (s): 67.5317
CPU user time (s): 54.1988
CPU system time (s): 13.333
CPU usage (%): 98.9093
Max. virtual memory (cumulated for all children) (KiB): 1893340

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

runsolver used 0.253961 second user time and 0.682896 second system time

The end

Launcher Data 

Begin job on node28 at 2009-06-17 20:43:39
IDJOB=1885198
IDBENCH=72033
IDSOLVER=684
FILE ID=node28/1885198-1245264218
PBS_JOBID= 9372425
Free space on /tmp= 66152 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
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.clp -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1885198-1245264218/watcher-1885198-1245264218 -o /tmp/evaluation-result-1885198-1245264218/solver-1885198-1245264218 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1885198-1245264218.opb

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

MD5SUM BENCH= f38f3d39b504b3bf3f8ecc24c6e23888
RANDOM SEED=1962681644

node28.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.231
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.231
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:       1562552 kB
Buffers:         39692 kB
Cached:         366340 kB
SwapCached:       5164 kB
Active:         107732 kB
Inactive:       307904 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1562552 kB
SwapTotal:     4192956 kB
SwapFree:      4181368 kB
Dirty:           37936 kB
Writeback:           0 kB
Mapped:          14688 kB
Slab:            63592 kB
Committed_AS:   192168 kB
PageTables:       1424 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264960 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66140 MiB
End job on node28 at 2009-06-17 20:44:49