/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 9 rules on 6 letters       weights
SRS with 3 rules on 4 letters       DP
SRS with 4 strict rules and 3 weak rules on 6 letters       weights
SRS with 0 strict rules and 3 weak rules on 4 letters       EDG

**************************************************
proof
**************************************************
property Termination
has value Just True
for SRS
  [1, 1] -> [4, 3] {- Input 0 -}
  [1, 2] -> [2, 1] {- Input 1 -}
  [2, 2] -> [1, 1, 1] {- Input 2 -}
  [3, 3] -> [5, 6] {- Input 3 -}
  [3, 4] -> [1, 1] {- Input 4 -}
  [4, 4] -> [3] {- Input 5 -}
  [5, 5] -> [6, 2] {- Input 6 -}
  [5, 6] -> [1, 2] {- Input 7 -}
  [6, 6] -> [2, 1] {- Input 8 -}
reason
  (1, 103/1)
  (4, 69/1)
  (3, 137/1)
  (2, 155/1)
  (5, 143/1)
  (6, 130/1)
   property Termination
has value Just True
for SRS
  [1, 1] -> [4, 3] {- Input 0 -}
  [1, 2] -> [2, 1] {- Input 1 -}
  [3, 4] -> [1, 1] {- Input 4 -}
reason
  DP
   property Termination
has value Just True
for SRS
  [1, 1] ->= [4, 3] {- DP Nontop (Input 0) -}
  [1, 2] ->= [2, 1] {- DP Nontop (Input 1) -}
  [3, 4] ->= [1, 1] {- DP Nontop (Input 4) -}
  [1#, 1] |-> [3#] {- DP (Top 1) (Input 0) -}
  [1#, 2] |-> [1#] {- DP (Top 1) (Input 1) -}
  [3#, 4] |-> [1#] {- DP (Top 1) (Input 4) -}
  [3#, 4] |-> [1#, 1] {- DP (Top 0) (Input 4) -}
reason
  (1, 1/4)
  (4, 1/2)
  (2, 1/1)
   property Termination
has value Just True
for SRS
  [1, 1] ->= [4, 3] {- DP Nontop (Input 0) -}
  [1, 2] ->= [2, 1] {- DP Nontop (Input 1) -}
  [3, 4] ->= [1, 1] {- DP Nontop (Input 4) -}
reason
  EDG

**************************************************
skeleton: (9,6)\Weight(3,4)\Deepee(4/3,6)\Weight(0/3,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)])