/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 4 rules on 3 letters mirror SRS with 4 rules on 3 letters DP SRS with 5 strict rules and 4 weak rules on 6 letters weights SRS with 2 strict rules and 4 weak rules on 4 letters EDG SRS with 2 strict rules and 4 weak rules on 4 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 4 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [] {- Input 0 -} [a, b] -> [b, b, a, a, c] {- Input 1 -} [b, b] -> [] {- Input 2 -} [c, c] -> [] {- Input 3 -} reason mirror property Termination has value Just True for SRS [a] -> [] {- Mirror (Input 0) -} [b, a] -> [c, a, a, b, b] {- Mirror (Input 1) -} [b, b] -> [] {- Mirror (Input 2) -} [c, c] -> [] {- Mirror (Input 3) -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} [b#, a] |-> [a#, a, b, b] {- DP (Top 1) (Mirror (Input 1)) -} [b#, a] |-> [a#, b, b] {- DP (Top 2) (Mirror (Input 1)) -} [b#, a] |-> [b#] {- DP (Top 4) (Mirror (Input 1)) -} [b#, a] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} [b#, a] |-> [c#, a, a, b, b] {- DP (Top 0) (Mirror (Input 1)) -} reason (b#, 3/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} [b#, a] |-> [b#] {- DP (Top 4) (Mirror (Input 1)) -} [b#, a] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} reason EDG property Termination has value Just True for SRS [b#, a] |-> [b#] {- DP (Top 4) (Mirror (Input 1)) -} [b#, a] |-> [b#, b] {- DP (Top 3) (Mirror (Input 1)) -} [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} reason ( a , Wk / 1A 0A - 0A \ | - 0A - - | | 1A 0A 0A 7A | \ - - - 0A / ) ( b , Wk / 0A - - - \ | 1A - 0A - | | 0A 0A - - | \ - - - 0A / ) ( c , Wk / - 0A - 0A \ | 0A - 0A - | | - 0A - - | \ - - - 0A / ) ( b# , Wk / 0A - - - \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Mirror (Input 0)) -} [b, a] ->= [c, a, a, b, b] {- DP Nontop (Mirror (Input 1)) -} [b, b] ->= [] {- DP Nontop (Mirror (Input 2)) -} [c, c] ->= [] {- DP Nontop (Mirror (Input 3)) -} reason EDG ************************************************** skeleton: \Mirror(4,3)\Deepee(5/4,6)\Weight\EDG(2/4,4)\Matrix{\Arctic}{4}(0/4,3)\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) ************************************************** Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} total number 2 max duration 8.398128033000 min duration 8.398090542000 total durat. 16.796218575000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 74 , parent = Just 0 , duration = 8.398090542000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:13:04.188003242 UTC , finish = 2021-07-13 22:13:12.586093784 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '6' ] , 2 , True )} Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 76 , parent = Just 7 , duration = 8.398128033000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:13:04.188084326 UTC , finish = 2021-07-13 22:13:12.586212359 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '5' ] , 2 , True )} 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 1.287025741000 min duration 1.148471200000 total durat. 2.435496941000 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 53 , parent = Just 11 , duration = 1.148471200000 , status = Fail , start = 2021-07-13 22:13:04.192069854 UTC , finish = 2021-07-13 22:13:05.340541054 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '2' ] , 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 54 , parent = Just 20 , duration = 1.287025741000 , status = Fail , start = 2021-07-13 22:13:04.197411487 UTC , finish = 2021-07-13 22:13:05.484437228 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '5' ] , 0 , True )} Success : Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 8 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 7.238676068000 min duration 7.238676068000 total durat. 7.238676068000 Info { what = Matrix { monotone = Weak , domain = Arctic , shape = Full , bits = 8 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 69 , parent = Just 11 , duration = 7.238676068000 , status = Success , start = 2021-07-13 22:13:05.340818041 UTC , finish = 2021-07-13 22:13:12.579494109 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '0' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 2 , encoding = Ersatz_Binary , dim = 6 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 3.962549938000 min duration 3.962549938000 total durat. 3.962549938000 Info { what = Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 2 , encoding = Ersatz_Binary , dim = 6 , solver = Minisatapi , verbose = True , tracing = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 78 , parent = Just 11 , duration = 3.962549938000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:13:08.623805456 UTC , finish = 2021-07-13 22:13:12.586355394 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '8' ] , 0 , True )} Fail : 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 5.737617112000 min duration 4.113930816000 total durat. 9.851547928000 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 61 , parent = Just 11 , duration = 4.113930816000 , status = Fail , start = 2021-07-13 22:13:04.509541159 UTC , finish = 2021-07-13 22:13:08.623471975 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '4' ] , 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 = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 64 , parent = Just 20 , duration = 5.737617112000 , status = Fail , start = 2021-07-13 22:13:04.600361043 UTC , finish = 2021-07-13 22:13:10.337978155 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '0' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.544282193000 min duration 1.450758724000 total durat. 2.995040917000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 55 , parent = Just 11 , duration = 1.450758724000 , status = Fail , start = 2021-07-13 22:13:04.568788447 UTC , finish = 2021-07-13 22:13:06.019547171 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '7' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 56 , parent = Just 20 , duration = 1.544282193000 , status = Fail , start = 2021-07-13 22:13:04.604662147 UTC , finish = 2021-07-13 22:13:06.14894434 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 6.224615510000 min duration 5.473056800000 total durat. 11.697672310000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 65 , parent = Just 11 , duration = 5.473056800000 , status = Fail , start = 2021-07-13 22:13:06.021582135 UTC , finish = 2021-07-13 22:13:11.494638935 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 21} , self = 68 , parent = Just 20 , duration = 6.224615510000 , status = Fail , start = 2021-07-13 22:13:06.149125697 UTC , finish = 2021-07-13 22:13:12.373741207 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '1' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.088515137000 min duration 0.203563006000 total durat. 1.292078143000 Info { what = QPI { dim = 8 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 4 , alphabet_size = 4 , total_length = 19} , self = 72 , parent = Just 11 , duration = 1.088515137000 , status = Fail , start = 2021-07-13 22:13:11.4950019 UTC , finish = 2021-07-13 22:13:12.583517037 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '4' , '8' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 8.398232060000 min duration 8.398232060000 total durat. 8.398232060000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 77 , parent = Just 0 , duration = 8.398232060000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:13:04.187996953 UTC , finish = 2021-07-13 22:13:12.586229013 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '9' ] , 1 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 8.398173979000 min duration 8.398173979000 total durat. 8.398173979000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 4 , num_strict_rules = 4 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 75 , parent = Just 0 , duration = 8.398173979000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:13:04.188027182 UTC , finish = 2021-07-13 22:13:12.586201161 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '8' ] , 1 , True )} Success : Tiling { method = Backward , 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 2 max duration 2.687640151000 min duration 0.091778504000 total durat. 2.779418655000 Info { what = Tiling { method = Backward , 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 = 61 , num_strict_rules = 61 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 309} , self = 57 , parent = Just 35 , duration = 2.687640151000 , status = Success , start = 2021-07-13 22:13:04.464766075 UTC , finish = 2021-07-13 22:13:07.152406226 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '8' ] , 3 , True )} Success : Tiling { method = Forward , 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 2 max duration 2.754649650000 min duration 0.086619912000 total durat. 2.841269562000 Info { what = Tiling { method = Forward , 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 = 61 , num_strict_rules = 61 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 309} , self = 59 , parent = Just 35 , duration = 2.754649650000 , status = Success , start = 2021-07-13 22:13:04.463075182 UTC , finish = 2021-07-13 22:13:07.217724832 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '7' ] , 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 4 max duration 7.056660109000 min duration 0.098051358000 total durat. 11.864688231000 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 = 81 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 74 , alphabet_size = 19 , total_length = 417} , self = 62 , parent = Just 41 , duration = 4.552336074000 , status = Success , start = 2021-07-13 22:13:04.6069124 UTC , finish = 2021-07-13 22:13:09.159248474 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '9' ] , 3 , True )} 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 = 82 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 74 , alphabet_size = 19 , total_length = 430} , self = 66 , parent = Just 45 , duration = 7.056660109000 , status = Success , start = 2021-07-13 22:13:04.690980967 UTC , finish = 2021-07-13 22:13:11.747641076 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '3' ] , 3 , True )} **************************************************