/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 5 rules on 3 letters DP SRS with 11 strict rules and 5 weak rules on 6 letters weights SRS with 10 strict rules and 5 weak rules on 6 letters EDG SRS with 10 strict rules and 5 weak rules on 6 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 4, encoding = Ersatz_Binary, dim = 2, solver = Minisatapi, verbose = True, tracing = False} SRS with 3 strict rules and 5 weak rules on 6 letters weights SRS with 2 strict rules and 5 weak rules on 5 letters EDG SRS with 2 strict rules and 5 weak rules on 5 letters Matrix { monotone = Weak, domain = Natural, shape = Full, bits = 4, encoding = Ersatz_Binary, dim = 2, solver = Minisatapi, verbose = True, tracing = False} SRS with 0 strict rules and 5 weak rules on 3 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, a] -> [b] {- Input 0 -} [b, a] -> [a, b] {- Input 1 -} [b, b, c] -> [c, a] {- Input 2 -} [b, b] -> [a, a, a] {- Input 3 -} [c, a] -> [b, a, c] {- Input 4 -} reason DP property Termination has value Just True for SRS [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} [a#, a] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, a] |-> [a#, b] {- DP (Top 0) (Input 1) -} [b#, a] |-> [b#] {- DP (Top 1) (Input 1) -} [b#, b] |-> [a#] {- DP (Top 2) (Input 3) -} [b#, b] |-> [a#, a] {- DP (Top 1) (Input 3) -} [b#, b] |-> [a#, a, a] {- DP (Top 0) (Input 3) -} [b#, b, c] |-> [a#] {- DP (Top 1) (Input 2) -} [b#, b, c] |-> [c#, a] {- DP (Top 0) (Input 2) -} [c#, a] |-> [a#, c] {- DP (Top 1) (Input 4) -} [c#, a] |-> [b#, a, c] {- DP (Top 0) (Input 4) -} [c#, a] |-> [c#] {- DP (Top 2) (Input 4) -} reason (c, 1/2) (c#, 1/2) property Termination has value Just True for SRS [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} [a#, a] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, a] |-> [a#, b] {- DP (Top 0) (Input 1) -} [b#, a] |-> [b#] {- DP (Top 1) (Input 1) -} [b#, b] |-> [a#] {- DP (Top 2) (Input 3) -} [b#, b] |-> [a#, a] {- DP (Top 1) (Input 3) -} [b#, b] |-> [a#, a, a] {- DP (Top 0) (Input 3) -} [b#, b, c] |-> [c#, a] {- DP (Top 0) (Input 2) -} [c#, a] |-> [a#, c] {- DP (Top 1) (Input 4) -} [c#, a] |-> [b#, a, c] {- DP (Top 0) (Input 4) -} [c#, a] |-> [c#] {- DP (Top 2) (Input 4) -} reason EDG property Termination has value Just True for SRS [a#, a] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, b, c] |-> [c#, a] {- DP (Top 0) (Input 2) -} [c#, a] |-> [c#] {- DP (Top 2) (Input 4) -} [c#, a] |-> [b#, a, c] {- DP (Top 0) (Input 4) -} [b#, b] |-> [a#, a, a] {- DP (Top 0) (Input 3) -} [b#, b] |-> [a#, a] {- DP (Top 1) (Input 3) -} [b#, b] |-> [a#] {- DP (Top 2) (Input 3) -} [b#, a] |-> [b#] {- DP (Top 1) (Input 1) -} [b#, a] |-> [a#, b] {- DP (Top 0) (Input 1) -} [c#, a] |-> [a#, c] {- DP (Top 1) (Input 4) -} [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} reason ( a , Wk / 1 1 \ \ 0 1 / ) ( b , Wk / 1 2 \ \ 0 1 / ) ( c , Wk / 3 3 \ \ 0 1 / ) ( a# , Wk / 2 2 \ \ 0 1 / ) ( b# , Wk / 2 4 \ \ 0 1 / ) ( c# , Wk / 6 6 \ \ 0 1 / ) property Termination has value Just True for SRS [a#, a] |-> [b#] {- DP (Top 0) (Input 0) -} [c#, a] |-> [b#, a, c] {- DP (Top 0) (Input 4) -} [b#, a] |-> [a#, b] {- DP (Top 0) (Input 1) -} [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} reason (c#, 1/1) property Termination has value Just True for SRS [a#, a] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, a] |-> [a#, b] {- DP (Top 0) (Input 1) -} [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} reason EDG property Termination has value Just True for SRS [a#, a] |-> [b#] {- DP (Top 0) (Input 0) -} [b#, a] |-> [a#, b] {- DP (Top 0) (Input 1) -} [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} reason ( a , Wk / 1 4 \ \ 0 1 / ) ( b , Wk / 1 6 \ \ 0 1 / ) ( c , Wk / 3 0 \ \ 0 1 / ) ( a# , Wk / 2 1 \ \ 0 1 / ) ( b# , Wk / 2 6 \ \ 0 1 / ) property Termination has value Just True for SRS [a, a] ->= [b] {- DP Nontop (Input 0) -} [b, a] ->= [a, b] {- DP Nontop (Input 1) -} [b, b, c] ->= [c, a] {- DP Nontop (Input 2) -} [b, b] ->= [a, a, a] {- DP Nontop (Input 3) -} [c, a] ->= [b, a, c] {- DP Nontop (Input 4) -} reason EDG ************************************************** skeleton: (5,3)\Deepee(11/5,6)\Weight\EDG(10/5,6)\Matrix{\Natural}{2}(3/5,6)\Weight\EDG(2/5,5)\Matrix{\Natural}{2}(0/5,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' ] : 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.583784492000 min duration 1.105617345000 total durat. 2.689401837000 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 = 15 , num_strict_rules = 10 , num_top_rules = 10 , num_weak_rules = 5 , alphabet_size = 6 , total_length = 61} , self = 48 , parent = Just 19 , duration = 1.105617345000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 12:14:09.395587302 UTC , finish = 2021-07-13 12:14:10.501204647 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '5' ] , 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 = 14 , num_strict_rules = 9 , num_top_rules = 9 , num_weak_rules = 5 , alphabet_size = 6 , total_length = 58} , self = 62 , parent = Just 15 , duration = 1.583784492000 , status = Except [ 'A' , 's' , 'y' , 'n' , 'c' , 'C' , 'a' , 'n' , 'c' , 'e' , 'l' , 'l' , 'e' , 'd' ] , start = 2021-07-13 12:14:09.3897631 UTC , finish = 2021-07-13 12:14:10.973547592 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '0' , '6' ] , 0 , True )} Success : 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.100169331000 min duration 0.463751658000 total durat. 1.563920989000 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 = 10 , num_top_rules = 10 , num_weak_rules = 5 , alphabet_size = 6 , total_length = 61} , self = 44 , parent = Just 19 , duration = 1.100169331000 , status = Success , start = 2021-07-13 12:14:09.395530963 UTC , finish = 2021-07-13 12:14:10.495700294 UTC , thread_cap_info = ( [ 'T' , 'h' , 'r' , 'e' , 'a' , 'd' , 'I' , 'd' , ' ' , '1' , '3' , '1' ] , 0 , True )} Fail : QPI { dim = 2, bits = 3, solver = Minisatapi, tracing = False, verbose = False} total number 3 max duration 0.967334445000 min duration 0.458701997000 total durat. 2.338404643000 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 3 max duration 0.395353122000 min duration 0.385499344000 total durat. 1.169525692000 Fail : Weight { modus = Pre (Or_Else Count (IfSizeLeq 100000 (Simplex Sparse) Fail)) , verbose = False , tracing = False} total number 7 max duration 0.548326481000 min duration 0.000196578000 total durat. 1.101039577000 **************************************************