Trace number 2684828

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 4.05438 4.05403

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

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-2684828-1278434906/watcher-2684828-1278434906 -o /tmp/evaluation-result-2684828-1278434906/solver-2684828-1278434906 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2684828-1278434906.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.91 1.77 1.40 3/106 19450
/proc/meminfo: memFree=1455508/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=6584 CPUtime=0
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 973 0 0 0 0 0 0 0 20 0 1 0 11704334 6742016 896 1992294400 4194304 7136930 140733876071360 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 1646 907 254 719 0 925 0

[startup+0.069114 s]
/proc/loadavg: 1.91 1.77 1.40 3/106 19450
/proc/meminfo: memFree=1455508/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=12236 CPUtime=0.06
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 2533 0 0 0 6 0 0 0 20 0 1 0 11704334 12529664 2456 1992294400 4194304 7136930 140733876071360 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 3059 2456 268 719 0 2338 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 12236

[startup+0.102117 s]
/proc/loadavg: 1.91 1.77 1.40 3/106 19450
/proc/meminfo: memFree=1455508/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=15868 CPUtime=0.1
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 3317 0 0 0 9 1 0 0 20 0 1 0 11704334 16248832 3241 1992294400 4194304 7136930 140733876071360 18446744073709551615 6164672 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 3967 3252 268 719 0 3246 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 15868

[startup+0.301133 s]
/proc/loadavg: 1.91 1.77 1.40 3/106 19450
/proc/meminfo: memFree=1455508/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=22704 CPUtime=0.29
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 5147 0 0 0 28 1 0 0 20 0 1 0 11704334 23248896 5070 1992294400 4194304 7136930 140733876071360 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 5676 5070 268 719 0 4955 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 22704

[startup+0.700166 s]
/proc/loadavg: 1.91 1.77 1.40 3/106 19450
/proc/meminfo: memFree=1455508/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=33476 CPUtime=0.69
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 7681 0 0 0 67 2 0 0 20 0 1 0 11704334 34279424 7605 1992294400 4194304 7136930 140733876071360 18446744073709551615 6164672 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 8369 7615 268 719 0 7648 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 33476

[startup+1.50023 s]
/proc/loadavg: 1.91 1.77 1.40 2/107 19451
/proc/meminfo: memFree=1414332/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=107264 CPUtime=1.49
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 26477 0 0 0 139 10 0 0 23 0 1 0 11704334 109838336 26045 1992294400 4194304 7136930 140733876071360 18446744073709551615 4561370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19450/statm: 26816 26045 302 719 0 26095 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 107264

[startup+3.10136 s]
/proc/loadavg: 1.91 1.77 1.40 2/107 19451
/proc/meminfo: memFree=1314636/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=190616 CPUtime=3.09
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 46804 0 0 0 290 19 0 0 25 0 1 0 11704334 195190784 46372 1992294400 4194304 7136930 140733876071360 18446744073709551615 5966370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19450/statm: 47654 46372 341 719 0 46933 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 190616

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

[startup+3.50139 s]
/proc/loadavg: 1.84 1.76 1.39 2/107 19451
/proc/meminfo: memFree=1269996/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=202284 CPUtime=3.49
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 49415 0 0 0 328 21 0 0 25 0 1 0 11704334 207138816 48983 1992294400 4194304 7136930 140733876071360 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/19450/statm: 50571 48983 341 719 0 49850 0
Current children cumulated CPU time (s) 3.49
Current children cumulated vsize (KiB) 202284

[startup+3.90142 s]
/proc/loadavg: 1.84 1.76 1.39 2/107 19451
/proc/meminfo: memFree=1269996/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=187908 CPUtime=3.89
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 50255 0 0 0 366 23 0 0 25 0 1 0 11704334 192417792 45416 1992294400 4194304 7136930 140733876071360 18446744073709551615 6166159 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 46977 45416 365 719 0 46256 0
Current children cumulated CPU time (s) 3.89
Current children cumulated vsize (KiB) 187908

[startup+4.00143 s]
/proc/loadavg: 1.84 1.76 1.39 2/107 19451
/proc/meminfo: memFree=1269996/2059040 swapFree=4192956/4192956
[pid=19450] ppid=19448 vsize=67232 CPUtime=3.99
/proc/19450/stat : 19450 (pbscip.linux.x8) R 19448 19450 19027 0 -1 4202496 50257 0 0 0 375 24 0 0 25 0 1 0 11704334 68845568 16077 1992294400 4194304 7136930 140733876071360 18446744073709551615 4904079 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/19450/statm: 16808 16077 367 719 0 16087 0
Current children cumulated CPU time (s) 3.99
Current children cumulated vsize (KiB) 67232

Child status: 0
Real time (s): 4.05403
CPU time (s): 4.05438
CPU user time (s): 3.80042
CPU system time (s): 0.253961
CPU usage (%): 100.009
Max. virtual memory (cumulated for all children) (KiB): 202568

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

runsolver used 0.005999 second user time and 0.030995 second system time

The end

Launcher Data 

Begin job on node003 at 2010-07-06 18:48:26
IDJOB=2684828
IDBENCH=73651
IDSOLVER=1167
FILE ID=node003/2684828-1278434906
PBS_JOBID= 11233467
Free space on /tmp= 62568 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any 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.none -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2684828-1278434906/watcher-2684828-1278434906 -o /tmp/evaluation-result-2684828-1278434906/solver-2684828-1278434906 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2684828-1278434906.opb -t 1800 -m 1800

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

MD5SUM BENCH= fb0fc5066c2899699e0ea4a2b024975c
RANDOM SEED=106410680

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1456036 kB
Buffers:        104212 kB
Cached:         366240 kB
SwapCached:          0 kB
Active:         196612 kB
Inactive:       334124 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1456036 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            5216 kB
Writeback:           0 kB
AnonPages:       60296 kB
Mapped:          14376 kB
Slab:            50444 kB
PageTables:       4252 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180556 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= 62568 MiB
End job on node003 at 2010-07-06 18:48:30