/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 6 rules on 3 letters Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 5266 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 -} reason Matchbound Matchbound { method = RFC, max_size = Just 100000, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 5266 states ************************************************** skeleton: (6,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 1.982106158000 min duration 1.982106158000 total durat. 1.982106158000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 6 , num_strict_rules = 6 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 129} , self = 65 , parent = Just 0 , duration = 1.982106158000 , status = Success , start = 2021-07-13 22:33:34.879567785 UTC , finish = 2021-07-13 22:33:36.861673943 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 1.984916256000 min duration 1.984916256000 total durat. 1.984916256000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 6 , num_strict_rules = 6 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 129} , self = 67 , parent = Just 6 , duration = 1.984916256000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:33:34.879605771 UTC , finish = 2021-07-13 22:33:36.864522027 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '6' ] , 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.583229103000 min duration 1.108904994000 total durat. 2.692134097000 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 = 9 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 6 , alphabet_size = 4 , total_length = 149} , self = 55 , parent = Just 16 , duration = 1.108904994000 , status = Fail , start = 2021-07-13 22:33:34.881656009 UTC , finish = 2021-07-13 22:33:35.990561003 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '9' , '4' ] , 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 = 13 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 6 , alphabet_size = 4 , total_length = 241} , self = 58 , parent = Just 12 , duration = 1.583229103000 , status = Fail , start = 2021-07-13 22:33:34.883798543 UTC , finish = 2021-07-13 22:33:36.467027646 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.032827805000 min duration 0.704516551000 total durat. 1.737344356000 Info { what = QPI { dim = 2 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 13 , num_strict_rules = 7 , num_top_rules = 7 , num_weak_rules = 6 , alphabet_size = 4 , total_length = 241} , self = 50 , parent = Just 12 , duration = 1.032827805000 , status = Fail , start = 2021-07-13 22:33:34.881363167 UTC , finish = 2021-07-13 22:33:35.914190972 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '6' ] , 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.214802801000 min duration 0.175862667000 total durat. 1.390665468000 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 = 36 , num_strict_rules = 36 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 7 , total_length = 846} , self = 56 , parent = Just 28 , duration = 1.214802801000 , status = Success , start = 2021-07-13 22:33:35.215049439 UTC , finish = 2021-07-13 22:33:36.42985224 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '6' ] , 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.094423401000 min duration 1.094423401000 total durat. 1.094423401000 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 = 6 , num_strict_rules = 6 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 129} , self = 53 , parent = Just 0 , duration = 1.094423401000 , status = Success , start = 2021-07-13 22:33:34.888547517 UTC , finish = 2021-07-13 22:33:35.982970918 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '4' ] , 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.473247673000 min duration 0.171521692000 total durat. 1.644769365000 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 = 36 , num_strict_rules = 36 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 7 , total_length = 846} , self = 61 , parent = Just 28 , duration = 1.473247673000 , status = Success , start = 2021-07-13 22:33:35.214979524 UTC , finish = 2021-07-13 22:33:36.688227197 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '4' ] , 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.050688672000 min duration 1.050688672000 total durat. 1.050688672000 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 = 6 , num_strict_rules = 6 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 129} , self = 51 , parent = Just 0 , duration = 1.050688672000 , status = Success , start = 2021-07-13 22:33:34.888443636 UTC , finish = 2021-07-13 22:33:35.939132308 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 11 max duration 0.719765167000 min duration 0.000094032000 total durat. 1.851394747000 **************************************************