/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 3 rules on 3 letters DP SRS with 5 strict rules and 3 weak rules on 6 letters weights SRS with 4 strict rules and 3 weak rules on 5 letters EDG SRS with 4 strict rules and 3 weak rules on 5 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 8, encoding = Ersatz_Binary, dim = 4, solver = Minisatapi, verbose = True, tracing = False} SRS with 2 strict rules and 3 weak rules on 5 letters weights SRS with 1 strict rules and 3 weak rules on 4 letters EDG SRS with 1 rules on 3 letters Usable SRS with 1 rules on 3 letters weights SRS with 0 rules on 0 letters no strict rules ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [b, c] {- Input 0 -} [b, b] -> [] {- Input 1 -} [c, c, b] -> [a, a, c] {- Input 2 -} reason DP property Termination has value Just True for SRS [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, b] ->= [] {- DP Nontop (Input 1) -} [c, c, b] ->= [a, a, c] {- DP Nontop (Input 2) -} [a#] |-> [b#, c] {- DP (Top 0) (Input 0) -} [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [c#, c, b] |-> [a#, a, c] {- DP (Top 0) (Input 2) -} [c#, c, b] |-> [a#, c] {- DP (Top 1) (Input 2) -} [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} reason (a#, 1/2) (c#, 1/2) property Termination has value Just True for SRS [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, b] ->= [] {- DP Nontop (Input 1) -} [c, c, b] ->= [a, a, c] {- DP Nontop (Input 2) -} [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [c#, c, b] |-> [a#, a, c] {- DP (Top 0) (Input 2) -} [c#, c, b] |-> [a#, c] {- DP (Top 1) (Input 2) -} [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} [c#, c, b] |-> [a#, c] {- DP (Top 1) (Input 2) -} [c#, c, b] |-> [a#, a, c] {- DP (Top 0) (Input 2) -} [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, b] ->= [] {- DP Nontop (Input 1) -} [c, c, b] ->= [a, a, c] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A - 2A 4A \ | 0A 0A 4A 5A | | - - 0A 2A | \ - - - 0A / ) ( b , Wk / 2A - 0A 4A \ | 2A 0A - - | | 0A - - - | \ - - - 0A / ) ( c , Wk / - - 0A 2A \ | 0A - 2A - | | 0A - - 0A | \ - - - 0A / ) ( a# , Wk / 0A 2A 5A 7A \ | - - - - | | - - - - | \ - - - 0A / ) ( c# , Wk / 0A - 5A 7A \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [a#] |-> [c#] {- DP (Top 1) (Input 0) -} [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, b] ->= [] {- DP Nontop (Input 1) -} [c, c, b] ->= [a, a, c] {- DP Nontop (Input 2) -} reason (a#, 1/1) property Termination has value Just True for SRS [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} [a] ->= [b, c] {- DP Nontop (Input 0) -} [b, b] ->= [] {- DP Nontop (Input 1) -} [c, c, b] ->= [a, a, c] {- DP Nontop (Input 2) -} reason EDG property Termination has value Just True for SRS [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} reason Usable property Termination has value Just True for SRS [c#, c, b] |-> [c#] {- DP (Top 2) (Input 2) -} reason (b, 1/1) (c, 1/1) property Termination has value Just True for SRS reason no strict rules ************************************************** skeleton: (3,3)\Deepee(5/3,6)\Weight\EDG(4/3,5)\Matrix{\Arctic}{4}(2/3,5)\Weight(1/3,4)\EDG\Usable(1,3)\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 1.284123528000 min duration 0.976337464000 total durat. 2.260460992000 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 28} , self = 54 , parent = Just 19 , duration = 1.284123528000 , status = Fail , start = 2021-07-13 22:04:39.690451525 UTC , finish = 2021-07-13 22:04:40.974575053 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '5' , '2' ] , 0 , True )} Success : 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 7.101532072000 min duration 7.101532072000 total durat. 7.101532072000 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 = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 28} , self = 68 , parent = Just 19 , duration = 7.101532072000 , status = Success , start = 2021-07-13 22:04:40.974846352 UTC , finish = 2021-07-13 22:04:48.076378424 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '3' ] , 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 7.462066600000 min duration 7.462066600000 total durat. 7.462066600000 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 = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 76 , parent = Just 12 , duration = 7.462066600000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 22:04:40.656766938 UTC , finish = 2021-07-13 22:04:48.118833538 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '4' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.699785403000 min duration 1.498527043000 total durat. 3.198312446000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 55 , parent = Just 12 , duration = 1.498527043000 , status = Fail , start = 2021-07-13 22:04:39.957803096 UTC , finish = 2021-07-13 22:04:41.456330139 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '7' ] , 0 , True )} Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 28} , self = 58 , parent = Just 19 , duration = 1.699785403000 , status = Fail , start = 2021-07-13 22:04:40.060175964 UTC , finish = 2021-07-13 22:04:41.759961367 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '3' ] , 0 , True )} Fail : QPI { dim = 6, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 6.356642015000 min duration 5.699318678000 total durat. 12.055960693000 Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 65 , parent = Just 12 , duration = 5.699318678000 , status = Fail , start = 2021-07-13 22:04:41.456499116 UTC , finish = 2021-07-13 22:04:47.155817794 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '8' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 28} , self = 75 , parent = Just 19 , duration = 6.356642015000 , status = Fail , start = 2021-07-13 22:04:41.760237248 UTC , finish = 2021-07-13 22:04:48.116879263 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '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 1.699398150000 min duration 0.062214853000 total durat. 1.761613003000 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 = 12 , total_length = 204} , self = 56 , parent = Just 28 , duration = 1.699398150000 , status = Success , start = 2021-07-13 22:04:39.885585015 UTC , finish = 2021-07-13 22:04:41.584983165 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '1' ] , 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.912096362000 min duration 0.065334466000 total durat. 1.977430828000 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 = 12 , total_length = 204} , self = 59 , parent = Just 28 , duration = 1.912096362000 , status = Success , start = 2021-07-13 22:04:39.885784864 UTC , finish = 2021-07-13 22:04:41.797881226 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '7' ] , 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 4 max duration 6.628178706000 min duration 0.140911107000 total durat. 10.850101618000 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 = 68 , num_strict_rules = 10 , num_top_rules = 10 , num_weak_rules = 58 , alphabet_size = 20 , total_length = 390} , self = 63 , parent = Just 45 , duration = 3.891697754000 , status = Success , start = 2021-07-13 22:04:40.496569191 UTC , finish = 2021-07-13 22:04:44.388266945 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '0' ] , 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 = 66 , num_strict_rules = 12 , num_top_rules = 12 , num_weak_rules = 54 , alphabet_size = 20 , total_length = 381} , self = 66 , parent = Just 38 , duration = 6.628178706000 , status = Success , start = 2021-07-13 22:04:40.711429479 UTC , finish = 2021-07-13 22:04:47.339608185 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '8' ] , 3 , True )} 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 4.676459507000 min duration 3.956818928000 total durat. 8.633278435000 Info { what = 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} , input_size = Size { num_rules = 6 , num_strict_rules = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 22} , self = 61 , parent = Just 12 , duration = 3.956818928000 , status = Fail , start = 2021-07-13 22:04:39.686203406 UTC , finish = 2021-07-13 22:04:43.643022334 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '6' ] , 3 , True )} Info { what = 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} , input_size = Size { num_rules = 7 , num_strict_rules = 4 , num_top_rules = 4 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 28} , self = 62 , parent = Just 19 , duration = 4.676459507000 , status = Fail , start = 2021-07-13 22:04:39.696558572 UTC , finish = 2021-07-13 22:04:44.373018079 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '7' , '0' ] , 3 , True )} **************************************************