Trace number 2664540

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
SCIPnone SCIP 1.2.1.2 without any LP solverUNSAT 3.00354 3.00428

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/web/
uclid_pb_benchmarks/normalized-cache.inv10.ucl.opb
MD5SUM449faf6379a77b0035cc1474243ef90a
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.118981
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables8937
Total number of constraints26319
Number of constraints which are clauses26047
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints272
Minimum length of a constraint1
Maximum length of a constraint9
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 17
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 62
Number of bits of the biggest sum of numbers6
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.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00	c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00	c 
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c reading problem <HOME/instance-2664540-1276330077.opb>
0.39/0.46	c original problem has 8937 variables (8937 bin, 0 int, 0 impl, 0 cont) and 26319 constraints
0.39/0.46	c problem read
0.39/0.47	c No objective function, only one solution is needed.
0.39/0.47	c presolving settings loaded
0.39/0.47	c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.59/0.61	c presolving:
1.19/1.20	c (round 1) 503 del vars, 530 del conss, 230 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 691346 impls, 0 clqs
1.19/1.29	c (round 2) 615 del vars, 1458 del conss, 316 chg bounds, 136 chg sides, 416 chg coeffs, 0 upgd conss, 692636 impls, 0 clqs
1.29/1.32	c (round 3) 622 del vars, 1569 del conss, 327 chg bounds, 136 chg sides, 420 chg coeffs, 0 upgd conss, 693203 impls, 0 clqs
1.29/1.35	c (round 4) 635 del vars, 1608 del conss, 332 chg bounds, 136 chg sides, 430 chg coeffs, 0 upgd conss, 693365 impls, 0 clqs
1.59/1.63	c (round 5) 635 del vars, 1617 del conss, 332 chg bounds, 136 chg sides, 430 chg coeffs, 24702 upgd conss, 693365 impls, 0 clqs
1.69/1.70	c presolving (6 rounds):
1.69/1.70	c  635 deleted vars, 1617 deleted constraints, 332 tightened bounds, 0 added holes, 136 changed sides, 430 changed coefficients
1.69/1.70	c  693365 implications, 0 cliques
1.69/1.70	c presolved problem has 8302 variables (8302 bin, 0 int, 0 impl, 0 cont) and 24702 constraints
1.69/1.70	c     272 constraints of type <knapsack>
1.69/1.70	c   24430 constraints of type <logicor>
1.69/1.70	c transformed objective value is always integral (scale: 1)
1.69/1.70	c Presolving Time: 0.98
1.69/1.70	c - non default parameters ----------------------------------------------------------------------
1.69/1.70	c # SCIP version 1.2.1.2
1.69/1.70	c 
1.69/1.70	c # frequency for displaying node information lines
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 100]
1.69/1.70	c display/freq = 10000
1.69/1.70	c 
1.69/1.70	c # maximal time in seconds to run
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.69/1.70	c limits/time = 1799.54
1.69/1.70	c 
1.69/1.70	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.69/1.70	c limits/memory = 1620
1.69/1.70	c 
1.69/1.70	c # solving stops, if the given number of solutions were found (-1: no limit)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.70	c limits/solutions = 1
1.69/1.70	c 
1.69/1.70	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c lp/solvefreq = -1
1.69/1.70	c 
1.69/1.70	c # maximal number of separation rounds per node (-1: unlimited)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 5]
1.69/1.70	c separating/maxrounds = 1
1.69/1.70	c 
1.69/1.70	c # maximal number of separation rounds in the root node (-1: unlimited)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.70	c separating/maxroundsroot = 5
1.69/1.70	c 
1.69/1.70	c # should presolving try to simplify inequalities
1.69/1.70	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.69/1.70	c constraints/linear/simplifyinequalities = TRUE
1.69/1.70	c 
1.69/1.70	c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.69/1.70	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.69/1.70	c constraints/knapsack/disaggregation = FALSE
1.69/1.70	c 
1.69/1.70	c # should presolving try to simplify knapsacks
1.69/1.70	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.69/1.70	c constraints/knapsack/simplifyinequalities = TRUE
1.69/1.70	c 
1.69/1.70	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.70	c presolving/probing/maxrounds = 0
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/coefdiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/coefdiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/coefdiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 30]
1.69/1.70	c heuristics/crossover/freq = -1
1.69/1.70	c 
1.69/1.70	c # number of nodes added to the contingent of the total nodes
1.69/1.70	c # [type: longint, range: [0,9223372036854775807], default: 500]
1.69/1.70	c heuristics/crossover/nodesofs = 750
1.69/1.70	c 
1.69/1.70	c # number of nodes without incumbent change that heuristic should wait
1.69/1.70	c # [type: longint, range: [0,9223372036854775807], default: 200]
1.69/1.70	c heuristics/crossover/nwaitingnodes = 100
1.69/1.70	c 
1.69/1.70	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.69/1.70	c # [type: real, range: [0,1], default: 0.1]
1.69/1.70	c heuristics/crossover/nodesquot = 0.15
1.69/1.70	c 
1.69/1.70	c # minimum percentage of integer variables that have to be fixed 
1.69/1.70	c # [type: real, range: [0,1], default: 0.666]
1.69/1.70	c heuristics/crossover/minfixingrate = 0.5
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 20]
1.69/1.70	c heuristics/feaspump/freq = -1
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/feaspump/maxlpiterofs = 2000
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/fracdiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/fracdiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/fracdiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/guideddiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/guideddiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/guideddiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/intdiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/intshifting/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/linesearchdiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/linesearchdiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c heuristics/nlp/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 20]
1.69/1.70	c heuristics/objpscostdiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to total iteration number
1.69/1.70	c # [type: real, range: [0,1], default: 0.01]
1.69/1.70	c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/objpscostdiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c heuristics/oneopt/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/pscostdiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/pscostdiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/pscostdiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.70	c heuristics/rens/freq = -1
1.69/1.70	c 
1.69/1.70	c # minimum percentage of integer variables that have to be fixable 
1.69/1.70	c # [type: real, range: [0,1], default: 0.5]
1.69/1.70	c heuristics/rens/minfixingrate = 0.3
1.69/1.70	c 
1.69/1.70	c # number of nodes added to the contingent of the total nodes
1.69/1.70	c # [type: longint, range: [0,9223372036854775807], default: 500]
1.69/1.70	c heuristics/rens/nodesofs = 2000
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 20]
1.69/1.70	c heuristics/rootsoldiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.69/1.70	c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/rootsoldiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c heuristics/rounding/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/shifting/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c heuristics/simplerounding/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.70	c heuristics/trivial/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c heuristics/trysol/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.70	c heuristics/veclendiving/freq = -1
1.69/1.70	c 
1.69/1.70	c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.70	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.70	c heuristics/veclendiving/maxlpiterquot = 0.075
1.69/1.70	c 
1.69/1.70	c # additional number of allowed LP iterations
1.69/1.70	c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.70	c heuristics/veclendiving/maxlpiterofs = 1500
1.69/1.70	c 
1.69/1.70	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.70	c heuristics/zirounding/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.70	c separating/cmir/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.70	c separating/flowcover/freq = -1
1.69/1.70	c 
1.69/1.70	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.69/1.70	c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.70	c separating/rapidlearning/freq = 0
1.69/1.70	c 
1.69/1.70	c -----------------------------------------------------------------------------------------------
1.69/1.70	c start solving
1.69/1.71	c 
1.69/1.74	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.69/1.74	c   1.1s|     1 |     2 |     0 |     - |  54M|   0 |   - |8302 |  24k|   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.89/2.90	c 
2.89/2.90	c SCIP Status        : problem is solved [infeasible]
2.89/2.90	c Solving Time (sec) : 2.24
2.89/2.90	c Solving Nodes      : 69
2.89/2.90	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
2.89/2.90	c Dual Bound         : +1.00000000000000e+20
2.89/2.90	c Gap                : 0.00 %
2.89/2.90	s UNSATISFIABLE
2.89/2.90	c SCIP Status        : problem is solved [infeasible]
2.89/2.90	c Solving Time       :       2.24
2.89/2.90	c Original Problem   :
2.89/2.90	c   Problem name     : HOME/instance-2664540-1276330077.opb
2.89/2.90	c   Variables        : 8937 (8937 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.90	c   Constraints      : 26319 initial, 26319 maximal
2.89/2.90	c Presolved Problem  :
2.89/2.90	c   Problem name     : t_HOME/instance-2664540-1276330077.opb
2.89/2.90	c   Variables        : 8302 (8302 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.90	c   Constraints      : 24702 initial, 24712 maximal
2.89/2.90	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.89/2.90	c   trivial          :       0.01         30          0          0          0          0          0          0          0
2.89/2.90	c   dualfix          :       0.02          0          0          0          0          0          0          0          0
2.89/2.90	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.89/2.90	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.89/2.90	c   implics          :       0.07          0        284          0          0          0          0          0          0
2.89/2.90	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.89/2.90	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
2.89/2.90	c   linear           :       0.68        320          1          0        332          0       1617        136        430
2.89/2.90	c   logicor          :       0.11          0          0          0          0          0          0          0          0
2.89/2.90	c   root node        :          -       4312          -          -       4312          -          -          -          -
2.89/2.90	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.89/2.90	c   integral         :          0          0          0          0          0          0          0          0          0          0
2.89/2.90	c   knapsack         :        272          0        988          0         58          0          0          0          0          0
2.89/2.90	c   logicor          :      24430+         0        925          0         58         13      24662          0          0          0
2.89/2.90	c   countsols        :          0          0          0          0         58          0          0          0          0          0
2.89/2.90	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.89/2.90	c   integral         :       0.00       0.00       0.00       0.00       0.00
2.89/2.90	c   knapsack         :       0.01       0.00       0.01       0.00       0.00
2.89/2.90	c   logicor          :       0.84       0.00       0.36       0.00       0.48
2.89/2.90	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.89/2.90	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.89/2.90	c   vbounds          :       0.00          1          0          0
2.89/2.90	c   rootredcost      :       0.00          0          0          0
2.89/2.90	c   pseudoobj        :       0.00          0          0          0
2.89/2.90	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.89/2.90	c   propagation      :       0.00         13         11         15        6.2          2       10.0          -
2.89/2.90	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.89/2.90	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.89/2.90	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.89/2.90	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.89/2.90	c   applied globally :          -          -          -         15        3.7          -          -          -
2.89/2.90	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.89/2.90	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.89/2.90	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
2.89/2.90	c   redcost          :       0.00          0          0          0          0          0
2.89/2.90	c   impliedbounds    :       0.00          0          0          0          0          0
2.89/2.90	c   intobj           :       0.00          0          0          0          0          0
2.89/2.90	c   cgmip            :       0.00          0          0          0          0          0
2.89/2.90	c   gomory           :       0.00          0          0          0          0          0
2.89/2.90	c   strongcg         :       0.00          0          0          0          0          0
2.89/2.90	c   cmir             :       0.00          0          0          0          0          0
2.89/2.90	c   flowcover        :       0.00          0          0          0          0          0
2.89/2.90	c   clique           :       0.00          0          0          0          0          0
2.89/2.90	c   zerohalf         :       0.00          0          0          0          0          0
2.89/2.90	c   mcf              :       0.00          0          0          0          0          0
2.89/2.90	c   rapidlearning    :       0.00          0          0          0          0          0
2.89/2.90	c Pricers            :       Time      Calls       Vars
2.89/2.90	c   problem variables:       0.00          0          0
2.89/2.90	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.89/2.90	c   relpscost        :       0.00          0          0          0          0          0          0
2.89/2.90	c   pscost           :       0.00          0          0          0          0          0          0
2.89/2.90	c   inference        :       0.11         58          0          0          0          0        116
2.89/2.90	c   mostinf          :       0.00          0          0          0          0          0          0
2.89/2.90	c   leastinf         :       0.00          0          0          0          0          0          0
2.89/2.90	c   fullstrong       :       0.00          0          0          0          0          0          0
2.89/2.90	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.89/2.90	c   random           :       0.00          0          0          0          0          0          0
2.89/2.90	c Primal Heuristics  :       Time      Calls      Found
2.89/2.90	c   LP solutions     :       0.00          -          0
2.89/2.90	c   pseudo solutions :       0.00          -          0
2.89/2.90	c   trivial          :       0.01          1          0
2.89/2.90	c   simplerounding   :       0.00          0          0
2.89/2.90	c   zirounding       :       0.00          0          0
2.89/2.90	c   rounding         :       0.00          0          0
2.89/2.90	c   shifting         :       0.00          0          0
2.89/2.90	c   intshifting      :       0.00          0          0
2.89/2.90	c   oneopt           :       0.00          0          0
2.89/2.90	c   twoopt           :       0.00          0          0
2.89/2.90	c   fixandinfer      :       0.00          0          0
2.89/2.90	c   feaspump         :       0.00          0          0
2.89/2.90	c   coefdiving       :       0.00          0          0
2.89/2.90	c   pscostdiving     :       0.00          0          0
2.89/2.90	c   fracdiving       :       0.00          0          0
2.89/2.90	c   veclendiving     :       0.00          0          0
2.89/2.90	c   intdiving        :       0.00          0          0
2.89/2.90	c   actconsdiving    :       0.00          0          0
2.89/2.90	c   objpscostdiving  :       0.00          0          0
2.89/2.90	c   rootsoldiving    :       0.00          0          0
2.89/2.90	c   linesearchdiving :       0.00          0          0
2.89/2.90	c   guideddiving     :       0.00          0          0
2.89/2.90	c   octane           :       0.00          0          0
2.89/2.90	c   rens             :       0.00          0          0
2.89/2.90	c   rins             :       0.00          0          0
2.89/2.90	c   localbranching   :       0.00          0          0
2.89/2.90	c   mutation         :       0.00          0          0
2.89/2.90	c   crossover        :       0.00          0          0
2.89/2.90	c   dins             :       0.00          0          0
2.89/2.90	c   undercover       :       0.00          0          0
2.89/2.90	c   nlp              :       0.00          0          0
2.89/2.90	c   trysol           :       0.00          0          0
2.89/2.90	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.89/2.90	c   primal LP        :       0.00          0          0       0.00          -
2.89/2.90	c   dual LP          :       0.00          0          0       0.00          -
2.89/2.90	c   lex dual LP      :       0.00          0          0       0.00          -
2.89/2.90	c   barrier LP       :       0.00          0          0       0.00          -
2.89/2.90	c   diving/probing LP:       0.00          0          0       0.00          -
2.89/2.90	c   strong branching :       0.00          0          0       0.00          -
2.89/2.90	c     (at root node) :          -          0          0       0.00          -
2.89/2.90	c   conflict analysis:       0.00          0          0       0.00          -
2.89/2.90	c B&B Tree           :
2.89/2.90	c   number of runs   :          1
2.89/2.90	c   nodes            :         69
2.89/2.90	c   nodes (total)    :         69
2.89/2.90	c   nodes left       :          0
2.89/2.90	c   max depth        :         42
2.89/2.90	c   max depth (total):         42
2.89/2.90	c   backtracks       :         18 (26.1%)
2.89/2.90	c   delayed cutoffs  :         48
2.89/2.90	c   repropagations   :         69 (6479 domain reductions, 2 cutoffs)
2.89/2.90	c   avg switch length:       4.06
2.89/2.90	c   switching time   :       0.21
2.89/2.90	c Solution           :
2.89/2.90	c   Solutions found  :          0 (0 improvements)
2.89/2.90	c   Primal Bound     : infeasible
2.89/2.90	c   Dual Bound       :          -
2.89/2.90	c   Gap              :       0.00 %
2.89/2.90	c   Root Dual Bound  : +0.00000000000000e+00
2.89/2.90	c   Root Iterations  :          0
2.99/3.00	c Time complete: 2.99.

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-2664540-1276330077/watcher-2664540-1276330077 -o /tmp/evaluation-result-2664540-1276330077/solver-2664540-1276330077 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664540-1276330077.opb -t 1800 -m 1800 

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.26 1.05 1.02 3/106 12281
/proc/meminfo: memFree=1839188/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=5552 CPUtime=0
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 810 0 0 0 0 0 0 0 19 0 1 0 8611633 5685248 732 1992294400 4194304 7136930 140733884874512 18446744073709551615 6346856 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/12281/statm: 1388 741 243 719 0 667 0

[startup+0.0603449 s]
/proc/loadavg: 1.26 1.05 1.02 3/106 12281
/proc/meminfo: memFree=1839188/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=10484 CPUtime=0.05
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 2089 0 0 0 5 0 0 0 19 0 1 0 8611633 10735616 2011 1992294400 4194304 7136930 140733884874512 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/12281/statm: 2621 2011 268 719 0 1900 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 10484

[startup+0.100348 s]
/proc/loadavg: 1.26 1.05 1.02 3/106 12281
/proc/meminfo: memFree=1839188/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=13072 CPUtime=0.09
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 2619 0 0 0 8 1 0 0 19 0 1 0 8611633 13385728 2541 1992294400 4194304 7136930 140733884874512 18446744073709551615 6164672 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/12281/statm: 3268 2551 268 719 0 2547 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13072

[startup+0.300368 s]
/proc/loadavg: 1.26 1.05 1.02 3/106 12281
/proc/meminfo: memFree=1839188/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=19668 CPUtime=0.28
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 4411 0 0 0 27 1 0 0 20 0 1 0 8611633 20140032 4333 1992294400 4194304 7136930 140733884874512 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/12281/statm: 4917 4333 268 719 0 4196 0
Current children cumulated CPU time (s) 0.28
Current children cumulated vsize (KiB) 19668

[startup+0.700409 s]
/proc/loadavg: 1.26 1.05 1.02 3/106 12281
/proc/meminfo: memFree=1839188/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=57348 CPUtime=0.69
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 13781 0 0 0 64 5 0 0 20 0 1 0 8611633 58724352 13321 1992294400 4194304 7136930 140733884874512 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/12281/statm: 14337 13321 341 719 0 13616 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 57348

[startup+1.50049 s]
/proc/loadavg: 1.26 1.05 1.02 2/107 12282
/proc/meminfo: memFree=1770856/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=90712 CPUtime=1.49
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 23928 0 0 0 132 17 0 0 23 0 1 0 8611633 92889088 21654 1992294400 4194304 7136930 140733884874512 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/12281/statm: 22678 21654 356 719 0 21957 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 90712

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

[startup+2.30057 s]
/proc/loadavg: 1.26 1.05 1.02 2/107 12282
/proc/meminfo: memFree=1750768/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=95232 CPUtime=2.29
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 27564 0 0 0 208 21 0 0 25 0 1 0 8611633 97517568 22775 1992294400 4194304 7136930 140733884874512 18446744073709551615 5966370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/12281/statm: 23808 22775 393 719 0 23087 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 95232

[startup+2.70061 s]
/proc/loadavg: 1.26 1.05 1.02 2/107 12282
/proc/meminfo: memFree=1750768/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=95704 CPUtime=2.69
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 27665 0 0 0 248 21 0 0 25 0 1 0 8611633 98000896 22876 1992294400 4194304 7136930 140733884874512 18446744073709551615 5966370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/12281/statm: 23926 22876 393 719 0 23205 0
Current children cumulated CPU time (s) 2.69
Current children cumulated vsize (KiB) 95704

[startup+2.90063 s]
/proc/loadavg: 1.26 1.05 1.02 2/107 12282
/proc/meminfo: memFree=1750768/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=95704 CPUtime=2.89
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 27665 0 0 0 268 21 0 0 25 0 1 0 8611633 98000896 22876 1992294400 4194304 7136930 140733884874512 18446744073709551615 4212320 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/12281/statm: 23926 22876 393 719 0 23205 0
Current children cumulated CPU time (s) 2.89
Current children cumulated vsize (KiB) 95704

[startup+3.00064 s]
/proc/loadavg: 1.26 1.05 1.02 2/107 12282
/proc/meminfo: memFree=1750768/2059040 swapFree=4136244/4192956
[pid=12281] ppid=12279 vsize=28992 CPUtime=2.99
/proc/12281/stat : 12281 (pbscip.linux.x8) R 12279 12281 10523 0 -1 4202496 27671 0 0 0 277 22 0 0 25 0 1 0 8611633 29687808 6606 1992294400 4194304 7136930 140733884874512 18446744073709551615 4333616 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/12281/statm: 7248 6606 399 719 0 6527 0
Current children cumulated CPU time (s) 2.99
Current children cumulated vsize (KiB) 28992

Child status: 0
Real time (s): 3.00428
CPU time (s): 3.00354
CPU user time (s): 2.77858
CPU system time (s): 0.224965
CPU usage (%): 99.9753
Max. virtual memory (cumulated for all children) (KiB): 95704

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

runsolver used 0.007998 second user time and 0.021996 second system time

The end

Launcher Data 

Begin job on node002 at 2010-06-12 10:07:57
IDJOB=2664540
IDBENCH=1446
IDSOLVER=1167
FILE ID=node002/2664540-1276330077
PBS_JOBID= 11173165
Free space on /tmp= 62396 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/web/uclid_pb_benchmarks/normalized-cache.inv10.ucl.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.none -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2664540-1276330077/watcher-2664540-1276330077 -o /tmp/evaluation-result-2664540-1276330077/solver-2664540-1276330077 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664540-1276330077.opb -t 1800 -m 1800

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

MD5SUM BENCH= 449faf6379a77b0035cc1474243ef90a
RANDOM SEED=2138793104

node002.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/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.242
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
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 constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.48
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.242
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
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 constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.36
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1839716 kB
Buffers:         14012 kB
Cached:         120888 kB
SwapCached:      17024 kB
Active:         110980 kB
Inactive:        43800 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1839716 kB
SwapTotal:     4192956 kB
SwapFree:      4136244 kB
Dirty:            4556 kB
Writeback:           8 kB
AnonPages:       10776 kB
Mapped:           9172 kB
Slab:            42876 kB
PageTables:       3924 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180920 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62396 MiB
End job on node002 at 2010-06-12 10:08:00