Trace number 1884738

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.2SAT 1.2858 1.28891

General information on the benchmark

Name/PURE-SAT/SAT09/CRAFTED/
parity-games/instance_n3_i3_pp.opb
MD5SUMab1771f0f2ec9010837fd73a0c51bb65
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.016996
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables525
Total number of constraints2276
Number of constraints which are clauses2276
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 constraint6
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 3
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 8
Number of bits of the biggest sum of numbers4
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.04	c SCIP version 1.1.0.7
0.00/0.04	c LP-Solver Clp 1.8.2
0.00/0.04	c user parameter file <scip.set> not found - using default parameters
0.00/0.04	c read problem <HOME/instance-1884738-1245260311.opb>
0.00/0.04	c original problem has 525 variables (525 bin, 0 int, 0 impl, 0 cont) and 2276 constraints
0.00/0.05	c No objective function, only one solution is needed.
0.00/0.05	c start presolving problem
0.00/0.05	c presolving:
0.05/0.07	c (round 1) 165 del vars, 132 del conss, 27 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 4612 impls, 0 clqs
0.05/0.08	c (round 2) 183 del vars, 668 del conss, 27 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 4676 impls, 0 clqs
0.05/0.08	c (round 3) 183 del vars, 732 del conss, 27 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 4676 impls, 0 clqs
0.19/0.20	c (round 4) 184 del vars, 808 del conss, 27 chg bounds, 6 chg sides, 6 chg coeffs, 1487 upgd conss, 4676 impls, 0 clqs
0.19/0.22	c presolving (5 rounds):
0.19/0.22	c  184 deleted vars, 808 deleted constraints, 27 tightened bounds, 0 added holes, 6 changed sides, 6 changed coefficients
0.19/0.22	c  4676 implications, 0 cliques
0.19/0.22	c presolved problem has 341 variables (341 bin, 0 int, 0 impl, 0 cont) and 1468 constraints
0.19/0.22	c    1468 constraints of type <logicor>
0.19/0.22	c transformed objective value is always integral (scale: 1)
0.19/0.22	c Presolving Time: 0.16
0.19/0.22	c PURESAT
0.19/0.22	c -----------------------------------------------------------------------------------------------
0.19/0.22	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22	c separating/flowcover/freq = c -1
0.19/0.22	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22	c separating/cmir/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.22	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/veclendiving/freq = c -1
0.19/0.22	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22	c heuristics/simplerounding/freq = c -1
0.19/0.22	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/shifting/freq = c -1
0.19/0.22	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22	c heuristics/rounding/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.22	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.22	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.22	c heuristics/rootsoldiving/freq = c -1
0.19/0.22	c # number of nodes added to the contingent of the total nodes
0.19/0.22	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.22	c heuristics/rens/nodesofs = c 2000
0.19/0.22	c # minimum percentage of integer variables that have to be fixable 
0.19/0.22	c # [type: real, range: [0,1], default: 0.5]
0.19/0.22	c heuristics/rens/minfixingrate = c 0.3
0.19/0.22	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22	c heuristics/rens/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.22	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/pscostdiving/freq = c -1
0.19/0.22	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22	c heuristics/oneopt/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.22	c # [type: real, range: [0,1], default: 0.01]
0.19/0.22	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.22	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.22	c heuristics/objpscostdiving/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.22	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/linesearchdiving/freq = c -1
0.19/0.22	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/intshifting/freq = c -1
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.22	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/guideddiving/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.22	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/fracdiving/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.22	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.22	c heuristics/feaspump/freq = c -1
0.19/0.22	c # minimum percentage of integer variables that have to be fixed 
0.19/0.22	c # [type: real, range: [0,1], default: 0.666]
0.19/0.22	c heuristics/crossover/minfixingrate = c 0.5
0.19/0.22	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.22	c # [type: real, range: [0,1], default: 0.1]
0.19/0.22	c heuristics/crossover/nodesquot = c 0.15
0.19/0.22	c # number of nodes without incumbent change that heuristic should wait
0.19/0.22	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.22	c heuristics/crossover/nwaitingnodes = c 100
0.19/0.22	c # number of nodes added to the contingent of the total nodes
0.19/0.22	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.22	c heuristics/crossover/nodesofs = c 750
0.19/0.22	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.22	c heuristics/crossover/freq = c -1
0.19/0.22	c # additional number of allowed LP iterations
0.19/0.22	c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22	c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.22	c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.22	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22	c heuristics/coefdiving/freq = c -1
0.19/0.22	c # priority of node selection rule <dfs> in standard mode
0.19/0.22	c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.22	c nodeselection/dfs/stdpriority = c 1000000
0.19/0.22	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22	c presolving/probing/maxrounds = c 0
0.19/0.22	c # should presolving try to simplify knapsacks
0.19/0.22	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22	c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.22	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.22	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.22	c constraints/knapsack/disaggregation = c FALSE
0.19/0.22	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22	c constraints/knapsack/maxnumcardlift = c 0
0.19/0.22	c # should presolving try to simplify inequalities
0.19/0.22	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22	c constraints/linear/simplifyinequalities = c TRUE
0.19/0.22	c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22	c separating/maxroundsroot = c 5
0.19/0.22	c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.22	c separating/maxrounds = c 1
0.19/0.22	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.22	c # [type: char, range: {lafpsqd}, default: l]
0.19/0.22	c lp/pricing = c a
0.19/0.22	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22	c lp/solvefreq = c 0
0.19/0.22	c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22	c limits/solutions = c 1
0.19/0.22	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22	c limits/memory = c 1620
0.19/0.22	c # maximal time in seconds to run
0.19/0.22	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22	c limits/time = c 1791
0.19/0.22	c # frequency for displaying node information lines
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.22	c display/freq = c 10000
0.19/0.22	c # should enforcement of pseudo solution be disabled?
0.19/0.22	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22	c constraints/disableenfops = c TRUE
0.19/0.22	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22	c constraints/agelimit = c 1
0.19/0.22	c # should binary conflicts be preferred?
0.19/0.22	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22	c conflict/preferbinary = c TRUE
0.19/0.22	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.22	c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22	c conflict/interconss = c 0
0.19/0.22	c -----------------------------------------------------------------------------------------------
0.19/0.22	c start solving problem
0.19/0.22	c 
0.19/0.24	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.19/0.24	c   0.2s|     1 |     0 |   212 |3229k|   0 | 130 | 341 |1468 |1468 | 341 |1468 |   0 |   0 |   0 | 8.825000e+01 |      --      |    Inf 
0.29/0.31	c   0.2s|     1 |     0 |   274 |3266k|   0 | 127 | 341 |1468 |1468 | 341 |1479 |  11 |   0 |   0 | 9.250000e+01 |      --      |    Inf 
0.29/0.38	c   0.3s|     1 |     0 |   357 |3298k|   0 | 129 | 341 |1468 |1468 | 341 |1491 |  23 |   0 |   0 | 9.837500e+01 |      --      |    Inf 
0.39/0.45	c   0.4s|     1 |     0 |   444 |3354k|   0 | 145 | 341 |1468 |1468 | 341 |1501 |  33 |   0 |   0 | 1.032500e+02 |      --      |    Inf 
0.49/0.53	c   0.5s|     1 |     0 |   528 |3426k|   0 | 172 | 341 |1468 |1468 | 341 |1513 |  45 |   0 |   0 | 1.079875e+02 |      --      |    Inf 
0.59/0.62	c   0.6s|     1 |     0 |   664 |3528k|   0 | 178 | 341 |1468 |1468 | 341 |1525 |  57 |   0 |   0 | 1.129306e+02 |      --      |    Inf 
1.19/1.24	c   1.2s|     1 |     2 |   664 |3529k|   0 | 178 | 341 |1468 |1468 | 341 |1525 |  57 |   0 |  19 | 1.129306e+02 |      --      |    Inf 
1.19/1.27	c * 1.2s|    48 |    15 |   664 |3709k|  26 |   - | 341 |1479 | 191 |   0 |   0 |  57 |  25 |  19 | 1.248056e+02 | 2.500000e+02 | 100.31%
1.19/1.27	c 
1.19/1.27	c SCIP Status        : solving was interrupted [solution limit reached]
1.19/1.27	c Solving Time (sec) : 1.20
1.19/1.27	c Solving Nodes      : 48
1.19/1.27	c Primal Bound       : +2.50000000000000e+02 (1 solutions)
1.19/1.27	c Dual Bound         : +1.24805555555556e+02
1.19/1.27	c Gap                : 100.31 %
1.19/1.27	c NODE         48
1.19/1.27	c DUAL BOUND   124.806
1.19/1.27	c PRIMAL BOUND 250
1.19/1.27	c GAP          1.00312
1.19/1.27	s SATISFIABLE
1.19/1.27	v x14 -x18 -x19 x24 -x28 -x30 x20 -x38 x21 -x41 x25 x43 x49 -x55 -x56 -x4 -x36 -x46 -x54 x3 x35 x60 x63 x69 x73 -x78 -x80 x71 x85 
1.19/1.27	v x72 x87 x76 -x92 x94 -x66 -x84 -x89 x97 x65 x82 -x98 -x100 x101 -x103 -x105 -x106 -x109 -x110 -x112 -x113 -x114 x115 x107 x108 
1.19/1.27	v x111 -x104 -x117 -x121 x124 x102 x116 x148 x149 x153 -x164 x167 -x176 -x142 -x162 x184 -x170 x178 x141 x160 -x165 x168 -x193 
1.19/1.27	v x197 x194 x206 -x192 x195 x199 x198 x212 -x166 x215 x169 -x189 -x217 -x205 -x173 -x208 -x213 x187 x203 -x179 -x181 x182 x211 
1.19/1.27	v x221 x185 -x214 x190 -x226 x229 x222 x223 -x235 x225 x241 -x227 x230 -x219 -x234 -x240 -x244 x218 x232 x249 x250 -x258 x247 
1.19/1.27	v x251 x256 x257 x264 x228 x259 x266 x231 -x268 -x233 -x236 -x238 x239 x263 -x253 x271 -x262 x242 -x265 -x267 -x269 x252 x261 
1.19/1.27	v x246 -x277 x280 -x286 x293 x284 -x278 x285 x281 x287 x300 x301 -x276 -x294 -x299 x304 x275 x292 -x308 x298 x302 -x315 x279 x318 
1.19/1.27	v x282 x320 -x283 x312 -x288 x313 x290 x316 x291 -x314 -x323 x295 x317 x297 -x310 -x321 -x324 x326 x309 x319 x188 -x180 x207 
1.19/1.27	v -x204 x224 -x202 -x220 x339 x245 -x237 x340 x260 -x255 x343 x273 -x254 -x270 -x336 -x349 x296 -x350 x356 x335 x348 x289 x311 
1.19/1.27	v x307 x325 -x305 x322 x96 x177 x243 x362 x303 x363 x366 x355 x378 -x377 -x361 -x370 -x372 -x376 x360 x369 -x384 -x380 -x391 
1.19/1.27	v x386 x387 x393 -x392 x388 -x394 -x398 -x396 x122 -x383 -x390 x119 -x397 -x400 x382 x389 -x404 -x407 -x411 -x410 -x413 -x418 -x415 
1.19/1.27	v x408 x123 x409 x412 -x120 -x125 -x118 x371 -x403 -x419 -x420 -x421 x402 x417 -x422 x427 -x423 -x432 -x428 x430 x431 x434 
1.19/1.27	v x437 x440 x438 -x442 x445 -x444 -x426 -x436 -x439 x441 x425 x435 -x134 x128 -x452 -x456 -x459 -x457 x450 -x461 x451 -x465 -x463 
1.19/1.27	v x455 x143 x129 x375 -x146 -x449 -x460 -x466 x467 x448 x458 x468 -x126 -x379 x447 x359 -x401 x475 -x474 -x478 -x476 x5 x29 
1.19/1.27	v -x6 x8 -x40 x9 x484 x11 -x45 x12 -x31 x127 -x34 -x58 -x39 x99 x486 x42 x485 x44 -x50 -x57 -x83 x327 -x59 -x81 -x272 -x487 x61 
1.19/1.27	v -x88 x306 -x68 x86 -x216 x70 x95 -x248 -x74 -x93 x183 x489 -x488 -x159 x152 -x490 -x493 -x495 -x494 -x496 -x498 -x497 -x161 
1.19/1.27	v x156 x163 -x147 -x405 -x406 -x140 -x150 -x154 x145 -x157 -x139 -x151 -x155 x144 -x158 -x453 -x454 -x186 -x196 -x200 x191 -x201 
1.19/1.27	v -x334 -x341 -x344 x338 -x346 -x333 -x342 -x345 x337 -x347 -x491 -x492 -x358 -x365 -x367 x357 -x368 -x62 x130 -x381 -x385 -x131 
1.19/1.27	v x133 -x395 -x399 -x135 -x137 -x414 -x416 -x274 x328 x171 -x429 -x433 -x174 x329 -x330 x172 -x443 x446 x175 -x331 -x332 -x209 
1.19/1.27	v -x462 -x464 -x210 -x424 x469 x351 -x477 -x479 -x353 x470 -x471 x352 -x480 x481 x354 -x472 -x473 -x373 -x482 -x483 -x374 
1.19/1.27	v x501 x502 x503 -x500 -x505 x506 -x507 x499 x504 x136 -x1 x7 -x23 x510 -x27 x511 -x33 x512 -x48 x364 -x52 -x509 -x514 -x515 -x516 
1.19/1.27	v x508 x513 -x132 -x10 -x2 x16 -x64 x67 x15 -x22 -x26 -x32 -x75 x519 -x37 -x77 x520 -x13 -x79 x521 x17 x90 x47 x53 -x91 -x51 
1.19/1.27	v -x518 -x523 x524 -x525 x517 x522 x138 
1.19/1.27	c SCIP Status        : solving was interrupted [solution limit reached]
1.19/1.27	c Solving Time       :       1.20
1.19/1.27	c Original Problem   :
1.19/1.27	c   Problem name     : HOME/instance-1884738-1245260311.opb
1.19/1.27	c   Variables        : 525 (525 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.27	c   Constraints      : 2276 initial, 2276 maximal
1.19/1.27	c Presolved Problem  :
1.19/1.27	c   Problem name     : t_HOME/instance-1884738-1245260311.opb
1.19/1.27	c   Variables        : 341 (341 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.27	c   Constraints      : 1468 initial, 1479 maximal
1.19/1.27	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.19/1.27	c   trivial          :       0.00          2          0          0          0          0          0          0          0
1.19/1.27	c   dualfix          :       0.00          1          0          0          0          0          0          0          0
1.19/1.27	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.19/1.27	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.19/1.27	c   implics          :       0.00          0        146          0          0          0          0          0          0
1.19/1.27	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.19/1.27	c   linear           :       0.09         25         10          0         27          0        789          6          6
1.19/1.27	c   logicor          :       0.06          0          0          0          0          0         19          0          0
1.19/1.27	c   root node        :          -          0          -          -          0          -          -          -          -
1.19/1.27	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.19/1.27	c   integral         :          0          0          0          1          0          0          0          0          0          2
1.19/1.27	c   logicor          :       1468+         5        276          0          1         15       1237          0          0          0
1.19/1.27	c   countsols        :          0          0          0          0          1          0          0          0          0          0
1.19/1.27	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.19/1.27	c   integral         :       0.62       0.00       0.00       0.62       0.00
1.19/1.27	c   logicor          :       0.02       0.00       0.02       0.00       0.00
1.19/1.27	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.19/1.27	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.19/1.27	c   rootredcost      :       0.00          0          0          0
1.19/1.27	c   pseudoobj        :       0.00        317          0          0
1.19/1.27	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.19/1.27	c   propagation      :       0.00         15         15         15        7.5         10        3.3          -
1.19/1.27	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.19/1.27	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.19/1.27	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.19/1.27	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.19/1.27	c   applied globally :          -          -          -         25        5.8          -          -          -
1.19/1.27	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.19/1.27	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.19/1.27	c   cut pool         :       0.00          4          -          -         16          -    (maximal pool size: 350)
1.19/1.27	c   redcost          :       0.00          5          0          0          0          0
1.19/1.27	c   impliedbounds    :       0.00          5          0          0          0          0
1.19/1.27	c   intobj           :       0.00          0          0          0          0          0
1.19/1.27	c   gomory           :       0.13          5          0          0       2500          0
1.19/1.27	c   strongcg         :       0.12          5          0          0       2500          0
1.19/1.27	c   cmir             :       0.00          0          0          0          0          0
1.19/1.27	c   flowcover        :       0.00          0          0          0          0          0
1.19/1.27	c   clique           :       0.00          5          0          0         23          0
1.19/1.27	c   zerohalf         :       0.00          0          0          0          0          0
1.19/1.27	c   mcf              :       0.00          1          0          0          0          0
1.19/1.27	c Pricers            :       Time      Calls       Vars
1.19/1.27	c   problem variables:       0.00          0          0
1.19/1.27	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.19/1.27	c   relpscost        :       0.62          1          0          0          0          0          2
1.19/1.27	c   pscost           :       0.00          0          0          0          0          0          0
1.19/1.27	c   inference        :       0.00         38          0          0          0          0         76
1.19/1.27	c   mostinf          :       0.00          0          0          0          0          0          0
1.19/1.27	c   leastinf         :       0.00          0          0          0          0          0          0
1.19/1.27	c   fullstrong       :       0.00          0          0          0          0          0          0
1.19/1.27	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.19/1.27	c   random           :       0.00          0          0          0          0          0          0
1.19/1.27	c Primal Heuristics  :       Time      Calls      Found
1.19/1.27	c   LP solutions     :       0.00          -          0
1.19/1.27	c   pseudo solutions :       0.00          -          1
1.19/1.27	c   simplerounding   :       0.00          0          0
1.19/1.27	c   rounding         :       0.00          0          0
1.19/1.27	c   shifting         :       0.00          0          0
1.19/1.27	c   intshifting      :       0.00          0          0
1.19/1.27	c   oneopt           :       0.00          0          0
1.19/1.27	c   fixandinfer      :       0.00          0          0
1.19/1.27	c   feaspump         :       0.00          0          0
1.19/1.27	c   coefdiving       :       0.00          0          0
1.19/1.27	c   pscostdiving     :       0.00          0          0
1.19/1.27	c   fracdiving       :       0.00          0          0
1.19/1.27	c   veclendiving     :       0.00          0          0
1.19/1.27	c   intdiving        :       0.00          0          0
1.19/1.27	c   actconsdiving    :       0.00          0          0
1.19/1.27	c   objpscostdiving  :       0.00          0          0
1.19/1.27	c   rootsoldiving    :       0.00          0          0
1.19/1.27	c   linesearchdiving :       0.00          0          0
1.19/1.27	c   guideddiving     :       0.00          0          0
1.19/1.27	c   octane           :       0.00          0          0
1.19/1.27	c   rens             :       0.00          0          0
1.19/1.27	c   rins             :       0.00          0          0
1.19/1.27	c   localbranching   :       0.00          0          0
1.19/1.27	c   mutation         :       0.00          0          0
1.19/1.27	c   crossover        :       0.00          0          0
1.19/1.27	c   dins             :       0.00          0          0
1.19/1.27	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.19/1.27	c   primal LP        :       0.01          0          0       0.00       0.00
1.19/1.27	c   dual LP          :       0.13          6        664     110.67    5107.69
1.19/1.27	c   barrier LP       :       0.00          0          0       0.00          -
1.19/1.27	c   diving/probing LP:       0.00          0          0       0.00          -
1.19/1.27	c   strong branching :       0.62         19       3248     170.95    5238.71
1.19/1.27	c     (at root node) :          -         19       3248     170.95          -
1.19/1.27	c   conflict analysis:       0.00          0          0       0.00          -
1.19/1.27	c B&B Tree           :
1.19/1.27	c   number of runs   :          1
1.19/1.27	c   nodes            :         48
1.19/1.27	c   nodes (total)    :         48
1.19/1.27	c   nodes left       :         15
1.19/1.27	c   max depth        :         26
1.19/1.27	c   max depth (total):         26
1.19/1.27	c   backtracks       :          7 (14.6%)
1.19/1.27	c   delayed cutoffs  :         10
1.19/1.27	c   repropagations   :         38 (425 domain reductions, 7 cutoffs)
1.19/1.27	c   avg switch length:       2.40
1.19/1.27	c   switching time   :       0.01
1.19/1.27	c Solution           :
1.19/1.27	c   Solutions found  :          1 (1 improvements)
1.19/1.27	c   Primal Bound     : +2.50000000000000e+02   (in run 1, after 48 nodes, 1.20 seconds, depth 26, found by <relaxation>)
1.19/1.27	c   Dual Bound       : +1.24805555555556e+02
1.19/1.27	c   Gap              :     100.31 %
1.19/1.27	c   Root Dual Bound  : +1.12930555555556e+02
1.19/1.28	c Time complete: 1.28.

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-1884738-1245260311/watcher-1884738-1245260311 -o /tmp/evaluation-result-1884738-1245260311/solver-1884738-1245260311 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884738-1245260311.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.08 1.01 0.92 3/64 3246
/proc/meminfo: memFree=1905560/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=5812 CPUtime=0
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 516 0 0 0 0 0 0 0 18 0 1 0 1510485 5951488 500 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 0 0 0 0 17 1 0 0
/proc/3246/statm: 1453 501 332 1256 0 192 0

[startup+0.060646 s]
/proc/loadavg: 1.08 1.01 0.92 3/64 3246
/proc/meminfo: memFree=1905560/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=15760 CPUtime=0.05
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 3109 0 0 0 5 0 0 0 18 0 1 0 1510485 16138240 2739 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3246/statm: 3940 2739 474 1256 0 2679 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 15760

[startup+0.102652 s]
/proc/loadavg: 1.08 1.01 0.92 3/64 3246
/proc/meminfo: memFree=1905560/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=17144 CPUtime=0.09
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 3449 0 0 0 8 1 0 0 18 0 1 0 1510485 17555456 3079 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3246/statm: 4286 3079 476 1256 0 3025 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17144

[startup+0.301673 s]
/proc/loadavg: 1.08 1.01 0.92 3/64 3246
/proc/meminfo: memFree=1905560/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=22160 CPUtime=0.29
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 4426 0 0 0 27 2 0 0 17 0 1 0 1510485 22691840 4056 1992294400 4194304 9342243 548682068736 18446744073709551615 6960333 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3246/statm: 5540 4056 642 1256 0 4279 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 22160

[startup+0.701721 s]
/proc/loadavg: 1.08 1.01 0.92 3/64 3246
/proc/meminfo: memFree=1905560/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=25248 CPUtime=0.69
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 4703 0 0 0 67 2 0 0 19 0 1 0 1510485 25853952 4333 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3246/statm: 6312 4333 650 1256 0 5051 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 25248

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

[startup+1.10578 s]
/proc/loadavg: 1.07 1.01 0.92 2/65 3247
/proc/meminfo: memFree=1890768/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=25248 CPUtime=1.09
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 4703 0 0 0 107 2 0 0 24 0 1 0 1510485 25853952 4333 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3246/statm: 6312 4333 650 1256 0 5051 0
Current children cumulated CPU time (s) 1.09
Current children cumulated vsize (KiB) 25248

[startup+1.20178 s]
/proc/loadavg: 1.07 1.01 0.92 2/65 3247
/proc/meminfo: memFree=1890768/2055920 swapFree=4192956/4192956
[pid=3246] ppid=3244 vsize=25248 CPUtime=1.19
/proc/3246/stat : 3246 (pbscip.linux.x8) R 3244 3246 2926 0 -1 4194304 4703 0 0 0 117 2 0 0 24 0 1 0 1510485 25853952 4333 1992294400 4194304 9342243 548682068736 18446744073709551615 6978098 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3246/statm: 6312 4333 650 1256 0 5051 0
Current children cumulated CPU time (s) 1.19
Current children cumulated vsize (KiB) 25248

Child status: 0
Real time (s): 1.28891
CPU time (s): 1.2858
CPU user time (s): 1.25481
CPU system time (s): 0.030995
CPU usage (%): 99.7591
Max. virtual memory (cumulated for all children) (KiB): 25248

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

runsolver used 0.003999 second user time and 0.014997 second system time

The end

Launcher Data 

Begin job on node1 at 2009-06-17 19:38:31
IDJOB=1884738
IDBENCH=71987
IDSOLVER=684
FILE ID=node1/1884738-1245260311
PBS_JOBID= 9372452
Free space on /tmp= 66204 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
BENCH NAME= PB09/normalized-PB09/PURE-SAT/SAT09/CRAFTED/parity-games/instance_n3_i3_pp.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-1884738-1245260311/watcher-1884738-1245260311 -o /tmp/evaluation-result-1884738-1245260311/solver-1884738-1245260311 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884738-1245260311.opb

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

MD5SUM BENCH= ab1771f0f2ec9010837fd73a0c51bb65
RANDOM SEED=1574677931

node1.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.198
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.198
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:       1905976 kB
Buffers:         14652 kB
Cached:          92856 kB
SwapCached:          0 kB
Active:          60160 kB
Inactive:        60160 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1905976 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:           11852 kB
Writeback:           0 kB
Mapped:          22632 kB
Slab:            15584 kB
Committed_AS:    52624 kB
PageTables:       1436 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= 66192 MiB
End job on node1 at 2009-06-17 19:38:32