0.00/0.00 c 2016-06-29T23:51:12+0200
0.00/0.00 c version = 0.5.0
0.00/0.00 c githash = 1a49202
0.00/0.00 c compilationtime = 2016-05-02 00:19:28.990761 UTC
0.00/0.00 c arch = x86_64
0.00/0.00 c os = linux
0.00/0.00 c compiler = ghc 7.10
0.00/0.00 c packages:
0.00/0.00 c OptDir-0.0.3
0.00/0.00 c array-0.5.1.0
0.00/0.00 c base-4.8.2.0
0.00/0.00 c bytestring-0.10.6.0
0.00/0.00 c bytestring-builder-0.10.6.0.0
0.00/0.00 c clock-0.7.2
0.00/0.00 c containers-0.5.6.2
0.00/0.00 c data-default-0.5.3
0.00/0.00 c data-default-class-0.0.1
0.00/0.00 c data-interval-1.2.0
0.00/0.00 c deepseq-1.4.1.1
0.00/0.00 c directory-1.2.2.0
0.00/0.00 c exceptions-0.8.2.1
0.00/0.00 c extended-reals-0.2.1.0
0.00/0.00 c filepath-1.4.0.0
0.00/0.00 c finite-field-0.8.0
0.00/0.00 c hashable-1.2.4.0
0.00/0.00 c heaps-0.3.3
0.00/0.00 c intern-0.9.1.4
0.00/0.00 c loop-0.3.0
0.00/0.00 c mtl-2.2.1
0.00/0.00 c multiset-0.3.2
0.00/0.00 c mwc-random-0.13.3.2
0.00/0.00 c parse_dimacs-1.3
0.00/0.00 c parsec-3.1.9
0.00/0.00 c prettyclass-1.0.0.0
0.00/0.00 c primes-0.2.1.0
0.00/0.00 c primitive-0.6.1.0
0.00/0.00 c process-1.2.3.0
0.00/0.00 c pseudo-boolean-0.1.3.0
0.00/0.01 c queue-0.1.2
0.00/0.01 c semigroups-0.18.1
0.00/0.01 c sign-0.4.3
0.00/0.01 c stm-2.4.4.1
0.00/0.01 c template-haskell-2.10.0.0
0.00/0.01 c temporary-1.2.0.4
0.00/0.01 c time-1.5.0.1
0.00/0.01 c transformers-0.4.2.0
0.00/0.01 c transformers-compat-0.5.1.4
0.00/0.01 c type-level-numbers-0.1.1.1
0.00/0.01 c unbounded-delays-0.1.0.9
0.00/0.01 c unordered-containers-0.2.6.0
0.00/0.01 c vector-0.11.0.0
0.00/0.01 c vector-space-0.10.3
0.00/0.01 c command line = ["+RTS","-H1G","-M15500m","-K1G","-RTS","--pb","--search=bcd2","HOME/instance-4117843-1467237072.opb"]
0.00/0.01 c use --random-gen="2314716623 3943213288 157861913 1591799561 2669750123 1425142741 154385882 1173146493 388551283 2258630049 1584447553 2855884080 1854235180 755061472 3058090536 2559248947 1014394819 1043531687 2088162757 1489818897 2888160557 3965176989 2870620638 2438733457 951757571 2491857131 260893721 2374681284 4293227368 442238930 3220180619 3303705612 914951478 2745144060 3726281879 2560600487 1955022827 2069508727 3711418971 118817077 3344180673 3523266360 116321703 1699841425 4283003775 1843319492 4063368160 2681035237 2468364705 2231247212 4187651771 1045280503 2982143774 4207426069 2821750040 1504966923 858285704 1224869388 2748155956 3153149617 501874402 3662426629 2877324900 2015886930 1046828488 930988296 2668496902 424527537 2994931653 260081232 2237061601 2819409275 1616075251 988995192 2186488440 1379753830 1928861871 3008476237 2052393377 1629916287 2417681588 3837856121 513770757 226792485 878773908 2570122669 696976092 2200222847 1467281791 1556891101 3711322570 1817737720 1589453080 1614162146 1645463165 2689328586 169739719 3304570297 2302659521 647230036 1721638368 388385412 1110593671 892119104 2227748116 1780388173 428539898 3670511037 1143389315 1129113842 983027173 3960985277 1987676739 933240338 3608682845 1702062374 1710256857 109621153 1761896550 2369493190 1703474536 2351601802 3894577146 2306782748 1949469610 1109371201 1747810677 1375673701 2789260993 291797397 2465901777 2850527651 3898691139 3077706201 4057809849 2701009600 3512925729 884669743 110182306 1221193880 696171091 2363415393 1175156402 392666112 2463521575 2204022242 962985597 3831126054 521868062 2478386449 2277340505 3621327933 1510112750 1718775661 4059808633 313089862 2084780647 2403063953 3368871490 1527688938 3300321077 706304279 3515206872 965906994 968997633 2344982778 2375398788 3240976290 1018911352 1862198679 4179803337 1569984809 139434020 40520333 1699009077 585218763 4233663704 3834153811 2338613634 476295429 1984421511 2016680436 2821001977 2318913692 2972984640 1843879260 582682551 2498724244 2947253199 1642988099 2463855274 2288727683 3107942467 2874409689 3347766370 3683990962 3341713221 23317630 1557880384 2850447675 1497294852 3564056804 952135742 1476357180 2164640712 3317374879 847064279 2460773004 3458397385 3939155614 712213664 182438900 4117630527 3674535347 2262138056 1717908636 3296909600 2463610004 1814342323 3759926160 1250551025 1793095280 1742528388 708065985 3772719790 2509196069 2970956538 3323487115 854830690 1436549278 3428725953 3863296790 3484809549 3273326615 431265140 3307121744 3798198192 3794833852 2357189553 884700772 978748616 196911802 2569379805 1586349154 1496602522 2526403620 3495403884 444372122 4177889335 2192446794 2125927846 1677973961 3064722038 2836513961 3578824186 2774304537 255 362436" option to reproduce the execution
0.00/0.01 c #vars 64
0.00/0.01 c #constraints 46
0.00/0.01 c BCD2: Hardening is enabled.
0.00/0.01 c BCD2: BiasedSearch is enabled.
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 0
0.00/0.01 c 0.0s | 0 | 1 | 0 | 48 0 | 16 | 4
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 1
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 o 30
0.00/0.01 c BCD2: updating upper bound: 64 -> 29
0.00/0.01 c BCD2: 0 <= obj <= 29
0.00/0.01 c BCD2: #cores=0, #unrelaxed=64, #relaxed=0, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 4
0.00/0.01 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 4
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 0
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.01 c lower bound updated to 1
0.00/0.01 c BCD2: 1 <= obj <= 29
0.00/0.01 c BCD2: #cores=1, #unrelaxed=63, #relaxed=1, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 4
0.00/0.01 c 0.0s | 0 | 2 | 0 | 48 0 | 16 | 4
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 2
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.01 c lower bound updated to 2
0.00/0.01 c BCD2: 2 <= obj <= 29
0.00/0.01 c BCD2: #cores=2, #unrelaxed=62, #relaxed=2, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=3 bias=3/4
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 4
0.00/0.01 c 0.0s | 0 | 5 | 0 | 48 0 | 16 | 4
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 5
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.01 c lower bound updated to 3
0.00/0.01 c BCD2: 3 <= obj <= 29
0.00/0.01 c BCD2: #cores=3, #unrelaxed=58, #relaxed=6, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=4 bias=4/5
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 5
0.00/0.01 c 0.0s | 0 | 3 | 0 | 48 0 | 16 | 5
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 3
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.01 c lower bound updated to 4
0.00/0.01 c BCD2: 4 <= obj <= 29
0.00/0.01 c BCD2: #cores=4, #unrelaxed=57, #relaxed=7, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=5 bias=5/6
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 5
0.00/0.02 c 0.0s | 0 | 5 | 0 | 48 0 | 16 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 5
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 29
0.00/0.02 c BCD2: #cores=5, #unrelaxed=56, #relaxed=8, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=6 bias=6/7
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 5
0.00/0.02 c 0.0s | 0 | 9 | 1 | 48 0 | 16 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 9
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 29
0.00/0.02 c BCD2: #cores=6, #unrelaxed=52, #relaxed=12, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=7 bias=7/8
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 16 | 5
0.00/0.02 c 0.0s | 0 | 9 | 1 | 48 0 | 16 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 9
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 3 and merging with 2 cores into a new core of size 11: cost of the new core is >=3
0.00/0.02 c lower bound updated to 7
0.00/0.02 c BCD2: 7 <= obj <= 29
0.00/0.02 c BCD2: #cores=5, #unrelaxed=49, #relaxed=15, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=8 bias=8/9
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 18 | 5
0.00/0.02 c 0.0s | 0 | 5 | 0 | 48 0 | 18 | 7
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 5
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 8
0.00/0.02 c BCD2: 8 <= obj <= 29
0.00/0.02 c BCD2: #cores=6, #unrelaxed=48, #relaxed=16, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=9 bias=9/10
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 18 | 7
0.00/0.02 c 0.0s | 0 | 7 | 0 | 48 0 | 18 | 7
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 7
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02 c lower bound updated to 9
0.00/0.02 c BCD2: 9 <= obj <= 29
0.00/0.02 c BCD2: #cores=7, #unrelaxed=46, #relaxed=18, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=10 bias=10/11
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 18 | 7
0.00/0.02 c 0.0s | 0 | 8 | 1 | 48 0 | 18 | 7
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.02 c lower bound updated to 10
0.00/0.02 c BCD2: 10 <= obj <= 29
0.00/0.02 c BCD2: #cores=7, #unrelaxed=45, #relaxed=19, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=11 bias=11/12
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 19 | 7
0.00/0.02 c 0.0s | 0 | 8 | 1 | 48 0 | 19 | 8
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=3
0.00/0.02 c lower bound updated to 11
0.00/0.02 c BCD2: 11 <= obj <= 29
0.00/0.02 c BCD2: #cores=7, #unrelaxed=44, #relaxed=20, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 20 | 8
0.00/0.02 c 0.0s | 0 | 8 | 1 | 48 0 | 20 | 9
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 5: cost of the new core is >=4
0.00/0.02 c lower bound updated to 12
0.00/0.02 c BCD2: 12 <= obj <= 29
0.00/0.02 c BCD2: #cores=7, #unrelaxed=43, #relaxed=21, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=13 bias=13/14
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 21 | 9
0.00/0.02 c 0.0s | 0 | 8 | 1 | 48 0 | 21 | 10
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 6: cost of the new core is >=5
0.00/0.02 c lower bound updated to 13
0.00/0.02 c BCD2: 13 <= obj <= 29
0.00/0.02 c BCD2: #cores=7, #unrelaxed=42, #relaxed=22, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 22 | 10
0.00/0.02 c 0.0s | 0 | 7 | 0 | 48 0 | 22 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 7
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 14
0.00/0.02 c BCD2: 14 <= obj <= 29
0.00/0.02 c BCD2: #cores=8, #unrelaxed=41, #relaxed=23, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=15 bias=15/16
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 22 | 11
0.00/0.02 c 0.0s | 0 | 12 | 0 | 48 0 | 22 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 12
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 5: cost of the new core is >=1
0.00/0.02 c lower bound updated to 15
0.00/0.02 c BCD2: 15 <= obj <= 29
0.00/0.02 c BCD2: #cores=9, #unrelaxed=36, #relaxed=28, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=16 bias=16/17
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 22 | 11
0.00/0.02 c 0.0s | 0 | 13 | 1 | 48 0 | 22 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 13
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.02 c lower bound updated to 16
0.00/0.02 c BCD2: 16 <= obj <= 29
0.00/0.02 c BCD2: #cores=10, #unrelaxed=33, #relaxed=31, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=17 bias=17/18
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 22 | 11
0.00/0.02 c 0.0s | 0 | 14 | 1 | 48 0 | 22 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 14
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.02 c lower bound updated to 17
0.00/0.02 c BCD2: 17 <= obj <= 29
0.00/0.02 c BCD2: #cores=11, #unrelaxed=29, #relaxed=35, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=18 bias=18/19
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 22 | 11
0.00/0.02 c 0.0s | 0 | 14 | 1 | 48 0 | 22 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 14
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 6: cost of the new core is >=2
0.00/0.02 c lower bound updated to 18
0.00/0.02 c BCD2: 18 <= obj <= 29
0.00/0.02 c BCD2: #cores=11, #unrelaxed=28, #relaxed=36, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=19 bias=19/20
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 48 0 | 23 | 11
0.00/0.03 c 0.0s | 0 | 17 | 0 | 48 0 | 23 | 12
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 17
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 7: cost of the new core is >=1
0.00/0.03 c lower bound updated to 19
0.00/0.03 c BCD2: 19 <= obj <= 29
0.00/0.03 c BCD2: #cores=12, #unrelaxed=21, #relaxed=43, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=20 bias=20/21
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 23 | 13
0.00/0.03 c 0.0s | 0 | 14 | 0 | 48 0 | 23 | 13
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 20
0.00/0.03 c BCD2: 20 <= obj <= 29
0.00/0.03 c BCD2: #cores=13, #unrelaxed=18, #relaxed=46, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 23 | 13
0.00/0.03 c 0.0s | 0 | 15 | 1 | 48 0 | 23 | 13
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 15
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 5: cost of the new core is >=2
0.00/0.03 c lower bound updated to 21
0.00/0.03 c BCD2: 21 <= obj <= 29
0.00/0.03 c BCD2: #cores=13, #unrelaxed=16, #relaxed=48, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=22 bias=22/23
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 24 | 13
0.00/0.03 c 0.0s | 0 | 14 | 0 | 48 0 | 24 | 14
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 22
0.00/0.03 c BCD2: 22 <= obj <= 29
0.00/0.03 c BCD2: #cores=14, #unrelaxed=15, #relaxed=49, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=23 bias=23/24
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 24 | 14
0.00/0.03 c 0.0s | 0 | 25 | 2 | 48 0 | 24 | 14
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 25
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 1 and merging with 2 cores into a new core of size 12: cost of the new core is >=8
0.00/0.03 c lower bound updated to 23
0.00/0.03 c BCD2: 23 <= obj <= 29
0.00/0.03 c BCD2: #cores=13, #unrelaxed=14, #relaxed=50, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=24 bias=24/25
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 26 | 14
0.00/0.03 c 0.0s | 0 | 15 | 0 | 48 0 | 26 | 16
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 15
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 24
0.00/0.03 c BCD2: 24 <= obj <= 29
0.00/0.03 c BCD2: #cores=14, #unrelaxed=11, #relaxed=53, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=25 bias=25/26
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 26 | 16
0.00/0.03 c 0.0s | 0 | 18 | 1 | 48 0 | 26 | 16
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 18
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 1 and merging with 2 cores into a new core of size 11: cost of the new core is >=3
0.00/0.03 c lower bound updated to 25
0.00/0.03 c BCD2: 25 <= obj <= 29
0.00/0.03 c BCD2: #cores=13, #unrelaxed=10, #relaxed=54, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=26 bias=26/27
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 28 | 16
0.00/0.03 c 0.0s | 0 | 18 | 1 | 48 0 | 28 | 18
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 18
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 1 and merging with 2 cores into a new core of size 11: cost of the new core is >=4
0.00/0.03 c lower bound updated to 26
0.00/0.03 c BCD2: 26 <= obj <= 29
0.00/0.03 c BCD2: #cores=12, #unrelaxed=9, #relaxed=55, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=27 bias=27/28
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 30 | 18
0.00/0.03 c 0.0s | 0 | 25 | 12 | 48 0 | 30 | 20
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 25
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 12
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 0 and merging with 4 cores into a new core of size 36: cost of the new core is >=12
0.00/0.03 c lower bound updated to 27
0.00/0.03 c BCD2: 27 <= obj <= 29
0.00/0.03 c BCD2: #cores=9, #unrelaxed=9, #relaxed=55, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=28 bias=28/29
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 48 0 | 34 | 20
0.00/0.03 c 0.0s | 0 | 28 | 18 | 48 0 | 34 | 24
0.00/0.03 c #cpu_time = 0.002s
0.00/0.03 c #wall_clock_time = 0.002s
0.00/0.03 c #decision = 28
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 18
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 0 and merging with 2 cores into a new core of size 48: cost of the new core is >=21
0.00/0.03 c lower bound updated to 28
0.00/0.04 c BCD2: 28 <= obj <= 29
0.00/0.04 c BCD2: #cores=8, #unrelaxed=9, #relaxed=55, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=29 bias=29/30
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 48 0 | 36 | 24
0.00/0.04 c 0.0s | 0 | 46 | 15 | 48 0 | 84 | 76
0.00/0.04 c #cpu_time = 0.002s
0.00/0.04 c #wall_clock_time = 0.002s
0.00/0.04 c #decision = 46
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 15
0.00/0.04 c #restart = 0
0.00/0.04 c lower bound updated to 30
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v -x1 -x2 x3 x4 x5 -x6 -x7 -x8 x9 x10
0.00/0.04 v -x11 x12 -x13 -x14 x15 x16 -x17 -x18 -x19 -x20
0.00/0.04 v x21 -x22 -x23 -x24 x25 x26 -x27 x28 -x29 -x30
0.00/0.04 v x31 -x32 -x33 x34 -x35 -x36 -x37 -x38 x39 x40
0.00/0.04 v x41 x42 x43 x44 x45 x46 x47 -x48 x49 -x50
0.00/0.04 v x51 -x52 -x53 x54 -x55 -x56 x57 -x58 -x59 -x60
0.00/0.04 v x61 x62 x63 -x64
0.00/0.04 c total CPU time = 0.041s
0.00/0.04 c total wall clock time = 0.041s
runsolver Copyright (C) 2010-2013 Olivier ROUSSEL
This is runsolver version 3.3.7 (svn: 2553)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4117843-1467237072/watcher-4117843-1467237072 -o /tmp/evaluation-result-4117843-1467237072/solver-4117843-1467237072 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node119-1467209132-3988 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4117843-1467237072.opb
pid=6770
running on 4 cores: 1,3,5,7
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): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.22 2.23 2.18 3/179 6773
/proc/meminfo: memFree=23455256/32872528 swapFree=1253612/1390560
[pid=6773] ppid=6770 vsize=694716 CPUtime=0 cores=1,3,5,7
/proc/6773/stat : 6773 (toysat) R 6770 6773 3971 0 -1 4202496 2589 0 0 0 0 0 0 0 20 0 4 0 4667999 711389184 2949 33554432000 4194304 16246674 140735517052352 140735517051776 13880264 0 2 0 34082818 18446744073709551615 0 0 17 5 0 0 0 0 0
/proc/6773/statm: 174447 2959 441 2943 0 171341 0
[pid=6773/tid=6774] ppid=6770 vsize=713148 CPUtime=0 cores=1,3,5,7
/proc/6773/task/6774/stat : 6774 (toysat) S 6770 6773 3971 0 -1 4202560 10 0 0 0 0 0 0 0 20 0 4 0 4667999 730263552 3019 33554432000 4194304 16246674 140735517052352 139986065140976 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 1 0 0 0 0 0
[pid=6773/tid=6775] ppid=6770 vsize=717244 CPUtime=0 cores=1,3,5,7
/proc/6773/task/6775/stat : 6775 (toysat) S 6770 6773 3971 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 4667999 734457856 3037 33554432000 4194304 16246674 140735517052352 139986054651120 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 3 0 0 0 0 0
[pid=6773/tid=6776] ppid=6770 vsize=721340 CPUtime=0 cores=1,3,5,7
/proc/6773/task/6776/stat : 6776 (toysat) S 6770 6773 3971 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 4667999 738652160 3052 33554432000 4194304 16246674 140735517052352 139985936182448 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 1 0 0 0 0 0
Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 6773 sig 9
??? kill -6773 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0466251
CPU time (s): 0.044993
CPU user time (s): 0.018997
CPU system time (s): 0.025996
CPU usage (%): 96.4995
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.018997
system time used= 0.025996
maximum resident set size= 44260
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10727
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= 19
involuntary context switches= 1
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.003999 second user time and 0.006998 second system time
The end