/export/starexec/sandbox/solver/bin/starexec_run_tc20-std.sh /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
**************************************************
summary
**************************************************
SRS with 7 rules on 5 letters       mirror
SRS with 7 rules on 5 letters       Matchbound   { method = RFC, max_size = Nothing, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 155 states

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [foo, 0] -> [0, s, p, p, p, s, s, s, p, s] {- Input 0 -}
  [foo, s] -> [ p , s , p , p , p , s , s , p , s , s , p , s , foo , p , p , s , s , p , s , bar , p , p , s , s , p , s ] {- Input 1 -}
  [bar, 0] -> [0, p, s, s, s] {- Input 2 -}
  [bar, s] -> [p, s, p, p, s, s, foo, s, p, p, s, s] {- Input 3 -}
  [p, p, s] -> [p] {- Input 4 -}
  [p, s] -> [] {- Input 5 -}
  [p, 0] -> [0, s, s, s, s] {- Input 6 -}
reason
  mirror
   property Termination
has value Just True
for SRS
  [0, foo] -> [s, p, s, s, s, p, p, p, s, 0] {- Mirror (Input 0) -}
  [s, foo] -> [ s , p , s , s , p , p , bar , s , p , s , s , p , p , foo , s , p , s , s , p , s , s , p , p , p , s , p ] {- Mirror (Input 1) -}
  [0, bar] -> [s, s, s, p, 0] {- Mirror (Input 2) -}
  [s, bar] -> [s, s, p, p, s, foo, s, s, p, p, s, p] {- Mirror (Input 3) -}
  [s, p, p] -> [p] {- Mirror (Input 4) -}
  [s, p] -> [] {- Mirror (Input 5) -}
  [0, p] -> [s, s, s, s, 0] {- Mirror (Input 6) -}
reason
  Matchbound
    Matchbound   { method = RFC, max_size = Nothing, max_bound = Nothing, verbose = False, tracing = False} matchbound 2 certified by automaton with 155 states

**************************************************
skeleton: \Mirror(7,5)\Rfcmatchbound{2}[]
**************************************************
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)])