/export/starexec/sandbox2/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ************************************************** summary ************************************************** SRS with 5 rules on 4 letters DP SRS with 9 strict rules and 5 weak rules on 7 letters weights SRS with 3 strict rules and 5 weak rules on 6 letters EDG SRS with 3 strict rules and 5 weak rules on 6 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 2 strict rules and 5 weak rules on 6 letters EDG SRS with 2 strict rules and 5 weak rules on 6 letters Matrix { monotone = Weak, domain = Arctic, shape = Full, bits = 4, dim = 2, solver = Minisatapi, verbose = False, tracing = False} SRS with 1 strict rules and 5 weak rules on 6 letters weights SRS with 0 strict rules and 5 weak rules on 4 letters EDG ************************************************** proof ************************************************** property Termination has value Just True for SRS [f] -> [n, c, c] {- Input 0 -} [c, f] -> [f, c, c] {- Input 1 -} [c, c] -> [c] {- Input 2 -} [n, s] -> [f, s, s] {- Input 3 -} [n, f] -> [f, n] {- Input 4 -} reason DP property Termination has value Just True for SRS [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -} [f#] |-> [c#] {- DP (Top 2) (Input 0) -} [f#] |-> [c#, c] {- DP (Top 1) (Input 0) -} [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -} [n#, f] |-> [n#] {- DP (Top 1) (Input 4) -} [n#, s] |-> [f#, s, s] {- DP (Top 0) (Input 3) -} [c#, f] |-> [f#, c, c] {- DP (Top 0) (Input 1) -} [c#, f] |-> [c#] {- DP (Top 2) (Input 1) -} [c#, f] |-> [c#, c] {- DP (Top 1) (Input 1) -} reason (f, 3/2) (n, 3/2) (f#, 1/2) (n#, 1/2) property Termination has value Just True for SRS [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -} [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -} [n#, s] |-> [f#, s, s] {- DP (Top 0) (Input 3) -} reason EDG property Termination has value Just True for SRS [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -} [n#, s] |-> [f#, s, s] {- DP (Top 0) (Input 3) -} [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -} [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} reason ( f , Wk / 14A 14A \ \ 12A 14A / ) ( n , Wk / 14A 16A \ \ 12A 14A / ) ( c , Wk / 0A 0A \ \ -2A -2A / ) ( s , Wk / 0A 0A \ \ 0A 0A / ) ( f# , Wk / 14A 14A \ \ 14A 14A / ) ( n# , Wk / 14A 16A \ \ 14A 16A / ) property Termination has value Just True for SRS [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -} [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -} [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} reason EDG property Termination has value Just True for SRS [f#] |-> [n#, c, c] {- DP (Top 0) (Input 0) -} [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -} [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} reason ( f , Wk / 8A 8A \ \ 6A 8A / ) ( n , Wk / 6A 8A \ \ 6A 8A / ) ( c , Wk / 0A 0A \ \ -2A -2A / ) ( s , Wk / 0A 0A \ \ 0A 0A / ) ( f# , Wk / 9A 10A \ \ 9A 10A / ) ( n# , Wk / 8A 10A \ \ 8A 10A / ) property Termination has value Just True for SRS [n#, f] |-> [f#, n] {- DP (Top 0) (Input 4) -} [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} reason (n#, 1/1) property Termination has value Just True for SRS [f] ->= [n, c, c] {- DP Nontop (Input 0) -} [c, f] ->= [f, c, c] {- DP Nontop (Input 1) -} [c, c] ->= [c] {- DP Nontop (Input 2) -} [n, s] ->= [f, s, s] {- DP Nontop (Input 3) -} [n, f] ->= [f, n] {- DP Nontop (Input 4) -} reason EDG ************************************************** skeleton: (5,4)\Deepee(9/5,7)\Weight\EDG(3/5,6)\Matrix{\Arctic}{2}\EDG(2/5,6)\Matrix{\Arctic}{2}(1/5,6)\Weight(0/5,4)\EDG[] ************************************************** let {} in let {trac = False;done = Worker No_Strict_Rules;mo = Pre (Or_Else Count (IfSizeLeq 10000 GLPK Fail));wop = Or_Else (Worker (Weight {modus = mo})) Pass;weighted = \ m -> And_Then m wop;tiling = \ m w -> weighted (And_Then (Worker (Tiling {method = m,width = w,unlabel = False})) (Worker Remap));when_small = \ m -> And_Then (Worker (SizeAtmost 1000)) m;when_medium = \ m -> And_Then (Worker (SizeAtmost 10000)) m;solver = Minisatapi;qpi = \ dim bits -> weighted (when_small (Worker (QPI {tracing = trac,dim = dim,bits = bits,solver = solver})));matrix = \ dom dim bits -> weighted (when_small (Worker (Matrix {monotone = Weak,domain = dom,dim = dim,bits = bits,tracing = trac,solver = solver})));kbo = \ b -> weighted (when_small (Worker (KBO {bits = b,solver = solver})));mb = Worker (Matchbound {method = RFC,max_size = 100000});remove = First_Of ([ Worker (Weight {modus = mo})] <> ([ Seq [ qpi 2 4, qpi 3 4, qpi 4 4], Seq [ qpi 5 4, qpi 6 3, qpi 7 3]] <> ([ Seq [ matrix Arctic 2 5, matrix Arctic 3 4, matrix Arctic 4 3], Seq [ matrix Natural 2 5, matrix Natural 3 4, matrix Natural 4 3]] <> [ kbo 1, And_Then (Worker Mirror) (And_Then (kbo 1) (Worker Mirror))])));dp = As_Transformer (Apply (And_Then (Worker (DP {tracing = True})) (Worker Remap)) (Apply wop (Branch (Worker (EDG {tracing = True})) remove)));noh = [ Worker (Enumerate {closure = Forward}), Worker (Enumerate {closure = Backward})];yeah = Tree_Search_Preemptive 0 done ([ Worker (Weight {modus = mo}), mb, And_Then (Worker Mirror) mb, dp, And_Then (Worker Mirror) dp, tiling Forward 2, And_Then (Worker Mirror) (tiling Forward 2)] <> [ Worker (Unlabel {verbose = True})])} in Apply (Worker Remap) (Seq [ Worker KKST01, First_Of ([ yeah] <> noh)])