/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

Problem:
 strict:
  f(x,c(y)) -> f(x,s(f(y,y)))
  f(s(x),y) -> f(x,s(c(y)))
 weak:
  rand(x) -> x
  rand(x) -> rand(s(x))

Proof:
 Matrix Interpretation Processor: dim=2
  
  interpretation:
                 [2 0]     [1 1]     [1]
   [f](x0, x1) = [0 0]x0 + [0 0]x1 + [2],
   
                [2 0]     [2]
   [rand](x0) = [0 3]x0 + [0],
   
             [1 1]     [0]
   [c](x0) = [2 1]x0 + [2],
   
             [1 0]  
   [s](x0) = [0 0]x0
  orientation:
               [2 0]    [3 2]    [3]    [2 0]    [3 1]    [2]                 
   f(x,c(y)) = [0 0]x + [0 0]y + [2] >= [0 0]x + [0 0]y + [2] = f(x,s(f(y,y)))
   
               [2 0]    [1 1]    [1]    [2 0]    [1 1]    [1]               
   f(s(x),y) = [0 0]x + [0 0]y + [2] >= [0 0]x + [0 0]y + [2] = f(x,s(c(y)))
   
             [2 0]    [2]         
   rand(x) = [0 3]x + [0] >= x = x
   
             [2 0]    [2]    [2 0]    [2]             
   rand(x) = [0 3]x + [0] >= [0 0]x + [0] = rand(s(x))
  problem:
   strict:
    f(s(x),y) -> f(x,s(c(y)))
   weak:
    rand(x) -> rand(s(x))
  Bounds Processor:
   bound: 1
   enrichment: match-rt
   automaton:
    final states: {5}
    transitions:
     c0(5) -> 5*
     f1(5,9) -> 5*
     rand0(5) -> 5*
     f0(5,5) -> 5*
     s0(5) -> 5*
     s1(10) -> 11*
     s1(13) -> 14*
     s1(8) -> 9*
     rand1(11) -> 12*
     c1(5) -> 8*
     c1(9) -> 8*
     12 -> 5*
     14 -> 11*
     11 -> 13*
     5 -> 10*
   problem:
    strict:
     
    weak:
     rand(x) -> rand(s(x))
   Qed