Trace number 1868042

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)UNSAT 1.38579 1.38605

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111220546.opb
MD5SUMaeab1724c196459c6b33e6369a15ae92
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
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 benchmark1.38579
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
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 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1248
Number of bits of the biggest sum of numbers11
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.01	c SCIP version 1.1.0.7
0.00/0.01	c LP-Solver SoPlex 1.4.1
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c read problem <HOME/instance-1868042-1245115481.opb>
0.00/0.01	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c start presolving problem
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.02/0.02	c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.02/0.02	c presolving (3 rounds):
0.02/0.02	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.02	c  8 implications, 68 cliques
0.02/0.02	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.02	c       1 constraints of type <knapsack>
0.02/0.02	c      68 constraints of type <setppc>
0.02/0.02	c       4 constraints of type <logicor>
0.02/0.02	c transformed objective value is always integral (scale: 1)
0.02/0.02	c Presolving Time: 0.01
0.02/0.02	c SATUNSAT-LIN
0.02/0.02	c -----------------------------------------------------------------------------------------------
0.02/0.02	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.02	c separating/flowcover/freq = c -1
0.02/0.02	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.02	c separating/cmir/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/veclendiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.02/0.02	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/veclendiving/freq = c -1
0.02/0.02	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.02	c heuristics/simplerounding/freq = c -1
0.02/0.02	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/shifting/freq = c -1
0.02/0.02	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.02	c heuristics/rounding/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.02	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.02/0.02	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.02	c heuristics/rootsoldiving/freq = c -1
0.02/0.02	c # number of nodes added to the contingent of the total nodes
0.02/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.02	c heuristics/rens/nodesofs = c 2000
0.02/0.02	c # minimum percentage of integer variables that have to be fixable 
0.02/0.02	c # [type: real, range: [0,1], default: 0.5]
0.02/0.02	c heuristics/rens/minfixingrate = c 0.3
0.02/0.02	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.02	c heuristics/rens/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.02/0.02	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/pscostdiving/freq = c -1
0.02/0.02	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.02	c heuristics/oneopt/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.02	c # [type: real, range: [0,1], default: 0.01]
0.02/0.02	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.02/0.02	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.02	c heuristics/objpscostdiving/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.02/0.02	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/linesearchdiving/freq = c -1
0.02/0.02	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/intshifting/freq = c -1
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/intdiving/maxlpiterquot = c 0.075
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/guideddiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.02/0.02	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/guideddiving/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/fracdiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.02/0.02	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/fracdiving/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/feaspump/maxlpiterofs = c 2000
0.02/0.02	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.02	c heuristics/feaspump/freq = c -1
0.02/0.02	c # minimum percentage of integer variables that have to be fixed 
0.02/0.02	c # [type: real, range: [0,1], default: 0.666]
0.02/0.02	c heuristics/crossover/minfixingrate = c 0.5
0.02/0.02	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.02	c # [type: real, range: [0,1], default: 0.1]
0.02/0.02	c heuristics/crossover/nodesquot = c 0.15
0.02/0.02	c # number of nodes without incumbent change that heuristic should wait
0.02/0.02	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.02	c heuristics/crossover/nwaitingnodes = c 100
0.02/0.02	c # number of nodes added to the contingent of the total nodes
0.02/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.02	c heuristics/crossover/nodesofs = c 750
0.02/0.02	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.02	c heuristics/crossover/freq = c -1
0.02/0.02	c # additional number of allowed LP iterations
0.02/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.02	c heuristics/coefdiving/maxlpiterofs = c 1500
0.02/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.02	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.02/0.02	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.02	c heuristics/coefdiving/freq = c -1
0.02/0.02	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.02	c presolving/probing/maxrounds = c 0
0.02/0.02	c # should presolving try to simplify knapsacks
0.02/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.02	c constraints/knapsack/simplifyinequalities = c TRUE
0.02/0.02	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.02	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.02	c constraints/knapsack/disaggregation = c FALSE
0.02/0.02	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.02	c constraints/knapsack/maxnumcardlift = c 0
0.02/0.02	c # should presolving try to simplify inequalities
0.02/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.02	c constraints/linear/simplifyinequalities = c TRUE
0.02/0.02	c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.02	c separating/maxroundsroot = c 5
0.02/0.02	c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.02	c separating/maxrounds = c 1
0.02/0.02	c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.02	c limits/solutions = c 1
0.02/0.02	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.02	c limits/memory = c 1620
0.02/0.02	c # maximal time in seconds to run
0.02/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.02	c limits/time = c 1791
0.02/0.02	c # frequency for displaying node information lines
0.02/0.02	c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.02	c display/freq = c 10000
0.02/0.02	c -----------------------------------------------------------------------------------------------
0.02/0.03	c start solving problem
0.02/0.03	c 
0.02/0.03	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.02/0.03	c   0.0s|     1 |     0 |   145 | 593k|   0 |  41 | 169 |  73 |  73 | 169 |  73 |   0 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.02/0.05	c   0.0s|     1 |     0 |   199 | 866k|   0 |  46 | 169 |  73 |  73 | 169 |  88 |  15 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.02/0.07	c   0.1s|     1 |     0 |   252 | 912k|   0 |  49 | 169 |  73 |  73 | 169 |  94 |  21 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.02/0.09	c   0.1s|     1 |     0 |   285 | 928k|   0 |  49 | 169 |  73 |  73 | 169 |  98 |  25 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.11	c   0.1s|     1 |     0 |   329 | 945k|   0 |  51 | 169 |  73 |  73 | 169 | 102 |  29 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.12	c   0.1s|     1 |     0 |   346 | 946k|   0 |  50 | 169 |  73 |  73 | 169 | 103 |  30 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.69/0.78	c   0.8s|     1 |     0 |   451 | 946k|   0 |  44 | 169 |  73 |  73 | 169 | 103 |  30 |   0 |  34 | 1.300000e+01 |      --      |    Inf 
0.89/0.92	c   0.9s|     1 |     0 |   539 | 946k|   0 |  43 | 169 |  73 |  73 | 169 | 103 |  30 |   0 |  43 | 1.300000e+01 |      --      |    Inf 
0.89/1.00	c   1.0s|     1 |     0 |   611 | 946k|   0 |  46 | 169 |  73 |  73 | 169 | 103 |  30 |   0 |  49 | 1.300000e+01 |      --      |    Inf 
0.99/1.06	c   1.0s|     1 |     0 |   622 | 946k|   0 |  45 | 169 |  73 |  73 | 169 | 103 |  30 |   0 |  56 | 1.300000e+01 |      --      |    Inf 
1.10/1.10	c   1.1s|     1 |     0 |   634 | 946k|   0 |  44 | 169 |  73 |  73 | 169 | 103 |  30 |   0 |  61 | 1.300000e+01 |      --      |    Inf 
1.10/1.16	c   1.1s|     1 |     0 |   650 | 946k|   0 |  40 | 169 |  73 |  73 | 169 |  98 |  30 |   0 |  66 | 1.300000e+01 |      --      |    Inf 
1.19/1.22	c   1.2s|     1 |     0 |   650 | 946k|   0 |   - | 169 |  73 |  73 | 169 |  98 |  30 |   0 |  72 | 1.300000e+01 |      --      |    Inf 
1.19/1.22	c (run 1, node 1) restarting after 35 global fixings of integer variables
1.19/1.22	c 
1.19/1.22	(restart) converted 25 cuts from the global cut pool into linear constraints
1.19/1.22	c 
1.19/1.22	presolving:
1.19/1.22	c (round 1) 35 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 25 upgd conss, 12 impls, 80 clqs
1.19/1.23	c (round 2) 35 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 25 upgd conss, 12 impls, 80 clqs
1.19/1.23	c presolving (3 rounds):
1.19/1.23	c  35 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.19/1.23	c  12 implications, 80 cliques
1.19/1.23	c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 96 constraints
1.19/1.23	c      12 constraints of type <knapsack>
1.19/1.23	c      79 constraints of type <setppc>
1.19/1.23	c       5 constraints of type <logicor>
1.19/1.23	c transformed objective value is always integral (scale: 1)
1.19/1.23	c Presolving Time: 0.02
1.19/1.23	c 
1.19/1.24	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.19/1.24	c   1.2s|     1 |     0 |   739 | 795k|   0 |  41 | 134 |  96 |  96 | 134 |  96 |   0 |   0 |  72 | 1.300000e+01 |      --      |    Inf 
1.19/1.26	c   1.2s|     1 |     0 |   780 |1116k|   0 |  47 | 134 |  96 |  96 | 134 | 109 |  13 |   0 |  72 | 1.300000e+01 |      --      |    Inf 
1.29/1.36	c   1.3s|     1 |     0 |   887 |1116k|   0 |  40 | 134 |  96 |  96 | 134 | 109 |  13 |   0 |  81 | 1.300000e+01 |      --      |    Inf 
1.29/1.37	c   1.3s|     1 |     0 |   887 |1116k|   0 |  40 | 134 |  96 |  96 | 134 | 109 |  13 |   0 |  82 |      --      |      --      |   0.00%
1.29/1.37	c 
1.29/1.37	c SCIP Status        : problem is solved [infeasible]
1.29/1.37	c Solving Time (sec) : 1.32
1.29/1.37	c Solving Nodes      : 1 (total of 2 nodes in 2 runs)
1.29/1.37	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
1.29/1.37	c Dual Bound         : +1.00000000000000e+20
1.29/1.37	c Gap                : 0.00 %
1.29/1.37	c NODE         1
1.29/1.37	c DUAL BOUND   1e+20
1.29/1.37	c PRIMAL BOUND 1e+20
1.29/1.37	c GAP          0
1.29/1.37	s UNSATISFIABLE
1.29/1.37	c SCIP Status        : problem is solved [infeasible]
1.29/1.37	c Solving Time       :       1.32
1.29/1.37	c Original Problem   :
1.29/1.37	c   Problem name     : HOME/instance-1868042-1245115481.opb
1.29/1.37	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37	c   Constraints      : 101 initial, 101 maximal
1.29/1.37	c Presolved Problem  :
1.29/1.37	c   Problem name     : t_HOME/instance-1868042-1245115481.opb
1.29/1.37	c   Variables        : 134 (134 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37	c   Constraints      : 96 initial, 96 maximal
1.29/1.37	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.29/1.37	c   trivial          :       0.00         35          0          0          0          0          0          0          0
1.29/1.37	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.29/1.37	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.29/1.37	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.29/1.37	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.29/1.37	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.29/1.37	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
1.29/1.37	c   setppc           :       0.00          0          0          0          0          0          1          0          0
1.29/1.37	c   linear           :       0.01          0          0          0          0          0         28          0          0
1.29/1.37	c   logicor          :       0.00          0          0          0          0          0          1          0          0
1.29/1.37	c   root node        :          -         40          -          -         40          -          -          -          -
1.29/1.37	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.37	c   integral         :          0          0          0          9          0          1         40          0          0          0
1.29/1.37	c   knapsack         :         12          6          9          0          0          0          0          0          0          0
1.29/1.37	c   setppc           :         79          6          9          0          0          0          0          0          0          0
1.29/1.37	c   logicor          :          5          6          2          0          0          0          0          0          0          0
1.29/1.37	c   countsols        :          0          0          0          0          0          0          0          0          0          0
1.29/1.37	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.29/1.37	c   integral         :       1.14       0.00       0.00       1.14       0.00
1.29/1.37	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
1.29/1.37	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.29/1.37	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.29/1.37	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.29/1.37	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.29/1.37	c   rootredcost      :       0.00          0          0          0
1.29/1.37	c   pseudoobj        :       0.00         11          0          0
1.29/1.37	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.29/1.37	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.37	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.37	c   applied globally :          -          -          -          0        0.0          -          -          -
1.29/1.37	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.29/1.37	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.29/1.37	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 97)
1.29/1.37	c   redcost          :       0.00          6          0          0          0          0
1.29/1.37	c   impliedbounds    :       0.00          6          0          0          0          0
1.29/1.37	c   intobj           :       0.00          0          0          0          0          0
1.29/1.37	c   gomory           :       0.05          6          0          0         48          0
1.29/1.37	c   strongcg         :       0.04          6          0          0        141          0
1.29/1.37	c   cmir             :       0.00          0          0          0          0          0
1.29/1.37	c   flowcover        :       0.00          0          0          0          0          0
1.29/1.37	c   clique           :       0.00          6          0          0         26          0
1.29/1.37	c   zerohalf         :       0.00          0          0          0          0          0
1.29/1.37	c   mcf              :       0.00          2          0          0          0          0
1.29/1.37	c Pricers            :       Time      Calls       Vars
1.29/1.37	c   problem variables:       0.00          0          0
1.29/1.37	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.37	c   relpscost        :       1.14          9          1         40          0          0          0
1.29/1.37	c   pscost           :       0.00          0          0          0          0          0          0
1.29/1.37	c   inference        :       0.00          0          0          0          0          0          0
1.29/1.37	c   mostinf          :       0.00          0          0          0          0          0          0
1.29/1.37	c   leastinf         :       0.00          0          0          0          0          0          0
1.29/1.37	c   fullstrong       :       0.00          0          0          0          0          0          0
1.29/1.37	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.29/1.37	c   random           :       0.00          0          0          0          0          0          0
1.29/1.37	c Primal Heuristics  :       Time      Calls      Found
1.29/1.37	c   LP solutions     :       0.00          -          0
1.29/1.37	c   pseudo solutions :       0.00          -          0
1.29/1.37	c   simplerounding   :       0.00          0          0
1.29/1.37	c   rounding         :       0.00          0          0
1.29/1.37	c   shifting         :       0.00          0          0
1.29/1.37	c   intshifting      :       0.00          0          0
1.29/1.37	c   oneopt           :       0.00          0          0
1.29/1.37	c   fixandinfer      :       0.00          0          0
1.29/1.37	c   feaspump         :       0.00          0          0
1.29/1.37	c   coefdiving       :       0.00          0          0
1.29/1.37	c   pscostdiving     :       0.00          0          0
1.29/1.37	c   fracdiving       :       0.00          0          0
1.29/1.37	c   veclendiving     :       0.00          0          0
1.29/1.37	c   intdiving        :       0.00          0          0
1.29/1.37	c   actconsdiving    :       0.00          0          0
1.29/1.37	c   objpscostdiving  :       0.00          0          0
1.29/1.37	c   rootsoldiving    :       0.00          0          0
1.29/1.37	c   linesearchdiving :       0.00          0          0
1.29/1.37	c   guideddiving     :       0.00          0          0
1.29/1.37	c   octane           :       0.00          0          0
1.29/1.37	c   rens             :       0.00          0          0
1.29/1.37	c   rins             :       0.00          0          0
1.29/1.37	c   localbranching   :       0.00          0          0
1.29/1.37	c   mutation         :       0.00          0          0
1.29/1.37	c   crossover        :       0.00          0          0
1.29/1.37	c   dins             :       0.00          0          0
1.29/1.37	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.29/1.37	c   primal LP        :       0.00          0          0       0.00          -
1.29/1.37	c   dual LP          :       0.06         15        887      59.13   14783.33
1.29/1.37	c   barrier LP       :       0.00          0          0       0.00          -
1.29/1.37	c   diving/probing LP:       0.00          0          0       0.00          -
1.29/1.37	c   strong branching :       1.14         82      12440     151.71   10912.28
1.29/1.37	c     (at root node) :          -         82      12440     151.71          -
1.29/1.37	c   conflict analysis:       0.00          0          0       0.00          -
1.29/1.37	c B&B Tree           :
1.29/1.37	c   number of runs   :          2
1.29/1.37	c   nodes            :          1
1.29/1.37	c   nodes (total)    :          2
1.29/1.37	c   nodes left       :          0
1.29/1.37	c   max depth        :          0
1.29/1.37	c   max depth (total):          0
1.29/1.37	c   backtracks       :          0 (0.0%)
1.29/1.37	c   delayed cutoffs  :          0
1.29/1.37	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.29/1.37	c   avg switch length:       2.00
1.29/1.37	c   switching time   :       0.00
1.29/1.37	c Solution           :
1.29/1.37	c   Solutions found  :          0 (0 improvements)
1.29/1.37	c   Primal Bound     : infeasible
1.29/1.37	c   Dual Bound       :          -
1.29/1.37	c   Gap              :       0.00 %
1.29/1.37	c   Root Dual Bound  :          -
1.29/1.38	c Time complete: 1.37.

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-1868042-1245115481/watcher-1868042-1245115481 -o /tmp/evaluation-result-1868042-1245115481/solver-1868042-1245115481 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868042-1245115481.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 1.06 3/64 32123
/proc/meminfo: memFree=1080440/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=4648 CPUtime=0
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 494 0 0 0 0 0 0 0 18 0 1 0 179145378 4759552 479 1992294400 4194304 7823515 548682068736 18446744073709551615 6115440 0 0 4096 0 0 0 0 17 1 0 0
/proc/32123/statm: 1162 485 319 886 0 272 0

