/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 30 rules on 4 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 1684 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [0, 0, 0, 1, 0, 2, 2, 3, 3, 2, 3, 3, 0] -> [ 3 , 3 , 1 , 1 , 3 , 3 , 3 , 1 , 3 , 1 , 3 , 2 , 1 , 0 , 3 , 3 , 1 ] {- Input 0 -} [0, 0, 2, 2, 1, 0, 2, 3, 1, 3, 1, 1, 0] -> [ 1 , 0 , 1 , 0 , 2 , 1 , 3 , 3 , 3 , 3 , 2 , 3 , 2 , 3 , 1 , 1 , 0 ] {- Input 1 -} [0, 1, 1, 0, 2, 1, 0, 1, 3, 0, 1, 3, 3] -> [ 0 , 3 , 3 , 3 , 0 , 2 , 3 , 3 , 0 , 3 , 3 , 2 , 1 , 3 , 3 , 1 , 3 ] {- Input 2 -} [0, 1, 1, 1, 3, 3, 0, 3, 2, 3, 3, 1, 2] -> [ 3 , 3 , 1 , 1 , 0 , 2 , 1 , 2 , 3 , 0 , 3 , 3 , 3 , 2 , 3 , 0 , 2 ] {- Input 3 -} [0, 1, 1, 3, 0, 1, 1, 1, 1, 3, 1, 3, 1] -> [ 2 , 3 , 1 , 1 , 0 , 3 , 3 , 1 , 3 , 2 , 1 , 3 , 3 , 1 , 2 , 1 , 3 ] {- Input 4 -} [0, 1, 2, 3, 2, 2, 2, 1, 2, 3, 0, 0, 0] -> [ 1 , 1 , 3 , 3 , 0 , 3 , 3 , 1 , 2 , 3 , 1 , 3 , 3 , 0 , 0 , 1 , 1 ] {- Input 5 -} [0, 2, 3, 0, 0, 0, 0, 2, 3, 1, 0, 3, 1] -> [ 1 , 1 , 2 , 2 , 1 , 2 , 3 , 0 , 2 , 1 , 3 , 1 , 2 , 3 , 3 , 2 , 1 ] {- Input 6 -} [0, 2, 3, 3, 0, 0, 2, 2, 3, 0, 3, 1, 3] -> [ 3 , 1 , 3 , 3 , 2 , 1 , 0 , 0 , 1 , 0 , 3 , 3 , 3 , 1 , 3 , 2 , 1 ] {- Input 7 -} [0, 3, 3, 0, 3, 0, 3, 0, 3, 3, 3, 0, 0] -> [ 1 , 1 , 0 , 3 , 3 , 1 , 1 , 2 , 3 , 2 , 3 , 3 , 3 , 0 , 2 , 1 , 1 ] {- Input 8 -} [1, 0, 1, 3, 2, 2, 2, 1, 2, 1, 3, 3, 2] -> [ 3 , 3 , 1 , 0 , 0 , 2 , 3 , 3 , 3 , 2 , 3 , 1 , 3 , 1 , 3 , 1 , 1 ] {- Input 9 -} [1, 1, 0, 3, 2, 0, 1, 0, 3, 3, 2, 0, 2] -> [ 1 , 3 , 0 , 0 , 3 , 2 , 1 , 1 , 2 , 3 , 3 , 2 , 1 , 1 , 1 , 1 , 2 ] {- Input 10 -} [1, 2, 0, 1, 0, 3, 1, 3, 0, 2, 1, 2, 3] -> [ 1 , 3 , 1 , 3 , 1 , 0 , 1 , 0 , 0 , 3 , 3 , 3 , 1 , 3 , 2 , 3 , 3 ] {- Input 11 -} [1, 2, 1, 0, 1, 1, 2, 3, 2, 1, 1, 0, 0] -> [ 3 , 1 , 3 , 3 , 3 , 3 , 3 , 1 , 1 , 2 , 3 , 2 , 1 , 0 , 1 , 0 , 1 ] {- Input 12 -} [1, 2, 2, 1, 1, 2, 0, 3, 3, 3, 0, 3, 2] -> [ 1 , 3 , 1 , 3 , 3 , 3 , 3 , 1 , 3 , 2 , 1 , 3 , 3 , 2 , 2 , 3 , 2 ] {- Input 13 -} [1, 2, 2, 3, 3, 3, 3, 3, 0, 0, 3, 2, 2] -> [ 1 , 3 , 3 , 3 , 3 , 1 , 1 , 2 , 3 , 1 , 1 , 3 , 1 , 0 , 0 , 1 , 0 ] {- Input 14 -} [2, 0, 1, 1, 2, 1, 0, 3, 2, 1, 3, 1, 3] -> [ 0 , 3 , 3 , 0 , 2 , 2 , 1 , 3 , 1 , 2 , 3 , 1 , 3 , 1 , 3 , 3 , 3 ] {- Input 15 -} [2, 0, 2, 0, 2, 1, 3, 0, 0, 0, 2, 3, 0] -> [ 2 , 3 , 1 , 2 , 3 , 3 , 2 , 2 , 0 , 3 , 1 , 1 , 3 , 3 , 3 , 2 , 0 ] {- Input 16 -} [2, 0, 2, 2, 1, 3, 1, 3, 0, 1, 3, 2, 1] -> [ 2 , 0 , 1 , 3 , 3 , 1 , 3 , 3 , 2 , 3 , 0 , 2 , 1 , 1 , 0 , 2 , 1 ] {- Input 17 -} [2, 1, 3, 0, 2, 3, 2, 2, 1, 2, 3, 2, 3] -> [ 2 , 1 , 1 , 1 , 2 , 1 , 2 , 1 , 3 , 1 , 3 , 1 , 1 , 0 , 3 , 3 , 3 ] {- Input 18 -} [2, 3, 1, 0, 3, 3, 3, 0, 0, 3, 0, 0, 3] -> [ 1 , 1 , 2 , 2 , 3 , 3 , 3 , 3 , 1 , 3 , 3 , 1 , 2 , 3 , 3 , 3 , 1 ] {- Input 19 -} [3, 0, 1, 2, 2, 0, 3, 1, 0, 1, 2, 0, 1] -> [ 3 , 3 , 2 , 2 , 3 , 1 , 0 , 2 , 3 , 3 , 1 , 2 , 1 , 0 , 1 , 1 , 1 ] {- Input 20 -} [3, 0, 2, 2, 1, 0, 0, 3, 1, 2, 1, 1, 1] -> [ 3 , 2 , 3 , 1 , 3 , 1 , 2 , 3 , 1 , 0 , 0 , 2 , 3 , 1 , 2 , 3 , 1 ] {- Input 21 -} [3, 0, 2, 2, 1, 3, 3, 1, 1, 0, 1, 0, 2] -> [ 3 , 2 , 1 , 1 , 1 , 3 , 3 , 1 , 3 , 1 , 3 , 1 , 1 , 2 , 1 , 3 , 3 ] {- Input 22 -} [3, 0, 3, 2, 1, 3, 2, 3, 2, 3, 2, 3, 2] -> [ 3 , 2 , 3 , 3 , 0 , 0 , 3 , 1 , 1 , 2 , 3 , 1 , 1 , 1 , 3 , 1 , 2 ] {- Input 23 -} [3, 0, 3, 3, 1, 2, 3, 0, 0, 2, 2, 0, 1] -> [ 3 , 3 , 1 , 2 , 0 , 1 , 1 , 0 , 3 , 3 , 3 , 0 , 2 , 3 , 3 , 1 , 0 ] {- Input 24 -} [3, 1, 1, 3, 3, 2, 0, 3, 3, 1, 1, 0, 1] -> [ 3 , 1 , 1 , 3 , 3 , 3 , 1 , 0 , 2 , 3 , 1 , 1 , 3 , 1 , 3 , 3 , 3 ] {- Input 25 -} [3, 2, 0, 3, 3, 1, 3, 2, 0, 2, 0, 0, 1] -> [ 3 , 3 , 3 , 3 , 1 , 0 , 2 , 3 , 2 , 1 , 3 , 1 , 3 , 3 , 2 , 1 , 3 ] {- Input 26 -} [3, 2, 1, 2, 0, 3, 2, 3, 2, 3, 0, 2, 3] -> [ 3 , 3 , 3 , 1 , 3 , 2 , 1 , 0 , 0 , 2 , 0 , 0 , 3 , 0 , 3 , 3 , 3 ] {- Input 27 -} [3, 2, 2, 2, 0, 0, 2, 3, 2, 3, 1, 1, 1] -> [ 3 , 2 , 3 , 3 , 3 , 1 , 1 , 3 , 2 , 1 , 2 , 2 , 3 , 2 , 2 , 3 , 1 ] {- Input 28 -} [3, 3, 2, 0, 0, 0, 0, 3, 1, 1, 0, 0, 2] -> [ 3 , 1 , 2 , 3 , 3 , 2 , 1 , 1 , 1 , 1 , 2 , 1 , 2 , 1 , 0 , 3 , 1 ] {- Input 29 -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 1 certified by automaton with 1684 states ************************************************** skeleton: (30,4)\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 : EDG { usable = True, tracing = False} total number 2 max duration 4.403229082000 min duration 0.301400918000 total durat. 4.704630000000 Info { what = EDG { usable = True, tracing = False} , input_size = Size { num_rules = 515 , num_strict_rules = 485 , num_top_rules = 485 , num_weak_rules = 30 , alphabet_size = 8 , total_length = 11757} , self = 29 , parent = Just 9 , duration = 4.403229082000 , status = Success , start = 2021-07-13 21:36:19.774583903 UTC , finish = 2021-07-13 21:36:24.177812985 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '3' ] , 3 , False )} Success : Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} total number 1 max duration 9.375439854000 min duration 9.375439854000 total durat. 9.375439854000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 30 , num_strict_rules = 30 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 900} , self = 38 , parent = Just 0 , duration = 9.375439854000 , status = Success , start = 2021-07-13 21:36:19.676822145 UTC , finish = 2021-07-13 21:36:29.052261999 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '1' ] , 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 9.377745388000 min duration 9.377745388000 total durat. 9.377745388000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 30 , num_strict_rules = 30 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 900} , self = 40 , parent = Just 4 , duration = 9.377745388000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:36:19.67685814 UTC , finish = 2021-07-13 21:36:29.054603528 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '5' ] , 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 1 max duration 8.978596471000 min duration 8.978596471000 total durat. 8.978596471000 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 = 519 , num_strict_rules = 489 , num_top_rules = 489 , num_weak_rules = 30 , alphabet_size = 8 , total_length = 11818} , self = 42 , parent = Just 15 , duration = 8.978596471000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:36:20.076703264 UTC , finish = 2021-07-13 21:36:29.055299735 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '1' , '1' ] , 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 1 max duration 8.979520117000 min duration 8.979520117000 total durat. 8.979520117000 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 = 519 , num_strict_rules = 489 , num_top_rules = 489 , num_weak_rules = 30 , alphabet_size = 8 , total_length = 11818} , self = 43 , parent = Just 15 , duration = 8.979520117000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 21:36:20.075874431 UTC , finish = 2021-07-13 21:36:29.055394548 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '7' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 1 max duration 8.979329662000 min duration 8.979329662000 total durat. 8.979329662000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 519 , num_strict_rules = 489 , num_top_rules = 489 , num_weak_rules = 30 , alphabet_size = 8 , total_length = 11818} , self = 41 , parent = Just 15 , duration = 8.979329662000 , status = Fail , start = 2021-07-13 21:36:20.075773534 UTC , finish = 2021-07-13 21:36:29.055103196 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '4' ] , 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 2.126512730000 min duration 2.126512730000 total durat. 2.126512730000 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 = 30 , num_strict_rules = 30 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 900} , self = 25 , parent = Just 0 , duration = 2.126512730000 , status = Success , start = 2021-07-13 21:36:19.697760113 UTC , finish = 2021-07-13 21:36:21.824272843 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '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 6.215927843000 min duration 6.215927843000 total durat. 6.215927843000 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 = 30 , num_strict_rules = 30 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 900} , self = 35 , parent = Just 0 , duration = 6.215927843000 , status = Fail , start = 2021-07-13 21:36:19.697877703 UTC , finish = 2021-07-13 21:36:25.913805546 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '8' ] , 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.543373773000 min duration 3.543373773000 total durat. 3.543373773000 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 = 30 , num_strict_rules = 30 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 900} , self = 27 , parent = Just 0 , duration = 3.543373773000 , status = Success , start = 2021-07-13 21:36:19.697794253 UTC , finish = 2021-07-13 21:36:23.241168026 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '8' , '0' ] , 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 1 max duration 1.414748275000 min duration 1.414748275000 total durat. 1.414748275000 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 = 30 , num_strict_rules = 30 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 4 , total_length = 900} , self = 23 , parent = Just 0 , duration = 1.414748275000 , status = Fail , start = 2021-07-13 21:36:19.697711251 UTC , finish = 2021-07-13 21:36:21.112459526 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '0' ] , 3 , True )} Fail : Tiling { method = Overlap , 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 0.859431986000 min duration 0.606968381000 total durat. 1.466400367000 Fail : Tiling { method = Overlap , 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 0.808511044000 min duration 0.573596613000 total durat. 1.382107657000 **************************************************