/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 55 rules on 3 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 4309 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [0, 0, 0, 1, 0, 2, 2, 2, 2, 2, 0, 0, 0] -> [ 0 , 1 , 0 , 0 , 0 , 0 , 1 , 2 , 0 , 0 , 0 , 2 , 0 , 1 , 0 , 2 , 0 ] {- Input 0 -} [0, 0, 0, 1, 2, 0, 2, 2, 2, 2, 2, 1, 0] -> [ 0 , 0 , 1 , 1 , 1 , 2 , 2 , 0 , 1 , 2 , 1 , 0 , 0 , 0 , 0 , 2 , 0 ] {- Input 1 -} [0, 0, 0, 1, 2, 1, 2, 1, 1, 1, 0, 1, 2] -> [ 0 , 0 , 1 , 2 , 0 , 0 , 0 , 1 , 0 , 2 , 1 , 0 , 0 , 1 , 1 , 0 , 1 ] {- Input 2 -} [0, 0, 0, 1, 2, 1, 2, 2, 2, 0, 1, 2, 0] -> [ 0 , 0 , 2 , 0 , 1 , 0 , 0 , 1 , 0 , 1 , 0 , 0 , 2 , 0 , 2 , 2 , 0 ] {- Input 3 -} [0, 0, 0, 2, 2, 2, 0, 2, 1, 2, 0, 2, 1] -> [ 0 , 2 , 0 , 1 , 2 , 0 , 0 , 0 , 2 , 1 , 2 , 1 , 1 , 0 , 0 , 0 , 1 ] {- Input 4 -} [0, 0, 1, 1, 0, 2, 0, 0, 2, 2, 0, 2, 1] -> [ 0 , 0 , 1 , 0 , 1 , 2 , 0 , 0 , 0 , 1 , 1 , 0 , 0 , 2 , 1 , 0 , 1 ] {- Input 5 -} [0, 0, 1, 1, 0, 2, 0, 1, 1, 0, 0, 1, 0] -> [ 0 , 0 , 2 , 0 , 0 , 1 , 0 , 1 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 1 , 0 ] {- Input 6 -} [0, 0, 1, 1, 0, 2, 2, 2, 1, 1, 2, 1, 0] -> [ 0 , 0 , 0 , 2 , 2 , 0 , 0 , 0 , 0 , 1 , 2 , 2 , 0 , 1 , 1 , 1 , 0 ] {- Input 7 -} [0, 0, 1, 1, 2, 1, 1, 1, 1, 0, 2, 0, 2] -> [ 0 , 1 , 0 , 2 , 0 , 2 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 1 , 0 , 1 , 2 ] {- Input 8 -} [0, 0, 1, 2, 1, 2, 1, 1, 1, 0, 1, 0, 0] -> [ 0 , 2 , 1 , 0 , 1 , 0 , 0 , 0 , 0 , 1 , 0 , 1 , 1 , 2 , 0 , 0 , 0 ] {- Input 9 -} [0, 0, 2, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0] -> [ 0 , 0 , 0 , 0 , 0 , 0 , 2 , 0 , 1 , 0 , 1 , 1 , 0 , 0 , 0 , 2 , 0 ] {- Input 10 -} [0, 0, 2, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0] -> [ 0 , 1 , 1 , 1 , 0 , 0 , 0 , 2 , 2 , 0 , 0 , 0 , 1 , 0 , 1 , 0 , 0 ] {- Input 11 -} [0, 0, 2, 1, 1, 2, 0, 2, 1, 1, 0, 2, 0] -> [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 2 , 2 , 2 , 2 , 1 , 1 , 0 ] {- Input 12 -} [0, 0, 2, 1, 2, 1, 1, 1, 1, 2, 0, 0, 1] -> [ 0 , 0 , 0 , 0 , 0 , 2 , 0 , 2 , 2 , 1 , 0 , 0 , 1 , 0 , 2 , 0 , 1 ] {- Input 13 -} [0, 0, 2, 1, 2, 1, 2, 0, 0, 0, 2, 0, 1] -> [ 0 , 1 , 1 , 0 , 2 , 0 , 0 , 0 , 0 , 0 , 0 , 2 , 1 , 1 , 1 , 0 , 1 ] {- Input 14 -} [0, 1, 0, 0, 2, 0, 0, 1, 1, 1, 2, 1, 0] -> [ 0 , 0 , 1 , 0 , 0 , 1 , 0 , 1 , 0 , 2 , 1 , 1 , 0 , 1 , 0 , 0 , 0 ] {- Input 15 -} [0, 1, 0, 1, 1, 1, 0, 0, 2, 2, 1, 2, 0] -> [ 0 , 0 , 1 , 2 , 0 , 0 , 0 , 2 , 1 , 2 , 0 , 0 , 1 , 2 , 0 , 0 , 0 ] {- Input 16 -} [0, 1, 0, 1, 2, 0, 0, 1, 0, 1, 1, 0, 1] -> [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 2 , 0 , 2 , 1 , 0 , 0 , 0 , 2 , 1 ] {- Input 17 -} [0, 1, 0, 2, 1, 2, 1, 2, 1, 1, 1, 0, 0] -> [ 0 , 1 , 0 , 0 , 2 , 2 , 0 , 2 , 0 , 1 , 0 , 2 , 0 , 0 , 0 , 0 , 0 ] {- Input 18 -} [0, 1, 1, 0, 1, 0, 2, 1, 1, 0, 0, 0, 2] -> [ 0 , 0 , 0 , 0 , 0 , 1 , 1 , 1 , 2 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 0 ] {- Input 19 -} [0, 1, 1, 0, 2, 0, 2, 2, 1, 1, 2, 0, 0] -> [ 0 , 0 , 2 , 0 , 2 , 2 , 0 , 2 , 0 , 0 , 0 , 2 , 0 , 1 , 0 , 0 , 0 ] {- Input 20 -} [0, 1, 1, 0, 2, 1, 1, 1, 2, 2, 0, 2, 0] -> [ 0 , 0 , 2 , 1 , 2 , 1 , 0 , 0 , 2 , 0 , 1 , 0 , 2 , 2 , 0 , 0 , 0 ] {- Input 21 -} [0, 1, 1, 0, 2, 1, 2, 2, 1, 1, 0, 2, 1] -> [ 0 , 0 , 2 , 1 , 0 , 0 , 0 , 1 , 2 , 0 , 0 , 2 , 1 , 2 , 1 , 0 , 1 ] {- Input 22 -} [0, 1, 1, 1, 0, 2, 1, 1, 1, 0, 2, 1, 0] -> [ 0 , 2 , 1 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 1 , 0 , 1 , 0 , 1 , 2 , 0 ] {- Input 23 -} [0, 1, 2, 0, 2, 1, 0, 2, 0, 2, 2, 2, 1] -> [ 0 , 2 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 1 , 1 , 0 , 1 , 2 , 2 , 1 ] {- Input 24 -} [0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 0, 0, 0] -> [ 0 , 1 , 0 , 0 , 2 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 2 , 2 , 1 , 0 ] {- Input 25 -} [0, 1, 2, 2, 1, 0, 1, 1, 0, 1, 0, 1, 1] -> [ 0 , 0 , 0 , 0 , 1 , 0 , 2 , 0 , 2 , 1 , 0 , 0 , 0 , 0 , 2 , 2 , 1 ] {- Input 26 -} [0, 1, 2, 2, 2, 0, 1, 0, 0, 2, 0, 0, 0] -> [ 0 , 1 , 0 , 0 , 0 , 2 , 2 , 0 , 0 , 2 , 1 , 0 , 0 , 1 , 1 , 0 , 0 ] {- Input 27 -} [0, 1, 2, 2, 2, 2, 0, 2, 1, 2, 0, 0, 0] -> [ 0 , 0 , 0 , 1 , 1 , 0 , 2 , 2 , 0 , 1 , 2 , 1 , 1 , 0 , 1 , 1 , 0 ] {- Input 28 -} [0, 2, 0, 0, 1, 0, 0, 2, 0, 2, 0, 0, 1] -> [ 0 , 0 , 0 , 2 , 0 , 0 , 1 , 2 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 ] {- Input 29 -} [0, 2, 0, 2, 0, 2, 0, 1, 2, 2, 0, 2, 0] -> [ 0 , 1 , 1 , 2 , 0 , 2 , 1 , 0 , 0 , 0 , 2 , 2 , 1 , 0 , 2 , 0 , 0 ] {- Input 30 -} [0, 2, 0, 2, 1, 2, 1, 0, 0, 0, 2, 2, 0] -> [ 0 , 2 , 2 , 1 , 1 , 0 , 0 , 0 , 2 , 0 , 0 , 0 , 0 , 1 , 0 , 2 , 0 ] {- Input 31 -} [0, 2, 1, 0, 0, 2, 0, 1, 1, 2, 1, 2, 2] -> [ 0 , 1 , 0 , 1 , 1 , 1 , 0 , 0 , 1 , 2 , 1 , 1 , 0 , 0 , 0 , 2 , 2 ] {- Input 32 -} [0, 2, 1, 0, 1, 1, 0, 2, 2, 0, 1, 0, 0] -> [ 0 , 2 , 2 , 1 , 2 , 0 , 0 , 1 , 0 , 0 , 2 , 0 , 0 , 0 , 0 , 0 , 0 ] {- Input 33 -} [0, 2, 1, 0, 1, 2, 1, 2, 2, 0, 0, 0, 0] -> [ 0 , 2 , 1 , 0 , 1 , 0 , 0 , 0 , 1 , 2 , 1 , 0 , 0 , 0 , 2 , 0 , 0 ] {- Input 34 -} [0, 2, 1, 2, 1, 0, 0, 1, 2, 2, 1, 0, 2] -> [ 0 , 0 , 0 , 0 , 1 , 1 , 1 , 2 , 1 , 0 , 1 , 1 , 0 , 2 , 1 , 0 , 2 ] {- Input 35 -} [0, 2, 1, 2, 1, 0, 1, 2, 0, 2, 0, 1, 0] -> [ 0 , 1 , 0 , 2 , 2 , 0 , 0 , 2 , 2 , 0 , 0 , 0 , 0 , 1 , 0 , 1 , 0 ] {- Input 36 -} [0, 2, 1, 2, 1, 1, 1, 2, 2, 0, 0, 0, 1] -> [ 0 , 0 , 0 , 0 , 2 , 0 , 0 , 2 , 1 , 0 , 0 , 2 , 1 , 2 , 0 , 2 , 1 ] {- Input 37 -} [1, 0, 0, 0, 0, 0, 1, 2, 2, 1, 0, 0, 2] -> [ 2 , 1 , 0 , 0 , 0 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 , 0 ] {- Input 38 -} [1, 0, 1, 1, 2, 1, 1, 2, 0, 0, 2, 0, 0] -> [ 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 1 , 2 , 0 , 2 , 0 ] {- Input 39 -} [1, 0, 1, 1, 2, 1, 1, 2, 0, 1, 2, 2, 0] -> [ 1 , 0 , 1 , 1 , 2 , 1 , 2 , 1 , 1 , 1 , 0 , 1 , 2 , 0 , 0 , 0 , 0 ] {- Input 40 -} [1, 0, 1, 2, 0, 2, 2, 2, 0, 1, 1, 1, 0] -> [ 1 , 0 , 0 , 1 , 1 , 0 , 0 , 2 , 1 , 0 , 1 , 2 , 1 , 0 , 1 , 2 , 0 ] {- Input 41 -} [1, 1, 1, 2, 2, 1, 0, 2, 1, 0, 1, 1, 0] -> [ 1 , 1 , 1 , 1 , 0 , 0 , 1 , 0 , 1 , 0 , 1 , 1 , 1 , 0 , 2 , 0 , 0 ] {- Input 42 -} [1, 2, 1, 0, 2, 0, 1, 0, 2, 0, 0, 1, 0] -> [ 1 , 2 , 1 , 1 , 0 , 0 , 2 , 1 , 0 , 0 , 0 , 1 , 0 , 1 , 0 , 0 , 0 ] {- Input 43 -} [2, 0, 0, 1, 0, 0, 2, 1, 0, 1, 0, 0, 1] -> [ 1 , 0 , 0 , 0 , 0 , 1 , 0 , 1 , 0 , 0 , 0 , 0 , 0 , 0 , 2 , 0 , 0 ] {- Input 44 -} [2, 0, 1, 1, 0, 0, 2, 1, 2, 1, 0, 0, 0] -> [ 0 , 2 , 1 , 0 , 0 , 0 , 0 , 1 , 1 , 0 , 0 , 0 , 1 , 2 , 0 , 0 , 0 ] {- Input 45 -} [2, 0, 2, 0, 1, 0, 2, 1, 2, 2, 1, 2, 0] -> [ 2 , 0 , 0 , 0 , 2 , 2 , 1 , 1 , 0 , 0 , 1 , 0 , 2 , 1 , 1 , 2 , 0 ] {- Input 46 -} [2, 0, 2, 1, 0, 0, 2, 1, 1, 1, 2, 0, 0] -> [ 2 , 1 , 0 , 0 , 1 , 0 , 2 , 0 , 1 , 0 , 0 , 1 , 0 , 0 , 2 , 0 , 0 ] {- Input 47 -} [2, 1, 1, 1, 1, 0, 0, 1, 2, 2, 0, 2, 1] -> [ 0 , 0 , 2 , 0 , 0 , 2 , 0 , 0 , 2 , 0 , 1 , 2 , 0 , 1 , 1 , 0 , 1 ] {- Input 48 -} [2, 1, 1, 1, 1, 1, 2, 2, 1, 0, 0, 1, 0] -> [ 0 , 2 , 0 , 2 , 0 , 2 , 0 , 0 , 0 , 2 , 1 , 0 , 2 , 1 , 1 , 0 , 0 ] {- Input 49 -} [2, 1, 2, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1] -> [ 0 , 2 , 0 , 0 , 1 , 0 , 0 , 0 , 2 , 0 , 0 , 0 , 0 , 0 , 0 , 2 , 1 ] {- Input 50 -} [2, 2, 0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 2] -> [ 0 , 0 , 0 , 2 , 0 , 0 , 0 , 0 , 0 , 1 , 1 , 1 , 2 , 1 , 0 , 0 , 1 ] {- Input 51 -} [2, 2, 0, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0] -> [ 0 , 0 , 0 , 0 , 1 , 0 , 0 , 1 , 1 , 0 , 0 , 1 , 0 , 1 , 1 , 1 , 0 ] {- Input 52 -} [2, 2, 2, 1, 0, 1, 2, 1, 2, 0, 1, 0, 2] -> [ 2 , 2 , 2 , 1 , 1 , 0 , 0 , 0 , 0 , 0 , 2 , 1 , 2 , 1 , 1 , 0 , 2 ] {- Input 53 -} [2, 2, 2, 1, 1, 0, 1, 1, 0, 0, 0, 1, 2] -> [ 2 , 1 , 1 , 0 , 0 , 1 , 0 , 0 , 0 , 1 , 0 , 0 , 2 , 1 , 0 , 1 , 2 ] {- Input 54 -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 4309 states ************************************************** skeleton: (55,3)\Rfcmatchbound{1}[] ************************************************** 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 42.178797291000 min duration 42.178797291000 total durat. 42.178797291000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 28 , parent = Just 0 , duration = 42.178797291000 , status = Success , start = 2021-07-13 19:48:54.258036392 UTC , finish = 2021-07-13 19:49:36.436833683 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '5' ] , 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 42.179632720000 min duration 42.179632720000 total durat. 42.179632720000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 30 , parent = Just 3 , duration = 42.179632720000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 19:48:54.258073068 UTC , finish = 2021-07-13 19:49:36.437705788 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '9' ] , 2 , True )} Fail : Tiling { method = Backward , 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 2 max duration 25.391431912000 min duration 0.443222620000 total durat. 25.834654532000 Info { what = Tiling { method = Backward , 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 = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 24 , parent = Just 0 , duration = 25.391431912000 , status = Fail , start = 2021-07-13 19:48:54.276769558 UTC , finish = 2021-07-13 19:49:19.66820147 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '5' , '6' ] , 3 , 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 37.243736719000 min duration 1.957262699000 total durat. 39.200999418000 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 = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 9 , parent = Just 0 , duration = 1.957262699000 , status = Success , start = 2021-07-13 19:48:54.276852932 UTC , finish = 2021-07-13 19:48:56.234115631 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '6' , '8' ] , 3 , True )} 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 = 833 , num_strict_rules = 833 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 26656} , self = 26 , parent = Just 11 , duration = 37.243736719000 , status = Success , start = 2021-07-13 19:48:57.42068287 UTC , finish = 2021-07-13 19:49:34.664419589 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '9' ] , 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 2 max duration 16.146456560000 min duration 0.619584403000 total durat. 16.766040963000 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 = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 22 , parent = Just 0 , duration = 16.146456560000 , status = Fail , start = 2021-07-13 19:48:54.276825954 UTC , finish = 2021-07-13 19:49:10.423282514 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '6' , '0' ] , 3 , 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 2 max duration 1.406237911000 min duration 0.930111128000 total durat. 2.336349039000 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 = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 8 , parent = Just 0 , duration = 1.406237911000 , status = Fail , start = 2021-07-13 19:48:54.276895495 UTC , finish = 2021-07-13 19:48:55.683133406 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '0' ] , 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.303510868000 min duration 3.303510868000 total durat. 3.303510868000 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 = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 16 , parent = Just 0 , duration = 3.303510868000 , status = Success , start = 2021-07-13 19:48:54.276859658 UTC , finish = 2021-07-13 19:48:57.580370526 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '4' ] , 3 , True )} Fail : Tiling { method = Forward , 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 2 max duration 2.744910932000 min duration 0.884407154000 total durat. 3.629318086000 Info { what = Tiling { method = Forward , 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 = 55 , num_strict_rules = 55 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 1650} , self = 13 , parent = Just 0 , duration = 2.744910932000 , status = Fail , start = 2021-07-13 19:48:54.276879234 UTC , finish = 2021-07-13 19:48:57.021790166 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '6' ] , 3 , True )} **************************************************