/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 3 rules on 2 letters DP SRS with 5 strict rules and 3 weak rules on 4 letters weights SRS with 3 strict rules and 3 weak rules on 3 letters EDG SRS with 3 strict rules and 3 weak rules on 3 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 1 strict rules and 3 weak rules on 3 letters EDG SRS with 1 rules on 3 letters Usable SRS with 1 rules on 3 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a] -> [] {- Input 0 -} [a, a, b] -> [b, a, b, a, a] {- Input 1 -} [b, b] -> [] {- Input 2 -} reason DP property Termination has value Just True for SRS [a, a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, a, a] {- DP Nontop (Input 1) -} [b, b] ->= [] {- DP Nontop (Input 2) -} [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, a, b] |-> [a#, a] {- DP (Top 3) (Input 1) -} [a#, a, b] |-> [a#, b, a, a] {- DP (Top 1) (Input 1) -} [a#, a, b] |-> [b#, a, a] {- DP (Top 2) (Input 1) -} [a#, a, b] |-> [b#, a, b, a, a] {- DP (Top 0) (Input 1) -} reason (a#, 2/1) property Termination has value Just True for SRS [a, a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, a, a] {- DP Nontop (Input 1) -} [b, b] ->= [] {- DP Nontop (Input 2) -} [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, a, b] |-> [a#, a] {- DP (Top 3) (Input 1) -} [a#, a, b] |-> [a#, b, a, a] {- DP (Top 1) (Input 1) -} reason EDG property Termination has value Just True for SRS [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, a, b] |-> [a#, b, a, a] {- DP (Top 1) (Input 1) -} [a#, a, b] |-> [a#, a] {- DP (Top 3) (Input 1) -} [a, a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, a, a] {- DP Nontop (Input 1) -} [b, b] ->= [] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A - 1A - \ | - - 0A - | | - 0A - - | \ - - - 0A / ) ( b , Wk / 0A - 0A - \ | - 1A 0A 3A | | - 0A - - | \ - - - 0A / ) ( a# , Wk / - - 0A 0A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a, a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, a, a] {- DP Nontop (Input 1) -} [b, b] ->= [] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} reason Usable property Termination has value Just True for SRS [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} reason (a, 1/1) (b, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (3,2)\Deepee(5/3,4)\Weight\EDG(3/3,3)\Matrix{\Arctic}{4}(1/3,3)\EDG\Usable(1,3)\Weight(0,0)[] ************************************************** 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 1 max duration 9.439477616000 min duration 9.439477616000 total durat. 9.439477616000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 12} , self = 103 , parent = Just 0 , duration = 9.439477616000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:12:35.17106256 UTC , finish = 2021-07-13 23:12:44.610540176 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '2' ] , 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.517639876000 min duration 1.120471600000 total durat. 2.638111476000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 22} , self = 57 , parent = Just 17 , duration = 1.120471600000 , status = Fail , start = 2021-07-13 23:12:35.172624662 UTC , finish = 2021-07-13 23:12:36.293096262 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '8' ] , 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 = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 58 , parent = Just 11 , duration = 1.517639876000 , status = Fail , start = 2021-07-13 23:12:35.171961827 UTC , finish = 2021-07-13 23:12:36.689601703 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '4' ] , 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.910872910000 min duration 7.910872910000 total durat. 7.910872910000 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 = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 95 , parent = Just 11 , duration = 7.910872910000 , status = Success , start = 2021-07-13 23:12:36.689937339 UTC , finish = 2021-07-13 23:12:44.600810249 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '6' ] , 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 6.679020448000 min duration 6.088257437000 total durat. 12.767277885000 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 = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 82 , parent = Just 11 , duration = 6.088257437000 , status = Fail , start = 2021-07-13 23:12:35.580876452 UTC , finish = 2021-07-13 23:12:41.669133889 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '5' ] , 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 22} , self = 83 , parent = Just 17 , duration = 6.679020448000 , status = Fail , start = 2021-07-13 23:12:35.474773738 UTC , finish = 2021-07-13 23:12:42.153794186 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.726425944000 min duration 1.302783313000 total durat. 3.029209257000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 22} , self = 59 , parent = Just 17 , duration = 1.302783313000 , status = Fail , start = 2021-07-13 23:12:35.491263988 UTC , finish = 2021-07-13 23:12:36.794047301 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '8' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 66 , parent = Just 11 , duration = 1.726425944000 , status = Fail , start = 2021-07-13 23:12:35.572920717 UTC , finish = 2021-07-13 23:12:37.299346661 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '2' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 6.244239846000 min duration 4.739036635000 total durat. 10.983276481000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 22} , self = 81 , parent = Just 17 , duration = 4.739036635000 , status = Fail , start = 2021-07-13 23:12:36.794146921 UTC , finish = 2021-07-13 23:12:41.533183556 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '9' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 90 , parent = Just 11 , duration = 6.244239846000 , status = Fail , start = 2021-07-13 23:12:37.299655909 UTC , finish = 2021-07-13 23:12:43.543895755 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '6' ] , 0 , True )} Fail : QPI { dim = 8, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 3.077228045000 min duration 1.065921260000 total durat. 4.143149305000 Info { what = QPI { dim = 8 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 101 , parent = Just 11 , duration = 1.065921260000 , status = Fail , start = 2021-07-13 23:12:43.544561972 UTC , finish = 2021-07-13 23:12:44.610483232 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '7' , '3' ] , 0 , True )} Info { what = QPI { dim = 8 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 22} , self = 102 , parent = Just 17 , duration = 3.077228045000 , status = Fail , start = 2021-07-13 23:12:41.533279203 UTC , finish = 2021-07-13 23:12:44.610507248 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' , '6' ] , 0 , True )} Success : Tiling { method = Backward , 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 2.061164687000 min duration 2.061164687000 total durat. 2.061164687000 Info { what = Tiling { method = Backward , 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 12} , self = 62 , parent = Just 0 , duration = 2.061164687000 , status = Success , start = 2021-07-13 23:12:35.174303641 UTC , finish = 2021-07-13 23:12:37.235468328 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '3' ] , 3 , True )} Success : 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 2.090098801000 min duration 2.090098801000 total durat. 2.090098801000 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 = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 2 , total_length = 12} , self = 64 , parent = Just 0 , duration = 2.090098801000 , status = Success , start = 2021-07-13 23:12:35.174431671 UTC , finish = 2021-07-13 23:12:37.264530472 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '3' ] , 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 1.981198739000 min duration 0.097828454000 total durat. 4.018340021000 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 = 37 , num_strict_rules = 5 , num_top_rules = 5 , num_weak_rules = 32 , alphabet_size = 11 , total_length = 236} , self = 60 , parent = Just 41 , duration = 1.836324711000 , status = Success , start = 2021-07-13 23:12:35.360813323 UTC , finish = 2021-07-13 23:12:37.197138034 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '1' ] , 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 = 40 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 32 , alphabet_size = 11 , total_length = 260} , self = 67 , parent = Just 43 , duration = 1.981198739000 , status = Success , start = 2021-07-13 23:12:35.409539841 UTC , finish = 2021-07-13 23:12:37.39073858 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '9' ] , 3 , True )} Success : 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 3.986346089000 min duration 3.911264649000 total durat. 7.897610738000 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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 22} , self = 77 , parent = Just 17 , duration = 3.911264649000 , status = Success , start = 2021-07-13 23:12:35.174630902 UTC , finish = 2021-07-13 23:12:39.085895551 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '9' ] , 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 = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 3 , total_length = 28} , self = 79 , parent = Just 11 , duration = 3.986346089000 , status = Success , start = 2021-07-13 23:12:35.172651687 UTC , finish = 2021-07-13 23:12:39.158997776 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '8' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 11 max duration 5.307568104000 min duration 0.000191088000 total durat. 15.147492911000 Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 241 , num_strict_rules = 241 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 34 , total_length = 1932} , self = 71 , parent = Just 56 , duration = 2.229278805000 , status = Success , start = 2021-07-13 23:12:36.145389532 UTC , finish = 2021-07-13 23:12:38.374668337 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '9' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 241 , num_strict_rules = 241 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 34 , total_length = 1932} , self = 69 , parent = Just 54 , duration = 2.284734365000 , status = Success , start = 2021-07-13 23:12:35.76935486 UTC , finish = 2021-07-13 23:12:38.054089225 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '7' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 371 , num_strict_rules = 26 , num_top_rules = 26 , num_weak_rules = 345 , alphabet_size = 47 , total_length = 3016} , self = 85 , parent = Just 68 , duration = 5.116807796000 , status = Success , start = 2021-07-13 23:12:37.390922523 UTC , finish = 2021-07-13 23:12:42.507730319 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '8' ] , 3 , False )} Info { what = Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} , input_size = Size { num_rules = 362 , num_strict_rules = 17 , num_top_rules = 17 , num_weak_rules = 345 , alphabet_size = 47 , total_length = 2926} , self = 84 , parent = Just 61 , duration = 5.307568104000 , status = Success , start = 2021-07-13 23:12:37.197302712 UTC , finish = 2021-07-13 23:12:42.504870816 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '2' ] , 3 , False )} **************************************************