/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 9 rules on 4 letters weights SRS with 5 rules on 3 letters DP SRS with 18 strict rules and 5 weak rules on 6 letters weights SRS with 5 strict rules and 5 weak rules on 6 letters EDG 2 sub-proofs 1 SRS with 1 strict rules and 5 weak rules on 4 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 3, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 5 weak rules on 3 letters EDG 2 SRS with 4 strict rules and 4 weak rules on 4 letters Usable SRS with 4 strict rules and 4 weak rules on 4 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [C, C] -> [c, c] {- Input 0 -} [c, c, c, c] -> [] {- Input 1 -} [b, b, b, b] -> [B, B] {- Input 2 -} [B, B, B, B] -> [b, b] {- Input 3 -} [c, c, B, B, c, c, b, b, c, c] -> [ B , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- Input 4 -} [b, b, B, B] -> [] {- Input 5 -} [B, B, b, b] -> [] {- Input 6 -} [c, c, C, C] -> [] {- Input 7 -} [C, C, c, c] -> [] {- Input 8 -} reason (C, 3/2) (c, 1/1) property Termination has value Just True for SRS [b, b, b, b] -> [B, B] {- Input 2 -} [B, B, B, B] -> [b, b] {- Input 3 -} [c, c, B, B, c, c, b, b, c, c] -> [ B , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- Input 4 -} [b, b, B, B] -> [] {- Input 5 -} [B, B, b, b] -> [] {- Input 6 -} reason DP property Termination has value Just True for SRS [b, b, b, b] ->= [B, B] {- DP Nontop (Input 2) -} [B, B, B, B] ->= [b, b] {- DP Nontop (Input 3) -} [c, c, B, B, c, c, b, b, c, c] ->= [ B , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- DP Nontop (Input 4) -} [b, b, B, B] ->= [] {- DP Nontop (Input 5) -} [B, B, b, b] ->= [] {- DP Nontop (Input 6) -} [c#, c, B, B, c, c, b, b, c, c] |-> [c#, c, b, b] {- DP (Top 10) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ c# , c , b , b , c , c , B , B , c , c , b , b ] {- DP (Top 2) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ c# , c , B , B , c , c , b , b ] {- DP (Top 6) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [c#, b, b] {- DP (Top 11) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ c# , b , b , c , c , B , B , c , c , b , b ] {- DP (Top 3) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ c# , B , B , c , c , b , b ] {- DP (Top 7) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [b#] {- DP (Top 13) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ b# , c , c , B , B , c , c , b , b ] {- DP (Top 5) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [b#, b] {- DP (Top 12) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ b# , b , c , c , B , B , c , c , b , b ] {- DP (Top 4) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [B#, c, c, b, b] {- DP (Top 9) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ B# , c , c , b , b , c , c , B , B , c , c , b , b ] {- DP (Top 1) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ B# , B , c , c , b , b ] {- DP (Top 8) (Input 4) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ B# , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- DP (Top 0) (Input 4) -} [b#, b, b, b] |-> [B#] {- DP (Top 1) (Input 2) -} [b#, b, b, b] |-> [B#, B] {- DP (Top 0) (Input 2) -} [B#, B, B, B] |-> [b#] {- DP (Top 1) (Input 3) -} [B#, B, B, B] |-> [b#, b] {- DP (Top 0) (Input 3) -} reason (c, 5/1) (c#, 6/1) property Termination has value Just True for SRS [b, b, b, b] ->= [B, B] {- DP Nontop (Input 2) -} [B, B, B, B] ->= [b, b] {- DP Nontop (Input 3) -} [c, c, B, B, c, c, b, b, c, c] ->= [ B , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- DP Nontop (Input 4) -} [b, b, B, B] ->= [] {- DP Nontop (Input 5) -} [B, B, b, b] ->= [] {- DP Nontop (Input 6) -} [c#, c, B, B, c, c, b, b, c, c] |-> [ c# , c , b , b , c , c , B , B , c , c , b , b ] {- DP (Top 2) (Input 4) -} [b#, b, b, b] |-> [B#] {- DP (Top 1) (Input 2) -} [b#, b, b, b] |-> [B#, B] {- DP (Top 0) (Input 2) -} [B#, B, B, B] |-> [b#] {- DP (Top 1) (Input 3) -} [B#, B, B, B] |-> [b#, b] {- DP (Top 0) (Input 3) -} reason EDG property Termination has value Just True for SRS [c#, c, B, B, c, c, b, b, c, c] |-> [ c# , c , b , b , c , c , B , B , c , c , b , b ] {- DP (Top 2) (Input 4) -} [b, b, b, b] ->= [B, B] {- DP Nontop (Input 2) -} [B, B, B, B] ->= [b, b] {- DP Nontop (Input 3) -} [c, c, B, B, c, c, b, b, c, c] ->= [ B , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- DP Nontop (Input 4) -} [b, b, B, B] ->= [] {- DP Nontop (Input 5) -} [B, B, b, b] ->= [] {- DP Nontop (Input 6) -} reason ( b , Wk / 0 1 0 0 \ | 1 1 1 1 | | 1 0 0 0 | \ 0 0 0 1 / ) ( B , Wk / 0 1 1 0 \ | 2 0 0 0 | | 0 1 0 1 | \ 0 0 0 1 / ) ( c , Wk / 0 0 1 0 \ | 0 0 0 0 | | 0 0 1 0 | \ 0 0 0 1 / ) ( c# , Wk / 2 0 0 1 \ | 0 0 0 0 | | 0 0 0 0 | \ 0 0 0 1 / ) property Termination has value Just True for SRS [b, b, b, b] ->= [B, B] {- DP Nontop (Input 2) -} [B, B, B, B] ->= [b, b] {- DP Nontop (Input 3) -} [c, c, B, B, c, c, b, b, c, c] ->= [ B , B , c , c , b , b , c , c , B , B , c , c , b , b ] {- DP Nontop (Input 4) -} [b, b, B, B] ->= [] {- DP Nontop (Input 5) -} [B, B, b, b] ->= [] {- DP Nontop (Input 6) -} reason EDG property Termination has value Just True for SRS [b#, b, b, b] |-> [B#] {- DP (Top 1) (Input 2) -} [B#, B, B, B] |-> [b#, b] {- DP (Top 0) (Input 3) -} [b#, b, b, b] |-> [B#, B] {- DP (Top 0) (Input 2) -} [B#, B, B, B] |-> [b#] {- DP (Top 1) (Input 3) -} [b, b, b, b] ->= [B, B] {- DP Nontop (Input 2) -} [B, B, B, B] ->= [b, b] {- DP Nontop (Input 3) -} [b, b, B, B] ->= [] {- DP Nontop (Input 5) -} [B, B, b, b] ->= [] {- DP Nontop (Input 6) -} reason Usable property Termination has value Just True for SRS [b#, b, b, b] |-> [B#] {- DP (Top 1) (Input 2) -} [B#, B, B, B] |-> [b#, b] {- DP (Top 0) (Input 3) -} [b#, b, b, b] |-> [B#, B] {- DP (Top 0) (Input 2) -} [B#, B, B, B] |-> [b#] {- DP (Top 1) (Input 3) -} [b, b, b, b] ->= [B, B] {- DP Nontop (Input 2) -} [B, B, B, B] ->= [b, b] {- DP Nontop (Input 3) -} [b, b, B, B] ->= [] {- DP Nontop (Input 5) -} [B, B, b, b] ->= [] {- DP Nontop (Input 6) -} reason (b, 5/1) (B, 9/2) (b#, 5/2) (B#, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (9,4)\Weight(5,3)\Deepee(18/5,6)\Weight(5/5,6)\EDG[(1/5,4)\Matrix{\Natural}{4}(0/5,3)\EDG[],\Usable(4/4,4)\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) ************************************************** 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 5.774592910000 min duration 5.768493853000 total durat. 11.543086763000 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 = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 55 , parent = Just 15 , duration = 5.768493853000 , status = Fail , start = 2021-07-13 23:41:26.615371204 UTC , finish = 2021-07-13 23:41:32.383865057 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '4' ] , 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 = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 56 , parent = Just 16 , duration = 5.774592910000 , status = Fail , start = 2021-07-13 23:41:26.615156317 UTC , finish = 2021-07-13 23:41:32.389749227 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '0' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : 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 8.339108941000 min duration 8.339108941000 total durat. 8.339108941000 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 = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 66 , parent = Just 15 , duration = 8.339108941000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:41:32.384033695 UTC , finish = 2021-07-13 23:41:40.723142636 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '9' ] , 0 , True )} Success : Matrix { monotone = Weak , domain = Natural , shape = Full , bits = 3 , encoding = Ersatz_Binary , dim = 4 , solver = Minisatapi , verbose = True , tracing = False} total number 1 max duration 13.322089511000 min duration 13.322089511000 total durat. 13.322089511000 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 = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 62 , parent = Just 15 , duration = 13.322089511000 , status = Success , start = 2021-07-13 23:41:27.389757648 UTC , finish = 2021-07-13 23:41:40.711847159 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '2' ] , 0 , True )} Fail : 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 0.774260896000 min duration 0.772370879000 total durat. 1.546631775000 Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 0.622666782000 min duration 0.622485415000 total durat. 1.245152197000 Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 4.915231051000 min duration 4.896360838000 total durat. 9.811591889000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 53 , parent = Just 16 , duration = 4.896360838000 , status = Fail , start = 2021-07-13 23:41:27.238193605 UTC , finish = 2021-07-13 23:41:32.134554443 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '3' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 54 , parent = Just 15 , duration = 4.915231051000 , status = Fail , start = 2021-07-13 23:41:27.238259494 UTC , finish = 2021-07-13 23:41:32.153490545 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '6' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 8.593214369000 min duration 8.569236986000 total durat. 17.162451355000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 65 , parent = Just 15 , duration = 8.569236986000 , status = Fail , start = 2021-07-13 23:41:32.153714743 UTC , finish = 2021-07-13 23:41:40.722951729 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '6' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 70 , parent = Just 16 , duration = 8.593214369000 , status = Fail , start = 2021-07-13 23:41:32.134822207 UTC , finish = 2021-07-13 23:41:40.728036576 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '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 2 max duration 6.752157917000 min duration 0.216645397000 total durat. 6.968803314000 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 = 78 , num_strict_rules = 78 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 852} , self = 57 , parent = Just 31 , duration = 6.752157917000 , status = Success , start = 2021-07-13 23:41:27.126479919 UTC , finish = 2021-07-13 23:41:33.878637836 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '1' ] , 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 9.133195776000 min duration 9.133195776000 total durat. 9.133195776000 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 = 5 , num_strict_rules = 5 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 44} , self = 59 , parent = Just 1 , duration = 9.133195776000 , status = Fail , start = 2021-07-13 23:41:26.614750841 UTC , finish = 2021-07-13 23:41:35.747946617 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '3' ] , 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 11.818142257000 min duration 0.289893228000 total durat. 12.108035485000 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 = 78 , num_strict_rules = 78 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 15 , total_length = 852} , self = 60 , parent = Just 31 , duration = 11.818142257000 , status = Success , start = 2021-07-13 23:41:27.186867812 UTC , finish = 2021-07-13 23:41:39.005010069 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '0' ] , 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 2 max duration 1.784131659000 min duration 1.781609311000 total durat. 3.565740970000 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 = 6 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 41 , parent = Just 16 , duration = 1.781609311000 , status = Success , start = 2021-07-13 23:41:26.625451245 UTC , finish = 2021-07-13 23:41:28.407060556 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '8' ] , 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 = 6 , num_strict_rules = 1 , num_top_rules = 1 , num_weak_rules = 5 , alphabet_size = 4 , total_length = 66} , self = 43 , parent = Just 15 , duration = 1.784131659000 , status = Success , start = 2021-07-13 23:41:26.625677011 UTC , finish = 2021-07-13 23:41:28.40980867 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '6' ] , 3 , True )} Success : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 8 max duration 0.470078810000 min duration 0.000419066000 total durat. 1.439677813000 **************************************************