Trace number 2684534

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 1.3178 1.31764

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j30/
normalized-j3046_4-unsat.opb
MD5SUM194fc06f7c21580ad88e7dc6177066b4
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
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.064989
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables3968
Total number of constraints13430
Number of constraints which are clauses13178
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints252
Minimum length of a constraint1
Maximum length of a constraint30
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 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 187
Number of bits of the biggest sum of numbers8
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-2684534-1278432541.opb>
0.19/0.24	c original problem has 3968 variables (3968 bin, 0 int, 0 impl, 0 cont) and 13430 constraints
0.19/0.24	c problem read
0.19/0.24	c No objective function, only one solution is needed.
0.19/0.24	c presolving settings loaded
0.19/0.24	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.29/0.31	c presolving:
0.69/0.79	c (round 1) 1414 del vars, 3678 del conss, 1043 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 598348 impls, 0 clqs
0.89/0.97	c (round 2) 2752 del vars, 8895 del conss, 2237 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 606296 impls, 0 clqs
1.00/1.01	c (round 3) 3070 del vars, 10632 del conss, 2401 chg bounds, 56 chg sides, 49 chg coeffs, 0 upgd conss, 608748 impls, 0 clqs
1.00/1.03	c (round 4) 3276 del vars, 11219 del conss, 2524 chg bounds, 75 chg sides, 68 chg coeffs, 0 upgd conss, 611604 impls, 0 clqs
1.00/1.04	c (round 5) 3402 del vars, 11758 del conss, 2607 chg bounds, 79 chg sides, 72 chg coeffs, 0 upgd conss, 613169 impls, 0 clqs
1.00/1.04	c (round 6) 3478 del vars, 11993 del conss, 2664 chg bounds, 98 chg sides, 90 chg coeffs, 0 upgd conss, 613593 impls, 0 clqs
1.00/1.05	c (round 7) 3499 del vars, 12084 del conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
1.00/1.05	c (round 8) 3499 del vars, 12110 del conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
1.00/1.10	c (round 9) 3499 del vars, 12113 del conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 1320 upgd conss, 613781 impls, 0 clqs
1.10/1.13	c (round 10) 3499 del vars, 12113 del conss, 2669 chg bounds, 142 chg sides, 306 chg coeffs, 1320 upgd conss, 614581 impls, 66 clqs
1.10/1.16	c (round 11) 3499 del vars, 12116 del conss, 2669 chg bounds, 161 chg sides, 460 chg coeffs, 1320 upgd conss, 614653 impls, 85 clqs
1.10/1.17	c (round 12) 3499 del vars, 12116 del conss, 2669 chg bounds, 164 chg sides, 517 chg coeffs, 1320 upgd conss, 614685 impls, 101 clqs
1.10/1.18	c (round 13) 3499 del vars, 12116 del conss, 2669 chg bounds, 166 chg sides, 548 chg coeffs, 1320 upgd conss, 614729 impls, 110 clqs
1.10/1.18	c (round 14) 3499 del vars, 12116 del conss, 2669 chg bounds, 166 chg sides, 556 chg coeffs, 1320 upgd conss, 614729 impls, 115 clqs
1.10/1.19	c (round 15) 3499 del vars, 12116 del conss, 2669 chg bounds, 166 chg sides, 557 chg coeffs, 1320 upgd conss, 614729 impls, 118 clqs
1.10/1.19	c presolving (16 rounds):
1.10/1.19	c  3499 deleted vars, 12116 deleted constraints, 2669 tightened bounds, 0 added holes, 166 changed sides, 557 changed coefficients
1.10/1.19	c  614729 implications, 118 cliques
1.10/1.19	c presolved problem has 469 variables (469 bin, 0 int, 0 impl, 0 cont) and 1314 constraints
1.10/1.19	c     191 constraints of type <knapsack>
1.10/1.19	c    1123 constraints of type <logicor>
1.10/1.19	c transformed objective value is always integral (scale: 1)
1.10/1.19	c Presolving Time: 0.81
1.10/1.19	c - non default parameters ----------------------------------------------------------------------
1.10/1.19	c # SCIP version 1.2.1.2
1.10/1.19	c 
1.10/1.19	c # frequency for displaying node information lines
1.10/1.19	c # [type: int, range: [-1,2147483647], default: 100]
1.10/1.19	c display/freq = 10000
1.10/1.19	c 
1.10/1.19	c # maximal time in seconds to run
1.10/1.19	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.19	c limits/time = 1799.76
1.10/1.19	c 
1.10/1.19	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.10/1.19	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.19	c limits/memory = 1620
1.10/1.19	c 
1.10/1.19	c # solving stops, if the given number of solutions were found (-1: no limit)
1.10/1.19	c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.19	c limits/solutions = 1
1.10/1.19	c 
1.10/1.19	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.10/1.19	c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.19	c lp/solvefreq = -1
1.10/1.19	c 
1.10/1.19	c # maximal number of separation rounds per node (-1: unlimited)
1.10/1.19	c # [type: int, range: [-1,2147483647], default: 5]
1.10/1.19	c separating/maxrounds = 1
1.10/1.19	c 
1.10/1.19	c # maximal number of separation rounds in the root node (-1: unlimited)
1.10/1.19	c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.19	c separating/maxroundsroot = 5
1.10/1.19	c 
1.10/1.19	c # should presolving try to simplify inequalities
1.10/1.19	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.19	c constraints/linear/simplifyinequalities = TRUE
1.10/1.19	c 
1.10/1.19	c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.10/1.19	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.10/1.19	c constraints/knapsack/disaggregation = FALSE
1.10/1.19	c 
1.10/1.19	c # should presolving try to simplify knapsacks
1.10/1.19	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.19	c constraints/knapsack/simplifyinequalities = TRUE
1.10/1.19	c 
1.10/1.20	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.20	c presolving/probing/maxrounds = 0
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.20	c heuristics/coefdiving/freq = -1
1.10/1.20	c 
1.10/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.20	c heuristics/coefdiving/maxlpiterquot = 0.075
1.10/1.20	c 
1.10/1.20	c # additional number of allowed LP iterations
1.10/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.20	c heuristics/coefdiving/maxlpiterofs = 1500
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 30]
1.10/1.20	c heuristics/crossover/freq = -1
1.10/1.20	c 
1.10/1.20	c # number of nodes added to the contingent of the total nodes
1.10/1.20	c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.20	c heuristics/crossover/nodesofs = 750
1.10/1.20	c 
1.10/1.20	c # number of nodes without incumbent change that heuristic should wait
1.10/1.20	c # [type: longint, range: [0,9223372036854775807], default: 200]
1.10/1.20	c heuristics/crossover/nwaitingnodes = 100
1.10/1.20	c 
1.10/1.20	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.10/1.20	c # [type: real, range: [0,1], default: 0.1]
1.10/1.20	c heuristics/crossover/nodesquot = 0.15
1.10/1.20	c 
1.10/1.20	c # minimum percentage of integer variables that have to be fixed 
1.10/1.20	c # [type: real, range: [0,1], default: 0.666]
1.10/1.20	c heuristics/crossover/minfixingrate = 0.5
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.20	c heuristics/feaspump/freq = -1
1.10/1.20	c 
1.10/1.20	c # additional number of allowed LP iterations
1.10/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.20	c heuristics/feaspump/maxlpiterofs = 2000
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.20	c heuristics/fracdiving/freq = -1
1.10/1.20	c 
1.10/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.20	c heuristics/fracdiving/maxlpiterquot = 0.075
1.10/1.20	c 
1.10/1.20	c # additional number of allowed LP iterations
1.10/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.20	c heuristics/fracdiving/maxlpiterofs = 1500
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.20	c heuristics/guideddiving/freq = -1
1.10/1.20	c 
1.10/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.20	c heuristics/guideddiving/maxlpiterquot = 0.075
1.10/1.20	c 
1.10/1.20	c # additional number of allowed LP iterations
1.10/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.20	c heuristics/guideddiving/maxlpiterofs = 1500
1.10/1.20	c 
1.10/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.20	c heuristics/intdiving/maxlpiterquot = 0.075
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.20	c heuristics/intshifting/freq = -1
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.20	c heuristics/linesearchdiving/freq = -1
1.10/1.20	c 
1.10/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.20	c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.10/1.20	c 
1.10/1.20	c # additional number of allowed LP iterations
1.10/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.20	c heuristics/linesearchdiving/maxlpiterofs = 1500
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.10/1.20	c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.20	c heuristics/nlp/freq = -1
1.10/1.20	c 
1.10/1.20	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.20	c heuristics/objpscostdiving/freq = -1
1.19/1.20	c 
1.19/1.20	c # maximal fraction of diving LP iterations compared to total iteration number
1.19/1.20	c # [type: real, range: [0,1], default: 0.01]
1.19/1.20	c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.19/1.20	c 
1.19/1.20	c # additional number of allowed LP iterations
1.19/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.20	c heuristics/objpscostdiving/maxlpiterofs = 1500
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.20	c heuristics/oneopt/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.20	c heuristics/pscostdiving/freq = -1
1.19/1.20	c 
1.19/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.20	c heuristics/pscostdiving/maxlpiterquot = 0.075
1.19/1.20	c 
1.19/1.20	c # additional number of allowed LP iterations
1.19/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.20	c heuristics/pscostdiving/maxlpiterofs = 1500
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.20	c heuristics/rens/freq = -1
1.19/1.20	c 
1.19/1.20	c # minimum percentage of integer variables that have to be fixable 
1.19/1.20	c # [type: real, range: [0,1], default: 0.5]
1.19/1.20	c heuristics/rens/minfixingrate = 0.3
1.19/1.20	c 
1.19/1.20	c # number of nodes added to the contingent of the total nodes
1.19/1.20	c # [type: longint, range: [0,9223372036854775807], default: 500]
1.19/1.20	c heuristics/rens/nodesofs = 2000
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.20	c heuristics/rootsoldiving/freq = -1
1.19/1.20	c 
1.19/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.19/1.20	c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.19/1.20	c 
1.19/1.20	c # additional number of allowed LP iterations
1.19/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.20	c heuristics/rootsoldiving/maxlpiterofs = 1500
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.20	c heuristics/rounding/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.20	c heuristics/shifting/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.20	c heuristics/simplerounding/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.20	c heuristics/trivial/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.20	c heuristics/trysol/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.20	c heuristics/veclendiving/freq = -1
1.19/1.20	c 
1.19/1.20	c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.20	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.20	c heuristics/veclendiving/maxlpiterquot = 0.075
1.19/1.20	c 
1.19/1.20	c # additional number of allowed LP iterations
1.19/1.20	c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.20	c heuristics/veclendiving/maxlpiterofs = 1500
1.19/1.20	c 
1.19/1.20	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.20	c heuristics/zirounding/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.20	c separating/cmir/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.20	c separating/flowcover/freq = -1
1.19/1.20	c 
1.19/1.20	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.19/1.20	c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.20	c separating/rapidlearning/freq = 0
1.19/1.20	c 
1.19/1.20	c -----------------------------------------------------------------------------------------------
1.19/1.20	c start solving
1.19/1.20	c 
1.19/1.20	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.19/1.20	c   0.8s|     1 |     2 |     0 |     - |  14M|   0 |   - | 469 |1314 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.19/1.28	c 
1.19/1.28	c SCIP Status        : problem is solved [infeasible]
1.19/1.28	c Solving Time (sec) : 0.93
1.19/1.28	c Solving Nodes      : 90
1.19/1.28	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
1.19/1.28	c Dual Bound         : +1.00000000000000e+20
1.19/1.28	c Gap                : 0.00 %
1.19/1.28	s UNSATISFIABLE
1.19/1.28	c SCIP Status        : problem is solved [infeasible]
1.19/1.28	c Solving Time       :       0.93
1.19/1.28	c Original Problem   :
1.19/1.28	c   Problem name     : HOME/instance-2684534-1278432541.opb
1.19/1.28	c   Variables        : 3968 (3968 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.28	c   Constraints      : 13430 initial, 13430 maximal
1.19/1.28	c Presolved Problem  :
1.19/1.28	c   Problem name     : t_HOME/instance-2684534-1278432541.opb
1.19/1.28	c   Variables        : 469 (469 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.28	c   Constraints      : 1314 initial, 1316 maximal
1.19/1.28	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.19/1.28	c   trivial          :       0.00        124          0          0          0          0          0          0          0
1.19/1.28	c   dualfix          :       0.02         28          0          0          0          0          0          0          0
1.19/1.28	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.19/1.28	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.19/1.28	c   implics          :       0.00          0         23          0          0          0          0          0          0
1.19/1.28	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.19/1.28	c   knapsack         :       0.05          0          0          0          0          0          1         56        455
1.19/1.28	c   linear           :       0.66       2545        779          0       2669          0      12110        110        102
1.19/1.28	c   logicor          :       0.04          0          0          0          0          0          5          0          0
1.19/1.28	c   root node        :          -        362          -          -        362          -          -          -          -
1.19/1.28	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.19/1.28	c   integral         :          0          0          0          0          0          0          0          0          0          0
1.19/1.28	c   knapsack         :        191          0        909          0         68         10       1439          0          0          0
1.19/1.28	c   logicor          :       1123+         0        743          0         68         26       3873          0          0          0
1.19/1.28	c   countsols        :          0          0          0          0         68          0          0          0          0          0
1.19/1.28	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.19/1.28	c   integral         :       0.00       0.00       0.00       0.00       0.00
1.19/1.28	c   knapsack         :       0.03       0.00       0.03       0.00       0.00
1.19/1.28	c   logicor          :       0.02       0.00       0.01       0.00       0.01
1.19/1.28	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.19/1.28	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.19/1.28	c   vbounds          :       0.00          1          0          0
1.19/1.28	c   rootredcost      :       0.00          0          0          0
1.19/1.28	c   pseudoobj        :       0.01          0          0          0
1.19/1.28	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.19/1.28	c   propagation      :       0.00         36         34         47        2.9          3        2.3          -
1.19/1.28	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.19/1.28	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.19/1.28	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.19/1.28	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.19/1.28	c   applied globally :          -          -          -         44        2.8          -          -          -
1.19/1.28	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.19/1.28	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.19/1.28	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.19/1.28	c   redcost          :       0.00          0          0          0          0          0
1.19/1.28	c   impliedbounds    :       0.00          0          0          0          0          0
1.19/1.28	c   intobj           :       0.00          0          0          0          0          0
1.19/1.28	c   cgmip            :       0.00          0          0          0          0          0
1.19/1.28	c   gomory           :       0.00          0          0          0          0          0
1.19/1.28	c   strongcg         :       0.00          0          0          0          0          0
1.19/1.28	c   cmir             :       0.00          0          0          0          0          0
1.19/1.28	c   flowcover        :       0.00          0          0          0          0          0
1.19/1.28	c   clique           :       0.00          0          0          0          0          0
1.19/1.28	c   zerohalf         :       0.00          0          0          0          0          0
1.19/1.28	c   mcf              :       0.00          0          0          0          0          0
1.19/1.28	c   rapidlearning    :       0.00          0          0          0          0          0
1.19/1.28	c Pricers            :       Time      Calls       Vars
1.19/1.28	c   problem variables:       0.00          0          0
1.19/1.28	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.19/1.28	c   relpscost        :       0.00          0          0          0          0          0          0
1.19/1.28	c   pscost           :       0.00          0          0          0          0          0          0
1.19/1.28	c   inference        :       0.00         68          0          0          0          0        136
1.19/1.28	c   mostinf          :       0.00          0          0          0          0          0          0
1.19/1.28	c   leastinf         :       0.00          0          0          0          0          0          0
1.19/1.28	c   fullstrong       :       0.00          0          0          0          0          0          0
1.19/1.28	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.19/1.28	c   random           :       0.00          0          0          0          0          0          0
1.19/1.28	c Primal Heuristics  :       Time      Calls      Found
1.19/1.28	c   LP solutions     :       0.00          -          0
1.19/1.28	c   pseudo solutions :       0.00          -          0
1.19/1.28	c   trivial          :       0.00          1          0
1.19/1.28	c   simplerounding   :       0.00          0          0
1.19/1.28	c   zirounding       :       0.00          0          0
1.19/1.28	c   rounding         :       0.00          0          0
1.19/1.28	c   shifting         :       0.00          0          0
1.19/1.28	c   intshifting      :       0.00          0          0
1.19/1.28	c   oneopt           :       0.00          0          0
1.19/1.28	c   twoopt           :       0.00          0          0
1.19/1.28	c   fixandinfer      :       0.00          0          0
1.19/1.28	c   feaspump         :       0.00          0          0
1.19/1.28	c   coefdiving       :       0.00          0          0
1.19/1.28	c   pscostdiving     :       0.00          0          0
1.19/1.28	c   fracdiving       :       0.00          0          0
1.19/1.28	c   veclendiving     :       0.00          0          0
1.19/1.28	c   intdiving        :       0.00          0          0
1.19/1.28	c   actconsdiving    :       0.00          0          0
1.19/1.28	c   objpscostdiving  :       0.00          0          0
1.19/1.28	c   rootsoldiving    :       0.00          0          0
1.19/1.28	c   linesearchdiving :       0.00          0          0
1.19/1.28	c   guideddiving     :       0.00          0          0
1.19/1.28	c   octane           :       0.00          0          0
1.19/1.28	c   rens             :       0.00          0          0
1.19/1.28	c   rins             :       0.00          0          0
1.19/1.28	c   localbranching   :       0.00          0          0
1.19/1.28	c   mutation         :       0.00          0          0
1.19/1.28	c   crossover        :       0.00          0          0
1.19/1.28	c   dins             :       0.00          0          0
1.19/1.28	c   undercover       :       0.00          0          0
1.19/1.28	c   nlp              :       0.00          0          0
1.19/1.28	c   trysol           :       0.00          0          0
1.19/1.28	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.19/1.28	c   primal LP        :       0.00          0          0       0.00          -
1.19/1.28	c   dual LP          :       0.00          0          0       0.00          -
1.19/1.28	c   lex dual LP      :       0.00          0          0       0.00          -
1.19/1.28	c   barrier LP       :       0.00          0          0       0.00          -
1.19/1.28	c   diving/probing LP:       0.00          0          0       0.00          -
1.19/1.28	c   strong branching :       0.00          0          0       0.00          -
1.19/1.28	c     (at root node) :          -          0          0       0.00          -
1.19/1.28	c   conflict analysis:       0.00          0          0       0.00          -
1.19/1.28	c B&B Tree           :
1.19/1.28	c   number of runs   :          1
1.19/1.28	c   nodes            :         90
1.19/1.28	c   nodes (total)    :         90
1.19/1.28	c   nodes left       :          0
1.19/1.28	c   max depth        :         51
1.19/1.28	c   max depth (total):         51
1.19/1.28	c   backtracks       :         22 (24.4%)
1.19/1.28	c   delayed cutoffs  :         47
1.19/1.28	c   repropagations   :        272 (1336 domain reductions, 14 cutoffs)
1.19/1.28	c   avg switch length:       7.47
1.19/1.28	c   switching time   :       0.02
1.19/1.28	c Solution           :
1.19/1.28	c   Solutions found  :          0 (0 improvements)
1.19/1.28	c   Primal Bound     : infeasible
1.19/1.28	c   Dual Bound       :          -
1.19/1.28	c   Gap              :       0.00 %
1.19/1.28	c   Root Dual Bound  : +0.00000000000000e+00
1.19/1.28	c   Root Iterations  :          0
1.29/1.31	c Time complete: 1.31.

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-2684534-1278432541/watcher-2684534-1278432541 -o /tmp/evaluation-result-2684534-1278432541/solver-2684534-1278432541 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2684534-1278432541.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: 0.09 0.03 0.00 3/106 19797
/proc/meminfo: memFree=1490264/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=6584 CPUtime=0
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 1000 0 0 0 0 0 0 0 19 0 1 0 11464774 6742016 923 1992294400 4194304 7136930 140734883187840 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19797/statm: 1646 932 254 719 0 925 0

[startup+0.0315559 s]
/proc/loadavg: 0.09 0.03 0.00 3/106 19797
/proc/meminfo: memFree=1490264/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=9732 CPUtime=0.02
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 1903 0 0 0 2 0 0 0 21 0 1 0 11464774 9965568 1826 1992294400 4194304 7136930 140734883187840 18446744073709551615 6285758 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19797/statm: 2433 1826 268 719 0 1712 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 9732

[startup+0.101562 s]
/proc/loadavg: 0.09 0.03 0.00 3/106 19797
/proc/meminfo: memFree=1490264/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=12908 CPUtime=0.09
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 2704 0 0 0 9 0 0 0 21 0 1 0 11464774 13217792 2627 1992294400 4194304 7136930 140734883187840 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19797/statm: 3227 2627 268 719 0 2506 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 12908

[startup+0.30158 s]
/proc/loadavg: 0.09 0.03 0.00 3/106 19797
/proc/meminfo: memFree=1490264/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=30408 CPUtime=0.29
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 7473 0 0 0 27 2 0 0 21 0 1 0 11464774 31137792 7042 1992294400 4194304 7136930 140734883187840 18446744073709551615 4561370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19797/statm: 7602 7042 302 719 0 6881 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 30408

[startup+0.701613 s]
/proc/loadavg: 0.09 0.03 0.00 3/106 19797
/proc/meminfo: memFree=1490264/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=52448 CPUtime=0.69
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 12678 0 0 0 64 5 0 0 22 0 1 0 11464774 53706752 12247 1992294400 4194304 7136930 140734883187840 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19797/statm: 13112 12247 346 719 0 12391 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 52448

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

[startup+1.10965 s]
/proc/loadavg: 0.09 0.03 0.00 2/107 19798
/proc/meminfo: memFree=1439788/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=55664 CPUtime=1.1
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 15839 0 0 0 101 9 0 0 24 0 1 0 11464774 56999936 13029 1992294400 4194304 7136930 140734883187840 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19797/statm: 13916 13029 366 719 0 13195 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 55664

[startup+1.30067 s]
/proc/loadavg: 0.09 0.03 0.00 2/107 19798
/proc/meminfo: memFree=1439788/2059040 swapFree=4192956/4192956
[pid=19797] ppid=19795 vsize=52472 CPUtime=1.29
/proc/19797/stat : 19797 (pbscip.linux.x8) R 19795 19797 19731 0 -1 4202496 20342 0 0 0 117 12 0 0 25 0 1 0 11464774 53731328 12266 1992294400 4194304 7136930 140734883187840 18446744073709551615 4333616 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19797/statm: 13118 12266 399 719 0 12397 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 52472

Child status: 0
Real time (s): 1.31764
CPU time (s): 1.3178
CPU user time (s): 1.18182
CPU system time (s): 0.135979
CPU usage (%): 100.012
Max. virtual memory (cumulated for all children) (KiB): 55668

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

runsolver used 0.009998 second user time and 0.017997 second system time

The end

Launcher Data 

Begin job on node031 at 2010-07-06 18:09:02
IDJOB=2684534
IDBENCH=72884
IDSOLVER=1167
FILE ID=node031/2684534-1278432541
PBS_JOBID= 11233447
Free space on /tmp= 62560 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j30/normalized-j3046_4-unsat.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-2684534-1278432541/watcher-2684534-1278432541 -o /tmp/evaluation-result-2684534-1278432541/solver-2684534-1278432541 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2684534-1278432541.opb -t 1800 -m 1800

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

MD5SUM BENCH= 194fc06f7c21580ad88e7dc6177066b4
RANDOM SEED=2057861938

node031.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.220
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.44
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.220
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.54
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1490792 kB
Buffers:         99632 kB
Cached:         335580 kB
SwapCached:          0 kB
Active:         167068 kB
Inactive:       328332 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1490792 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            3940 kB
Writeback:           0 kB
AnonPages:       60096 kB
Mapped:          14424 kB
Slab:            50768 kB
PageTables:       4168 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   179624 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264964 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62556 MiB
End job on node031 at 2010-07-06 18:09:03