/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 7 rules on 3 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 8672 states ************************************************** proof ************************************************** property Termination has value Just True for SRS [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2] {- Input 0 -} [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2] {- Input 1 -} [0, 1, 2, 1] -> [1, 2, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2] {- Input 2 -} [0, 1, 2, 1] -> [ 1 , 2 , 1 , 1 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 ] {- Input 3 -} [0, 1, 2, 1] -> [ 1 , 2 , 1 , 1 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 ] {- Input 4 -} [0, 1, 2, 1] -> [ 1 , 2 , 1 , 1 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 ] {- Input 5 -} [0, 1, 2, 1] -> [ 1 , 2 , 1 , 1 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 , 0 , 1 , 2 ] {- Input 6 -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 8672 states ************************************************** skeleton: (7,3)\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 3.782513529000 min duration 3.782513529000 total durat. 3.782513529000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 7 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 161} , self = 75 , parent = Just 0 , duration = 3.782513529000 , status = Success , start = 2021-07-13 19:54:10.704662328 UTC , finish = 2021-07-13 19:54:14.487175857 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '3' , '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 3.785219143000 min duration 3.785219143000 total durat. 3.785219143000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 7 , num_strict_rules = 7 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 161} , self = 77 , parent = Just 4 , duration = 3.785219143000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 19:54:10.704633184 UTC , finish = 2021-07-13 19:54:14.489852327 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '0' ] , 2 , 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 1.963783282000 min duration 1.342156064000 total durat. 3.305939346000 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 = 10 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 7 , alphabet_size = 4 , total_length = 181} , self = 51 , parent = Just 14 , duration = 1.342156064000 , status = Fail , start = 2021-07-13 19:54:10.712497669 UTC , finish = 2021-07-13 19:54:12.054653733 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '7' ] , 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 = 15 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 7 , alphabet_size = 4 , total_length = 301} , self = 56 , parent = Just 13 , duration = 1.963783282000 , status = Fail , start = 2021-07-13 19:54:10.709370255 UTC , finish = 2021-07-13 19:54:12.673153537 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '4' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.158452027000 min duration 0.783290088000 total durat. 1.941742115000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 15 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 7 , alphabet_size = 4 , total_length = 301} , self = 50 , parent = Just 13 , duration = 1.158452027000 , status = Fail , start = 2021-07-13 19:54:10.709415764 UTC , finish = 2021-07-13 19:54:11.867867791 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '1' ] , 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 1.633066221000 min duration 0.247785933000 total durat. 1.880852154000 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 = 42 , num_strict_rules = 42 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 7 , total_length = 1050} , self = 57 , parent = Just 28 , duration = 1.633066221000 , status = Success , start = 2021-07-13 19:54:11.145237277 UTC , finish = 2021-07-13 19:54:12.778303498 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '4' ] , 3 , 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 1.444845461000 min duration 1.444845461000 total durat. 1.444845461000 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 = 7 , num_strict_rules = 7 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 161} , self = 54 , parent = Just 0 , duration = 1.444845461000 , status = Success , start = 2021-07-13 19:54:10.717107691 UTC , finish = 2021-07-13 19:54:12.161953152 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '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 2 max duration 1.811815643000 min duration 0.211810160000 total durat. 2.023625803000 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 = 42 , num_strict_rules = 42 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 7 , total_length = 1050} , self = 63 , parent = Just 28 , duration = 1.811815643000 , status = Success , start = 2021-07-13 19:54:11.14510148 UTC , finish = 2021-07-13 19:54:12.956917123 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '0' ] , 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 1.405405369000 min duration 1.405405369000 total durat. 1.405405369000 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 = 7 , num_strict_rules = 7 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 161} , self = 52 , parent = Just 0 , duration = 1.405405369000 , status = Success , start = 2021-07-13 19:54:10.716082769 UTC , finish = 2021-07-13 19:54:12.121488138 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '0' ] , 3 , True )} Success : 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 3.075044641000 min duration 3.075044641000 total durat. 3.075044641000 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 = 7 , num_strict_rules = 7 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 161} , self = 71 , parent = Just 0 , duration = 3.075044641000 , status = Success , start = 2021-07-13 19:54:10.716150459 UTC , finish = 2021-07-13 19:54:13.7911951 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '4' ] , 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 0.653833615000 min duration 0.514866786000 total durat. 1.168700401000 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.670889921000 min duration 2.843905405000 total durat. 6.514795326000 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 = 15 , num_strict_rules = 8 , num_top_rules = 8 , num_weak_rules = 7 , alphabet_size = 4 , total_length = 301} , self = 67 , parent = Just 13 , duration = 2.843905405000 , status = Success , start = 2021-07-13 19:54:10.724787204 UTC , finish = 2021-07-13 19:54:13.568692609 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '6' , '0' ] , 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 = 10 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 7 , alphabet_size = 4 , total_length = 181} , self = 73 , parent = Just 14 , duration = 3.670889921000 , status = Success , start = 2021-07-13 19:54:10.71738452 UTC , finish = 2021-07-13 19:54:14.388274441 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '4' , '2' ] , 3 , True )} Fail : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 13 max duration 0.775899184000 min duration 0.000282529000 total durat. 3.256873037000 **************************************************