/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 15 rules on 7 letters       weights
SRS with 11 rules on 7 letters       DP
SRS with 16 strict rules and 11 weak rules on 12 letters       weights
SRS with 1 strict rules and 11 weak rules on 8 letters       EDG
SRS with 1 strict rules and 11 weak rules on 8 letters       Matrix   { monotone = Strict, domain = Natural, shape = Full, bits = 3, dim = 2, solver = Minisatapi, verbose = False, tracing = False}
SRS with 1 strict rules and 10 weak rules on 8 letters       EDG
SRS with 1 strict rules and 10 weak rules on 8 letters       Matrix   { monotone = Weak, domain = Arctic, shape = Full, bits = 4, dim = 3, solver = Minisatapi, verbose = False, tracing = False}
SRS with 0 strict rules and 10 weak rules on 7 letters       EDG

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [r, r] -> [s, r] {- Input 0 -}
  [r, s] -> [s, r] {- Input 1 -}
  [r, n] -> [s, r] {- Input 2 -}
  [r, b] -> [u, s, b] {- Input 3 -}
  [r, u] -> [u, r] {- Input 4 -}
  [s, u] -> [u, s] {- Input 5 -}
  [n, u] -> [u, n] {- Input 6 -}
  [t, r, u] -> [t, c, r] {- Input 7 -}
  [t, s, u] -> [t, c, r] {- Input 8 -}
  [t, n, u] -> [t, c, r] {- Input 9 -}
  [c, u] -> [u, c] {- Input 10 -}
  [c, s] -> [s, c] {- Input 11 -}
  [c, r] -> [r, c] {- Input 12 -}
  [c, n] -> [n, c] {- Input 13 -}
  [c, n] -> [n] {- Input 14 -}
reason
  (r, 1/2)
  (n, 1/1)
  (u, 1/2)
   property Termination
has value Just True
for SRS
  [r, s] -> [s, r] {- Input 1 -}
  [r, b] -> [u, s, b] {- Input 3 -}
  [r, u] -> [u, r] {- Input 4 -}
  [s, u] -> [u, s] {- Input 5 -}
  [n, u] -> [u, n] {- Input 6 -}
  [t, s, u] -> [t, c, r] {- Input 8 -}
  [c, u] -> [u, c] {- Input 10 -}
  [c, s] -> [s, c] {- Input 11 -}
  [c, r] -> [r, c] {- Input 12 -}
  [c, n] -> [n, c] {- Input 13 -}
  [c, n] -> [n] {- Input 14 -}
reason
  DP
   property Termination
