/export/starexec/sandbox/solver/bin/starexec_run_tc21-9.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 3 rules on 3 letters DP SRS with 4 strict rules and 3 weak rules on 5 letters EDG SRS with 3 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 1 strict rules and 3 weak rules on 5 letters weights SRS with 0 strict rules and 3 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a] -> [] {- Input 0 -} [a, a, b] -> [b, a, b, c, a] {- Input 1 -} [c, b] -> [a] {- Input 2 -} reason DP property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, c, a] {- DP Nontop (Input 1) -} [c, b] ->= [a] {- DP Nontop (Input 2) -} [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, a, b] |-> [a#, b, c, a] {- DP (Top 1) (Input 1) -} [a#, a, b] |-> [c#, a] {- DP (Top 3) (Input 1) -} [c#, b] |-> [a#] {- DP (Top 0) (Input 2) -} reason EDG property Termination has value Just True for SRS [a#, a, b] |-> [a#] {- DP (Top 4) (Input 1) -} [a#, a, b] |-> [c#, a] {- DP (Top 3) (Input 1) -} [c#, b] |-> [a#] {- DP (Top 0) (Input 2) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, c, a] {- DP Nontop (Input 1) -} [c, b] ->= [a] {- DP Nontop (Input 2) -} reason ( a , Wk / 0A 0A 0A 0A \ | 0A 0A 6A - | | - 0A 0A - | \ - - - 0A / ) ( b , Wk / 0A 0A 6A - \ | 0A 0A 0A 0A | | 0A 0A - 0A | \ - - - 0A / ) ( c , Wk / 0A - - 0A \ | 0A - - - | | 0A - - - | \ - - - 0A / ) ( a# , Wk / 1A 0A 3A - \ | - - - - | | - - - - | \ - - - 0A / ) ( c# , Wk / 1A - - - \ | - - - - | | - - - - | \ - - - 0A / ) property Termination has value Just True for SRS [c#, b] |-> [a#] {- DP (Top 0) (Input 2) -} [a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, c, a] {- DP Nontop (Input 1) -} [c, b] ->= [a] {- DP Nontop (Input 2) -} reason (c#, 1/1) property Termination has value Just True for SRS [a] ->= [] {- DP Nontop (Input 0) -} [a, a, b] ->= [b, a, b, c, a] {- DP Nontop (Input 1) -} [c, b] ->= [a] {- DP Nontop (Input 2) -} reason EDG ************************************************** skeleton: (3,3)\Deepee(4/3,5)\EDG(3/3,5)\Matrix{\Arctic}{4}(1/3,5)\Weight(0/3,3)\EDG[] ************************************************** 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) ************************************************** 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 10.460613846000 min duration 10.460613846000 total durat. 10.460613846000 Info { what = Matchbound { method = RFC , max_size = Just 100000 , max_bound = Nothing , verbose = False , tracing = False} , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 71 , parent = Just 0 , duration = 10.460613846000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:29:20.585023978 UTC , finish = 2021-07-13 23:29:31.045637824 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '6' ] , 2 , True )} 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.535022025000 min duration 1.468009517000 total durat. 3.003031542000 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 = 3 , num_top_rules = 3 , num_weak_rules = 3 , alphabet_size = 5 , total_length = 24} , self = 53 , parent = Just 11 , duration = 1.468009517000 , status = Fail , start = 2021-07-13 23:29:20.585999642 UTC , finish = 2021-07-13 23:29:22.054009159 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '7' , '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 = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 22} , self = 54 , parent = Just 17 , duration = 1.535022025000 , status = Fail , start = 2021-07-13 23:29:20.589587476 UTC , finish = 2021-07-13 23:29:22.124609501 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '2' , '6' ] , 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 8.941974883000 min duration 8.941974883000 total durat. 8.941974883000 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 = 24} , self = 66 , parent = Just 11 , duration = 8.941974883000 , status = Success , start = 2021-07-13 23:29:22.054580372 UTC , finish = 2021-07-13 23:29:30.996555255 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '1' ] , 0 , True )} Fail : QPI { dim = 4, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 2 max duration 1.933332989000 min duration 1.489933196000 total durat. 3.423266185000 Info { what = QPI { dim = 4 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 22} , self = 57 , parent = Just 17 , duration = 1.489933196000 , status = Fail , start = 2021-07-13 23:29:20.935893005 UTC , finish = 2021-07-13 23:29:22.425826201 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '9' , '4' ] , 0 , True )} 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 = 24} , self = 60 , parent = Just 11 , duration = 1.933332989000 , status = Fail , start = 2021-07-13 23:29:20.991179416 UTC , finish = 2021-07-13 23:29:22.924512405 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 8.411475682000 min duration 8.119954369000 total durat. 16.531430051000 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 = 24} , self = 70 , parent = Just 11 , duration = 8.119954369000 , status = Fail , start = 2021-07-13 23:29:22.924816209 UTC , finish = 2021-07-13 23:29:31.044770578 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '3' , '3' ] , 0 , True )} Info { what = QPI { dim = 6 , bits = 3 , solver = Minisatapi , tracing = False , verbose = False} , input_size = Size { num_rules = 5 , num_strict_rules = 2 , num_top_rules = 2 , num_weak_rules = 3 , alphabet_size = 4 , total_length = 22} , self = 65 , parent = Just 17 , duration = 8.411475682000 , status = Fail , start = 2021-07-13 23:29:22.426143812 UTC , finish = 2021-07-13 23:29:30.837619494 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '2' , '9' ] , 0 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 10.467943856000 min duration 10.467943856000 total durat. 10.467943856000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Backward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 73 , parent = Just 0 , duration = 10.467943856000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:29:20.585033736 UTC , finish = 2021-07-13 23:29:31.052977592 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '2' ] , 1 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) total number 1 max duration 10.467912046000 min duration 10.467912046000 total durat. 10.467912046000 Info { what = Simple (Config { tracing = False , verbose = False , closure = Forward , max_closure_length = Nothing , max_closure_width = Nothing , intermediates = All , priority = (Linear [ (1, Log2 Steps) , (-1, Width_lhs) , (-2, Log2 Width_rhs) ])}) , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 72 , parent = Just 0 , duration = 10.467912046000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:29:20.585002709 UTC , finish = 2021-07-13 23:29:31.052914755 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '0' ] , 1 , 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.426114025000 min duration 0.068222701000 total durat. 1.494336726000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 13 , total_length = 239} , self = 55 , parent = Just 31 , duration = 1.426114025000 , status = Success , start = 2021-07-13 23:29:20.817700577 UTC , finish = 2021-07-13 23:29:22.243814602 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '7' ] , 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.798946029000 min duration 0.068125663000 total durat. 1.867071692000 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 = 41 , num_strict_rules = 41 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 13 , total_length = 239} , self = 58 , parent = Just 31 , duration = 1.798946029000 , status = Success , start = 2021-07-13 23:29:20.817571986 UTC , finish = 2021-07-13 23:29:22.616518015 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '8' , '3' ] , 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 4.349412702000 min duration 0.191161028000 total durat. 9.072209307000 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 = 55 , num_strict_rules = 5 , num_top_rules = 5 , num_weak_rules = 50 , alphabet_size = 16 , total_length = 331} , self = 61 , parent = Just 44 , duration = 4.303790311000 , status = Success , start = 2021-07-13 23:29:21.080015512 UTC , finish = 2021-07-13 23:29:25.383805823 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '0' , '7' ] , 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 = 8 , num_top_rules = 8 , num_weak_rules = 58 , alphabet_size = 20 , total_length = 384} , self = 63 , parent = Just 49 , duration = 4.349412702000 , status = Success , start = 2021-07-13 23:29:21.266009928 UTC , finish = 2021-07-13 23:29:25.61542263 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '2' , '1' , '2' ] , 3 , True )} Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] : Transport { mode = Standard, max_derivation_length = Nothing} total number 1 max duration 10.467955395000 min duration 10.467955395000 total durat. 10.467955395000 Info { what = Transport { mode = Standard, max_derivation_length = Nothing} , input_size = Size { num_rules = 3 , num_strict_rules = 3 , num_top_rules = 0 , num_weak_rules = 0 , alphabet_size = 3 , total_length = 12} , self = 74 , parent = Just 0 , duration = 10.467955395000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 23:29:20.585051208 UTC , finish = 2021-07-13 23:29:31.053006603 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '4' , '5' ] , 1 , True )} **************************************************