Trace number 2704766

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 5.52516 5.52642

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j90/
normalized-j9035_1-unsat.opb
MD5SUMe27627ae64f743135eba4ae37b0b2df0
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.238963
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables17836
Total number of constraints61428
Number of constraints which are clauses61040
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints388
Minimum length of a constraint1
Maximum length of a constraint25
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 28
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 185
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.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704766-1278580467.opb>
0.79/0.88	c original problem has 17836 variables (17836 bin, 0 int, 0 impl, 0 cont) and 61428 constraints
0.79/0.88	c problem read
0.79/0.88	c No objective function, only one solution is needed.
0.79/0.88	c presolving settings loaded
1.10/1.17	c presolving:
3.99/4.03	c (round 1) 5966 del vars, 17283 del conss, 4657 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 3313636 impls, 0 clqs
5.09/5.14	c (round 2) 11541 del vars, 38887 del conss, 9863 chg bounds, 7 chg sides, 7 chg coeffs, 0 upgd conss, 3347439 impls, 0 clqs
5.19/5.27	c (round 3) 13344 del vars, 47830 del conss, 10988 chg bounds, 119 chg sides, 112 chg coeffs, 0 upgd conss, 3356848 impls, 0 clqs
5.29/5.33	c (round 4) 14157 del vars, 50851 del conss, 11542 chg bounds, 209 chg sides, 206 chg coeffs, 0 upgd conss, 3363702 impls, 0 clqs
5.29/5.37	c (round 5) 14687 del vars, 52745 del conss, 11889 chg bounds, 256 chg sides, 262 chg coeffs, 0 upgd conss, 3369059 impls, 0 clqs
5.29/5.39	c presolving (6 rounds):
5.29/5.39	c  14800 deleted vars, 53280 deleted constraints, 11950 tightened bounds, 0 added holes, 257 changed sides, 263 changed coefficients
5.29/5.39	c  3370393 implications, 0 cliques
5.29/5.39	c presolving detected infeasibility
5.29/5.39	c Presolving Time: 4.32
5.29/5.39	c - non default parameters ----------------------------------------------------------------------
5.29/5.39	c # SCIP version 1.2.1.3
5.29/5.39	c 
5.29/5.39	c # frequency for displaying node information lines
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 100]
5.29/5.39	c display/freq = 10000
5.29/5.39	c 
5.29/5.39	c # maximal time in seconds to run
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
5.29/5.39	c limits/time = 1789.13
5.29/5.39	c 
5.29/5.39	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
5.29/5.39	c limits/memory = 1620
5.29/5.39	c 
5.29/5.39	c # solving stops, if the given number of solutions were found (-1: no limit)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: -1]
5.29/5.39	c limits/solutions = 1
5.29/5.39	c 
5.29/5.39	c # maximal number of separation rounds per node (-1: unlimited)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 5]
5.29/5.39	c separating/maxrounds = 1
5.29/5.39	c 
5.29/5.39	c # maximal number of separation rounds in the root node (-1: unlimited)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: -1]
5.29/5.39	c separating/maxroundsroot = 5
5.29/5.39	c 
5.29/5.39	c # default clock type (1: CPU user seconds, 2: wall clock time)
5.29/5.39	c # [type: int, range: [1,2], default: 1]
5.29/5.39	c timing/clocktype = 2
5.29/5.39	c 
5.29/5.39	c # should presolving try to simplify inequalities
5.29/5.39	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
5.29/5.39	c constraints/linear/simplifyinequalities = TRUE
5.29/5.39	c 
5.29/5.39	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
5.29/5.39	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
5.29/5.39	c constraints/indicator/addCouplingCons = TRUE
5.29/5.39	c 
5.29/5.39	c # should disaggregation of knapsack constraints be allowed in preprocessing?
5.29/5.39	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
5.29/5.39	c constraints/knapsack/disaggregation = FALSE
5.29/5.39	c 
5.29/5.39	c # should presolving try to simplify knapsacks
5.29/5.39	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
5.29/5.39	c constraints/knapsack/simplifyinequalities = TRUE
5.29/5.39	c 
5.29/5.39	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: -1]
5.29/5.39	c presolving/probing/maxrounds = 0
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/coefdiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/coefdiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/coefdiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 30]
5.29/5.39	c heuristics/crossover/freq = -1
5.29/5.39	c 
5.29/5.39	c # number of nodes added to the contingent of the total nodes
5.29/5.39	c # [type: longint, range: [0,9223372036854775807], default: 500]
5.29/5.39	c heuristics/crossover/nodesofs = 750
5.29/5.39	c 
5.29/5.39	c # number of nodes without incumbent change that heuristic should wait
5.29/5.39	c # [type: longint, range: [0,9223372036854775807], default: 200]
5.29/5.39	c heuristics/crossover/nwaitingnodes = 100
5.29/5.39	c 
5.29/5.39	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
5.29/5.39	c # [type: real, range: [0,1], default: 0.1]
5.29/5.39	c heuristics/crossover/nodesquot = 0.15
5.29/5.39	c 
5.29/5.39	c # minimum percentage of integer variables that have to be fixed 
5.29/5.39	c # [type: real, range: [0,1], default: 0.666]
5.29/5.39	c heuristics/crossover/minfixingrate = 0.5
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 20]
5.29/5.39	c heuristics/feaspump/freq = -1
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/feaspump/maxlpiterofs = 2000
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/fracdiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/fracdiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/fracdiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/guideddiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/guideddiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/guideddiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/intdiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/intshifting/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/linesearchdiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/linesearchdiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/linesearchdiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 1]
5.29/5.39	c heuristics/nlp/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 20]
5.29/5.39	c heuristics/objpscostdiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to total iteration number
5.29/5.39	c # [type: real, range: [0,1], default: 0.01]
5.29/5.39	c heuristics/objpscostdiving/maxlpiterquot = 0.015
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/objpscostdiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 1]
5.29/5.39	c heuristics/oneopt/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/pscostdiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/pscostdiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/pscostdiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 0]
5.29/5.39	c heuristics/rens/freq = -1
5.29/5.39	c 
5.29/5.39	c # minimum percentage of integer variables that have to be fixable 
5.29/5.39	c # [type: real, range: [0,1], default: 0.5]
5.29/5.39	c heuristics/rens/minfixingrate = 0.3
5.29/5.39	c 
5.29/5.39	c # number of nodes added to the contingent of the total nodes
5.29/5.39	c # [type: longint, range: [0,9223372036854775807], default: 500]
5.29/5.39	c heuristics/rens/nodesofs = 2000
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 20]
5.29/5.39	c heuristics/rootsoldiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
5.29/5.39	c heuristics/rootsoldiving/maxlpiterquot = 0.015
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/rootsoldiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 1]
5.29/5.39	c heuristics/rounding/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/shifting/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 1]
5.29/5.39	c heuristics/simplerounding/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 0]
5.29/5.39	c heuristics/trivial/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 1]
5.29/5.39	c heuristics/trysol/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 10]
5.29/5.39	c heuristics/veclendiving/freq = -1
5.29/5.39	c 
5.29/5.39	c # maximal fraction of diving LP iterations compared to node LP iterations
5.29/5.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.29/5.39	c heuristics/veclendiving/maxlpiterquot = 0.075
5.29/5.39	c 
5.29/5.39	c # additional number of allowed LP iterations
5.29/5.39	c # [type: int, range: [0,2147483647], default: 1000]
5.29/5.39	c heuristics/veclendiving/maxlpiterofs = 1500
5.29/5.39	c 
5.29/5.39	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 1]
5.29/5.39	c heuristics/zirounding/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 0]
5.29/5.39	c separating/cmir/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: 0]
5.29/5.39	c separating/flowcover/freq = -1
5.29/5.39	c 
5.29/5.39	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
5.29/5.39	c # [type: int, range: [-1,2147483647], default: -1]
5.29/5.39	c separating/rapidlearning/freq = 0
5.29/5.39	c 
5.29/5.39	c -----------------------------------------------------------------------------------------------
5.29/5.39	c start solving
5.29/5.39	c 
5.29/5.39	c SCIP Status        : problem is solved [infeasible]
5.29/5.39	c Solving Time (sec) : 4.51
5.29/5.39	c Solving Nodes      : 0
5.29/5.39	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
5.29/5.39	c Dual Bound         : -1.00000000000000e+20
5.29/5.39	c Gap                : infinite
5.29/5.39	s UNSATISFIABLE
5.29/5.39	c SCIP Status        : problem is solved [infeasible]
5.29/5.39	c Solving Time       :       4.51
5.29/5.39	c Original Problem   :
5.29/5.39	c   Problem name     : HOME/instance-2704766-1278580467.opb
5.29/5.39	c   Variables        : 17836 (17836 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.39	c   Constraints      : 61428 initial, 61428 maximal
5.29/5.39	c Presolved Problem  :
5.29/5.39	c   Problem name     : t_HOME/instance-2704766-1278580467.opb
5.29/5.39	c   Variables        : 3036 (3036 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.39	c   Constraints      : 8148 initial, 8148 maximal
5.29/5.39	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
5.29/5.39	c   trivial          :       0.01        490          0          0          0          0          0          0          0
5.29/5.39	c   dualfix          :       0.03         89          0          0          0          0          0          0          0
5.29/5.39	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   implics          :       0.03          0          0          0          0          0          0          0          0
5.29/5.39	c   probing          :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   linear           :       4.07      11458       2763          0      11950          0      53280        257        263
5.29/5.39	c   root node        :          -          0          -          -          0          -          -          -          -
5.29/5.39	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
5.29/5.39	c   integral         :          0          0          0          0          0          0          0          0          0          0
5.29/5.39	c   linear           :       8148          0          0          0          0          0          0          0          0          0
5.29/5.39	c   countsols        :          0          0          0          0          0          0          0          0          0          0
5.29/5.39	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
5.29/5.39	c   integral         :       0.00       0.00       0.00       0.00       0.00
5.29/5.39	c   linear           :       0.00       0.00       0.00       0.00       0.00
5.29/5.39	c   countsols        :       0.00       0.00       0.00       0.00       0.00
5.29/5.39	c Propagators        :       Time      Calls    Cutoffs    DomReds
5.29/5.39	c   pseudoobj        :       0.00          0          0          0
5.29/5.39	c   rootredcost      :       0.00          0          0          0
5.29/5.39	c   vbounds          :       0.00          0          0          0
5.29/5.39	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
5.29/5.39	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
5.29/5.39	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
5.29/5.39	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
5.29/5.39	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
5.29/5.39	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
5.29/5.39	c   applied globally :          -          -          -          0        0.0          -          -          -
5.29/5.39	c   applied locally  :          -          -          -          0        0.0          -          -          -
5.29/5.39	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
5.29/5.39	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
5.29/5.39	c   redcost          :       0.00          0          0          0          0          0
5.29/5.39	c   impliedbounds    :       0.00          0          0          0          0          0
5.29/5.39	c   intobj           :       0.00          0          0          0          0          0
5.29/5.39	c   cgmip            :       0.00          0          0          0          0          0
5.29/5.39	c   gomory           :       0.00          0          0          0          0          0
5.29/5.39	c   strongcg         :       0.00          0          0          0          0          0
5.29/5.39	c   cmir             :       0.00          0          0          0          0          0
5.29/5.39	c   flowcover        :       0.00          0          0          0          0          0
5.29/5.39	c   clique           :       0.00          0          0          0          0          0
5.29/5.39	c   zerohalf         :       0.00          0          0          0          0          0
5.29/5.39	c   mcf              :       0.00          0          0          0          0          0
5.29/5.39	c   rapidlearning    :       0.00          0          0          0          0          0
5.29/5.39	c Pricers            :       Time      Calls       Vars
5.29/5.39	c   problem variables:       0.00          0          0
5.29/5.39	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
5.29/5.39	c   pscost           :       0.00          0          0          0          0          0          0
5.29/5.39	c   inference        :       0.00          0          0          0          0          0          0
5.29/5.39	c   mostinf          :       0.00          0          0          0          0          0          0
5.29/5.39	c   leastinf         :       0.00          0          0          0          0          0          0
5.29/5.39	c   fullstrong       :       0.00          0          0          0          0          0          0
5.29/5.39	c   allfullstrong    :       0.00          0          0          0          0          0          0
5.29/5.39	c   random           :       0.00          0          0          0          0          0          0
5.29/5.39	c   relpscost        :       0.00          0          0          0          0          0          0
5.29/5.39	c Primal Heuristics  :       Time      Calls      Found
5.29/5.39	c   LP solutions     :       0.00          -          0
5.29/5.39	c   pseudo solutions :       0.00          -          0
5.29/5.39	c   trivial          :       0.03          1          0
5.29/5.39	c   simplerounding   :       0.00          0          0
5.29/5.39	c   zirounding       :       0.00          0          0
5.29/5.39	c   rounding         :       0.00          0          0
5.29/5.39	c   shifting         :       0.00          0          0
5.29/5.39	c   intshifting      :       0.00          0          0
5.29/5.39	c   oneopt           :       0.00          0          0
5.29/5.39	c   twoopt           :       0.00          0          0
5.29/5.39	c   fixandinfer      :       0.00          0          0
5.29/5.39	c   feaspump         :       0.00          0          0
5.29/5.39	c   coefdiving       :       0.00          0          0
5.29/5.39	c   pscostdiving     :       0.00          0          0
5.29/5.39	c   fracdiving       :       0.00          0          0
5.29/5.39	c   veclendiving     :       0.00          0          0
5.29/5.39	c   intdiving        :       0.00          0          0
5.29/5.39	c   actconsdiving    :       0.00          0          0
5.29/5.39	c   objpscostdiving  :       0.00          0          0
5.29/5.39	c   rootsoldiving    :       0.00          0          0
5.29/5.39	c   linesearchdiving :       0.00          0          0
5.29/5.39	c   guideddiving     :       0.00          0          0
5.29/5.39	c   octane           :       0.00          0          0
5.29/5.39	c   rens             :       0.00          0          0
5.29/5.39	c   rins             :       0.00          0          0
5.29/5.39	c   localbranching   :       0.00          0          0
5.29/5.39	c   mutation         :       0.00          0          0
5.29/5.39	c   crossover        :       0.00          0          0
5.29/5.39	c   dins             :       0.00          0          0
5.29/5.39	c   undercover       :       0.00          0          0
5.29/5.39	c   nlp              :       0.00          0          0
5.29/5.39	c   trysol           :       0.00          0          0
5.29/5.39	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
5.29/5.39	c   primal LP        :       0.00          0          0       0.00          -
5.29/5.39	c   dual LP          :       0.00          0          0       0.00          -
5.29/5.39	c   lex dual LP      :       0.00          0          0       0.00          -
5.29/5.39	c   barrier LP       :       0.00          0          0       0.00          -
5.29/5.39	c   diving/probing LP:       0.00          0          0       0.00          -
5.29/5.39	c   strong branching :       0.00          0          0       0.00          -
5.29/5.39	c     (at root node) :          -          0          0       0.00          -
5.29/5.39	c   conflict analysis:       0.00          0          0       0.00          -
5.29/5.39	c B&B Tree           :
5.29/5.39	c   number of runs   :          1
5.29/5.39	c   nodes            :          0
5.29/5.39	c   nodes (total)    :          0
5.29/5.39	c   nodes left       :          1
5.29/5.39	c   max depth        :         -1
5.29/5.39	c   max depth (total):         -1
5.29/5.39	c   backtracks       :          0 (0.0%)
5.29/5.39	c   delayed cutoffs  :          0
5.29/5.39	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
5.29/5.39	c   avg switch length:       0.00
5.29/5.39	c   switching time   :       0.00
5.29/5.39	c Solution           :
5.29/5.39	c   Solutions found  :          0 (0 improvements)
5.29/5.39	c   Primal Bound     : infeasible
5.29/5.39	c   Dual Bound       :          -
5.29/5.39	c   Gap              :   infinite
5.29/5.39	c   Root Dual Bound  :          -
5.29/5.39	c   Root Iterations  :          0
5.50/5.52	c Time complete: 5.52.

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-2704766-1278580467/watcher-2704766-1278580467 -o /tmp/evaluation-result-2704766-1278580467/solver-2704766-1278580467 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704766-1278580467.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.00 0.99 0.91 3/105 29378
/proc/meminfo: memFree=1779456/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=7904 CPUtime=0
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 1084 0 0 0 0 0 0 0 25 0 1 0 26255188 8093696 995 1992294400 4194304 8395647 140734996925584 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 1976 1003 365 1026 0 946 0

[startup+0.102582 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29378
/proc/meminfo: memFree=1779456/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=18416 CPUtime=0.1
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 3890 0 0 0 8 2 0 0 25 0 1 0 26255188 18857984 3801 1992294400 4194304 8395647 140734996925584 18446744073709551615 7382061 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 4604 3801 390 1026 0 3574 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 18416

[startup+0.201592 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29378
/proc/meminfo: memFree=1779456/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=22896 CPUtime=0.19
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 5022 0 0 0 17 2 0 0 25 0 1 0 26255188 23445504 4933 1992294400 4194304 8395647 140734996925584 18446744073709551615 4440413 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 5724 4933 390 1026 0 4694 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 22896

[startup+0.301603 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29378
/proc/meminfo: memFree=1779456/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=25192 CPUtime=0.29
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 5571 0 0 0 27 2 0 0 25 0 1 0 26255188 25796608 5482 1992294400 4194304 8395647 140734996925584 18446744073709551615 5758126 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 6298 5482 390 1026 0 5268 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25192

[startup+0.701649 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29378
/proc/meminfo: memFree=1779456/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=38444 CPUtime=0.7
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 8875 0 0 0 66 4 0 0 25 0 1 0 26255188 39366656 8786 1992294400 4194304 8395647 140734996925584 18446744073709551615 7371008 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 9611 8786 390 1026 0 8581 0
Current children cumulated CPU time (s) 0.7
Current children cumulated vsize (KiB) 38444

[startup+1.50074 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1689300/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=121224 CPUtime=1.49
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 29522 0 0 0 139 10 0 0 25 0 1 0 26255188 124133376 29079 1992294400 4194304 8395647 140734996925584 18446744073709551615 6071296 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29378/statm: 30306 29079 469 1026 0 29276 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 121224

[startup+3.10092 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1629904/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=181016 CPUtime=3.09
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 44364 0 0 0 294 15 0 0 25 0 1 0 26255188 185360384 43921 1992294400 4194304 8395647 140734996925584 18446744073709551615 4684118 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29378/statm: 45254 43921 469 1026 0 44224 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 181016

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

[startup+3.20093 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1629904/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=183144 CPUtime=3.19
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 44848 0 0 0 304 15 0 0 25 0 1 0 26255188 187539456 44405 1992294400 4194304 8395647 140734996925584 18446744073709551615 4743329 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29378/statm: 45786 44405 469 1026 0 44756 0
Current children cumulated CPU time (s) 3.19
Current children cumulated vsize (KiB) 183144

[startup+4.80111 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1591340/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=195484 CPUtime=4.79
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 47669 0 0 0 463 16 0 0 25 0 1 0 26255188 200175616 47226 1992294400 4194304 8395647 140734996925584 18446744073709551615 6085509 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29378/statm: 48871 47226 475 1026 0 47841 0
Current children cumulated CPU time (s) 4.79
Current children cumulated vsize (KiB) 195484

[startup+5.20116 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1591340/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=195484 CPUtime=5.19
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 47677 0 0 0 503 16 0 0 25 0 1 0 26255188 200175616 47234 1992294400 4194304 8395647 140734996925584 18446744073709551615 6085522 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29378/statm: 48871 47234 475 1026 0 47841 0
Current children cumulated CPU time (s) 5.19
Current children cumulated vsize (KiB) 195484

[startup+5.40118 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1591340/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=195484 CPUtime=5.39
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 47707 0 0 0 523 16 0 0 25 0 1 0 26255188 200175616 47264 1992294400 4194304 8395647 140734996925584 18446744073709551615 4969448 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 48871 47264 505 1026 0 47841 0
Current children cumulated CPU time (s) 5.39
Current children cumulated vsize (KiB) 195484

[startup+5.50119 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29379
/proc/meminfo: memFree=1611676/2059040 swapFree=4139760/4192956
[pid=29378] ppid=29376 vsize=169644 CPUtime=5.5
/proc/29378/stat : 29378 (pbscip.linux.x8) R 29376 29378 28623 0 -1 4202496 47709 0 0 0 534 16 0 0 25 0 1 0 26255188 173715456 40816 1992294400 4194304 8395647 140734996925584 18446744073709551615 4287961 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29378/statm: 42411 40816 507 1026 0 41381 0
Current children cumulated CPU time (s) 5.5
Current children cumulated vsize (KiB) 169644

Child status: 0
Real time (s): 5.52642
CPU time (s): 5.52516
CPU user time (s): 5.34019
CPU system time (s): 0.184971
CPU usage (%): 99.9772
Max. virtual memory (cumulated for all children) (KiB): 195484

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

runsolver used 0.010998 second user time and 0.041993 second system time

The end

Launcher Data 

Begin job on node085 at 2010-07-08 11:14:27
IDJOB=2704766
IDBENCH=74647
IDSOLVER=1213
FILE ID=node085/2704766-1278580467
PBS_JOBID= 11240063
Free space on /tmp= 121796 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j9035_1-unsat.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2704766-1278580467/watcher-2704766-1278580467 -o /tmp/evaluation-result-2704766-1278580467/solver-2704766-1278580467 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704766-1278580467.opb -t 1800 -m 1800

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

MD5SUM BENCH= e27627ae64f743135eba4ae37b0b2df0
RANDOM SEED=6128646

node085.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.215
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.43
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.215
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	: 5999.39
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1779984 kB
Buffers:         20424 kB
Cached:         161152 kB
SwapCached:       6996 kB
Active:         120880 kB
Inactive:        74616 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1779984 kB
SwapTotal:     4192956 kB
SwapFree:      4139760 kB
Dirty:           13448 kB
Writeback:           0 kB
AnonPages:       11900 kB
Mapped:          11960 kB
Slab:            61952 kB
PageTables:       4100 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181456 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= 121788 MiB
End job on node085 at 2010-07-08 11:14:33