[startup+0.0235989 s]
/proc/loadavg: 1.00 1.00 1.06 3/64 32123
/proc/meminfo: memFree=1080440/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=13324 CPUtime=0.02
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 2528 0 0 0 1 1 0 0 18 0 1 0 179145378 13643776 2156 1992294400 4194304 7823515 548682068736 18446744073709551615 4402248 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32123/statm: 3331 2165 435 886 0 2441 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 13324

[startup+0.101608 s]
/proc/loadavg: 1.00 1.00 1.06 3/64 32123
/proc/meminfo: memFree=1080440/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=13324 CPUtime=0.09
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 2914 0 0 0 8 1 0 0 17 0 1 0 179145378 13643776 2542 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32123/statm: 3331 2542 548 886 0 2441 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13324

[startup+0.301627 s]
/proc/loadavg: 1.00 1.00 1.06 3/64 32123
/proc/meminfo: memFree=1080440/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=13512 CPUtime=0.29
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 2967 0 0 0 27 2 0 0 18 0 1 0 179145378 13836288 2595 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32123/statm: 3378 2595 551 886 0 2488 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 13512

[startup+0.701667 s]
/proc/loadavg: 1.00 1.00 1.06 3/64 32123
/proc/meminfo: memFree=1080440/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=13512 CPUtime=0.69
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 2967 0 0 0 67 2 0 0 21 0 1 0 179145378 13836288 2595 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32123/statm: 3378 2595 551 886 0 2488 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 13512

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

