/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 47 rules on 6 letters mirror SRS with 47 rules on 6 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1382 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [0, 1, 4] -> [5, 5, 4, 0, 2, 2, 0, 2, 5, 4] {- Input 0 -} [0, 4, 1] -> [5, 2, 2, 3, 5, 3, 2, 2, 5, 4] {- Input 1 -} [1, 4, 1] -> [1, 4, 4, 2, 0, 3, 5, 4, 4, 5] {- Input 2 -} [0, 1, 1, 1] -> [0, 3, 5, 1, 2, 0, 3, 2, 4, 5] {- Input 3 -} [4, 1, 0, 0] -> [1, 4, 0, 5, 4, 2, 5, 5, 3, 0] {- Input 4 -} [4, 1, 1, 3] -> [4, 5, 2, 0, 5, 2, 3, 5, 4, 2] {- Input 5 -} [0, 1, 1, 2, 0] -> [3, 2, 3, 2, 3, 5, 4, 5, 2, 0] {- Input 6 -} [0, 3, 0, 1, 3] -> [2, 0, 3, 5, 5, 0, 1, 2, 1, 2] {- Input 7 -} [0, 4, 4, 1, 3] -> [4, 5, 4, 5, 0, 5, 4, 5, 5, 2] {- Input 8 -} [1, 0, 4, 1, 0] -> [2, 3, 0, 2, 3, 4, 2, 0, 4, 0] {- Input 9 -} [1, 1, 4, 3, 1] -> [1, 4, 2, 0, 5, 4, 4, 5, 5, 3] {- Input 10 -} [0, 0, 0, 4, 3, 1] -> [2, 3, 2, 0, 0, 4, 2, 4, 3, 3] {- Input 11 -} [0, 1, 1, 1, 1, 3] -> [3, 1, 2, 3, 2, 3, 4, 1, 3, 3] {- Input 12 -} [0, 1, 3, 4, 3, 1] -> [1, 5, 4, 5, 2, 2, 0, 3, 5, 1] {- Input 13 -} [0, 1, 4, 5, 1, 3] -> [2, 0, 5, 3, 2, 3, 1, 5, 0, 3] {- Input 14 -} [0, 1, 5, 0, 0, 0] -> [5, 2, 1, 0, 1, 0, 5, 4, 0, 0] {- Input 15 -} [0, 3, 1, 1, 1, 1] -> [0, 3, 3, 1, 3, 0, 3, 2, 3, 3] {- Input 16 -} [0, 3, 4, 0, 1, 0] -> [1, 2, 3, 5, 3, 5, 2, 5, 4, 0] {- Input 17 -} [1, 0, 0, 1, 1, 1] -> [1, 1, 5, 5, 3, 3, 3, 0, 0, 2] {- Input 18 -} [1, 0, 5, 1, 3, 0] -> [3, 2, 3, 0, 1, 0, 2, 0, 0, 3] {- Input 19 -} [1, 3, 1, 1, 4, 1] -> [2, 5, 0, 3, 2, 5, 4, 5, 4, 4] {- Input 20 -} [2, 5, 3, 4, 3, 2] -> [2, 5, 2, 0, 5, 4, 3, 3, 3, 2] {- Input 21 -} [3, 0, 4, 1, 0, 3] -> [5, 2, 3, 3, 0, 2, 1, 0, 3, 0] {- Input 22 -} [3, 1, 0, 1, 5, 5] -> [5, 4, 2, 0, 0, 0, 3, 3, 5, 5] {- Input 23 -} [4, 5, 1, 1, 3, 1] -> [4, 4, 5, 5, 2, 2, 4, 5, 4, 0] {- Input 24 -} [5, 1, 3, 4, 1, 2] -> [0, 4, 4, 2, 0, 0, 5, 5, 2, 2] {- Input 25 -} [5, 2, 4, 4, 1, 3] -> [5, 5, 5, 0, 5, 2, 2, 2, 1, 2] {- Input 26 -} [0, 0, 0, 0, 4, 4, 3] -> [1, 5, 4, 4, 4, 3, 1, 5, 0, 5] {- Input 27 -} [0, 0, 4, 1, 1, 0, 3] -> [2, 1, 2, 0, 3, 5, 0, 1, 0, 3] {- Input 28 -} [0, 3, 4, 1, 1, 0, 0] -> [3, 3, 3, 0, 1, 1, 4, 3, 5, 0] {- Input 29 -} [1, 0, 3, 2, 1, 3, 1] -> [2, 1, 3, 5, 5, 3, 5, 5, 1, 4] {- Input 30 -} [1, 1, 0, 3, 5, 1, 3] -> [2, 5, 3, 5, 5, 4, 4, 1, 3, 3] {- Input 31 -} [1, 1, 3, 1, 1, 3, 0] -> [2, 3, 1, 2, 4, 5, 2, 0, 0, 0] {- Input 32 -} [1, 1, 3, 4, 1, 3, 5] -> [2, 5, 5, 2, 1, 2, 1, 5, 2, 5] {- Input 33 -} [1, 3, 3, 4, 0, 5, 2] -> [4, 5, 4, 3, 4, 2, 5, 5, 2, 2] {- Input 34 -} [1, 3, 4, 0, 4, 3, 2] -> [2, 3, 1, 1, 5, 4, 0, 3, 5, 2] {- Input 35 -} [1, 5, 1, 1, 3, 5, 2] -> [0, 1, 0, 3, 3, 2, 4, 3, 2, 2] {- Input 36 -} [1, 5, 3, 1, 3, 4, 4] -> [2, 5, 4, 5, 1, 1, 5, 4, 1, 4] {- Input 37 -} [2, 1, 3, 4, 3, 1, 1] -> [5, 4, 4, 1, 4, 1, 4, 4, 1, 5] {- Input 38 -} [3, 0, 4, 5, 0, 0, 4] -> [3, 0, 5, 0, 0, 2, 0, 0, 0, 4] {- Input 39 -} [3, 4, 0, 0, 1, 3, 0] -> [4, 4, 3, 0, 3, 2, 4, 2, 2, 0] {- Input 40 -} [4, 0, 1, 4, 3, 2, 0] -> [4, 5, 0, 2, 0, 3, 3, 3, 3, 0] {- Input 41 -} [4, 0, 4, 0, 3, 4, 4] -> [4, 4, 4, 3, 5, 1, 4, 1, 4, 4] {- Input 42 -} [4, 0, 4, 3, 2, 1, 0] -> [1, 4, 2, 3, 5, 5, 3, 2, 3, 5] {- Input 43 -} [5, 1, 3, 4, 1, 3, 1] -> [1, 5, 4, 4, 3, 4, 3, 0, 1, 2] {- Input 44 -} [5, 1, 4, 4, 3, 0, 0] -> [5, 0, 2, 5, 4, 2, 5, 2, 2, 0] {- Input 45 -} [5, 5, 0, 0, 4, 1, 5] -> [5, 4, 3, 2, 0, 2, 5, 5, 5, 5] {- Input 46 -} reason mirror property Termination has value Just True for SRS [4, 1, 0] -> [4, 5, 2, 0, 2, 2, 0, 4, 5, 5] {- Mirror (Input 0) -} [1, 4, 0] -> [4, 5, 2, 2, 3, 5, 3, 2, 2, 5] {- Mirror (Input 1) -} [1, 4, 1] -> [5, 4, 4, 5, 3, 0, 2, 4, 4, 1] {- Mirror (Input 2) -} [1, 1, 1, 0] -> [5, 4, 2, 3, 0, 2, 1, 5, 3, 0] {- Mirror (Input 3) -} [0, 0, 1, 4] -> [0, 3, 5, 5, 2, 4, 5, 0, 4, 1] {- Mirror (Input 4) -} [3, 1, 1, 4] -> [2, 4, 5, 3, 2, 5, 0, 2, 5, 4] {- Mirror (Input 5) -} [0, 2, 1, 1, 0] -> [0, 2, 5, 4, 5, 3, 2, 3, 2, 3] {- Mirror (Input 6) -} [3, 1, 0, 3, 0] -> [2, 1, 2, 1, 0, 5, 5, 3, 0, 2] {- Mirror (Input 7) -} [3, 1, 4, 4, 0] -> [2, 5, 5, 4, 5, 0, 5, 4, 5, 4] {- Mirror (Input 8) -} [0, 1, 4, 0, 1] -> [0, 4, 0, 2, 4, 3, 2, 0, 3, 2] {- Mirror (Input 9) -} [1, 3, 4, 1, 1] -> [3, 5, 5, 4, 4, 5, 0, 2, 4, 1] {- Mirror (Input 10) -} [1, 3, 4, 0, 0, 0] -> [3, 3, 4, 2, 4, 0, 0, 2, 3, 2] {- Mirror (Input 11) -} [3, 1, 1, 1, 1, 0] -> [3, 3, 1, 4, 3, 2, 3, 2, 1, 3] {- Mirror (Input 12) -} [1, 3, 4, 3, 1, 0] -> [1, 5, 3, 0, 2, 2, 5, 4, 5, 1] {- Mirror (Input 13) -} [3, 1, 5, 4, 1, 0] -> [3, 0, 5, 1, 3, 2, 3, 5, 0, 2] {- Mirror (Input 14) -} [0, 0, 0, 5, 1, 0] -> [0, 0, 4, 5, 0, 1, 0, 1, 2, 5] {- Mirror (Input 15) -} [1, 1, 1, 1, 3, 0] -> [3, 3, 2, 3, 0, 3, 1, 3, 3, 0] {- Mirror (Input 16) -} [0, 1, 0, 4, 3, 0] -> [0, 4, 5, 2, 5, 3, 5, 3, 2, 1] {- Mirror (Input 17) -} [1, 1, 1, 0, 0, 1] -> [2, 0, 0, 3, 3, 3, 5, 5, 1, 1] {- Mirror (Input 18) -} [0, 3, 1, 5, 0, 1] -> [3, 0, 0, 2, 0, 1, 0, 3, 2, 3] {- Mirror (Input 19) -} [1, 4, 1, 1, 3, 1] -> [4, 4, 5, 4, 5, 2, 3, 0, 5, 2] {- Mirror (Input 20) -} [2, 3, 4, 3, 5, 2] -> [2, 3, 3, 3, 4, 5, 0, 2, 5, 2] {- Mirror (Input 21) -} [3, 0, 1, 4, 0, 3] -> [0, 3, 0, 1, 2, 0, 3, 3, 2, 5] {- Mirror (Input 22) -} [5, 5, 1, 0, 1, 3] -> [5, 5, 3, 3, 0, 0, 0, 2, 4, 5] {- Mirror (Input 23) -} [1, 3, 1, 1, 5, 4] -> [0, 4, 5, 4, 2, 2, 5, 5, 4, 4] {- Mirror (Input 24) -} [2, 1, 4, 3, 1, 5] -> [2, 2, 5, 5, 0, 0, 2, 4, 4, 0] {- Mirror (Input 25) -} [3, 1, 4, 4, 2, 5] -> [2, 1, 2, 2, 2, 5, 0, 5, 5, 5] {- Mirror (Input 26) -} [3, 4, 4, 0, 0, 0, 0] -> [5, 0, 5, 1, 3, 4, 4, 4, 5, 1] {- Mirror (Input 27) -} [3, 0, 1, 1, 4, 0, 0] -> [3, 0, 1, 0, 5, 3, 0, 2, 1, 2] {- Mirror (Input 28) -} [0, 0, 1, 1, 4, 3, 0] -> [0, 5, 3, 4, 1, 1, 0, 3, 3, 3] {- Mirror (Input 29) -} [1, 3, 1, 2, 3, 0, 1] -> [4, 1, 5, 5, 3, 5, 5, 3, 1, 2] {- Mirror (Input 30) -} [3, 1, 5, 3, 0, 1, 1] -> [3, 3, 1, 4, 4, 5, 5, 3, 5, 2] {- Mirror (Input 31) -} [0, 3, 1, 1, 3, 1, 1] -> [0, 0, 0, 2, 5, 4, 2, 1, 3, 2] {- Mirror (Input 32) -} [5, 3, 1, 4, 3, 1, 1] -> [5, 2, 5, 1, 2, 1, 2, 5, 5, 2] {- Mirror (Input 33) -} [2, 5, 0, 4, 3, 3, 1] -> [2, 2, 5, 5, 2, 4, 3, 4, 5, 4] {- Mirror (Input 34) -} [2, 3, 4, 0, 4, 3, 1] -> [2, 5, 3, 0, 4, 5, 1, 1, 3, 2] {- Mirror (Input 35) -} [2, 5, 3, 1, 1, 5, 1] -> [2, 2, 3, 4, 2, 3, 3, 0, 1, 0] {- Mirror (Input 36) -} [4, 4, 3, 1, 3, 5, 1] -> [4, 1, 4, 5, 1, 1, 5, 4, 5, 2] {- Mirror (Input 37) -} [1, 1, 3, 4, 3, 1, 2] -> [5, 1, 4, 4, 1, 4, 1, 4, 4, 5] {- Mirror (Input 38) -} [4, 0, 0, 5, 4, 0, 3] -> [4, 0, 0, 0, 2, 0, 0, 5, 0, 3] {- Mirror (Input 39) -} [0, 3, 1, 0, 0, 4, 3] -> [0, 2, 2, 4, 2, 3, 0, 3, 4, 4] {- Mirror (Input 40) -} [0, 2, 3, 4, 1, 0, 4] -> [0, 3, 3, 3, 3, 0, 2, 0, 5, 4] {- Mirror (Input 41) -} [4, 4, 3, 0, 4, 0, 4] -> [4, 4, 1, 4, 1, 5, 3, 4, 4, 4] {- Mirror (Input 42) -} [0, 1, 2, 3, 4, 0, 4] -> [5, 3, 2, 3, 5, 5, 3, 2, 4, 1] {- Mirror (Input 43) -} [1, 3, 1, 4, 3, 1, 5] -> [2, 1, 0, 3, 4, 3, 4, 4, 5, 1] {- Mirror (Input 44) -} [0, 0, 3, 4, 4, 1, 5] -> [0, 2, 2, 5, 2, 4, 5, 2, 0, 5] {- Mirror (Input 45) -} [5, 1, 4, 0, 0, 5, 5] -> [5, 5, 5, 5, 2, 0, 2, 3, 4, 5] {- Mirror (Input 46) -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1382 states ************************************************** skeleton: \Mirror(47,6)\Rfcmatchbound{2}[] ************************************************** 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) ************************************************** Success : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} total number 1 max duration 5.681026882000 min duration 5.681026882000 total durat. 5.681026882000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 47 , num_strict_rules = 47 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 752} , self = 38 , parent = Just 4 , duration = 5.681026882000 , status = Success , start = 2021-07-13 14:47:10.813263343 UTC , finish = 2021-07-13 14:47:16.494290225 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '7' ] , 2 , True )} 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 1 max duration 5.682405906000 min duration 5.682405906000 total durat. 5.682405906000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 47 , num_strict_rules = 47 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 752} , self = 40 , parent = Just 0 , duration = 5.682405906000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 14:47:10.813213596 UTC , finish = 2021-07-13 14:47:16.495619502 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '4' ] , 2 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 5.199906084000 min duration 4.870057392000 total durat. 10.069963476000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 499 , num_strict_rules = 452 , num_top_rules = 452 , num_weak_rules = 47 , alphabet_size = 12 , total_length = 6032} , self = 42 , parent = Just 20 , duration = 4.870057392000 , status = Fail , start = 2021-07-13 14:47:11.625845704 UTC , finish = 2021-07-13 14:47:16.495903096 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '7' ] , 0 , True )} Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 481 , num_strict_rules = 434 , num_top_rules = 434 , num_weak_rules = 47 , alphabet_size = 12 , total_length = 5882} , self = 41 , parent = Just 17 , duration = 5.199906084000 , status = Fail , start = 2021-07-13 14:47:11.295971551 UTC , finish = 2021-07-13 14:47:16.495877635 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '3' ] , 0 , 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 1 max duration 3.507895560000 min duration 3.507895560000 total durat. 3.507895560000 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 = 47 , num_strict_rules = 47 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 752} , self = 33 , parent = Just 0 , duration = 3.507895560000 , status = Success , start = 2021-07-13 14:47:10.836714834 UTC , finish = 2021-07-13 14:47:14.344610394 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '3' ] , 3 , True )} Fail : Tiling { method = Backward , width = 8 , 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 4.451547448000 min duration 4.451547448000 total durat. 4.451547448000 Info { what = Tiling { method = Backward , width = 8 , 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 = 47 , num_strict_rules = 47 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 752} , self = 35 , parent = Just 0 , duration = 4.451547448000 , status = Fail , start = 2021-07-13 14:47:10.836661979 UTC , finish = 2021-07-13 14:47:15.288209427 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '5' ] , 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 1 max duration 4.695015495000 min duration 4.695015495000 total durat. 4.695015495000 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 = 47 , num_strict_rules = 47 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 752} , self = 36 , parent = Just 0 , duration = 4.695015495000 , status = Success , start = 2021-07-13 14:47:10.83675637 UTC , finish = 2021-07-13 14:47:15.531771865 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '9' ] , 3 , True )} **************************************************