Trace number 2684829

Some explanations

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

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

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

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solverUNSAT 4.03339 4.03524

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j120/
normalized-j12015_3-unsat.opb
MD5SUMfb0fc5066c2899699e0ea4a2b024975c
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.31995
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables21054
Total number of constraints66352
Number of constraints which are clauses66008
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints344
Minimum length of a constraint1
Maximum length of a constraint93
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 46
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 599
Number of bits of the biggest sum of numbers10
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: Clp 1.11.1] [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-2684829-1278434907.opb>
1.10/1.15	c original problem has 21054 variables (21054 bin, 0 int, 0 impl, 0 cont) and 66352 constraints
1.10/1.15	c problem read
1.10/1.15	c No objective function, only one solution is needed.
1.10/1.15	c presolving settings loaded
1.49/1.52	c presolving:
3.69/3.75	c presolving (1 rounds):
3.69/3.75	c  1718 deleted vars, 6793 deleted constraints, 1718 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.69/3.75	c  2702288 implications, 0 cliques
3.69/3.77	c presolving detected infeasibility
3.69/3.77	c Presolving Time: 2.24
3.69/3.77	c - non default parameters ----------------------------------------------------------------------
3.69/3.77	c # SCIP version 1.2.1.2
3.69/3.77	c 
3.69/3.77	c # frequency for displaying node information lines
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 100]
3.69/3.77	c display/freq = 10000
3.69/3.77	c 
3.69/3.77	c # maximal time in seconds to run
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.69/3.77	c limits/time = 1798.85
3.69/3.77	c 
3.69/3.77	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.69/3.77	c limits/memory = 1620
3.69/3.77	c 
3.69/3.77	c # solving stops, if the given number of solutions were found (-1: no limit)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: -1]
3.69/3.77	c limits/solutions = 1
3.69/3.77	c 
3.69/3.77	c # maximal number of separation rounds per node (-1: unlimited)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 5]
3.69/3.77	c separating/maxrounds = 1
3.69/3.77	c 
3.69/3.77	c # maximal number of separation rounds in the root node (-1: unlimited)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: -1]
3.69/3.77	c separating/maxroundsroot = 5
3.69/3.77	c 
3.69/3.77	c # should presolving try to simplify inequalities
3.69/3.77	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.69/3.77	c constraints/linear/simplifyinequalities = TRUE
3.69/3.77	c 
3.69/3.77	c # should disaggregation of knapsack constraints be allowed in preprocessing?
3.69/3.77	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
3.69/3.77	c constraints/knapsack/disaggregation = FALSE
3.69/3.77	c 
3.69/3.77	c # should presolving try to simplify knapsacks
3.69/3.77	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.69/3.77	c constraints/knapsack/simplifyinequalities = TRUE
3.69/3.77	c 
3.69/3.77	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: -1]
3.69/3.77	c presolving/probing/maxrounds = 0
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/coefdiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/coefdiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/coefdiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 30]
3.69/3.77	c heuristics/crossover/freq = -1
3.69/3.77	c 
3.69/3.77	c # number of nodes added to the contingent of the total nodes
3.69/3.77	c # [type: longint, range: [0,9223372036854775807], default: 500]
3.69/3.77	c heuristics/crossover/nodesofs = 750
3.69/3.77	c 
3.69/3.77	c # number of nodes without incumbent change that heuristic should wait
3.69/3.77	c # [type: longint, range: [0,9223372036854775807], default: 200]
3.69/3.77	c heuristics/crossover/nwaitingnodes = 100
3.69/3.77	c 
3.69/3.77	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
3.69/3.77	c # [type: real, range: [0,1], default: 0.1]
3.69/3.77	c heuristics/crossover/nodesquot = 0.15
3.69/3.77	c 
3.69/3.77	c # minimum percentage of integer variables that have to be fixed 
3.69/3.77	c # [type: real, range: [0,1], default: 0.666]
3.69/3.77	c heuristics/crossover/minfixingrate = 0.5
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 20]
3.69/3.77	c heuristics/feaspump/freq = -1
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/feaspump/maxlpiterofs = 2000
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/fracdiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/fracdiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/fracdiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/guideddiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/guideddiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/guideddiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/intdiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/intshifting/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/linesearchdiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/linesearchdiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/linesearchdiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 1]
3.69/3.77	c heuristics/nlp/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 20]
3.69/3.77	c heuristics/objpscostdiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to total iteration number
3.69/3.77	c # [type: real, range: [0,1], default: 0.01]
3.69/3.77	c heuristics/objpscostdiving/maxlpiterquot = 0.015
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/objpscostdiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 1]
3.69/3.77	c heuristics/oneopt/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/pscostdiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/pscostdiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/pscostdiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 0]
3.69/3.77	c heuristics/rens/freq = -1
3.69/3.77	c 
3.69/3.77	c # minimum percentage of integer variables that have to be fixable 
3.69/3.77	c # [type: real, range: [0,1], default: 0.5]
3.69/3.77	c heuristics/rens/minfixingrate = 0.3
3.69/3.77	c 
3.69/3.77	c # number of nodes added to the contingent of the total nodes
3.69/3.77	c # [type: longint, range: [0,9223372036854775807], default: 500]
3.69/3.77	c heuristics/rens/nodesofs = 2000
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 20]
3.69/3.77	c heuristics/rootsoldiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
3.69/3.77	c heuristics/rootsoldiving/maxlpiterquot = 0.015
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/rootsoldiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 1]
3.69/3.77	c heuristics/rounding/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/shifting/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 1]
3.69/3.77	c heuristics/simplerounding/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 0]
3.69/3.77	c heuristics/trivial/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 1]
3.69/3.77	c heuristics/trysol/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 10]
3.69/3.77	c heuristics/veclendiving/freq = -1
3.69/3.77	c 
3.69/3.77	c # maximal fraction of diving LP iterations compared to node LP iterations
3.69/3.77	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.69/3.77	c heuristics/veclendiving/maxlpiterquot = 0.075
3.69/3.77	c 
3.69/3.77	c # additional number of allowed LP iterations
3.69/3.77	c # [type: int, range: [0,2147483647], default: 1000]
3.69/3.77	c heuristics/veclendiving/maxlpiterofs = 1500
3.69/3.77	c 
3.69/3.77	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 1]
3.69/3.77	c heuristics/zirounding/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 0]
3.69/3.77	c separating/cmir/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: 0]
3.69/3.77	c separating/flowcover/freq = -1
3.69/3.77	c 
3.69/3.77	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
3.69/3.77	c # [type: int, range: [-1,2147483647], default: -1]
3.69/3.77	c separating/rapidlearning/freq = 0
3.69/3.77	c 
3.69/3.77	c -----------------------------------------------------------------------------------------------
3.69/3.77	c start solving
3.69/3.77	c 
3.69/3.77	c SCIP Status        : problem is solved [infeasible]
3.69/3.77	c Solving Time (sec) : 2.44
3.69/3.77	c Solving Nodes      : 0
3.69/3.77	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
3.69/3.77	c Dual Bound         : -1.00000000000000e+20
3.69/3.77	c Gap                : infinite
3.69/3.77	s UNSATISFIABLE
3.69/3.77	c SCIP Status        : problem is solved [infeasible]
3.69/3.77	c Solving Time       :       2.44
3.69/3.77	c Original Problem   :
3.69/3.77	c   Problem name     : HOME/instance-2684829-1278434907.opb
3.69/3.77	c   Variables        : 21054 (21054 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.77	c   Constraints      : 66352 initial, 66352 maximal
3.69/3.77	c Presolved Problem  :
3.69/3.77	c   Problem name     : t_HOME/instance-2684829-1278434907.opb
3.69/3.77	c   Variables        : 19336 (19336 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.77	c   Constraints      : 59559 initial, 59559 maximal
3.69/3.77	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
3.69/3.77	c   trivial          :       0.00          0          0          0          0          0          0          0          0
3.69/3.77	c   dualfix          :       0.01          0          0          0          0          0          0          0          0
3.69/3.77	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
3.69/3.77	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
3.69/3.77	c   implics          :       0.00          0          0          0          0          0          0          0          0
3.69/3.77	c   probing          :       0.00          0          0          0          0          0          0          0          0
3.69/3.77	c   linear           :       2.06       1718          0          0       1718          0       6793          0          0
3.69/3.77	c   root node        :          -          0          -          -          0          -          -          -          -
3.69/3.77	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
3.69/3.77	c   integral         :          0          0          0          0          0          0          0          0          0          0
3.69/3.77	c   linear           :      59559          0          0          0          0          0          0          0          0          0
3.69/3.77	c   countsols        :          0          0          0          0          0          0          0          0          0          0
3.69/3.77	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
3.69/3.77	c   integral         :       0.00       0.00       0.00       0.00       0.00
3.69/3.77	c   linear           :       0.00       0.00       0.00       0.00       0.00
3.69/3.77	c   countsols        :       0.00       0.00       0.00       0.00       0.00
3.69/3.77	c Propagators        :       Time      Calls    Cutoffs    DomReds
3.69/3.77	c   pseudoobj        :       0.00          0          0          0
3.69/3.77	c   rootredcost      :       0.00          0          0          0
3.69/3.77	c   vbounds          :       0.00          0          0          0
3.69/3.77	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
3.69/3.77	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
3.69/3.77	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
3.69/3.77	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
3.69/3.77	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
3.69/3.77	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
3.69/3.77	c   applied globally :          -          -          -          0        0.0          -          -          -
3.69/3.77	c   applied locally  :          -          -          -          0        0.0          -          -          -
3.69/3.77	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
3.69/3.77	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
3.69/3.77	c   redcost          :       0.00          0          0          0          0          0
3.69/3.77	c   impliedbounds    :       0.00          0          0          0          0          0
3.69/3.77	c   intobj           :       0.00          0          0          0          0          0
3.69/3.77	c   cgmip            :       0.00          0          0          0          0          0
3.69/3.77	c   gomory           :       0.00          0          0          0          0          0
3.69/3.77	c   strongcg         :       0.00          0          0          0          0          0
3.69/3.77	c   cmir             :       0.00          0          0          0          0          0
3.69/3.77	c   flowcover        :       0.00          0          0          0          0          0
3.69/3.77	c   clique           :       0.00          0          0          0          0          0
3.69/3.77	c   zerohalf         :       0.00          0          0          0          0          0
3.69/3.77	c   mcf              :       0.00          0          0          0          0          0
3.69/3.77	c   rapidlearning    :       0.00          0          0          0          0          0
3.69/3.77	c Pricers            :       Time      Calls       Vars
3.69/3.77	c   problem variables:       0.00          0          0
3.69/3.77	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
3.69/3.77	c   pscost           :       0.00          0          0          0          0          0          0
3.69/3.77	c   inference        :       0.00          0          0          0          0          0          0
3.69/3.77	c   mostinf          :       0.00          0          0          0          0          0          0
3.69/3.77	c   leastinf         :       0.00          0          0          0          0          0          0
3.69/3.77	c   fullstrong       :       0.00          0          0          0          0          0          0
3.69/3.77	c   allfullstrong    :       0.00          0          0          0          0          0          0
3.69/3.77	c   random           :       0.00          0          0          0          0          0          0
3.69/3.77	c   relpscost        :       0.00          0          0          0          0          0          0
3.69/3.77	c Primal Heuristics  :       Time      Calls      Found
3.69/3.77	c   LP solutions     :       0.00          -          0
3.69/3.77	c   pseudo solutions :       0.00          -          0
3.69/3.77	c   trivial          :       0.04          1          0
3.69/3.77	c   simplerounding   :       0.00          0          0
3.69/3.77	c   zirounding       :       0.00          0          0
3.69/3.77	c   rounding         :       0.00          0          0
3.69/3.77	c   shifting         :       0.00          0          0
3.69/3.77	c   intshifting      :       0.00          0          0
3.69/3.77	c   oneopt           :       0.00          0          0
3.69/3.77	c   twoopt           :       0.00          0          0
3.69/3.77	c   fixandinfer      :       0.00          0          0
3.69/3.77	c   feaspump         :       0.00          0          0
3.69/3.77	c   coefdiving       :       0.00          0          0
3.69/3.77	c   pscostdiving     :       0.00          0          0
3.69/3.77	c   fracdiving       :       0.00          0          0
3.69/3.77	c   veclendiving     :       0.00          0          0
3.69/3.77	c   intdiving        :       0.00          0          0
3.69/3.77	c   actconsdiving    :       0.00          0          0
3.69/3.77	c   objpscostdiving  :       0.00          0          0
3.69/3.77	c   rootsoldiving    :       0.00          0          0
3.69/3.77	c   linesearchdiving :       0.00          0          0
3.69/3.77	c   guideddiving     :       0.00          0          0
3.69/3.77	c   octane           :       0.00          0          0
3.69/3.77	c   rens             :       0.00          0          0
3.69/3.77	c   rins             :       0.00          0          0
3.69/3.77	c   localbranching   :       0.00          0          0
3.69/3.77	c   mutation         :       0.00          0          0
3.69/3.77	c   crossover        :       0.00          0          0
3.69/3.77	c   dins             :       0.00          0          0
3.69/3.77	c   undercover       :       0.00          0          0
3.69/3.77	c   nlp              :       0.00          0          0
3.69/3.77	c   trysol           :       0.00          0          0
3.69/3.77	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
3.69/3.77	c   primal LP        :       0.00          0          0       0.00          -
3.69/3.77	c   dual LP          :       0.00          0          0       0.00          -
3.69/3.77	c   lex dual LP      :       0.00          0          0       0.00          -
3.69/3.77	c   barrier LP       :       0.00          0          0       0.00          -
3.69/3.77	c   diving/probing LP:       0.00          0          0       0.00          -
3.69/3.77	c   strong branching :       0.00          0          0       0.00          -
3.69/3.77	c     (at root node) :          -          0          0       0.00          -
3.69/3.77	c   conflict analysis:       0.00          0          0       0.00          -
3.69/3.77	c B&B Tree           :
3.69/3.77	c   number of runs   :          1
3.69/3.77	c   nodes            :          0
3.69/3.77	c   nodes (total)    :          0
3.69/3.77	c   nodes left       :          1
3.69/3.77	c   max depth        :         -1
3.69/3.77	c   max depth (total):         -1
3.69/3.77	c   backtracks       :          0 (0.0%)
3.69/3.77	c   delayed cutoffs  :          0
3.69/3.77	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
3.69/3.77	c   avg switch length:       0.00
3.69/3.77	c   switching time   :       0.00
3.69/3.77	c Solution           :
3.69/3.77	c   Solutions found  :          0 (0 improvements)
3.69/3.77	c   Primal Bound     : infeasible
3.69/3.77	c   Dual Bound       :          -
3.69/3.77	c   Gap              :   infinite
3.69/3.77	c   Root Dual Bound  :          -
3.69/3.77	c   Root Iterations  :          0
3.99/4.03	c Time complete: 4.02.

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-2684829-1278434907/watcher-2684829-1278434907 -o /tmp/evaluation-result-2684829-1278434907/solver-2684829-1278434907 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2684829-1278434907.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.93 0.99 0.89 3/106 19013
/proc/meminfo: memFree=1430816/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=9288 CPUtime=0
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 1070 0 0 0 0 0 0 0 20 0 1 0 11698406 9510912 991 1992294400 4194304 9819077 140734725815664 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 2322 1000 371 1374 0 943 0

[startup+0.0909001 s]
/proc/loadavg: 0.93 0.99 0.89 3/106 19013
/proc/meminfo: memFree=1430816/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=17612 CPUtime=0.08
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 3327 0 0 0 8 0 0 0 22 0 1 0 11698406 18034688 3247 1992294400 4194304 9819077 140734725815664 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 4403 3247 386 1374 0 3024 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 17612

[startup+0.1009 s]
/proc/loadavg: 0.93 0.99 0.89 3/106 19013
/proc/meminfo: memFree=1430816/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=18576 CPUtime=0.09
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 3569 0 0 0 8 1 0 0 22 0 1 0 11698406 19021824 3489 1992294400 4194304 9819077 140734725815664 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 4644 3489 386 1374 0 3265 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 18576

[startup+0.300922 s]
/proc/loadavg: 0.93 0.99 0.89 3/106 19013
/proc/meminfo: memFree=1430816/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=26252 CPUtime=0.29
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 5481 0 0 0 27 2 0 0 22 0 1 0 11698406 26882048 5401 1992294400 4194304 9819077 140734725815664 18446744073709551615 4640689 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 6563 5401 386 1374 0 5184 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 26252

[startup+0.700965 s]
/proc/loadavg: 0.93 0.99 0.89 3/106 19013
/proc/meminfo: memFree=1430816/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=37212 CPUtime=0.69
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 8199 0 0 0 66 3 0 0 24 0 1 0 11698406 38105088 8119 1992294400 4194304 9819077 140734725815664 18446744073709551615 6179008 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 9303 8130 386 1374 0 7924 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 37212

[startup+1.50105 s]
/proc/loadavg: 0.93 0.99 0.89 2/107 19014
/proc/meminfo: memFree=1389392/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=115356 CPUtime=1.49
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 27562 0 0 0 140 9 0 0 25 0 1 0 11698406 118124544 27089 1992294400 4194304 9819077 140734725815664 18446744073709551615 4561370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19013/statm: 28839 27089 461 1374 0 27460 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 115356

[startup+3.10123 s]
/proc/loadavg: 0.93 0.99 0.89 2/107 19015
/proc/meminfo: memFree=1289820/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=193332 CPUtime=3.09
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 46998 0 0 0 290 19 0 0 25 0 1 0 11698406 197971968 46525 1992294400 4194304 9819077 140734725815664 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19013/statm: 48333 46525 486 1374 0 46954 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 193332

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

[startup+3.50027 s]
/proc/loadavg: 0.93 0.99 0.89 2/107 19015
/proc/meminfo: memFree=1244932/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=205004 CPUtime=3.48
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 49618 0 0 0 328 20 0 0 25 0 1 0 11698406 209924096 49145 1992294400 4194304 9819077 140734725815664 18446744073709551615 5966640 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19013/statm: 51251 49145 486 1374 0 49872 0
Current children cumulated CPU time (s) 3.48
Current children cumulated vsize (KiB) 205004

[startup+3.90032 s]
/proc/loadavg: 0.93 0.99 0.89 2/107 19015
/proc/meminfo: memFree=1244932/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=187608 CPUtime=3.88
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 50448 0 0 0 367 21 0 0 25 0 1 0 11698406 192110592 44814 1992294400 4194304 9819077 140734725815664 18446744073709551615 6179930 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 46902 44696 510 1374 0 45523 0
Current children cumulated CPU time (s) 3.88
Current children cumulated vsize (KiB) 187608

[startup+4.00033 s]
/proc/loadavg: 0.93 0.99 0.89 2/107 19015
/proc/meminfo: memFree=1244932/2059040 swapFree=4192956/4192956
[pid=19013] ppid=19011 vsize=61468 CPUtime=3.99
/proc/19013/stat : 19013 (pbscip.linux.x8) R 19011 19013 18454 0 -1 4202496 50455 0 0 0 376 23 0 0 25 0 1 0 11698406 62943232 14115 1992294400 4194304 9819077 140734725815664 18446744073709551615 6180700 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19013/statm: 15367 14115 517 1374 0 13988 0
Current children cumulated CPU time (s) 3.99
Current children cumulated vsize (KiB) 61468

Child status: 0
Real time (s): 4.03524
CPU time (s): 4.03339
CPU user time (s): 3.79442
CPU system time (s): 0.238963
CPU usage (%): 99.954
Max. virtual memory (cumulated for all children) (KiB): 205288

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 3.79442
system time used= 0.238963
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 50466
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= 4
involuntary context switches= 53

runsolver used 0.011998 second user time and 0.027995 second system time

The end

Launcher Data 

Begin job on node038 at 2010-07-06 18:48:28
IDJOB=2684829
IDBENCH=73651
IDSOLVER=1168
FILE ID=node038/2684829-1278434907
PBS_JOBID= 11233444
Free space on /tmp= 62536 MiB

SOLVER NAME= SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j120/normalized-j12015_3-unsat.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.clp -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2684829-1278434907/watcher-2684829-1278434907 -o /tmp/evaluation-result-2684829-1278434907/solver-2684829-1278434907 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2684829-1278434907.opb -t 1800 -m 1800

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

MD5SUM BENCH= fb0fc5066c2899699e0ea4a2b024975c
RANDOM SEED=891980783

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1431344 kB
Buffers:        104592 kB
Cached:         390680 kB
SwapCached:          0 kB
Active:         218704 kB
Inactive:       336480 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1431344 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            8592 kB
Writeback:           4 kB
AnonPages:       59888 kB
Mapped:          14452 kB
Slab:            50636 kB
PageTables:       4236 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   179356 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= 62532 MiB
End job on node038 at 2010-07-06 18:48:32