Trace number 1883983

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.2UNSAT 0.157975 0.159099

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
roussel/normalized-pigeon-clauses-11-10.opb
MD5SUM5f6dec86c5ff7bb6eb57b379c0139788
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 benchmark0.121981
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables110
Total number of constraints561
Number of constraints which are clauses561
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 constraint10
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 11
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.01	c SCIP version 1.1.0.7
0.00/0.01	c LP-Solver Clp 1.8.2
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c read problem <HOME/instance-1883983-1245239447.opb>
0.00/0.01	c original problem has 110 variables (110 bin, 0 int, 0 impl, 0 cont) and 561 constraints
0.01/0.02	c No objective function, only one solution is needed.
0.01/0.02	c start presolving problem
0.01/0.02	c presolving:
0.01/0.04	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 561 upgd conss, 1100 impls, 0 clqs
0.01/0.04	c presolving (2 rounds):
0.01/0.04	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04	c  1100 implications, 0 cliques
0.01/0.04	c presolved problem has 110 variables (110 bin, 0 int, 0 impl, 0 cont) and 561 constraints
0.01/0.04	c     561 constraints of type <logicor>
0.01/0.04	c transformed objective value is always integral (scale: 1)
0.01/0.04	c Presolving Time: 0.02
0.01/0.04	c PURESAT
0.01/0.04	c -----------------------------------------------------------------------------------------------
0.01/0.04	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04	c separating/flowcover/freq = c -1
0.01/0.04	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04	c separating/cmir/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/veclendiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.01/0.04	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/veclendiving/freq = c -1
0.01/0.04	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04	c heuristics/simplerounding/freq = c -1
0.01/0.04	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/shifting/freq = c -1
0.01/0.04	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04	c heuristics/rounding/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.04	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.01/0.04	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04	c heuristics/rootsoldiving/freq = c -1
0.01/0.04	c # number of nodes added to the contingent of the total nodes
0.01/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04	c heuristics/rens/nodesofs = c 2000
0.01/0.04	c # minimum percentage of integer variables that have to be fixable 
0.01/0.04	c # [type: real, range: [0,1], default: 0.5]
0.01/0.04	c heuristics/rens/minfixingrate = c 0.3
0.01/0.04	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04	c heuristics/rens/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.01/0.04	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/pscostdiving/freq = c -1
0.01/0.04	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04	c heuristics/oneopt/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.04	c # [type: real, range: [0,1], default: 0.01]
0.01/0.04	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.01/0.04	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04	c heuristics/objpscostdiving/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.01/0.04	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/linesearchdiving/freq = c -1
0.01/0.04	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/intshifting/freq = c -1
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/intdiving/maxlpiterquot = c 0.075
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/guideddiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.01/0.04	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/guideddiving/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/fracdiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.01/0.04	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/fracdiving/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/feaspump/maxlpiterofs = c 2000
0.01/0.04	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04	c heuristics/feaspump/freq = c -1
0.01/0.04	c # minimum percentage of integer variables that have to be fixed 
0.01/0.04	c # [type: real, range: [0,1], default: 0.666]
0.01/0.04	c heuristics/crossover/minfixingrate = c 0.5
0.01/0.04	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.04	c # [type: real, range: [0,1], default: 0.1]
0.01/0.04	c heuristics/crossover/nodesquot = c 0.15
0.01/0.04	c # number of nodes without incumbent change that heuristic should wait
0.01/0.04	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.04	c heuristics/crossover/nwaitingnodes = c 100
0.01/0.04	c # number of nodes added to the contingent of the total nodes
0.01/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04	c heuristics/crossover/nodesofs = c 750
0.01/0.04	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.04	c heuristics/crossover/freq = c -1
0.01/0.04	c # additional number of allowed LP iterations
0.01/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04	c heuristics/coefdiving/maxlpiterofs = c 1500
0.01/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.01/0.04	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04	c heuristics/coefdiving/freq = c -1
0.01/0.04	c # priority of node selection rule <dfs> in standard mode
0.01/0.04	c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04	c nodeselection/dfs/stdpriority = c 1000000
0.01/0.04	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04	c presolving/probing/maxrounds = c 0
0.01/0.04	c # should presolving try to simplify knapsacks
0.01/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04	c constraints/knapsack/simplifyinequalities = c TRUE
0.01/0.04	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.04	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.04	c constraints/knapsack/disaggregation = c FALSE
0.01/0.04	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04	c constraints/knapsack/maxnumcardlift = c 0
0.01/0.04	c # should presolving try to simplify inequalities
0.01/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04	c constraints/linear/simplifyinequalities = c TRUE
0.01/0.04	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04	c separating/maxroundsroot = c 5
0.01/0.04	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.04	c separating/maxrounds = c 1
0.01/0.04	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.01/0.04	c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04	c lp/pricing = c a
0.01/0.04	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04	c lp/solvefreq = c 0
0.01/0.04	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04	c limits/solutions = c 1
0.01/0.04	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04	c limits/memory = c 1620
0.01/0.04	c # maximal time in seconds to run
0.01/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04	c limits/time = c 1791
0.01/0.04	c # frequency for displaying node information lines
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04	c display/freq = c 10000
0.01/0.04	c # should enforcement of pseudo solution be disabled?
0.01/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04	c constraints/disableenfops = c TRUE
0.01/0.04	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04	c constraints/agelimit = c 1
0.01/0.04	c # should binary conflicts be preferred?
0.01/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04	c conflict/preferbinary = c TRUE
0.01/0.04	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04	c conflict/interconss = c 0
0.01/0.04	c -----------------------------------------------------------------------------------------------
0.01/0.04	c start solving problem
0.01/0.04	c 
0.01/0.04	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.01/0.04	c   0.0s|     1 |     0 |    22 | 980k|   0 |  22 | 110 | 561 | 561 | 110 | 561 |   0 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.01/0.05	c   0.0s|     1 |     0 |    74 | 981k|   0 |  22 | 110 | 561 | 561 | 110 | 563 |   2 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.01/0.06	c   0.0s|     1 |     0 |   123 | 984k|   0 |  20 | 110 | 561 | 561 | 110 | 566 |   5 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.01/0.08	c   0.1s|     1 |     0 |   145 | 993k|   0 |  21 | 110 | 561 | 561 | 110 | 569 |   8 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   156 |1013k|   0 |   6 | 110 | 561 | 561 | 110 | 574 |  13 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.09/0.11	c   0.1s|     1 |     0 |   165 |1028k|   0 |  21 | 110 | 561 | 561 | 110 | 576 |  15 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.09/0.14	c   0.1s|     1 |     0 |   183 |1026k|   0 |  18 | 110 | 561 | 561 | 110 | 576 |  15 |   0 |  20 | 1.100000e+01 |      --      |    Inf 
0.09/0.15	c   0.1s|     1 |     0 |   199 |1024k|   0 |   - | 110 | 561 | 561 | 110 | 576 |  15 |   0 |  29 |      --      |      --      |   0.00%
0.09/0.15	c   0.1s|     1 |     0 |   199 |1024k|   0 |   - | 110 | 561 | 561 | 110 | 576 |  15 |   0 |  29 |      --      |      --      |   0.00%
0.09/0.15	c 
0.09/0.15	c SCIP Status        : problem is solved [infeasible]
0.09/0.15	c Solving Time (sec) : 0.12
0.09/0.15	c Solving Nodes      : 1
0.09/0.15	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.09/0.15	c Dual Bound         : +1.00000000000000e+20
0.09/0.15	c Gap                : 0.00 %
0.09/0.15	c NODE         1
0.09/0.15	c DUAL BOUND   1e+20
0.09/0.15	c PRIMAL BOUND 1e+20
0.09/0.15	c GAP          0
0.09/0.15	s UNSATISFIABLE
0.09/0.15	c SCIP Status        : problem is solved [infeasible]
0.09/0.15	c Solving Time       :       0.12
0.09/0.15	c Original Problem   :
0.09/0.15	c   Problem name     : HOME/instance-1883983-1245239447.opb
0.09/0.15	c   Variables        : 110 (110 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.15	c   Constraints      : 561 initial, 561 maximal
0.09/0.15	c Presolved Problem  :
0.09/0.15	c   Problem name     : t_HOME/instance-1883983-1245239447.opb
0.09/0.15	c   Variables        : 110 (110 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.15	c   Constraints      : 561 initial, 561 maximal
0.09/0.15	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.09/0.15	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.09/0.15	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.09/0.15	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.09/0.15	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.09/0.15	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.09/0.15	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.09/0.15	c   logicor          :       0.01          0          0          0          0          0          0          0          0
0.09/0.15	c   root node        :          -          9          -          -          9          -          -          -          -
0.09/0.15	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.09/0.15	c   integral         :          0          0          0          2          0          0          9          0          0          0
0.09/0.15	c   logicor          :        561          5          1          0          0          0          0          0          0          0
0.09/0.15	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.09/0.15	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.09/0.15	c   integral         :       0.03       0.00       0.00       0.03       0.00
0.09/0.15	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.09/0.15	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.09/0.15	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.09/0.15	c   rootredcost      :       0.00          0          0          0
0.09/0.15	c   pseudoobj        :       0.00          5          1          0
0.09/0.15	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.09/0.15	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.09/0.15	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.15	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.15	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.15	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.09/0.15	c   applied globally :          -          -          -          0        0.0          -          -          -
0.09/0.15	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.09/0.15	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.09/0.15	c   cut pool         :       0.00          4          -          -          1          -    (maximal pool size: 45)
0.09/0.15	c   redcost          :       0.00          5          0          0          0          0
0.09/0.15	c   impliedbounds    :       0.00          5          0          0          0          0
0.09/0.15	c   intobj           :       0.00          0          0          0          0          0
0.09/0.15	c   gomory           :       0.01          5          0          0        587          0
0.09/0.15	c   strongcg         :       0.04          5          0          0        587          0
0.09/0.15	c   cmir             :       0.00          0          0          0          0          0
0.09/0.15	c   flowcover        :       0.00          0          0          0          0          0
0.09/0.15	c   clique           :       0.00          5          0          0         11          0
0.09/0.15	c   zerohalf         :       0.00          0          0          0          0          0
0.09/0.15	c   mcf              :       0.00          1          0          0          0          0
0.09/0.15	c Pricers            :       Time      Calls       Vars
0.09/0.15	c   problem variables:       0.00          0          0
0.09/0.15	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.09/0.15	c   relpscost        :       0.03          2          0          9          0          0          0
0.09/0.15	c   pscost           :       0.00          0          0          0          0          0          0
0.09/0.15	c   inference        :       0.00          0          0          0          0          0          0
0.09/0.15	c   mostinf          :       0.00          0          0          0          0          0          0
0.09/0.15	c   leastinf         :       0.00          0          0          0          0          0          0
0.09/0.15	c   fullstrong       :       0.00          0          0          0          0          0          0
0.09/0.15	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.09/0.15	c   random           :       0.00          0          0          0          0          0          0
0.09/0.15	c Primal Heuristics  :       Time      Calls      Found
0.09/0.15	c   LP solutions     :       0.00          -          0
0.09/0.15	c   pseudo solutions :       0.00          -          0
0.09/0.15	c   simplerounding   :       0.00          0          0
0.09/0.15	c   rounding         :       0.00          0          0
0.09/0.15	c   shifting         :       0.00          0          0
0.09/0.15	c   intshifting      :       0.00          0          0
0.09/0.15	c   oneopt           :       0.00          0          0
0.09/0.15	c   fixandinfer      :       0.00          0          0
0.09/0.15	c   feaspump         :       0.00          0          0
0.09/0.15	c   coefdiving       :       0.00          0          0
0.09/0.15	c   pscostdiving     :       0.00          0          0
0.09/0.15	c   fracdiving       :       0.00          0          0
0.09/0.15	c   veclendiving     :       0.00          0          0
0.09/0.15	c   intdiving        :       0.00          0          0
0.09/0.15	c   actconsdiving    :       0.00          0          0
0.09/0.15	c   objpscostdiving  :       0.00          0          0
0.09/0.15	c   rootsoldiving    :       0.00          0          0
0.09/0.15	c   linesearchdiving :       0.00          0          0
0.09/0.15	c   guideddiving     :       0.00          0          0
0.09/0.15	c   octane           :       0.00          0          0
0.09/0.15	c   rens             :       0.00          0          0
0.09/0.15	c   rins             :       0.00          0          0
0.09/0.15	c   localbranching   :       0.00          0          0
0.09/0.15	c   mutation         :       0.00          0          0
0.09/0.15	c   crossover        :       0.00          0          0
0.09/0.15	c   dins             :       0.00          0          0
0.09/0.15	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.09/0.15	c   primal LP        :       0.00          0          0       0.00          -
0.09/0.15	c   dual LP          :       0.01          8        199      24.88   19900.00
0.09/0.15	c   barrier LP       :       0.00          0          0       0.00          -
0.09/0.15	c   diving/probing LP:       0.00          0          0       0.00          -
0.09/0.15	c   strong branching :       0.03         29        318      10.97   10600.00
0.09/0.15	c     (at root node) :          -         29        318      10.97          -
0.09/0.15	c   conflict analysis:       0.00          0          0       0.00          -
0.09/0.15	c B&B Tree           :
0.09/0.15	c   number of runs   :          1
0.09/0.15	c   nodes            :          1
0.09/0.15	c   nodes (total)    :          1
0.09/0.15	c   nodes left       :          0
0.09/0.15	c   max depth        :          0
0.09/0.15	c   max depth (total):          0
0.09/0.15	c   backtracks       :          0 (0.0%)
0.09/0.15	c   delayed cutoffs  :          0
0.09/0.15	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.09/0.15	c   avg switch length:       2.00
0.09/0.15	c   switching time   :       0.00
0.09/0.15	c Solution           :
0.09/0.15	c   Solutions found  :          0 (0 improvements)
0.09/0.15	c   Primal Bound     : infeasible
0.09/0.15	c   Dual Bound       :          -
0.09/0.15	c   Gap              :       0.00 %
0.09/0.15	c   Root Dual Bound  :          -
0.09/0.15	c Time complete: 0.15.

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-1883983-1245239447/watcher-1883983-1245239447 -o /tmp/evaluation-result-1883983-1245239447/solver-1883983-1245239447 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1883983-1245239447.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: 0.96 0.96 0.91 3/64 3395
/proc/meminfo: memFree=1836488/2055920 swapFree=4181500/4192956
[pid=3395] ppid=3393 vsize=5812 CPUtime=0
/proc/3395/stat : 3395 (pbscip.linux.x8) R 3393 3395 3162 0 -1 4194304 525 0 0 0 0 0 0 0 18 0 1 0 191544493 5951488 509 1992294400 4194304 9342243 548682068736 18446744073709551615 8160080 0 0 4096 0 0 0 0 17 1 0 0
/proc/3395/statm: 1454 516 345 1256 0 193 0

[startup+0.0210351 s]
/proc/loadavg: 0.96 0.96 0.91 3/64 3395
/proc/meminfo: memFree=1836488/2055920 swapFree=4181500/4192956
[pid=3395] ppid=3393 vsize=11112 CPUtime=0.01
/proc/3395/stat : 3395 (pbscip.linux.x8) R 3393 3395 3162 0 -1 4194304 2138 0 0 0 1 0 0 0 18 0 1 0 191544493 11378688 1768 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3395/statm: 2778 1772 411 1256 0 1517 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 11112

[startup+0.101042 s]
/proc/loadavg: 0.96 0.96 0.91 3/64 3395
/proc/meminfo: memFree=1836488/2055920 swapFree=4181500/4192956
[pid=3395] ppid=3393 vsize=16296 CPUtime=0.09
/proc/3395/stat : 3395 (pbscip.linux.x8) R 3393 3395 3162 0 -1 4194304 3133 0 0 0 8 1 0 0 17 0 1 0 191544493 16687104 2763 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3395/statm: 4074 2763 634 1256 0 2813 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 16296

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

Child status: 0
Real time (s): 0.159099
CPU time (s): 0.157975
CPU user time (s): 0.143978
CPU system time (s): 0.013997
CPU usage (%): 99.2936
Max. virtual memory (cumulated for all children) (KiB): 16296

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.143978
system time used= 0.013997
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3249
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= 0

runsolver used 0.003999 second user time and 0.009998 second system time

The end

Launcher Data 

Begin job on node25 at 2009-06-17 13:50:47
IDJOB=1883983
IDBENCH=2594
IDSOLVER=684
FILE ID=node25/1883983-1245239447
PBS_JOBID= 9372313
Free space on /tmp= 66312 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
BENCH NAME= PB06/final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/roussel/normalized-pigeon-clauses-11-10.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-1883983-1245239447/watcher-1883983-1245239447 -o /tmp/evaluation-result-1883983-1245239447/solver-1883983-1245239447 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1883983-1245239447.opb

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

MD5SUM BENCH= 5f6dec86c5ff7bb6eb57b379c0139788
RANDOM SEED=1667239794

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

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

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


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1836968 kB
Buffers:         31192 kB
Cached:         110008 kB
SwapCached:       5884 kB
Active:          48156 kB
Inactive:       101548 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1836968 kB
SwapTotal:     4192956 kB
SwapFree:      4181500 kB
Dirty:           11816 kB
Writeback:           0 kB
Mapped:          13644 kB
Slab:            55268 kB
Committed_AS:   227364 kB
PageTables:       1464 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66300 MiB
End job on node25 at 2009-06-17 13:50:48