/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 41 rules on 6 letters mirror SRS with 41 rules on 6 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1173 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [5, 4, 0] -> [0, 2, 2, 1, 1, 3, 0, 4, 3, 0] {- Input 0 -} [4, 1, 4, 0] -> [4, 0, 2, 2, 1, 1, 0, 0, 5, 2] {- Input 1 -} [5, 4, 4, 5] -> [1, 1, 2, 3, 2, 0, 3, 1, 2, 0] {- Input 2 -} [0, 3, 4, 0, 4] -> [2, 0, 2, 1, 3, 0, 4, 2, 3, 4] {- Input 3 -} [0, 3, 4, 5, 4] -> [1, 0, 1, 2, 4, 2, 3, 1, 2, 4] {- Input 4 -} [1, 1, 5, 5, 4] -> [1, 3, 0, 0, 0, 2, 3, 3, 4, 1] {- Input 5 -} [1, 4, 5, 5, 4] -> [2, 0, 1, 0, 2, 3, 4, 2, 5, 1] {- Input 6 -} [2, 5, 4, 5, 0] -> [1, 1, 2, 4, 2, 0, 2, 0, 5, 0] {- Input 7 -} [3, 1, 5, 1, 1] -> [3, 5, 0, 5, 3, 1, 2, 5, 5, 1] {- Input 8 -} [4, 0, 0, 4, 5] -> [3, 3, 2, 0, 0, 1, 4, 3, 3, 5] {- Input 9 -} [4, 1, 4, 2, 0] -> [0, 4, 2, 1, 3, 1, 0, 3, 3, 0] {- Input 10 -} [5, 4, 1, 4, 1] -> [0, 1, 0, 2, 0, 1, 2, 4, 4, 2] {- Input 11 -} [0, 3, 4, 1, 0, 4] -> [2, 4, 1, 4, 3, 3, 3, 0, 0, 4] {- Input 12 -} [0, 3, 4, 5, 1, 3] -> [4, 4, 4, 3, 1, 3, 3, 3, 0, 3] {- Input 13 -} [0, 4, 0, 5, 1, 4] -> [0, 0, 3, 3, 1, 2, 0, 3, 2, 4] {- Input 14 -} [1, 3, 2, 5, 4, 0] -> [3, 0, 4, 0, 0, 4, 3, 1, 4, 0] {- Input 15 -} [1, 3, 5, 4, 5, 4] -> [2, 3, 2, 0, 1, 2, 5, 2, 1, 5] {- Input 16 -} [1, 4, 2, 1, 4, 0] -> [0, 3, 3, 0, 2, 0, 3, 2, 0, 5] {- Input 17 -} [1, 5, 3, 4, 1, 3] -> [1, 1, 3, 1, 1, 2, 0, 1, 2, 3] {- Input 18 -} [1, 5, 4, 5, 0, 4] -> [4, 3, 2, 3, 2, 0, 1, 3, 4, 0] {- Input 19 -} [1, 5, 5, 4, 1, 3] -> [3, 5, 1, 3, 2, 1, 1, 4, 3, 3] {- Input 20 -} [2, 3, 5, 4, 5, 1] -> [5, 4, 3, 5, 5, 5, 1, 2, 5, 1] {- Input 21 -} [3, 4, 5, 3, 5, 0] -> [3, 4, 3, 3, 2, 3, 5, 3, 3, 0] {- Input 22 -} [5, 4, 5, 4, 4, 5] -> [1, 0, 3, 2, 0, 3, 3, 4, 4, 5] {- Input 23 -} [0, 2, 5, 2, 4, 0, 4] -> [4, 3, 0, 1, 2, 1, 0, 2, 0, 1] {- Input 24 -} [1, 1, 5, 5, 4, 0, 5] -> [4, 2, 2, 2, 1, 1, 4, 2, 4, 2] {- Input 25 -} [1, 4, 0, 3, 1, 4, 1] -> [0, 4, 1, 3, 3, 3, 4, 2, 2, 0] {- Input 26 -} [1, 4, 1, 0, 4, 0, 3] -> [2, 4, 4, 3, 3, 2, 4, 0, 2, 3] {- Input 27 -} [1, 4, 4, 5, 1, 0, 2] -> [2, 3, 0, 1, 4, 0, 1, 4, 2, 3] {- Input 28 -} [1, 4, 4, 5, 4, 2, 4] -> [1, 0, 0, 1, 5, 1, 2, 1, 5, 4] {- Input 29 -} [1, 5, 4, 1, 1, 3, 3] -> [0, 5, 3, 2, 0, 1, 3, 3, 2, 3] {- Input 30 -} [1, 5, 4, 4, 1, 4, 5] -> [2, 3, 2, 0, 2, 5, 3, 4, 3, 5] {- Input 31 -} [2, 0, 2, 5, 4, 5, 1] -> [0, 0, 5, 3, 0, 2, 1, 2, 4, 0] {- Input 32 -} [2, 3, 5, 4, 4, 0, 5] -> [2, 5, 1, 3, 0, 2, 3, 0, 2, 5] {- Input 33 -} [2, 4, 2, 4, 4, 1, 3] -> [0, 3, 2, 2, 1, 0, 1, 1, 0, 3] {- Input 34 -} [2, 5, 4, 4, 5, 4, 1] -> [2, 2, 1, 2, 4, 5, 3, 2, 4, 2] {- Input 35 -} [3, 5, 4, 1, 4, 1, 5] -> [3, 1, 5, 2, 5, 3, 2, 5, 2, 5] {- Input 36 -} [4, 2, 4, 4, 4, 5, 4] -> [4, 3, 3, 4, 1, 0, 4, 5, 5, 4] {- Input 37 -} [4, 5, 4, 0, 4, 4, 0] -> [0, 3, 1, 3, 4, 0, 0, 5, 5, 5] {- Input 38 -} [5, 4, 0, 3, 2, 3, 5] -> [1, 0, 3, 2, 1, 0, 1, 2, 3, 5] {- Input 39 -} [5, 4, 0, 3, 2, 5, 0] -> [2, 4, 3, 2, 4, 1, 1, 0, 5, 5] {- Input 40 -} reason mirror property Termination has value Just True for SRS [0, 4, 5] -> [0, 3, 4, 0, 3, 1, 1, 2, 2, 0] {- Mirror (Input 0) -} [0, 4, 1, 4] -> [2, 5, 0, 0, 1, 1, 2, 2, 0, 4] {- Mirror (Input 1) -} [5, 4, 4, 5] -> [0, 2, 1, 3, 0, 2, 3, 2, 1, 1] {- Mirror (Input 2) -} [4, 0, 4, 3, 0] -> [4, 3, 2, 4, 0, 3, 1, 2, 0, 2] {- Mirror (Input 3) -} [4, 5, 4, 3, 0] -> [4, 2, 1, 3, 2, 4, 2, 1, 0, 1] {- Mirror (Input 4) -} [4, 5, 5, 1, 1] -> [1, 4, 3, 3, 2, 0, 0, 0, 3, 1] {- Mirror (Input 5) -} [4, 5, 5, 4, 1] -> [1, 5, 2, 4, 3, 2, 0, 1, 0, 2] {- Mirror (Input 6) -} [0, 5, 4, 5, 2] -> [0, 5, 0, 2, 0, 2, 4, 2, 1, 1] {- Mirror (Input 7) -} [1, 1, 5, 1, 3] -> [1, 5, 5, 2, 1, 3, 5, 0, 5, 3] {- Mirror (Input 8) -} [5, 4, 0, 0, 4] -> [5, 3, 3, 4, 1, 0, 0, 2, 3, 3] {- Mirror (Input 9) -} [0, 2, 4, 1, 4] -> [0, 3, 3, 0, 1, 3, 1, 2, 4, 0] {- Mirror (Input 10) -} [1, 4, 1, 4, 5] -> [2, 4, 4, 2, 1, 0, 2, 0, 1, 0] {- Mirror (Input 11) -} [4, 0, 1, 4, 3, 0] -> [4, 0, 0, 3, 3, 3, 4, 1, 4, 2] {- Mirror (Input 12) -} [3, 1, 5, 4, 3, 0] -> [3, 0, 3, 3, 3, 1, 3, 4, 4, 4] {- Mirror (Input 13) -} [4, 1, 5, 0, 4, 0] -> [4, 2, 3, 0, 2, 1, 3, 3, 0, 0] {- Mirror (Input 14) -} [0, 4, 5, 2, 3, 1] -> [0, 4, 1, 3, 4, 0, 0, 4, 0, 3] {- Mirror (Input 15) -} [4, 5, 4, 5, 3, 1] -> [5, 1, 2, 5, 2, 1, 0, 2, 3, 2] {- Mirror (Input 16) -} [0, 4, 1, 2, 4, 1] -> [5, 0, 2, 3, 0, 2, 0, 3, 3, 0] {- Mirror (Input 17) -} [3, 1, 4, 3, 5, 1] -> [3, 2, 1, 0, 2, 1, 1, 3, 1, 1] {- Mirror (Input 18) -} [4, 0, 5, 4, 5, 1] -> [0, 4, 3, 1, 0, 2, 3, 2, 3, 4] {- Mirror (Input 19) -} [3, 1, 4, 5, 5, 1] -> [3, 3, 4, 1, 1, 2, 3, 1, 5, 3] {- Mirror (Input 20) -} [1, 5, 4, 5, 3, 2] -> [1, 5, 2, 1, 5, 5, 5, 3, 4, 5] {- Mirror (Input 21) -} [0, 5, 3, 5, 4, 3] -> [0, 3, 3, 5, 3, 2, 3, 3, 4, 3] {- Mirror (Input 22) -} [5, 4, 4, 5, 4, 5] -> [5, 4, 4, 3, 3, 0, 2, 3, 0, 1] {- Mirror (Input 23) -} [4, 0, 4, 2, 5, 2, 0] -> [1, 0, 2, 0, 1, 2, 1, 0, 3, 4] {- Mirror (Input 24) -} [5, 0, 4, 5, 5, 1, 1] -> [2, 4, 2, 4, 1, 1, 2, 2, 2, 4] {- Mirror (Input 25) -} [1, 4, 1, 3, 0, 4, 1] -> [0, 2, 2, 4, 3, 3, 3, 1, 4, 0] {- Mirror (Input 26) -} [3, 0, 4, 0, 1, 4, 1] -> [3, 2, 0, 4, 2, 3, 3, 4, 4, 2] {- Mirror (Input 27) -} [2, 0, 1, 5, 4, 4, 1] -> [3, 2, 4, 1, 0, 4, 1, 0, 3, 2] {- Mirror (Input 28) -} [4, 2, 4, 5, 4, 4, 1] -> [4, 5, 1, 2, 1, 5, 1, 0, 0, 1] {- Mirror (Input 29) -} [3, 3, 1, 1, 4, 5, 1] -> [3, 2, 3, 3, 1, 0, 2, 3, 5, 0] {- Mirror (Input 30) -} [5, 4, 1, 4, 4, 5, 1] -> [5, 3, 4, 3, 5, 2, 0, 2, 3, 2] {- Mirror (Input 31) -} [1, 5, 4, 5, 2, 0, 2] -> [0, 4, 2, 1, 2, 0, 3, 5, 0, 0] {- Mirror (Input 32) -} [5, 0, 4, 4, 5, 3, 2] -> [5, 2, 0, 3, 2, 0, 3, 1, 5, 2] {- Mirror (Input 33) -} [3, 1, 4, 4, 2, 4, 2] -> [3, 0, 1, 1, 0, 1, 2, 2, 3, 0] {- Mirror (Input 34) -} [1, 4, 5, 4, 4, 5, 2] -> [2, 4, 2, 3, 5, 4, 2, 1, 2, 2] {- Mirror (Input 35) -} [5, 1, 4, 1, 4, 5, 3] -> [5, 2, 5, 2, 3, 5, 2, 5, 1, 3] {- Mirror (Input 36) -} [4, 5, 4, 4, 4, 2, 4] -> [4, 5, 5, 4, 0, 1, 4, 3, 3, 4] {- Mirror (Input 37) -} [0, 4, 4, 0, 4, 5, 4] -> [5, 5, 5, 0, 0, 4, 3, 1, 3, 0] {- Mirror (Input 38) -} [5, 3, 2, 3, 0, 4, 5] -> [5, 3, 2, 1, 0, 1, 2, 3, 0, 1] {- Mirror (Input 39) -} [0, 5, 2, 3, 0, 4, 5] -> [5, 5, 0, 1, 1, 4, 2, 3, 4, 2] {- Mirror (Input 40) -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 1173 states ************************************************** skeleton: \Mirror(41,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 4.129055495000 min duration 4.129055495000 total durat. 4.129055495000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 38 , parent = Just 4 , duration = 4.129055495000 , status = Success , start = 2021-07-13 21:08:34.273616638 UTC , finish = 2021-07-13 21:08:38.402672133 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '3' ] , 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 4.130748798000 min duration 4.130748798000 total durat. 4.130748798000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 40 , parent = Just 0 , duration = 4.130748798000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.273575284 UTC , finish = 2021-07-13 21:08:38.404324082 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '3' ] , 2 , 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 2 max duration 3.730817649000 min duration 3.554594221000 total durat. 7.285411870000 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 = 439 , num_strict_rules = 398 , num_top_rules = 398 , num_weak_rules = 41 , alphabet_size = 12 , total_length = 5296} , self = 47 , parent = Just 18 , duration = 3.554594221000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.850200094 UTC , finish = 2021-07-13 21:08:38.404794315 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '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 = 417 , num_strict_rules = 376 , num_top_rules = 376 , num_weak_rules = 41 , alphabet_size = 12 , total_length = 5131} , self = 46 , parent = Just 17 , duration = 3.730817649000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.673955288 UTC , finish = 2021-07-13 21:08:38.404772937 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '2' ] , 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 = 4 , encoding = Ersatz_Binary , dim = 2 , solver = Minisatapi , verbose = True , tracing = False} total number 2 max duration 3.730926701000 min duration 3.554722817000 total durat. 7.285649518000 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 = 439 , num_strict_rules = 398 , num_top_rules = 398 , num_weak_rules = 41 , alphabet_size = 12 , total_length = 5296} , self = 49 , parent = Just 18 , duration = 3.554722817000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.85011493 UTC , finish = 2021-07-13 21:08:38.404837747 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '6' ] , 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 = 417 , num_strict_rules = 376 , num_top_rules = 376 , num_weak_rules = 41 , alphabet_size = 12 , total_length = 5131} , self = 48 , parent = Just 17 , duration = 3.730926701000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.673898267 UTC , finish = 2021-07-13 21:08:38.404824968 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '8' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 3.730808393000 min duration 3.554693472000 total durat. 7.285501865000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 439 , num_strict_rules = 398 , num_top_rules = 398 , num_weak_rules = 41 , alphabet_size = 12 , total_length = 5296} , self = 42 , parent = Just 18 , duration = 3.554693472000 , status = Fail , start = 2021-07-13 21:08:34.849963388 UTC , finish = 2021-07-13 21:08:38.40465686 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '8' ] , 0 , True )} Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 417 , num_strict_rules = 376 , num_top_rules = 376 , num_weak_rules = 41 , alphabet_size = 12 , total_length = 5131} , self = 41 , parent = Just 17 , duration = 3.730808393000 , status = Fail , start = 2021-07-13 21:08:34.673823151 UTC , finish = 2021-07-13 21:08:38.404631544 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '5' ] , 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 4.131168117000 min duration 4.131168117000 total durat. 4.131168117000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 44 , parent = Just 0 , duration = 4.131168117000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.273575774 UTC , finish = 2021-07-13 21:08:38.404743891 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '8' ] , 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 4.131089160000 min duration 4.131089160000 total durat. 4.131089160000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 43 , parent = Just 0 , duration = 4.131089160000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.273617368 UTC , finish = 2021-07-13 21:08:38.404706528 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '5' ] , 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 1 max duration 2.942777899000 min duration 2.942777899000 total durat. 2.942777899000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 33 , parent = Just 0 , duration = 2.942777899000 , status = Success , start = 2021-07-13 21:08:34.294818777 UTC , finish = 2021-07-13 21:08:37.237596676 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '4' ] , 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 3.425783575000 min duration 3.425783575000 total durat. 3.425783575000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 35 , parent = Just 0 , duration = 3.425783575000 , status = Fail , start = 2021-07-13 21:08:34.29484813 UTC , finish = 2021-07-13 21:08:37.720631705 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '6' ] , 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 3.921618896000 min duration 3.921618896000 total durat. 3.921618896000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 36 , parent = Just 0 , duration = 3.921618896000 , status = Success , start = 2021-07-13 21:08:34.294804519 UTC , finish = 2021-07-13 21:08:38.216423415 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '0' ] , 3 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Transport { mode = Standard, max_derivation_length = Nothing} total number 1 max duration 4.131166350000 min duration 4.131166350000 total durat. 4.131166350000 Info { what = Transport { mode = Standard, max_derivation_length = Nothing} , input_size = Size { num_rules = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 6 , total_length = 657} , self = 45 , parent = Just 0 , duration = 4.131166350000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:08:34.273600961 UTC , finish = 2021-07-13 21:08:38.404767311 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '1' ] , 1 , True )} **************************************************