/export/starexec/sandbox2/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 9 rules on 6 letters mirror SRS with 9 rules on 6 letters DP SRS with 18 strict rules and 9 weak rules on 10 letters weights SRS with 4 strict rules and 9 weak rules on 9 letters EDG 3 sub-proofs 1 SRS with 1 rules on 2 letters Usable SRS with 1 rules on 2 letters weights SRS with 0 rules on 0 letters no strict rules 2 SRS with 1 rules on 2 letters Usable SRS with 1 rules on 2 letters weights SRS with 0 rules on 0 letters no strict rules 3 SRS with 2 strict rules and 9 weak rules on 7 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 3, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 1 strict rules and 9 weak rules on 7 letters EDG SRS with 1 strict rules and 9 weak rules on 7 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 3, encoding = FBV, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 0 strict rules and 9 weak rules on 6 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [r1, a] -> [a, a, a, r1] {- Input 0 -} [r2, a] -> [a, a, a, r2] {- Input 1 -} [a, l1] -> [l1, a, a, a] {- Input 2 -} [a, a, l2] -> [l2, a, a] {- Input 3 -} [r1, b] -> [l1, b] {- Input 4 -} [r2, b] -> [l2, a, b] {- Input 5 -} [b, l1] -> [b, r2] {- Input 6 -} [b, l2] -> [b, r1] {- Input 7 -} [a, a] -> [] {- Input 8 -} reason mirror property Termination has value Just True for SRS [a, r1] -> [r1, a, a, a] {- Mirror (Input 0) -} [a, r2] -> [r2, a, a, a] {- Mirror (Input 1) -} [l1, a] -> [a, a, a, l1] {- Mirror (Input 2) -} [l2, a, a] -> [a, a, l2] {- Mirror (Input 3) -} [b, r1] -> [b, l1] {- Mirror (Input 4) -} [b, r2] -> [b, a, l2] {- Mirror (Input 5) -} [l1, b] -> [r2, b] {- Mirror (Input 6) -} [l2, b] -> [r1, b] {- Mirror (Input 7) -} [a, a] -> [] {- Mirror (Input 8) -} reason DP property Termination has value Just True for SRS [a, r1] ->= [r1, a, a, a] {- DP Nontop (Mirror (Input 0)) -} [a, r2] ->= [r2, a, a, a] {- DP Nontop (Mirror (Input 1)) -} [l1, a] ->= [a, a, a, l1] {- DP Nontop (Mirror (Input 2)) -} [l2, a, a] ->= [a, a, l2] {- DP Nontop (Mirror (Input 3)) -} [b, r1] ->= [b, l1] {- DP Nontop (Mirror (Input 4)) -} [b, r2] ->= [b, a, l2] {- DP Nontop (Mirror (Input 5)) -} [l1, b] ->= [r2, b] {- DP Nontop (Mirror (Input 6)) -} [l2, b] ->= [r1, b] {- DP Nontop (Mirror (Input 7)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 8)) -} [a#, r1] |-> [a#] {- DP (Top 3) (Mirror (Input 0)) -} [a#, r1] |-> [a#, a] {- DP (Top 2) (Mirror (Input 0)) -} [a#, r1] |-> [a#, a, a] {- DP (Top 1) (Mirror (Input 0)) -} [a#, r2] |-> [a#] {- DP (Top 3) (Mirror (Input 1)) -} [a#, r2] |-> [a#, a] {- DP (Top 2) (Mirror (Input 1)) -} [a#, r2] |-> [a#, a, a] {- DP (Top 1) (Mirror (Input 1)) -} [l1#, a] |-> [a#, a, a, l1] {- DP (Top 0) (Mirror (Input 2)) -} [l1#, a] |-> [a#, a, l1] {- DP (Top 1) (Mirror (Input 2)) -} [l1#, a] |-> [a#, l1] {- DP (Top 2) (Mirror (Input 2)) -} [l1#, a] |-> [l1#] {- DP (Top 3) (Mirror (Input 2)) -} [l2#, a, a] |-> [a#, a, l2] {- DP (Top 0) (Mirror (Input 3)) -} [l2#, a, a] |-> [a#, l2] {- DP (Top 1) (Mirror (Input 3)) -} [l2#, a, a] |-> [l2#] {- DP (Top 2) (Mirror (Input 3)) -} [b#, r1] |-> [l1#] {- DP (Top 1) (Mirror (Input 4)) -} [b#, r1] |-> [b#, l1] {- DP (Top 0) (Mirror (Input 4)) -} [b#, r2] |-> [a#, l2] {- DP (Top 1) (Mirror (Input 5)) -} [b#, r2] |-> [l2#] {- DP (Top 2) (Mirror (Input 5)) -} [b#, r2] |-> [b#, a, l2] {- DP (Top 0) (Mirror (Input 5)) -} reason (r1, 1/4) (r2, 1/4) (l1, 1/4) (l2, 1/4) (l1#, 15/8) (l2#, 5/4) (b#, 21/8) property Termination has value Just True for SRS [a, r1] ->= [r1, a, a, a] {- DP Nontop (Mirror (Input 0)) -} [a, r2] ->= [r2, a, a, a] {- DP Nontop (Mirror (Input 1)) -} [l1, a] ->= [a, a, a, l1] {- DP Nontop (Mirror (Input 2)) -} [l2, a, a] ->= [a, a, l2] {- DP Nontop (Mirror (Input 3)) -} [b, r1] ->= [b, l1] {- DP Nontop (Mirror (Input 4)) -} [b, r2] ->= [b, a, l2] {- DP Nontop (Mirror (Input 5)) -} [l1, b] ->= [r2, b] {- DP Nontop (Mirror (Input 6)) -} [l2, b] ->= [r1, b] {- DP Nontop (Mirror (Input 7)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 8)) -} [l1#, a] |-> [l1#] {- DP (Top 3) (Mirror (Input 2)) -} [l2#, a, a] |-> [l2#] {- DP (Top 2) (Mirror (Input 3)) -} [b#, r1] |-> [b#, l1] {- DP (Top 0) (Mirror (Input 4)) -} [b#, r2] |-> [b#, a, l2] {- DP (Top 0) (Mirror (Input 5)) -} reason EDG property Termination has value Just True for SRS [l1#, a] |-> [l1#] {- DP (Top 3) (Mirror (Input 2)) -} reason Usable property Termination has value Just True for SRS [l1#, a] |-> [l1#] {- DP (Top 3) (Mirror (Input 2)) -} reason (a, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [l2#, a, a] |-> [l2#] {- DP (Top 2) (Mirror (Input 3)) -} reason Usable property Termination has value Just True for SRS [l2#, a, a] |-> [l2#] {- DP (Top 2) (Mirror (Input 3)) -} reason (a, 1/1) property Termination has value Just True for SRS reason no strict rules property Termination has value Just True for SRS [b#, r1] |-> [b#, l1] {- DP (Top 0) (Mirror (Input 4)) -} [b#, r2] |-> [b#, a, l2] {- DP (Top 0) (Mirror (Input 5)) -} [a, r1] ->= [r1, a, a, a] {- DP Nontop (Mirror (Input 0)) -} [a, r2] ->= [r2, a, a, a] {- DP Nontop (Mirror (Input 1)) -} [l1, a] ->= [a, a, a, l1] {- DP Nontop (Mirror (Input 2)) -} [l2, a, a] ->= [a, a, l2] {- DP Nontop (Mirror (Input 3)) -} [b, r1] ->= [b, l1] {- DP Nontop (Mirror (Input 4)) -} [b, r2] ->= [b, a, l2] {- DP Nontop (Mirror (Input 5)) -} [l1, b] ->= [r2, b] {- DP Nontop (Mirror (Input 6)) -} [l2, b] ->= [r1, b] {- DP Nontop (Mirror (Input 7)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 8)) -} reason ( a , Wk / 0 0 1 0 \ | 0 1 0 0 | | 1 0 0 0 | \ 0 0 0 1 / ) ( r1 , Wk / 0 0 1 1 \ | 0 1 0 1 | | 1 0 0 1 | \ 0 0 0 1 / ) ( r2 , Wk / 1 0 2 0 \ | 0 1 0 0 | | 2 0 1 0 | \ 0 0 0 1 / ) ( l1 , Wk / 0 0 1 2 \ | 0 1 0 0 | | 1 0 0 2 | \ 0 0 0 1 / ) ( l2 , Wk / 0 1 1 0 \ | 0 0 1 0 | | 0 1 0 0 | \ 0 0 0 1 / ) ( b , Wk / 0 0 0 0 \ | 0 0 0 1 | | 0 0 0 2 | \ 0 0 0 1 / ) ( b# , Wk / 2 4 1 0 \ | 0 0 0 0 | | 0 0 0 0 | \ 0 0 0 1 / ) property Termination has value Just True for SRS [b#, r2] |-> [b#, a, l2] {- DP (Top 0) (Mirror (Input 5)) -} [a, r1] ->= [r1, a, a, a] {- DP Nontop (Mirror (Input 0)) -} [a, r2] ->= [r2, a, a, a] {- DP Nontop (Mirror (Input 1)) -} [l1, a] ->= [a, a, a, l1] {- DP Nontop (Mirror (Input 2)) -} [l2, a, a] ->= [a, a, l2] {- DP Nontop (Mirror (Input 3)) -} [b, r1] ->= [b, l1] {- DP Nontop (Mirror (Input 4)) -} [b, r2] ->= [b, a, l2] {- DP Nontop (Mirror (Input 5)) -} [l1, b] ->= [r2, b] {- DP Nontop (Mirror (Input 6)) -} [l2, b] ->= [r1, b] {- DP Nontop (Mirror (Input 7)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 8)) -} reason EDG property Termination has value Just True for SRS [b#, r2] |-> [b#, a, l2] {- DP (Top 0) (Mirror (Input 5)) -} [a, r1] ->= [r1, a, a, a] {- DP Nontop (Mirror (Input 0)) -} [a, r2] ->= [r2, a, a, a] {- DP Nontop (Mirror (Input 1)) -} [l1, a] ->= [a, a, a, l1] {- DP Nontop (Mirror (Input 2)) -} [l2, a, a] ->= [a, a, l2] {- DP Nontop (Mirror (Input 3)) -} [b, r1] ->= [b, l1] {- DP Nontop (Mirror (Input 4)) -} [b, r2] ->= [b, a, l2] {- DP Nontop (Mirror (Input 5)) -} [l1, b] ->= [r2, b] {- DP Nontop (Mirror (Input 6)) -} [l2, b] ->= [r1, b] {- DP Nontop (Mirror (Input 7)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 8)) -} reason ( a , Wk / 0A 0A \ \ -2A 0A / ) ( r1 , Wk / 0A 2A \ \ 0A 2A / ) ( r2 , Wk / 2A 2A \ \ 0A 0A / ) ( l1 , Wk / 2A 4A \ \ 0A 2A / ) ( l2 , Wk / 0A 0A \ \ 0A 0A / ) ( b , Wk / 0A 2A \ \ -2A 0A / ) ( b# , Wk / 15A 15A \ \ 15A 15A / ) property Termination has value Just True for SRS [a, r1] ->= [r1, a, a, a] {- DP Nontop (Mirror (Input 0)) -} [a, r2] ->= [r2, a, a, a] {- DP Nontop (Mirror (Input 1)) -} [l1, a] ->= [a, a, a, l1] {- DP Nontop (Mirror (Input 2)) -} [l2, a, a] ->= [a, a, l2] {- DP Nontop (Mirror (Input 3)) -} [b, r1] ->= [b, l1] {- DP Nontop (Mirror (Input 4)) -} [b, r2] ->= [b, a, l2] {- DP Nontop (Mirror (Input 5)) -} [l1, b] ->= [r2, b] {- DP Nontop (Mirror (Input 6)) -} [l2, b] ->= [r1, b] {- DP Nontop (Mirror (Input 7)) -} [a, a] ->= [] {- DP Nontop (Mirror (Input 8)) -} reason EDG ************************************************** skeleton: \Mirror(9,6)\Deepee(18/9,10)\Weight(4/9,9)\EDG[\Usable(1,2)\Weight(0,0)[],\Usable(1,2)\Weight(0,0)[],(2/9,7)\Matrix{\Natural}{4}\EDG(1/9,7)\Matrix{\Arctic}{2}(0/9,6)\EDG[]] ************************************************** let {} in let {trac ?= False;loop_cap = 1;match_cap = 2;tile_cap = 3;matrix_cap = 4;mo = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;done = Worker No_Strict_Rules;dont = \ p -> Fail;tiling = \ m w -> On tile_cap (weighted (And_Then (Worker (Tiling {method = m,width = w,map_type = Enum,max_num_tiles = Just 1000,max_num_rules = Just 100000})) (Worker Remap)));tile_roc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Overlap w)) <> [ Worker Unlabel];mb = \ size -> On match_cap (Apply (Worker (Matchbound {method = RFC,max_size = Just size})) done);mbs = \ size -> First_Of [ mb size, Apply (Worker Mirror) (mb size)];tile_rfc = Tree_Search_Preemptive 0 done let {ws = [ 2, 4, 8, 12]}in (for ws (\ w -> tiling Forward w)) <> ((for ws (\ w -> tiling Backward w)) <> [ Worker Unlabel]);solver = Minisatapi;qpi = \ dim bits -> On matrix_cap (weighted (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));qpis = Seq [ Timeout 10 (qpi 2 3), Timeout 30 (qpi 4 3), Timeout 50 (qpi 6 3), qpi 8 3];kbo = \ b -> On matrix_cap (weighted (Worker (KBO {bits = b,solver = solver})));matrix = \ dom dim bits -> On matrix_cap (weighted (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,encoding = Ersatz_Binary,tracing = trac,verbose = True,solver = solver})));arctics = Seq [ Timeout 10 (matrix Arctic 2 16), Timeout 30 (matrix Arctic 4 8), Timeout 50 (matrix Arctic 6 4), matrix Arctic 8 2];naturals = Seq [ Timeout 10 (matrix Natural 2 4), Timeout 30 (matrix Natural 4 3), Timeout 50 (matrix Natural 6 2), matrix Natural 8 1];remove = First_Of [ qpis, arctics, naturals, As_Transformer tile_roc];remove_wop = And_Then wop (Or_Else (As_Transformer (Worker No_Strict_Rules)) remove);deepee = Apply (And_Then (Worker DP) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = False,usable = True})) remove_wop));when_small = \ m -> Apply (Worker (SizeAtmost 1000)) m;yeah = First_Of [ when_small (First_Of [ deepee, Apply (Worker Mirror) deepee]), tile_rfc, mbs 100000];noh_for = \ side -> Worker (Simple (Config {closure = side,max_closure_width = Nothing,intermediates = All,priority = Linear [ ( 1, Log2 Steps), ( -1, Width_lhs), ( -2, Log2 Width_rhs)]}));noh = First_Of [ On loop_cap (noh_for Forward), On loop_cap (noh_for Backward), On loop_cap (Worker Transport)]} in Apply (Worker Remap) (Apply wop (Seq [ Worker KKST01, First_Of [ yeah, noh]])) ************************************************** statistics on proof search (nodes types that (together) took more than 1.000000000000) ************************************************** Fail : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 6.350474489000 min duration 6.350441820000 total durat. 12.700916309000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 52} , self = 51 , parent = Just 15 , duration = 6.350441820000 , status = Fail , start = 2021-07-13 23:49:00.617242118 UTC , finish = 2021-07-13 23:49:06.967683938 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '3' ] , 0 , True )} Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 51} , self = 52 , parent = Just 16 , duration = 6.350474489000 , status = Fail , start = 2021-07-13 23:49:00.617214829 UTC , finish = 2021-07-13 23:49:06.967689318 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '8' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 2.238871441000 min duration 2.238871441000 total durat. 2.238871441000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 16 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 10 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 48} , self = 80 , parent = Just 60 , duration = 2.238871441000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:49:17.355829201 UTC , finish = 2021-07-13 23:49:19.594700642 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '6' ] , 0 , True )} Success : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 14.875140820000 min duration 14.384348378000 total durat. 29.259489198000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 52} , self = 58 , parent = Just 15 , duration = 14.384348378000 , status = Success , start = 2021-07-13 23:49:02.953993374 UTC , finish = 2021-07-13 23:49:17.338341752 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '9' ] , 0 , True )} Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 51} , self = 67 , parent = Just 16 , duration = 14.875140820000 , status = Success , start = 2021-07-13 23:49:03.832252031 UTC , finish = 2021-07-13 23:49:18.707392851 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '2' ] , 0 , True )} Fail : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 3.214831302000 min duration 2.336654377000 total durat. 5.551485679000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 52} , self = 49 , parent = Just 15 , duration = 2.336654377000 , status = Fail , start = 2021-07-13 23:49:00.617186889 UTC , finish = 2021-07-13 23:49:02.953841266 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '4' ] , 0 , True )} Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 51} , self = 50 , parent = Just 16 , duration = 3.214831302000 , status = Fail , start = 2021-07-13 23:49:00.617156218 UTC , finish = 2021-07-13 23:49:03.83198752 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '7' ] , 0 , True )} Success : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 2.232010197000 min duration 2.232010197000 total durat. 2.232010197000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 10 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 48} , self = 77 , parent = Just 60 , duration = 2.232010197000 , status = Success , start = 2021-07-13 23:49:17.352460705 UTC , finish = 2021-07-13 23:49:19.584470902 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '8' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.976824028000 min duration 0.875568711000 total durat. 2.828861549000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 6.521375268000 min duration 6.396806664000 total durat. 12.918181932000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 51} , self = 53 , parent = Just 16 , duration = 6.396806664000 , status = Fail , start = 2021-07-13 23:49:01.597201451 UTC , finish = 2021-07-13 23:49:07.994008115 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '3' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 52} , self = 54 , parent = Just 15 , duration = 6.521375268000 , status = Fail , start = 2021-07-13 23:49:01.59726408 UTC , finish = 2021-07-13 23:49:08.118639348 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '6' ] , 0 , True )} Fail : Tiling { method = Forward , width = 12 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} total number 1 max duration 11.538953070000 min duration 11.538953070000 total durat. 11.538953070000 Info { what = Tiling { method = Forward , width = 12 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} , input_size = Size { num_rules = 9 , num_strict_rules = 9 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 43} , self = 56 , parent = Just 0 , duration = 11.538953070000 , status = Fail , start = 2021-07-13 23:49:00.613941819 UTC , finish = 2021-07-13 23:49:12.152894889 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '6' , '8' ] , 3 , True )} Fail : Tiling { method = Forward , width = 4 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} total number 1 max duration 17.563626955000 min duration 17.563626955000 total durat. 17.563626955000 Info { what = Tiling { method = Forward , width = 4 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} , input_size = Size { num_rules = 9 , num_strict_rules = 9 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 43} , self = 66 , parent = Just 0 , duration = 17.563626955000 , status = Fail , start = 2021-07-13 23:49:00.613885127 UTC , finish = 2021-07-13 23:49:18.177512082 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '6' , '0' ] , 3 , True )} Success : Tiling { method = Overlap , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} total number 3 max duration 2.180798394000 min duration 0.887076273000 total durat. 3.956996270000 Info { what = Tiling { method = Overlap , width = 2 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} , input_size = Size { num_rules = 10 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 48} , self = 75 , parent = Just 60 , duration = 2.180798394000 , status = Success , start = 2021-07-13 23:49:17.377555027 UTC , finish = 2021-07-13 23:49:19.558353421 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '6' ] , 3 , True )} Fail : Tiling { method = Overlap , width = 4 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} total number 2 max duration 11.612907537000 min duration 9.592649304000 total durat. 21.205556841000 Info { what = Tiling { method = Overlap , width = 4 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 52} , self = 55 , parent = Just 15 , duration = 9.592649304000 , status = Fail , start = 2021-07-13 23:49:00.628164297 UTC , finish = 2021-07-13 23:49:10.220813601 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '2' ] , 3 , True )} Info { what = Tiling { method = Overlap , width = 4 , state_type = Best , map_type = Enum , unlabel = True , print_completion_steps = False , print_tiles = False , max_num_tiles = Just 1000 , max_num_rules = Just 100000 , verbose = False , tracing = False} , input_size = Size { num_rules = 11 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 9 , alphabet_size = 7 , total_length = 51} , self = 57 , parent = Just 16 , duration = 11.612907537000 , status = Fail , start = 2021-07-13 23:49:00.626705841 UTC , finish = 2021-07-13 23:49:12.239613378 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '0' ] , 3 , True )} **************************************************