Trace number 2667412

Some explanations

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

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

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

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 0.959853 0.958907

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/web/
uclid_pb_benchmarks/normalized-blast-floppy1-7.ucl.opb
MD5SUMd632a3ec068dee28f1b227f8201fa32b
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.043992
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables2913
Total number of constraints3105
Number of constraints which are clauses2259
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints846
Minimum length of a constraint1
Maximum length of a constraint25
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 6518
Number of bits of the biggest number in a constraint 13
Biggest sum of numbers in a constraint 18803
Number of bits of the biggest sum of numbers15
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: SoPlex 1.4.2] [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-2667412-1276333656.opb>
0.00/0.10	c original problem has 2913 variables (2913 bin, 0 int, 0 impl, 0 cont) and 3105 constraints
0.00/0.10	c problem read
0.00/0.10	c No objective function, only one solution is needed.
0.00/0.10	c presolving settings loaded
0.10/0.14	c presolving:
0.10/0.18	c (round 1) 71 del vars, 1 del conss, 1 chg bounds, 514 chg sides, 1028 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.10/0.19	c (round 2) 75 del vars, 145 del conss, 5 chg bounds, 561 chg sides, 1124 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.20	c (round 3) 88 del vars, 148 del conss, 7 chg bounds, 566 chg sides, 1130 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.20	c (round 4) 93 del vars, 156 del conss, 12 chg bounds, 568 chg sides, 1133 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.21	c (round 5) 98 del vars, 164 del conss, 17 chg bounds, 569 chg sides, 1135 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.22	c (round 6) 102 del vars, 172 del conss, 21 chg bounds, 569 chg sides, 1135 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.22	c (round 7) 107 del vars, 180 del conss, 26 chg bounds, 571 chg sides, 1138 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.23	c (round 8) 112 del vars, 188 del conss, 31 chg bounds, 575 chg sides, 1144 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.23	c (round 9) 117 del vars, 197 del conss, 36 chg bounds, 575 chg sides, 1144 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.24	c (round 10) 119 del vars, 200 del conss, 38 chg bounds, 575 chg sides, 1144 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.24	c (round 11) 124 del vars, 209 del conss, 43 chg bounds, 575 chg sides, 1144 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.25	c (round 12) 137 del vars, 212 del conss, 45 chg bounds, 579 chg sides, 1148 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.25	c (round 13) 141 del vars, 220 del conss, 49 chg bounds, 579 chg sides, 1148 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.26	c (round 14) 145 del vars, 228 del conss, 53 chg bounds, 579 chg sides, 1148 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.26	c (round 15) 150 del vars, 236 del conss, 58 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.27	c (round 16) 155 del vars, 244 del conss, 63 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.28	c (round 17) 160 del vars, 252 del conss, 68 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29828 impls, 0 clqs
0.19/0.28	c (round 18) 167 del vars, 262 del conss, 73 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29838 impls, 0 clqs
0.19/0.29	c (round 19) 172 del vars, 274 del conss, 78 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29838 impls, 0 clqs
0.19/0.29	c (round 20) 176 del vars, 282 del conss, 82 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29838 impls, 0 clqs
0.29/0.30	c (round 21) 180 del vars, 287 del conss, 84 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29890 impls, 0 clqs
0.29/0.30	c (round 22) 187 del vars, 302 del conss, 89 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29898 impls, 0 clqs
0.29/0.31	c (round 23) 192 del vars, 314 del conss, 94 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29898 impls, 0 clqs
0.29/0.31	c (round 24) 195 del vars, 319 del conss, 96 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29910 impls, 0 clqs
0.29/0.32	c (round 25) 200 del vars, 330 del conss, 101 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29910 impls, 0 clqs
0.29/0.32	c (round 26) 202 del vars, 335 del conss, 103 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29924 impls, 0 clqs
0.29/0.33	c (round 27) 204 del vars, 340 del conss, 105 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29944 impls, 0 clqs
0.29/0.33	c (round 28) 209 del vars, 348 del conss, 110 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29944 impls, 0 clqs
0.29/0.34	c (round 29) 214 del vars, 356 del conss, 115 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29944 impls, 0 clqs
0.29/0.34	c (round 30) 216 del vars, 361 del conss, 117 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29946 impls, 0 clqs
0.29/0.35	c (round 31) 221 del vars, 369 del conss, 122 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29946 impls, 0 clqs
0.29/0.36	c (round 32) 226 del vars, 377 del conss, 127 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29946 impls, 0 clqs
0.29/0.36	c (round 33) 228 del vars, 382 del conss, 129 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 29948 impls, 0 clqs
0.29/0.37	c (round 34) 233 del vars, 391 del conss, 133 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 30198 impls, 0 clqs
0.29/0.37	c (round 35) 237 del vars, 400 del conss, 136 chg bounds, 581 chg sides, 1151 chg coeffs, 0 upgd conss, 30206 impls, 0 clqs
0.29/0.38	c (round 36) 240 del vars, 405 del conss, 139 chg bounds, 586 chg sides, 1158 chg coeffs, 0 upgd conss, 30206 impls, 0 clqs
0.29/0.38	c (round 37) 245 del vars, 413 del conss, 144 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30206 impls, 0 clqs
0.29/0.39	c (round 38) 249 del vars, 421 del conss, 148 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30206 impls, 0 clqs
0.29/0.39	c (round 39) 253 del vars, 429 del conss, 152 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30206 impls, 0 clqs
0.39/0.40	c (round 40) 258 del vars, 438 del conss, 156 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30208 impls, 0 clqs
0.39/0.40	c (round 41) 262 del vars, 448 del conss, 160 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30208 impls, 0 clqs
0.39/0.41	c (round 42) 266 del vars, 456 del conss, 164 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30208 impls, 0 clqs
0.39/0.41	c (round 43) 270 del vars, 464 del conss, 168 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30208 impls, 0 clqs
0.39/0.42	c (round 44) 274 del vars, 472 del conss, 172 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30208 impls, 0 clqs
0.39/0.42	c (round 45) 278 del vars, 480 del conss, 176 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30208 impls, 0 clqs
0.39/0.43	c (round 46) 283 del vars, 489 del conss, 180 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30210 impls, 0 clqs
0.39/0.43	c (round 47) 287 del vars, 499 del conss, 184 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30210 impls, 0 clqs
0.39/0.44	c (round 48) 291 del vars, 507 del conss, 188 chg bounds, 588 chg sides, 1161 chg coeffs, 0 upgd conss, 30210 impls, 0 clqs
0.39/0.44	c (round 49) 296 del vars, 515 del conss, 193 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30210 impls, 0 clqs
0.39/0.45	c (round 50) 301 del vars, 524 del conss, 197 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30212 impls, 0 clqs
0.39/0.45	c (round 51) 306 del vars, 535 del conss, 201 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30214 impls, 0 clqs
0.39/0.46	c (round 52) 310 del vars, 545 del conss, 205 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30214 impls, 0 clqs
0.39/0.47	c (round 53) 315 del vars, 554 del conss, 209 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30216 impls, 0 clqs
0.39/0.47	c (round 54) 320 del vars, 564 del conss, 214 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30216 impls, 0 clqs
0.39/0.48	c (round 55) 322 del vars, 569 del conss, 216 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30218 impls, 0 clqs
0.39/0.48	c (round 56) 324 del vars, 574 del conss, 218 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30220 impls, 0 clqs
0.39/0.49	c (round 57) 328 del vars, 580 del conss, 222 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30220 impls, 0 clqs
0.39/0.49	c (round 58) 332 del vars, 590 del conss, 226 chg bounds, 592 chg sides, 1167 chg coeffs, 0 upgd conss, 30220 impls, 0 clqs
0.39/0.50	c (round 59) 338 del vars, 595 del conss, 232 chg bounds, 598 chg sides, 1178 chg coeffs, 0 upgd conss, 30226 impls, 0 clqs
0.49/0.50	c (round 60) 340 del vars, 601 del conss, 234 chg bounds, 600 chg sides, 1181 chg coeffs, 0 upgd conss, 30228 impls, 0 clqs
0.49/0.51	c (round 61) 342 del vars, 604 del conss, 236 chg bounds, 600 chg sides, 1181 chg coeffs, 0 upgd conss, 30228 impls, 0 clqs
0.49/0.51	c (round 62) 347 del vars, 610 del conss, 241 chg bounds, 601 chg sides, 1182 chg coeffs, 0 upgd conss, 30228 impls, 0 clqs
0.49/0.52	c (round 63) 351 del vars, 619 del conss, 245 chg bounds, 601 chg sides, 1183 chg coeffs, 0 upgd conss, 30228 impls, 0 clqs
0.49/0.52	c (round 64) 355 del vars, 626 del conss, 249 chg bounds, 601 chg sides, 1183 chg coeffs, 0 upgd conss, 30228 impls, 0 clqs
0.49/0.53	c (round 65) 356 del vars, 633 del conss, 250 chg bounds, 601 chg sides, 1183 chg coeffs, 0 upgd conss, 30230 impls, 0 clqs
0.49/0.53	c (round 66) 358 del vars, 636 del conss, 252 chg bounds, 601 chg sides, 1183 chg coeffs, 0 upgd conss, 30230 impls, 0 clqs
0.49/0.54	c (round 67) 363 del vars, 642 del conss, 257 chg bounds, 601 chg sides, 1184 chg coeffs, 0 upgd conss, 30230 impls, 0 clqs
0.49/0.54	c (round 68) 368 del vars, 652 del conss, 262 chg bounds, 604 chg sides, 1187 chg coeffs, 0 upgd conss, 30230 impls, 0 clqs
0.49/0.55	c (round 69) 372 del vars, 658 del conss, 266 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30230 impls, 0 clqs
0.49/0.55	c (round 70) 378 del vars, 671 del conss, 272 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30232 impls, 0 clqs
0.49/0.55	c (round 71) 382 del vars, 681 del conss, 276 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30236 impls, 0 clqs
0.49/0.56	c (round 72) 388 del vars, 692 del conss, 282 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30238 impls, 0 clqs
0.49/0.56	c (round 73) 392 del vars, 706 del conss, 286 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.49/0.57	c (round 74) 397 del vars, 712 del conss, 291 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.49/0.57	c (round 75) 401 del vars, 722 del conss, 295 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.49/0.58	c (round 76) 406 del vars, 728 del conss, 300 chg bounds, 606 chg sides, 1190 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.49/0.58	c (round 77) 411 del vars, 738 del conss, 305 chg bounds, 607 chg sides, 1192 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.49/0.59	c (round 78) 416 del vars, 745 del conss, 310 chg bounds, 607 chg sides, 1192 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.49/0.59	c (round 79) 420 del vars, 752 del conss, 314 chg bounds, 607 chg sides, 1192 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.59/0.60	c (round 80) 426 del vars, 762 del conss, 320 chg bounds, 607 chg sides, 1192 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.59/0.60	c (round 81) 430 del vars, 769 del conss, 324 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.59/0.61	c (round 82) 436 del vars, 778 del conss, 330 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.59/0.61	c (round 83) 440 del vars, 784 del conss, 334 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.59/0.62	c (round 84) 444 del vars, 794 del conss, 338 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30242 impls, 0 clqs
0.59/0.62	c (round 85) 447 del vars, 799 del conss, 341 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30266 impls, 0 clqs
0.59/0.63	c (round 86) 449 del vars, 804 del conss, 343 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30292 impls, 0 clqs
0.59/0.63	c (round 87) 453 del vars, 809 del conss, 345 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30416 impls, 0 clqs
0.59/0.64	c (round 88) 458 del vars, 822 del conss, 350 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30416 impls, 0 clqs
0.59/0.64	c (round 89) 463 del vars, 829 del conss, 355 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30416 impls, 0 clqs
0.59/0.65	c (round 90) 467 del vars, 835 del conss, 357 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30460 impls, 0 clqs
0.59/0.65	c (round 91) 472 del vars, 846 del conss, 362 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30460 impls, 0 clqs
0.59/0.66	c (round 92) 475 del vars, 853 del conss, 364 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30472 impls, 0 clqs
0.59/0.66	c (round 93) 477 del vars, 861 del conss, 366 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30622 impls, 0 clqs
0.59/0.67	c (round 94) 482 del vars, 867 del conss, 371 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30622 impls, 0 clqs
0.59/0.67	c (round 95) 484 del vars, 874 del conss, 373 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30640 impls, 0 clqs
0.59/0.67	c (round 96) 489 del vars, 882 del conss, 378 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30640 impls, 0 clqs
0.59/0.68	c (round 97) 491 del vars, 887 del conss, 380 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30650 impls, 0 clqs
0.59/0.68	c (round 98) 493 del vars, 892 del conss, 382 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.59/0.69	c (round 99) 497 del vars, 898 del conss, 386 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.59/0.69	c (round 100) 502 del vars, 906 del conss, 391 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.69/0.70	c (round 101) 506 del vars, 914 del conss, 395 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.69/0.70	c (round 102) 510 del vars, 922 del conss, 399 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.69/0.71	c (round 103) 514 del vars, 930 del conss, 403 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.69/0.71	c (round 104) 518 del vars, 938 del conss, 407 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30750 impls, 0 clqs
0.69/0.72	c (round 105) 520 del vars, 945 del conss, 409 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30868 impls, 0 clqs
0.69/0.72	c (round 106) 522 del vars, 949 del conss, 411 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30868 impls, 0 clqs
0.69/0.73	c (round 107) 524 del vars, 954 del conss, 413 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30874 impls, 0 clqs
0.69/0.73	c (round 108) 528 del vars, 960 del conss, 417 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30874 impls, 0 clqs
0.69/0.73	c (round 109) 529 del vars, 964 del conss, 418 chg bounds, 611 chg sides, 1199 chg coeffs, 0 upgd conss, 30874 impls, 0 clqs
0.79/0.81	c (round 110) 529 del vars, 1041 del conss, 418 chg bounds, 612 chg sides, 1199 chg coeffs, 1989 upgd conss, 30874 impls, 0 clqs
0.79/0.83	c (round 111) 608 del vars, 1048 del conss, 418 chg bounds, 614 chg sides, 1203 chg coeffs, 1989 upgd conss, 30930 impls, 0 clqs
0.79/0.86	c (round 112) 624 del vars, 1048 del conss, 418 chg bounds, 637 chg sides, 1579 chg coeffs, 1989 upgd conss, 30930 impls, 0 clqs
0.79/0.87	c (round 113) 624 del vars, 1048 del conss, 418 chg bounds, 639 chg sides, 1621 chg coeffs, 1989 upgd conss, 30930 impls, 0 clqs
0.79/0.89	c presolving (114 rounds):
0.79/0.89	c  624 deleted vars, 1048 deleted constraints, 418 tightened bounds, 0 added holes, 639 changed sides, 1621 changed coefficients
0.79/0.89	c  30930 implications, 0 cliques
0.79/0.89	c presolved problem has 2289 variables (2289 bin, 0 int, 0 impl, 0 cont) and 2057 constraints
0.79/0.89	c     537 constraints of type <knapsack>
0.79/0.89	c      70 constraints of type <linear>
0.79/0.89	c    1450 constraints of type <logicor>
0.79/0.89	c transformed objective value is always integral (scale: 1)
0.79/0.89	c Presolving Time: 0.50
0.79/0.89	c - non default parameters ----------------------------------------------------------------------
0.79/0.89	c # SCIP version 1.2.1.2
0.79/0.89	c 
0.79/0.89	c # frequency for displaying node information lines
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 100]
0.79/0.89	c display/freq = 10000
0.79/0.89	c 
0.79/0.89	c # maximal time in seconds to run
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.89	c limits/time = 1799.91
0.79/0.89	c 
0.79/0.89	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.89	c limits/memory = 1620
0.79/0.89	c 
0.79/0.89	c # solving stops, if the given number of solutions were found (-1: no limit)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.89	c limits/solutions = 1
0.79/0.89	c 
0.79/0.89	c # maximal number of separation rounds per node (-1: unlimited)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 5]
0.79/0.89	c separating/maxrounds = 1
0.79/0.89	c 
0.79/0.89	c # maximal number of separation rounds in the root node (-1: unlimited)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.89	c separating/maxroundsroot = 5
0.79/0.89	c 
0.79/0.89	c # should presolving try to simplify inequalities
0.79/0.89	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.89	c constraints/linear/simplifyinequalities = TRUE
0.79/0.89	c 
0.79/0.89	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.79/0.89	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.79/0.89	c constraints/knapsack/disaggregation = FALSE
0.79/0.89	c 
0.79/0.89	c # should presolving try to simplify knapsacks
0.79/0.89	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.89	c constraints/knapsack/simplifyinequalities = TRUE
0.79/0.89	c 
0.79/0.89	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.89	c presolving/probing/maxrounds = 0
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/coefdiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/coefdiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/coefdiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 30]
0.79/0.89	c heuristics/crossover/freq = -1
0.79/0.89	c 
0.79/0.89	c # number of nodes added to the contingent of the total nodes
0.79/0.89	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.89	c heuristics/crossover/nodesofs = 750
0.79/0.89	c 
0.79/0.89	c # number of nodes without incumbent change that heuristic should wait
0.79/0.89	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.79/0.89	c heuristics/crossover/nwaitingnodes = 100
0.79/0.89	c 
0.79/0.89	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.79/0.89	c # [type: real, range: [0,1], default: 0.1]
0.79/0.89	c heuristics/crossover/nodesquot = 0.15
0.79/0.89	c 
0.79/0.89	c # minimum percentage of integer variables that have to be fixed 
0.79/0.89	c # [type: real, range: [0,1], default: 0.666]
0.79/0.89	c heuristics/crossover/minfixingrate = 0.5
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.89	c heuristics/feaspump/freq = -1
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/feaspump/maxlpiterofs = 2000
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/fracdiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/fracdiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/fracdiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/guideddiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/guideddiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/guideddiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/intdiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/intshifting/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/linesearchdiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.89	c heuristics/nlp/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.89	c heuristics/objpscostdiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to total iteration number
0.79/0.89	c # [type: real, range: [0,1], default: 0.01]
0.79/0.89	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.89	c heuristics/oneopt/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/pscostdiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/pscostdiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.89	c heuristics/rens/freq = -1
0.79/0.89	c 
0.79/0.89	c # minimum percentage of integer variables that have to be fixable 
0.79/0.89	c # [type: real, range: [0,1], default: 0.5]
0.79/0.89	c heuristics/rens/minfixingrate = 0.3
0.79/0.89	c 
0.79/0.89	c # number of nodes added to the contingent of the total nodes
0.79/0.89	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.89	c heuristics/rens/nodesofs = 2000
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.89	c heuristics/rootsoldiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.79/0.89	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.89	c heuristics/rounding/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/shifting/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.89	c heuristics/simplerounding/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.89	c heuristics/trivial/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.89	c heuristics/trysol/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.89	c heuristics/veclendiving/freq = -1
0.79/0.89	c 
0.79/0.89	c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.89	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.89	c heuristics/veclendiving/maxlpiterquot = 0.075
0.79/0.89	c 
0.79/0.89	c # additional number of allowed LP iterations
0.79/0.89	c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.89	c heuristics/veclendiving/maxlpiterofs = 1500
0.79/0.89	c 
0.79/0.89	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.89	c heuristics/zirounding/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.89	c separating/cmir/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.89	c separating/flowcover/freq = -1
0.79/0.89	c 
0.79/0.89	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.79/0.89	c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.89	c separating/rapidlearning/freq = 0
0.79/0.89	c 
0.79/0.89	c -----------------------------------------------------------------------------------------------
0.79/0.89	c start solving
0.79/0.89	c 
0.90/0.92	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.90/0.92	c   0.6s|     1 |     0 |    56 |     - |  11M|   0 |   - |2289 |2057 |2289 |2057 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.90/0.92	c   0.6s|     1 |     0 |    56 |     - |  11M|   0 |   - |2289 |2057 |2289 |2057 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.90/0.92	c 
0.90/0.92	c SCIP Status        : problem is solved [infeasible]
0.90/0.92	c Solving Time (sec) : 0.55
0.90/0.92	c Solving Nodes      : 1
0.90/0.92	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.90/0.92	c Dual Bound         : +1.00000000000000e+20
0.90/0.92	c Gap                : 0.00 %
0.90/0.92	s UNSATISFIABLE
0.90/0.92	c SCIP Status        : problem is solved [infeasible]
0.90/0.92	c Solving Time       :       0.55
0.90/0.92	c Original Problem   :
0.90/0.92	c   Problem name     : HOME/instance-2667412-1276333656.opb
0.90/0.92	c   Variables        : 2913 (2913 binary, 0 integer, 0 implicit integer, 0 continuous)
0.90/0.92	c   Constraints      : 3105 initial, 3105 maximal
0.90/0.92	c Presolved Problem  :
0.90/0.92	c   Problem name     : t_HOME/instance-2667412-1276333656.opb
0.90/0.92	c   Variables        : 2289 (2289 binary, 0 integer, 0 implicit integer, 0 continuous)
0.90/0.92	c   Constraints      : 2057 initial, 2057 maximal
0.90/0.92	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.90/0.92	c   trivial          :       0.05          0          0          0          0          0          0          0          0
0.90/0.92	c   dualfix          :       0.02         39          0          0          0          0          0          0          0
0.90/0.92	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.90/0.92	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.90/0.92	c   implics          :       0.06          0         89          0          0          0          0          0          0
0.90/0.92	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.90/0.92	c   knapsack         :       0.02          0          0          0          0          0          1         27        422
0.90/0.92	c   linear           :       0.22        418         78          0        418          0       1046        612       1199
0.90/0.92	c   logicor          :       0.05          0          0          0          0          0          1          0          0
0.90/0.92	c   root node        :          -          0          -          -          0          -          -          -          -
0.90/0.92	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.90/0.92	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.90/0.92	c   knapsack         :        537          0          1          0          0          0          0          0          0          0
0.90/0.92	c   linear           :         70          0          1          0          0          0          0          0          0          0
0.90/0.92	c   logicor          :       1450          0          1          0          0          0          0          0          0          0
0.90/0.92	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.90/0.92	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.90/0.92	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.90/0.92	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
0.90/0.92	c   linear           :       0.00       0.00       0.00       0.00       0.00
0.90/0.92	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.90/0.92	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.90/0.92	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.90/0.92	c   vbounds          :       0.00          1          0          0
0.90/0.92	c   rootredcost      :       0.00          0          0          0
0.90/0.92	c   pseudoobj        :       0.00          0          0          0
0.90/0.92	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.90/0.92	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.90/0.92	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.90/0.92	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.90/0.92	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.90/0.92	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.90/0.92	c   applied globally :          -          -          -          0        0.0          -          -          -
0.90/0.92	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.90/0.92	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.90/0.92	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.90/0.92	c   redcost          :       0.00          0          0          0          0          0
0.90/0.92	c   impliedbounds    :       0.00          0          0          0          0          0
0.90/0.92	c   intobj           :       0.00          0          0          0          0          0
0.90/0.92	c   cgmip            :       0.00          0          0          0          0          0
0.90/0.92	c   gomory           :       0.00          0          0          0          0          0
0.90/0.92	c   strongcg         :       0.00          0          0          0          0          0
0.90/0.92	c   cmir             :       0.00          0          0          0          0          0
0.90/0.92	c   flowcover        :       0.00          0          0          0          0          0
0.90/0.92	c   clique           :       0.00          0          0          0          0          0
0.90/0.92	c   zerohalf         :       0.00          0          0          0          0          0
0.90/0.92	c   mcf              :       0.00          0          0          0          0          0
0.90/0.92	c   rapidlearning    :       0.00          0          0          0          0          0
0.90/0.92	c Pricers            :       Time      Calls       Vars
0.90/0.92	c   problem variables:       0.00          0          0
0.90/0.92	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.90/0.92	c   pscost           :       0.00          0          0          0          0          0          0
0.90/0.92	c   inference        :       0.00          0          0          0          0          0          0
0.90/0.92	c   mostinf          :       0.00          0          0          0          0          0          0
0.90/0.92	c   leastinf         :       0.00          0          0          0          0          0          0
0.90/0.92	c   fullstrong       :       0.00          0          0          0          0          0          0
0.90/0.92	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.90/0.92	c   random           :       0.00          0          0          0          0          0          0
0.90/0.92	c   relpscost        :       0.00          0          0          0          0          0          0
0.90/0.92	c Primal Heuristics  :       Time      Calls      Found
0.90/0.92	c   LP solutions     :       0.00          -          0
0.90/0.92	c   pseudo solutions :       0.00          -          0
0.90/0.92	c   trivial          :       0.00          1          0
0.90/0.92	c   simplerounding   :       0.00          0          0
0.90/0.92	c   zirounding       :       0.00          0          0
0.90/0.92	c   rounding         :       0.00          0          0
0.90/0.92	c   shifting         :       0.00          0          0
0.90/0.92	c   intshifting      :       0.00          0          0
0.90/0.92	c   oneopt           :       0.00          0          0
0.90/0.92	c   twoopt           :       0.00          0          0
0.90/0.92	c   fixandinfer      :       0.00          0          0
0.90/0.92	c   feaspump         :       0.00          0          0
0.90/0.92	c   coefdiving       :       0.00          0          0
0.90/0.92	c   pscostdiving     :       0.00          0          0
0.90/0.92	c   fracdiving       :       0.00          0          0
0.90/0.92	c   veclendiving     :       0.00          0          0
0.90/0.92	c   intdiving        :       0.00          0          0
0.90/0.92	c   actconsdiving    :       0.00          0          0
0.90/0.92	c   objpscostdiving  :       0.00          0          0
0.90/0.92	c   rootsoldiving    :       0.00          0          0
0.90/0.92	c   linesearchdiving :       0.00          0          0
0.90/0.92	c   guideddiving     :       0.00          0          0
0.90/0.92	c   octane           :       0.00          0          0
0.90/0.92	c   rens             :       0.00          0          0
0.90/0.92	c   rins             :       0.00          0          0
0.90/0.92	c   localbranching   :       0.00          0          0
0.90/0.92	c   mutation         :       0.00          0          0
0.90/0.92	c   crossover        :       0.00          0          0
0.90/0.92	c   dins             :       0.00          0          0
0.90/0.92	c   undercover       :       0.00          0          0
0.90/0.92	c   nlp              :       0.00          0          0
0.90/0.92	c   trysol           :       0.00          0          0
0.90/0.92	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.90/0.92	c   primal LP        :       0.00          0          0       0.00          -
0.90/0.92	c   dual LP          :       0.01          1         56      56.00    5600.00
0.90/0.92	c   lex dual LP      :       0.00          0          0       0.00          -
0.90/0.92	c   barrier LP       :       0.00          0          0       0.00          -
0.90/0.92	c   diving/probing LP:       0.00          0          0       0.00          -
0.90/0.92	c   strong branching :       0.00          0          0       0.00          -
0.90/0.92	c     (at root node) :          -          0          0       0.00          -
0.90/0.92	c   conflict analysis:       0.00          0          0       0.00          -
0.90/0.92	c B&B Tree           :
0.90/0.92	c   number of runs   :          1
0.90/0.92	c   nodes            :          1
0.90/0.92	c   nodes (total)    :          1
0.90/0.92	c   nodes left       :          0
0.90/0.92	c   max depth        :          0
0.90/0.92	c   max depth (total):          0
0.90/0.92	c   backtracks       :          0 (0.0%)
0.90/0.92	c   delayed cutoffs  :          0
0.90/0.92	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.90/0.92	c   avg switch length:       2.00
0.90/0.92	c   switching time   :       0.00
0.90/0.92	c Solution           :
0.90/0.92	c   Solutions found  :          0 (0 improvements)
0.90/0.92	c   Primal Bound     : infeasible
0.90/0.92	c   Dual Bound       :          -
0.90/0.92	c   Gap              :       0.00 %
0.90/0.92	c   Root Dual Bound  :          -
0.90/0.92	c   Root Iterations  :         56
0.90/0.95	c Time complete: 0.94.

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-2667412-1276333656/watcher-2667412-1276333656 -o /tmp/evaluation-result-2667412-1276333656/solver-2667412-1276333656 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667412-1276333656.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.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=7724 CPUtime=0
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 1005 0 0 0 0 0 0 0 20 0 1 0 8969533 7909376 925 1992294400 4194304 8223781 140734774088928 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/10605/statm: 1931 934 348 984 0 944 0

