/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 f(s(x)) -> s(s(f(p(s(x)))))
 f(0()) -> 0()
 p(s(x)) -> x

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
         [0]
   [0] = [0]
         [1],
   
             [1 0 0]     [0]
   [p](x0) = [1 0 0]x0 + [1]
             [0 0 1]     [0],
   
             [1 0 1]  
   [f](x0) = [0 0 0]x0
             [0 0 1]  ,
   
             [1 1 0]  
   [s](x0) = [0 0 0]x0
             [0 0 1]  
  orientation:
             [1 1 1]     [1 1 1]                    
   f(s(x)) = [0 0 0]x >= [0 0 0]x = s(s(f(p(s(x)))))
             [0 0 1]     [0 0 1]                    
   
            [1]    [0]      
   f(0()) = [0] >= [0] = 0()
            [1]    [1]      
   
             [1 1 0]    [0]         
   p(s(x)) = [1 1 0]x + [1] >= x = x
             [0 0 1]    [0]         
  problem:
   f(s(x)) -> s(s(f(p(s(x)))))
   p(s(x)) -> x
  DP Processor:
   DPs:
    f#(s(x)) -> p#(s(x))
    f#(s(x)) -> f#(p(s(x)))
   TRS:
    f(s(x)) -> s(s(f(p(s(x)))))
    p(s(x)) -> x
   TDG Processor:
    DPs:
     f#(s(x)) -> p#(s(x))
     f#(s(x)) -> f#(p(s(x)))
    TRS:
     f(s(x)) -> s(s(f(p(s(x)))))
     p(s(x)) -> x
    graph:
     f#(s(x)) -> f#(p(s(x))) -> f#(s(x)) -> f#(p(s(x)))
     f#(s(x)) -> f#(p(s(x))) -> f#(s(x)) -> p#(s(x))
    SCC Processor:
     #sccs: 1
     #rules: 1
     #arcs: 2/4
     DPs:
      f#(s(x)) -> f#(p(s(x)))
     TRS:
      f(s(x)) -> s(s(f(p(s(x)))))
      p(s(x)) -> x
     Bounds Processor:
      bound: 0
      enrichment: match-dp
      automaton:
       final states: {1}
       transitions:
        f{#,0}(4) -> 1*
        p0(3) -> 4*
        s0(2) -> 3*
        f60() -> 2*
        2 -> 4*
      problem:
       DPs:
        
       TRS:
        f(s(x)) -> s(s(f(p(s(x)))))
        p(s(x)) -> x
      Qed