Trace number 2664541

Some explanations

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

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

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

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPnone SCIP 1.2.1.2 without any LP solverUNSAT 1.52477 1.52445

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/web/
uclid_pb_benchmarks/normalized-46s.smv.opb
MD5SUM3549530e67a18968a913c3e0a7729641
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.055991
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables1612
Total number of constraints3653
Number of constraints which are clauses3273
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints380
Minimum length of a constraint1
Maximum length of a constraint13
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 79
Number of bits of the biggest number in a constraint 7
Biggest sum of numbers in a constraint 268
Number of bits of the biggest sum of numbers9
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-2664541-1276330846.opb>
0.01/0.07	c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 constraints
0.01/0.07	c problem read
0.01/0.07	c No objective function, only one solution is needed.
0.01/0.08	c presolving settings loaded
0.01/0.08	c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.01/0.10	c presolving:
0.09/0.16	c (round 1) 215 del vars, 150 del conss, 49 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.09/0.17	c (round 2) 217 del vars, 498 del conss, 51 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.09/0.17	c (round 3) 236 del vars, 522 del conss, 61 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58276 impls, 0 clqs
0.09/0.18	c (round 4) 243 del vars, 552 del conss, 65 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58316 impls, 0 clqs
0.09/0.18	c (round 5) 255 del vars, 574 del conss, 71 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58394 impls, 0 clqs
0.09/0.19	c (round 6) 269 del vars, 606 del conss, 79 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58496 impls, 0 clqs
0.09/0.19	c (round 7) 293 del vars, 663 del conss, 98 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58598 impls, 0 clqs
0.19/0.20	c (round 8) 317 del vars, 718 del conss, 112 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58904 impls, 0 clqs
0.19/0.21	c (round 9) 334 del vars, 776 del conss, 129 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58936 impls, 0 clqs
0.19/0.22	c (round 10) 419 del vars, 967 del conss, 194 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 59680 impls, 0 clqs
0.19/0.22	c (round 11) 454 del vars, 1071 del conss, 219 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60363 impls, 0 clqs
0.19/0.23	c (round 12) 474 del vars, 1137 del conss, 225 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60609 impls, 0 clqs
0.19/0.23	c (round 13) 477 del vars, 1170 del conss, 227 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60695 impls, 0 clqs
0.19/0.24	c (round 14) 485 del vars, 1187 del conss, 232 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 60952 impls, 0 clqs
0.19/0.25	c (round 15) 501 del vars, 1223 del conss, 243 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61346 impls, 0 clqs
0.19/0.25	c (round 16) 513 del vars, 1258 del conss, 250 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61358 impls, 0 clqs
0.19/0.26	c (round 17) 517 del vars, 1280 del conss, 252 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61364 impls, 0 clqs
0.19/0.26	c (round 18) 520 del vars, 1290 del conss, 254 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61368 impls, 0 clqs
0.19/0.27	c (round 19) 522 del vars, 1297 del conss, 256 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61370 impls, 0 clqs
0.19/0.27	c (round 20) 524 del vars, 1303 del conss, 258 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61372 impls, 0 clqs
0.19/0.27	c (round 21) 528 del vars, 1309 del conss, 262 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61372 impls, 0 clqs
0.19/0.28	c (round 22) 534 del vars, 1323 del conss, 268 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61392 impls, 0 clqs
0.19/0.28	c (round 23) 544 del vars, 1346 del conss, 272 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61475 impls, 0 clqs
0.19/0.29	c (round 24) 550 del vars, 1368 del conss, 275 chg bounds, 197 chg sides, 401 chg coeffs, 0 upgd conss, 61512 impls, 0 clqs
0.19/0.29	c (round 25) 554 del vars, 1382 del conss, 277 chg bounds, 198 chg sides, 403 chg coeffs, 0 upgd conss, 61524 impls, 0 clqs
0.29/0.30	c (round 26) 561 del vars, 1404 del conss, 280 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61707 impls, 0 clqs
0.29/0.30	c (round 27) 566 del vars, 1420 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61731 impls, 0 clqs
0.29/0.31	c (round 28) 567 del vars, 1427 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61739 impls, 0 clqs
0.29/0.31	c (round 29) 567 del vars, 1429 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61739 impls, 0 clqs
0.29/0.36	c (round 30) 567 del vars, 1446 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.29/0.38	c (round 31) 639 del vars, 1458 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.39/0.40	c presolving (32 rounds):
0.39/0.40	c  639 deleted vars, 1458 deleted constraints, 282 tightened bounds, 0 added holes, 199 changed sides, 405 changed coefficients
0.39/0.40	c  61739 implications, 0 cliques
0.39/0.40	c presolved problem has 973 variables (973 bin, 0 int, 0 impl, 0 cont) and 2195 constraints
0.39/0.40	c     332 constraints of type <knapsack>
0.39/0.40	c    1863 constraints of type <logicor>
0.39/0.40	c transformed objective value is always integral (scale: 1)
0.39/0.40	c Presolving Time: 0.22
0.39/0.40	c - non default parameters ----------------------------------------------------------------------
0.39/0.40	c # SCIP version 1.2.1.2
0.39/0.40	c 
0.39/0.40	c # frequency for displaying node information lines
0.39/0.40	c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.40	c display/freq = 10000
0.39/0.40	c 
0.39/0.40	c # maximal time in seconds to run
0.39/0.40	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40	c limits/time = 1799.94
0.39/0.40	c 
0.39/0.40	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.40	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40	c limits/memory = 1620
0.39/0.40	c 
0.39/0.40	c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40	c limits/solutions = 1
0.39/0.40	c 
0.39/0.40	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40	c lp/solvefreq = -1
0.39/0.40	c 
0.39/0.40	c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.40	c separating/maxrounds = 1
0.39/0.40	c 
0.39/0.40	c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40	c separating/maxroundsroot = 5
0.39/0.40	c 
0.39/0.40	c # should presolving try to simplify inequalities
0.39/0.40	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40	c constraints/linear/simplifyinequalities = TRUE
0.39/0.40	c 
0.39/0.40	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.40	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.40	c constraints/knapsack/disaggregation = FALSE
0.39/0.40	c 
0.39/0.40	c # should presolving try to simplify knapsacks
0.39/0.40	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40	c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.40	c 
0.39/0.40	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40	c presolving/probing/maxrounds = 0
0.39/0.40	c 
0.39/0.40	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40	c heuristics/coefdiving/freq = -1
0.39/0.40	c 
0.39/0.40	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40	c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.40	c 
0.39/0.40	c # additional number of allowed LP iterations
0.39/0.40	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40	c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.40	c 
0.39/0.40	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.40	c heuristics/crossover/freq = -1
0.39/0.40	c 
0.39/0.40	c # number of nodes added to the contingent of the total nodes
0.39/0.40	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.40	c heuristics/crossover/nodesofs = 750
0.39/0.40	c 
0.39/0.40	c # number of nodes without incumbent change that heuristic should wait
0.39/0.40	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.40	c heuristics/crossover/nwaitingnodes = 100
0.39/0.40	c 
0.39/0.40	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.40	c # [type: real, range: [0,1], default: 0.1]
0.39/0.40	c heuristics/crossover/nodesquot = 0.15
0.39/0.40	c 
0.39/0.40	c # minimum percentage of integer variables that have to be fixed 
0.39/0.40	c # [type: real, range: [0,1], default: 0.666]
0.39/0.40	c heuristics/crossover/minfixingrate = 0.5
0.39/0.40	c 
0.39/0.40	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.40	c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40	c heuristics/feaspump/freq = -1
0.39/0.40	c 
0.39/0.40	c # additional number of allowed LP iterations
0.39/0.40	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/fracdiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41	c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/guideddiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41	c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41	c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/intshifting/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/linesearchdiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41	c heuristics/nlp/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41	c heuristics/objpscostdiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.41	c # [type: real, range: [0,1], default: 0.01]
0.39/0.41	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41	c heuristics/oneopt/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/pscostdiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41	c heuristics/rens/freq = -1
0.39/0.41	c 
0.39/0.41	c # minimum percentage of integer variables that have to be fixable 
0.39/0.41	c # [type: real, range: [0,1], default: 0.5]
0.39/0.41	c heuristics/rens/minfixingrate = 0.3
0.39/0.41	c 
0.39/0.41	c # number of nodes added to the contingent of the total nodes
0.39/0.41	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.41	c heuristics/rens/nodesofs = 2000
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41	c heuristics/rootsoldiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.41	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41	c heuristics/rounding/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/shifting/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41	c heuristics/simplerounding/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41	c heuristics/trivial/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41	c heuristics/trysol/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41	c heuristics/veclendiving/freq = -1
0.39/0.41	c 
0.39/0.41	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41	c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.41	c 
0.39/0.41	c # additional number of allowed LP iterations
0.39/0.41	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41	c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.41	c 
0.39/0.41	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41	c heuristics/zirounding/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41	c separating/cmir/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41	c separating/flowcover/freq = -1
0.39/0.41	c 
0.39/0.41	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.41	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41	c separating/rapidlearning/freq = 0
0.39/0.41	c 
0.39/0.41	c -----------------------------------------------------------------------------------------------
0.39/0.41	c start solving
0.39/0.41	c 
0.39/0.41	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.39/0.41	c   0.2s|     1 |     2 |     0 |     - |6879k|   0 |   - | 973 |2195 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.49/1.50	c 
1.49/1.50	c SCIP Status        : problem is solved [infeasible]
1.49/1.50	c Solving Time (sec) : 1.26
1.49/1.50	c Solving Nodes      : 1687
1.49/1.50	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
1.49/1.50	c Dual Bound         : +1.00000000000000e+20
1.49/1.50	c Gap                : 0.00 %
1.49/1.50	s UNSATISFIABLE
1.49/1.50	c SCIP Status        : problem is solved [infeasible]
1.49/1.50	c Solving Time       :       1.26
1.49/1.50	c Original Problem   :
1.49/1.50	c   Problem name     : HOME/instance-2664541-1276330846.opb
1.49/1.50	c   Variables        : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.50	c   Constraints      : 3653 initial, 3653 maximal
1.49/1.50	c Presolved Problem  :
1.49/1.50	c   Problem name     : t_HOME/instance-2664541-1276330846.opb
1.49/1.50	c   Variables        : 973 (973 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.50	c   Constraints      : 2195 initial, 2696 maximal
1.49/1.50	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.49/1.50	c   trivial          :       0.01          1          0          0          0          0          0          0          0
1.49/1.50	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.49/1.50	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.49/1.50	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.49/1.50	c   implics          :       0.02          0        274          0          0          0          0          0          0
1.49/1.50	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.49/1.50	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
1.49/1.50	c   linear           :       0.13        281         83          0        282          0       1458        199        405
1.49/1.50	c   logicor          :       0.04          0          0          0          0          0          0          0          0
1.49/1.50	c   root node        :          -        420          -          -        420          -          -          -          -
1.49/1.50	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.49/1.50	c   integral         :          0          0          0          0          0          0          0          0          0          0
1.49/1.50	c   knapsack         :        332          0       8474          0       1416        209       4209          0          0          0
1.49/1.50	c   logicor          :       1863+         0       6930          0       1416        244      18403          0          0          0
1.49/1.50	c   countsols        :          0          0          0          0       1416          0          0          0          0          0
1.49/1.50	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.49/1.50	c   integral         :       0.00       0.00       0.00       0.00       0.00
1.49/1.50	c   knapsack         :       0.21       0.00       0.21       0.00       0.00
1.49/1.50	c   logicor          :       0.39       0.00       0.13       0.00       0.26
1.49/1.50	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.49/1.50	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.49/1.50	c   vbounds          :       0.01          1          0          0
1.49/1.50	c   rootredcost      :       0.00          0          0          0
1.49/1.50	c   pseudoobj        :       0.01          0          0          0
1.49/1.50	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.49/1.50	c   propagation      :       0.00        453        451       1562        9.0        119        4.4          -
1.49/1.50	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.49/1.50	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.49/1.50	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.49/1.50	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.49/1.50	c   applied globally :          -          -          -        858        6.8          -          -          -
1.49/1.50	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.49/1.50	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.49/1.50	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.49/1.50	c   redcost          :       0.00          0          0          0          0          0
1.49/1.50	c   impliedbounds    :       0.00          0          0          0          0          0
1.49/1.50	c   intobj           :       0.00          0          0          0          0          0
1.49/1.50	c   cgmip            :       0.00          0          0          0          0          0
1.49/1.50	c   gomory           :       0.00          0          0          0          0          0
1.49/1.50	c   strongcg         :       0.00          0          0          0          0          0
1.49/1.50	c   cmir             :       0.00          0          0          0          0          0
1.49/1.50	c   flowcover        :       0.00          0          0          0          0          0
1.49/1.50	c   clique           :       0.00          0          0          0          0          0
1.49/1.50	c   zerohalf         :       0.00          0          0          0          0          0
1.49/1.50	c   mcf              :       0.00          0          0          0          0          0
1.49/1.50	c   rapidlearning    :       0.00          0          0          0          0          0
1.49/1.50	c Pricers            :       Time      Calls       Vars
1.49/1.50	c   problem variables:       0.00          0          0
1.49/1.50	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.49/1.50	c   relpscost        :       0.00          0          0          0          0          0          0
1.49/1.50	c   pscost           :       0.00          0          0          0          0          0          0
1.49/1.50	c   inference        :       0.15       1416          0          0          0          0       2832
1.49/1.50	c   mostinf          :       0.00          0          0          0          0          0          0
1.49/1.50	c   leastinf         :       0.00          0          0          0          0          0          0
1.49/1.50	c   fullstrong       :       0.00          0          0          0          0          0          0
1.49/1.50	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.49/1.50	c   random           :       0.00          0          0          0          0          0          0
1.49/1.50	c Primal Heuristics  :       Time      Calls      Found
1.49/1.50	c   LP solutions     :       0.00          -          0
1.49/1.50	c   pseudo solutions :       0.00          -          0
1.49/1.50	c   trivial          :       0.00          1          0
1.49/1.50	c   simplerounding   :       0.00          0          0
1.49/1.50	c   zirounding       :       0.00          0          0
1.49/1.50	c   rounding         :       0.00          0          0
1.49/1.50	c   shifting         :       0.00          0          0
1.49/1.50	c   intshifting      :       0.00          0          0
1.49/1.50	c   oneopt           :       0.00          0          0
1.49/1.50	c   twoopt           :       0.00          0          0
1.49/1.50	c   fixandinfer      :       0.00          0          0
1.49/1.50	c   feaspump         :       0.00          0          0
1.49/1.50	c   coefdiving       :       0.00          0          0
1.49/1.50	c   pscostdiving     :       0.00          0          0
1.49/1.50	c   fracdiving       :       0.00          0          0
1.49/1.50	c   veclendiving     :       0.00          0          0
1.49/1.50	c   intdiving        :       0.00          0          0
1.49/1.50	c   actconsdiving    :       0.00          0          0
1.49/1.50	c   objpscostdiving  :       0.00          0          0
1.49/1.50	c   rootsoldiving    :       0.00          0          0
1.49/1.50	c   linesearchdiving :       0.00          0          0
1.49/1.50	c   guideddiving     :       0.00          0          0
1.49/1.50	c   octane           :       0.00          0          0
1.49/1.50	c   rens             :       0.00          0          0
1.49/1.50	c   rins             :       0.00          0          0
1.49/1.50	c   localbranching   :       0.00          0          0
1.49/1.50	c   mutation         :       0.00          0          0
1.49/1.50	c   crossover        :       0.00          0          0
1.49/1.50	c   dins             :       0.00          0          0
1.49/1.50	c   undercover       :       0.00          0          0
1.49/1.50	c   nlp              :       0.00          0          0
1.49/1.50	c   trysol           :       0.00          0          0
1.49/1.50	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.49/1.50	c   primal LP        :       0.00          0          0       0.00          -
1.49/1.50	c   dual LP          :       0.00          0          0       0.00          -
1.49/1.50	c   lex dual LP      :       0.00          0          0       0.00          -
1.49/1.50	c   barrier LP       :       0.00          0          0       0.00          -
1.49/1.50	c   diving/probing LP:       0.00          0          0       0.00          -
1.49/1.50	c   strong branching :       0.00          0          0       0.00          -
1.49/1.50	c     (at root node) :          -          0          0       0.00          -
1.49/1.50	c   conflict analysis:       0.00          0          0       0.00          -
1.49/1.50	c B&B Tree           :
1.49/1.50	c   number of runs   :          1
1.49/1.50	c   nodes            :       1687
1.49/1.50	c   nodes (total)    :       1687
1.49/1.50	c   nodes left       :          0
1.49/1.50	c   max depth        :        106
1.49/1.50	c   max depth (total):        106
1.49/1.50	c   backtracks       :        232 (13.8%)
1.49/1.50	c   delayed cutoffs  :       1146
1.49/1.50	c   repropagations   :       1367 (6643 domain reductions, 182 cutoffs)
1.49/1.50	c   avg switch length:       3.89
1.49/1.50	c   switching time   :       0.16
1.49/1.50	c Solution           :
1.49/1.50	c   Solutions found  :          0 (0 improvements)
1.49/1.50	c   Primal Bound     : infeasible
1.49/1.50	c   Dual Bound       :          -
1.49/1.50	c   Gap              :       0.00 %
1.49/1.50	c   Root Dual Bound  : +0.00000000000000e+00
1.49/1.50	c   Root Iterations  :          0
1.49/1.52	c Time complete: 1.51.

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-2664541-1276330846/watcher-2664541-1276330846 -o /tmp/evaluation-result-2664541-1276330846/solver-2664541-1276330846 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664541-1276330846.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 1.00 1.00 3/106 10006
/proc/meminfo: memFree=1864656/2059040 swapFree=4136452/4192956
[pid=10006] ppid=10004 vsize=6584 CPUtime=0
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 9226 0 -1 4202496 964 0 0 0 0 0 0 0 20 0 1 0 8688604 6742016 887 1992294400 4194304 7136930 140735247450096 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/10006/statm: 1646 897 254 719 0 925 0

[startup+0.0162639 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 10006
/proc/meminfo: memFree=1864656/2059040 swapFree=4136452/4192956
[pid=10006] ppid=10004 vsize=8128 CPUtime=0.01
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 9226 0 -1 4202496 1526 0 0 0 1 0 0 0 20 0 1 0 8688604 8323072 1449 1992294400 4194304 7136930 140735247450096 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/10006/statm: 2032 1449 268 719 0 1311 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 8128

[startup+0.101273 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 10006
/proc/meminfo: memFree=1864656/2059040 swapFree=4136452/4192956
[pid=10006] ppid=10004 vsize=17764 CPUtime=0.09
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 9226 0 -1 4202496 4094 0 0 0 8 1 0 0 20 0 1 0 8688604 18190336 3663 1992294400 4194304 7136930 140735247450096 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 4441 3663 337 719 0 3720 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17764

[startup+0.301297 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 10006
/proc/meminfo: memFree=1864656/2059040 swapFree=4136452/4192956
[pid=10006] ppid=10004 vsize=21356 CPUtime=0.29
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 9226 0 -1 4202496 11308 0 0 0 21 8 0 0 20 0 1 0 8688604 21868544 4452 1992294400 4194304 7136930 140735247450096 18446744073709551615 6346613 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 5339 4465 347 719 0 4618 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 21356

[startup+0.701343 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 10006
/proc/meminfo: memFree=1864656/2059040 swapFree=4136452/4192956
[pid=10006] ppid=10004 vsize=24420 CPUtime=0.69
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 9226 0 -1 4202496 14775 0 0 0 57 12 0 0 21 0 1 0 8688604 25006080 5349 1992294400 4194304 7136930 140735247450096 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 6105 5349 393 719 0 5384 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 24420

[startup+1.50144 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 10007
/proc/meminfo: memFree=1844312/2059040 swapFree=4136452/4192956
[pid=10006] ppid=10004 vsize=25368 CPUtime=1.49
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 9226 0 -1 4202496 15018 0 0 0 132 17 0 0 23 0 1 0 8688604 25976832 5592 1992294400 4194304 7136930 140735247450096 18446744073709551615 5966499 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 6342 5592 393 719 0 5621 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 25368

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

Child status: 0
Real time (s): 1.52445
CPU time (s): 1.52477
CPU user time (s): 1.3468
CPU system time (s): 0.177972
CPU usage (%): 100.02
Max. virtual memory (cumulated for all children) (KiB): 25368

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

runsolver used 0.005999 second user time and 0.017997 second system time

The end

Launcher Data 

Begin job on node001 at 2010-06-12 10:20:46
IDJOB=2664541
IDBENCH=1448
IDSOLVER=1167
FILE ID=node001/2664541-1276330846
PBS_JOBID= 11173164
Free space on /tmp= 62392 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/web/uclid_pb_benchmarks/normalized-46s.smv.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-2664541-1276330846/watcher-2664541-1276330846 -o /tmp/evaluation-result-2664541-1276330846/solver-2664541-1276330846 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664541-1276330846.opb -t 1800 -m 1800

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

MD5SUM BENCH= 3549530e67a18968a913c3e0a7729641
RANDOM SEED=478579009

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1865060 kB
Buffers:         13992 kB
Cached:         108996 kB
SwapCached:      16744 kB
Active:         109516 kB
Inactive:        33212 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1865060 kB
SwapTotal:     4192956 kB
SwapFree:      4136452 kB
Dirty:            3672 kB
Writeback:           0 kB
AnonPages:       10788 kB
Mapped:           9148 kB
Slab:            29548 kB
PageTables:       4012 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180724 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= 62388 MiB
End job on node001 at 2010-06-12 10:20:47