[startup+1.10571 s]
/proc/loadavg: 1.00 1.00 1.06 2/65 32124
/proc/meminfo: memFree=1072176/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=13512 CPUtime=1.1
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 2969 0 0 0 106 4 0 0 25 0 1 0 179145378 13836288 2597 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32123/statm: 3378 2597 553 886 0 2488 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 13512

[startup+1.30173 s]
/proc/loadavg: 1.00 1.00 1.06 2/65 32124
/proc/meminfo: memFree=1072176/2055920 swapFree=4192812/4192956
[pid=32123] ppid=32121 vsize=14916 CPUtime=1.29
/proc/32123/stat : 32123 (pbscip.linux.x8) R 32121 32123 31844 0 -1 4194304 3376 0 0 0 125 4 0 0 25 0 1 0 179145378 15273984 2980 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32123/statm: 3729 2980 559 886 0 2839 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 14916

Child status: 0
Real time (s): 1.38605
CPU time (s): 1.38579
CPU user time (s): 1.3348
CPU system time (s): 0.050992
CPU usage (%): 99.981
Max. virtual memory (cumulated for all children) (KiB): 14916

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.3348
system time used= 0.050992
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3384
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 2

runsolver used 0.003999 second user time and 0.012998 second system time

The end

Launcher Data 

Begin job on node36 at 2009-06-16 03:24:41
IDJOB=1868042
IDBENCH=1188
IDSOLVER=683
FILE ID=node36/1868042-1245115481
PBS_JOBID= 9363652
Free space on /tmp= 66200 MiB

SOLVER NAME= SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1111220546.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-1868042-1245115481/watcher-1868042-1245115481 -o /tmp/evaluation-result-1868042-1245115481/solver-1868042-1245115481 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868042-1245115481.opb

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

MD5SUM BENCH= aeab1724c196459c6b33e6369a15ae92
RANDOM SEED=1457083418

node36.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.230
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.230
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:       1080856 kB
Buffers:         31792 kB
Cached:         878388 kB
SwapCached:          0 kB
Active:          76192 kB
Inactive:       847872 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1080856 kB
SwapTotal:     4192956 kB
SwapFree:      4192812 kB
Dirty:            9940 kB
Writeback:           0 kB
Mapped:          23696 kB
Slab:            37048 kB
Committed_AS:   153816 kB
PageTables:       1360 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= 66188 MiB
End job on node36 at 2009-06-16 03:24:42