/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 24 rules on 6 letters weights SRS with 6 rules on 6 letters mirror SRS with 6 rules on 6 letters DP SRS with 15 strict rules and 6 weak rules on 9 letters weights SRS with 0 strict rules and 6 weak rules on 6 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [a, b] -> [C] {- Input 0 -} [b, c] -> [A] {- Input 1 -} [c, a] -> [B] {- Input 2 -} [A, C] -> [b] {- Input 3 -} [C, B] -> [a] {- Input 4 -} [B, A] -> [c] {- Input 5 -} [a, a, a, a, a] -> [A, A, A] {- Input 6 -} [A, A, A, A] -> [a, a, a, a] {- Input 7 -} [b, b, b, b, b] -> [B, B, B] {- Input 8 -} [B, B, B, B] -> [b, b, b, b] {- Input 9 -} [c, c, c, c, c] -> [C, C, C] {- Input 10 -} [C, C, C, C] -> [c, c, c, c] {- Input 11 -} [B, a, a, a, a] -> [c, A, A, A] {- Input 12 -} [A, A, A, b] -> [a, a, a, a, C] {- Input 13 -} [C, b, b, b, b] -> [a, B, B, B] {- Input 14 -} [B, B, B, c] -> [b, b, b, b, A] {- Input 15 -} [A, c, c, c, c] -> [b, C, C, C] {- Input 16 -} [C, C, C, a] -> [c, c, c, c, B] {- Input 17 -} [a, A] -> [] {- Input 18 -} [A, a] -> [] {- Input 19 -} [b, B] -> [] {- Input 20 -} [B, b] -> [] {- Input 21 -} [c, C] -> [] {- Input 22 -} [C, c] -> [] {- Input 23 -} reason (a, 2/15) (b, 2/15) (C, 1/5) (c, 2/15) (A, 1/5) (B, 1/5) property Termination has value Just True for SRS [B, a, a, a, a] -> [c, A, A, A] {- Input 12 -} [A, A, A, b] -> [a, a, a, a, C] {- Input 13 -} [C, b, b, b, b] -> [a, B, B, B] {- Input 14 -} [B, B, B, c] -> [b, b, b, b, A] {- Input 15 -} [A, c, c, c, c] -> [b, C, C, C] {- Input 16 -} [C, C, C, a] -> [c, c, c, c, B] {- Input 17 -} reason mirror property Termination has value Just True for SRS [a, a, a, a, B] -> [A, A, A, c] {- Mirror (Input 12) -} [b, A, A, A] -> [C, a, a, a, a] {- Mirror (Input 13) -} [b, b, b, b, C] -> [B, B, B, a] {- Mirror (Input 14) -} [c, B, B, B] -> [A, b, b, b, b] {- Mirror (Input 15) -} [c, c, c, c, A] -> [C, C, C, b] {- Mirror (Input 16) -} [a, C, C, C] -> [B, c, c, c, c] {- Mirror (Input 17) -} reason DP property Termination has value Just True for SRS [a, a, a, a, B] ->= [A, A, A, c] {- DP Nontop (Mirror (Input 12)) -} [b, A, A, A] ->= [C, a, a, a, a] {- DP Nontop (Mirror (Input 13)) -} [b, b, b, b, C] ->= [B, B, B, a] {- DP Nontop (Mirror (Input 14)) -} [c, B, B, B] ->= [A, b, b, b, b] {- DP Nontop (Mirror (Input 15)) -} [c, c, c, c, A] ->= [C, C, C, b] {- DP Nontop (Mirror (Input 16)) -} [a, C, C, C] ->= [B, c, c, c, c] {- DP Nontop (Mirror (Input 17)) -} [a#, a, a, a, B] |-> [c#] {- DP (Top 3) (Mirror (Input 12)) -} [a#, C, C, C] |-> [c#] {- DP (Top 4) (Mirror (Input 17)) -} [a#, C, C, C] |-> [c#, c] {- DP (Top 3) (Mirror (Input 17)) -} [a#, C, C, C] |-> [c#, c, c] {- DP (Top 2) (Mirror (Input 17)) -} [a#, C, C, C] |-> [c#, c, c, c] {- DP (Top 1) (Mirror (Input 17)) -} [b#, b, b, b, C] |-> [a#] {- DP (Top 3) (Mirror (Input 14)) -} [b#, A, A, A] |-> [a#] {- DP (Top 4) (Mirror (Input 13)) -} [b#, A, A, A] |-> [a#, a] {- DP (Top 3) (Mirror (Input 13)) -} [b#, A, A, A] |-> [a#, a, a] {- DP (Top 2) (Mirror (Input 13)) -} [b#, A, A, A] |-> [a#, a, a, a] {- DP (Top 1) (Mirror (Input 13)) -} [c#, c, c, c, A] |-> [b#] {- DP (Top 3) (Mirror (Input 16)) -} [c#, B, B, B] |-> [b#] {- DP (Top 4) (Mirror (Input 15)) -} [c#, B, B, B] |-> [b#, b] {- DP (Top 3) (Mirror (Input 15)) -} [c#, B, B, B] |-> [b#, b, b] {- DP (Top 2) (Mirror (Input 15)) -} [c#, B, B, B] |-> [b#, b, b, b] {- DP (Top 1) (Mirror (Input 15)) -} reason (a, 2/15) (B, 1/5) (A, 1/5) (c, 2/15) (b, 2/15) (C, 1/5) property Termination has value Just True for SRS [a, a, a, a, B] ->= [A, A, A, c] {- DP Nontop (Mirror (Input 12)) -} [b, A, A, A] ->= [C, a, a, a, a] {- DP Nontop (Mirror (Input 13)) -} [b, b, b, b, C] ->= [B, B, B, a] {- DP Nontop (Mirror (Input 14)) -} [c, B, B, B] ->= [A, b, b, b, b] {- DP Nontop (Mirror (Input 15)) -} [c, c, c, c, A] ->= [C, C, C, b] {- DP Nontop (Mirror (Input 16)) -} [a, C, C, C] ->= [B, c, c, c, c] {- DP Nontop (Mirror (Input 17)) -} reason EDG ************************************************** skeleton: (24,6)\Weight\Mirror(6,6)\Deepee(15/6,9)\Weight(0/6,6)\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) ************************************************** **************************************************