[startup+0.10848 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=15456 CPUtime=0.1
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 3463 0 0 0 9 1 0 0 20 0 1 0 8969533 15826944 3019 1992294400 4194304 8223781 140734774088928 18446744073709551615 4682707 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10605/statm: 3864 3020 378 984 0 2877 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 15456

[startup+0.201488 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=24788 CPUtime=0.19
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 6088 0 0 0 16 3 0 0 20 0 1 0 8969533 25382912 5130 1992294400 4194304 8223781 140734774088928 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10605/statm: 6197 5130 444 984 0 5210 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 24788

[startup+0.301497 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=25816 CPUtime=0.29
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 10944 0 0 0 22 7 0 0 20 0 1 0 8969533 26435584 5360 1992294400 4194304 8223781 140734774088928 18446744073709551615 7253477 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10605/statm: 6454 5373 444 984 0 5467 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25816

[startup+0.701529 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=25816 CPUtime=0.69
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 31287 0 0 0 45 24 0 0 21 0 1 0 8969533 26435584 5143 1992294400 4194304 8223781 140734774088928 18446744073709551615 7253477 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10605/statm: 6454 5155 444 984 0 5467 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 25816

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

[startup+0.801536 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=29872 CPUtime=0.79
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 35135 0 0 0 52 27 0 0 21 0 1 0 8969533 30588928 6421 1992294400 4194304 8223781 140734774088928 18446744073709551615 7253477 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10605/statm: 7468 6423 454 984 0 6481 0
Current children cumulated CPU time (s) 0.79
Current children cumulated vsize (KiB) 29872

[startup+0.901545 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 10605
/proc/meminfo: memFree=1738828/2059040 swapFree=4192072/4192956
[pid=10605] ppid=10603 vsize=31084 CPUtime=0.9
/proc/10605/stat : 10605 (pbscip.linux.x8) R 10603 10605 9144 0 -1 4202496 38267 0 0 0 61 29 0 0 21 0 1 0 8969533 31830016 6724 1992294400 4194304 8223781 140734774088928 18446744073709551615 6208255 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10605/statm: 7771 6724 497 984 0 6784 0
Current children cumulated CPU time (s) 0.9
Current children cumulated vsize (KiB) 31084

Child status: 0
Real time (s): 0.958907
CPU time (s): 0.959853
CPU user time (s): 0.659899
CPU system time (s): 0.299954
CPU usage (%): 100.099
Max. virtual memory (cumulated for all children) (KiB): 31084

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

runsolver used 0.007998 second user time and 0.009998 second system time

The end

Launcher Data 

Begin job on node003 at 2010-06-12 11:07:36
IDJOB=2667412
IDBENCH=1460
IDSOLVER=1169
FILE ID=node003/2667412-1276333656
PBS_JOBID= 11173163
Free space on /tmp= 62556 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/web/uclid_pb_benchmarks/normalized-blast-floppy1-7.ucl.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2667412-1276333656/watcher-2667412-1276333656 -o /tmp/evaluation-result-2667412-1276333656/solver-2667412-1276333656 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667412-1276333656.opb -t 1800 -m 1800

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

MD5SUM BENCH= d632a3ec068dee28f1b227f8201fa32b
RANDOM SEED=2095600611

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.251
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.50
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.251
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:       1739356 kB
Buffers:         68100 kB
Cached:         125844 kB
SwapCached:          0 kB
Active:         105920 kB
Inactive:       146432 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1739356 kB
SwapTotal:     4192956 kB
SwapFree:      4192072 kB
Dirty:            5264 kB
Writeback:           0 kB
AnonPages:       58472 kB
Mapped:          15424 kB
Slab:            45704 kB
PageTables:       3948 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   182432 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= 62552 MiB
End job on node003 at 2010-06-12 11:07:37