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 in four parts:
  1. 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 provide some useful information on the computer.
  2. SOLVER DATA
    This is the output of the solver (stdout and stderr).
  3. 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 1200 seconds. 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 1230 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (900Mb).
    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.
  4. 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.

General information on the benchmark

Namenormalized-opb/submitted/manquinho/ttp/normalized-circ4_3.opb
MD5SUM4a7e7b149407cd13657a201380066d1b
Bench Categoryoptimization, small integers (OPTSMALLINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 20
Optimality of the best value was proved NO
Number of terms in the objective function 48
Biggest coefficient in the objective function 2
Number of bits for the biggest coefficient in the objective function 2
Sum of the numbers in the objective function 64
Number of bits of the sum of numbers in the objective function 7
Biggest number in a constraint 8
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 64
Number of bits of the biggest sum of numbers7
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.626903
Number of variables144
Total number of constraints704
Number of constraints which are clauses464
Number of constraints which are cardinality constraints (but not clauses)96
Number of constraints which are nor clauses,nor cardinality constraints144
Minimum length of a constraint2
Maximum length of a constraint12

Trace number 5146

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc1 THE 2005-04-13 22:34:19 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=3641 boxname=wulflinc1 idbench=257 idsolver=10 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  4a7e7b149407cd13657a201380066d1b  /oldhome/oroussel/tmp/wulflinc1/normalized-circ4_3.opb
REAL COMMAND:  minisat+ -ca /oldhome/oroussel/tmp/wulflinc1/normalized-circ4_3.opb /oldhome/oroussel/tmp/wulflinc1/normalized-circ4_3.opb
IDLAUNCH: 3641
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 2
cpu MHz		: 451.053
cache size	: 512 KB
fdiv_bug	: no
hlt_bug		: no
f00f_bug	: no
coma_bug	: no
fpu		: yes
fpu_exception	: yes
cpuid level	: 2
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips	: 888.83

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 2
cpu MHz		: 451.053
cache size	: 512 KB
fdiv_bug	: no
hlt_bug		: no
f00f_bug	: no
coma_bug	: no
fpu		: yes
fpu_exception	: yes
cpuid level	: 2
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips	: 899.07

/proc/meminfo:
MemTotal:      1034660 kB
MemFree:        858876 kB
Buffers:         40152 kB
Cached:         111692 kB
SwapCached:          0 kB
Active:         106708 kB
Inactive:        48288 kB
HighTotal:      131008 kB
HighFree:        26544 kB
LowTotal:       903652 kB
LowFree:        832332 kB
SwapTotal:     2097136 kB
SwapFree:      2097136 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           7200 kB
Slab:            15064 kB
Committed_AS:    92816 kB
PageTables:        344 kB
VmallocTotal:   114680 kB
VmallocUsed:      1388 kB
VmallocChunk:   113256 kB
JOB ENDED THE 2005-04-13 22:34:22 (client local time) WITH STATUS 30 IN 3.08253 SECONDS
stats: 3641 0 3.08253 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 764 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ############################################################
c   -- Clauses(.)/Splits(s): ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 762]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 760]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 758]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 756]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 754]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 752]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 750]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 748]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 746]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 744]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 742]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 740]---> Adder-cost: 8   maxlim: 5   bits: 3/3
c ---[ 667]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 666]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 665]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 664]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 663]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 662]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 661]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 660]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 659]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 658]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 657]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 656]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 655]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 654]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 653]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 652]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 651]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 650]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 649]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 648]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 647]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 646]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 645]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 644]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 642]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 640]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 638]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 636]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 634]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 632]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 630]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 628]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 626]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 624]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 622]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 620]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 618]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 616]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 614]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 612]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 610]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 608]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 606]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 604]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 602]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 600]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 598]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 596]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 591]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 590]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 589]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 588]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 583]---> Adder-cost: 20   maxlim: 8   bits: 4/4
c ---[ 582]---> Adder-cost: 20   maxlim: 8   bits: 4/4
c ---[ 581]---> Adder-cost: 20   maxlim: 8   bits: 4/4
c ---[ 580]---> Adder-cost: 20   maxlim: 8   bits: 4/4
c ---[ 575]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 574]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 573]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 572]---> Adder-cost: 18   maxlim: 8   bits: 4/4
c ---[ 246]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 244]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 242]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 240]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 238]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 236]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 234]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 232]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 230]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 228]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 226]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 224]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 222]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 220]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 218]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 216]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 214]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 212]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 210]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 208]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 206]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 204]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 202]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 200]---> Adder-cost: 2   maxlim: 2   bits: 2/2
c ---[ 191]---> Adder-cost: 8   maxlim: 3   bits: 3/2
c ---[ 190]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 189]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 188]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 187]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 186]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 185]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 184]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 183]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[ 182]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 181]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[ 180]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 175]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 174]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 173]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 172]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 171]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 170]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 169]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 168]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 167]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[ 166]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 165]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 164]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 159]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 158]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 157]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 156]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 155]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 154]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 153]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 152]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 151]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 150]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 149]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 148]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 143]---> Adder-cost: 8   maxlim: 3   bits: 3/2
c ---[ 142]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 141]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 140]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 139]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 138]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 137]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 136]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 135]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[ 134]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 133]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[ 132]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 127]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[ 126]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 125]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 124]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 123]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 122]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 121]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 120]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 119]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[ 118]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 117]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 116]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 111]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 110]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 109]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 108]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[ 107]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 106]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 105]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 104]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[ 103]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 102]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 101]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 100]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  95]---> Adder-cost: 8   maxlim: 3   bits: 3/2
c ---[  94]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  93]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[  92]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  91]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  90]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  89]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  88]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  87]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[  86]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  85]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[  84]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  79]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[  78]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  77]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  76]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  75]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  74]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  73]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  72]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  71]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[  70]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  69]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  68]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  63]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  62]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  61]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  60]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  59]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  58]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  57]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  56]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  55]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  54]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  53]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  52]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  47]---> Adder-cost: 8   maxlim: 3   bits: 3/2
c ---[  46]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  45]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[  44]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  43]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  42]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  41]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  40]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  39]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[  38]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  37]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[  36]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  31]---> Adder-cost: 6   maxlim: 3   bits: 3/2
c ---[  30]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  29]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  28]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  27]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  26]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  25]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  24]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  23]---> Adder-cost: 4   maxlim: 1   bits: 2/1
c ---[  22]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  21]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  20]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  15]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  14]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  13]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  12]---> Adder-cost: 2   maxlim: 3   bits: 3/2
c ---[  11]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[  10]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[   9]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[   8]---> Adder-cost: 7   maxlim: 2   bits: 3/2
c ---[   7]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[   6]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[   5]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[   4]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |    4616    15372 |    1538       0        0     nan |  0.000 % |
c ==============================================================================
c Found solution: 24
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 94   maxlim: 40   bits: 7/6
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        56 |    5038    16875 |    1679      51      215     4.2 |  0.000 % |
c ==============================================================================
c Found solution: 22
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 0   maxlim: 42   bits: 7/6
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        93 |    5034    16874 |    1678      87      664     7.6 |  0.000 % |
c ==============================================================================
c Found solution: 20
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 0   maxlim: 44   bits: 7/6
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       166 |    5038    16894 |    1679     160     1745    10.9 |  0.000 % |
c |       269 |    5022    16850 |    1846     261     3307    12.7 | 35.818 % |
c |       419 |    4975    16693 |    2031     409     5805    14.2 | 36.163 % |
c |       644 |    4906    16470 |    2234     630     9067    14.4 | 36.784 % |
c |       983 |    4835    16247 |    2458     964    14676    15.2 | 37.543 % |
c |      1489 |    4811    16181 |    2704    1467    22419    15.3 | 37.957 % |
c |      2248 |    4795    16137 |    2974    2224    35381    15.9 | 38.233 % |
c |      3388 |    4789    16120 |    3271    3362    51545    15.3 | 38.302 % |
c |      5096 |    4789    16120 |    3599    3133    40667    13.0 | 38.302 % |
c |      7660 |    4735    15932 |    3958    1462    11781     8.1 | 38.578 % |
c ==============================================================================
c Optimal solution: 20
s OPTIMUM FOUND
v v97 -v98 -v99 -v100 v101 -v102 -v103 -v104 v105 v106 -v107 -v108 v109 -v110 -v111 v112 -v113 v114 -v115 v116 -v117 -v118 -v119 v120 -v121 v122 -v123 v124 -v125 -v126 -v127 -v128 v129 -v130 v131 -v132 v133 -v134 -v135 -v136 v137 -v138 -v139 -v140 v141 v142 -v143 -v144 -v2 -v18 -v34 v50 -v66 -v82 -v3 -v19 -v35 -v51 v67 -v83 -v4 -v20 -v36 -v52 -v68 v84 v5 -v21 -v37 -v53 -v69 -v85 -v7 -v23 -v39 -v55 -v71 v87 -v8 -v24 -v40 -v56 v72 -v88 -v9 -v25 v41 -v57 -v73 -v89 -v10 v26 -v42 -v58 -v74 -v90 v12 -v28 -v44 -v60 -v76 -v92 -v13 v29 -v45 -v61 -v77 -v93 -v14 -v30 v46 -v62 -v78 -v94 -v15 -v31 -v47 v63 -v79 -v95 -v6 v22 v38 v54 -v70 -v86 -v11 -v27 -v43 v59 v75 v91 v16 -v32 -v48 -v64 v80 v96 v1 v17 v33 -v49 -v65 -v81
c _______________________________________________________________________________
c 
c restarts              : 13
c conflicts             : 9599           (3133 /sec)
c decisions             : 14119          (4609 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 3.06353 s
c _______________________________________________________________________________
#### END SOLVER DATA ####
#### BEGIN WATCHER DATA ####
Enforcing CPU limit (will send SIGTERM then SIGKILL): 1200 seconds
Enforcing CPUTime (will send SIGXCPU) limit: 1230 seconds
Enforcing VSIZE limit: 943718400 bytes
Raw data (loadavg): 0.84 0.94 0.90 2/56 16545
Raw data (stat): 16545 (runsolver) D 16544 12452 12451 0 -1 64 4 0 0 0 0 0 0 0 20 0 1 0 364511388 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 2147483391 7 90112 3225161850 0 0 17 0 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 1028
[startup+3.09148 s]
Raw data (loadavg): 0.85 0.94 0.90 1/55 16545
Raw data (stat): 16545 (runsolver) D 16544 12452 12451 0 -1 64 4 0 0 0 0 0 0 0 20 0 1 0 364511388 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 2147483391 7 90112 3225161850 0 0 17 0 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 0

Child status: 30
Real time (s): 3.09118
CPU time (s): 3.08253
CPU user time (s): 3.06453
CPU system time (s): 0.017997
CPU usage (%): 99.7201
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	20
#### END VERIFIER DATA ####