has value Just True
for SRS
  [r, s] ->= [s, r] {- DP Nontop (Input 1) -}
  [r, b] ->= [u, s, b] {- DP Nontop (Input 3) -}
  [r, u] ->= [u, r] {- DP Nontop (Input 4) -}
  [s, u] ->= [u, s] {- DP Nontop (Input 5) -}
  [n, u] ->= [u, n] {- DP Nontop (Input 6) -}
  [t, s, u] ->= [t, c, r] {- DP Nontop (Input 8) -}
  [c, u] ->= [u, c] {- DP Nontop (Input 10) -}
  [c, s] ->= [s, c] {- DP Nontop (Input 11) -}
  [c, r] ->= [r, c] {- DP Nontop (Input 12) -}
  [c, n] ->= [n, c] {- DP Nontop (Input 13) -}
  [c, n] ->= [n] {- DP Nontop (Input 14) -}
  [r#, s] |-> [r#] {- DP (Top 1) (Input 1) -}
  [r#, s] |-> [s#, r] {- DP (Top 0) (Input 1) -}
  [r#, b] |-> [s#, b] {- DP (Top 1) (Input 3) -}
  [r#, u] |-> [r#] {- DP (Top 1) (Input 4) -}
  [s#, u] |-> [s#] {- DP (Top 1) (Input 5) -}
  [n#, u] |-> [n#] {- DP (Top 1) (Input 6) -}
  [t#, s, u] |-> [r#] {- DP (Top 2) (Input 8) -}
  [t#, s, u] |-> [t#, c, r] {- DP (Top 0) (Input 8) -}
  [t#, s, u] |-> [c#, r] {- DP (Top 1) (Input 8) -}
  [c#, r] |-> [r#, c] {- DP (Top 0) (Input 12) -}
  [c#, r] |-> [c#] {- DP (Top 1) (Input 12) -}
  [c#, s] |-> [s#, c] {- DP (Top 0) (Input 11) -}
  [c#, s] |-> [c#] {- DP (Top 1) (Input 11) -}
  [c#, n] |-> [n#, c] {- DP (Top 0) (Input 13) -}
  [c#, n] |-> [c#] {- DP (Top 1) (Input 13) -}
  [c#, u] |-> [c#] {- DP (Top 1) (Input 10) -}
reason
  (r, 3/2)
  (s, 1/2)
  (u, 1/1)
  (n, 5/2)
  (r#, 2/1)
  (t#, 5/2)
  (c#, 3/2)
   property Termination
has value Just True
for SRS
  [r, s] ->= [s, r] {- DP Nontop (Input 1) -}
  [r, b] ->= [u, s, b] {- DP Nontop (Input 3) -}
  [r, u] ->= [u, r] {- DP Nontop (Input 4) -}
  [s, u] ->= [u, s] {- DP Nontop (Input 5) -}
  [n, u] ->= [u, n] {- DP Nontop (Input 6) -}
  [t, s, u] ->= [t, c, r] {- DP Nontop (Input 8) -}
  [c, u] ->= [u, c] {- DP Nontop (Input 10) -}
  [c, s] ->= [s, c] {- DP Nontop (Input 11) -}
  [c, r] ->= [r, c] {- DP Nontop (Input 12) -}
  [c, n] ->= [n, c] {- DP Nontop (Input 13) -}
  [c, n] ->= [n] {- DP Nontop (Input 14) -}
  [t#, s, u] |-> [t#, c, r] {- DP (Top 0) (Input 8) -}
reason
  EDG
   property Termination
has value Just True
for SRS
  [t#, s, u] |-> [t#, c, r] {- DP (Top 0) (Input 8) -}
  [r, s] ->= [s, r] {- DP Nontop (Input 1) -}
  [r, b] ->= [u, s, b] {- DP Nontop (Input 3) -}
  [r, u] ->= [u, r] {- DP Nontop (Input 4) -}
  [s, u] ->= [u, s] {- DP Nontop (Input 5) -}
  [n, u] ->= [u, n] {- DP Nontop (Input 6) -}
  [t, s, u] ->= [t, c, r] {- DP Nontop (Input 8) -}
  [c, u] ->= [u, c] {- DP Nontop (Input 10) -}
  [c, s] ->= [s, c] {- DP Nontop (Input 11) -}
  [c, r] ->= [r, c] {- DP Nontop (Input 12) -}
  [c, n] ->= [n, c] {- DP Nontop (Input 13) -}
  [c, n] ->= [n] {- DP Nontop (Input 14) -}
reason
  ( r
  , St  / 1 1 \
        \ 0 1 / )
  ( s
  , St  / 1 0 \
        \ 0 1 / )
  ( b
  , St  / 1 1 \
        \ 0 1 / )
  ( u
  , St  / 1 1 \
        \ 0 1 / )
  ( n
  , St  / 2 0 \
        \ 0 1 / )
  ( t
  , St  / 1 1 \
        \ 0 1 / )
  ( c
  , St  / 1 0 \
        \ 0 1 / )
  ( t#
  , St  / 1 1 \
        \ 0 1 / )
   property Termination
has value Just True
for SRS
  [t#, s, u] |-> [t#, c, r] {- DP (Top 0) (Input 8) -}
  [r, s] ->= [s, r] {- DP Nontop (Input 1) -}
  [r, b] ->= [u, s, b] {- DP Nontop (Input 3) -}
  [r, u] ->= [u, r] {- DP Nontop (Input 4) -}
  [s, u] ->= [u, s] {- DP Nontop (Input 5) -}
  [t, s, u] ->= [t, c, r] {- DP Nontop (Input 8) -}
  [c, u] ->= [u, c] {- DP Nontop (Input 10) -}
  [c, s] ->= [s, c] {- DP Nontop (Input 11) -}
  [c, r] ->= [r, c] {- DP Nontop (Input 12) -}
  [c, n] ->= [n, c] {- DP Nontop (Input 13) -}
  [c, n] ->= [n] {- DP Nontop (Input 14) -}
reason
  EDG
   property Termination
has value Just True
for SRS
  [t#, s, u] |-> [t#, c, r] {- DP (Top 0) (Input 8) -}
  [r, s] ->= [s, r] {- DP Nontop (Input 1) -}
  [r, b] ->= [u, s, b] {- DP Nontop (Input 3) -}
  [r, u] ->= [u, r] {- DP Nontop (Input 4) -}
  [s, u] ->= [u, s] {- DP Nontop (Input 5) -}
  [t, s, u] ->= [t, c, r] {- DP Nontop (Input 8) -}
  [c, u] ->= [u, c] {- DP Nontop (Input 10) -}
  [c, s] ->= [s, c] {- DP Nontop (Input 11) -}
  [c, r] ->= [r, c] {- DP Nontop (Input 12) -}
  [c, n] ->= [n, c] {- DP Nontop (Input 13) -}
  [c, n] ->= [n] {- DP Nontop (Input 14) -}
reason
  ( r
  , Wk  / 2A 11A -  \
        | -  4A  -  |
        \ -  -   0A / )
  ( s
  , Wk  / 1A -  -  \
        | -  1A -  |
        \ -  -  0A / )
  ( b
  , Wk  / 0A -  -  \
        | 1A 9A 9A |
        \ -  -  0A / )
  ( u
  , Wk  / 2A -  -  \
        | -  3A -  |
        \ -  -  0A / )
  ( n
  , Wk  / - - 0A \
        | - - -  |
        \ - - 0A / )
  ( t
  , Wk  / - - 0A \
        | - - 0A |
        \ - - 0A / )
  ( c
  , Wk  / 0A 6A -  \
        | -  -  -  |
        \ -  -  0A / )
  ( t#
  , Wk  / 0A 11A -  \
        | -  -   -  |
        \ -  -   0A / )
   property Termination
has value Just True
for SRS
  [r, s] ->= [s, r] {- DP Nontop (Input 1) -}
  [r, b] ->= [u, s, b] {- DP Nontop (Input 3) -}
  [r, u] ->= [u, r] {- DP Nontop (Input 4) -}
  [s, u] ->= [u, s] {- DP Nontop (Input 5) -}
  [t, s, u] ->= [t, c, r] {- DP Nontop (Input 8) -}
  [c, u] ->= [u, c] {- DP Nontop (Input 10) -}
  [c, s] ->= [s, c] {- DP Nontop (Input 11) -}
  [c, r] ->= [r, c] {- DP Nontop (Input 12) -}
  [c, n] ->= [n, c] {- DP Nontop (Input 13) -}
  [c, n] ->= [n] {- DP Nontop (Input 14) -}
reason
  EDG

**************************************************
skeleton: (15,7)\Weight(11,7)\Deepee(16/11,12)\Weight\EDG(1/11,8)\Matrix{\Natural}{2}\EDG(1/10,8)\Matrix{\Arctic}{3}(0/10,7)\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)])