/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(0(),y) -> 0()
 f(s(x),y) -> f(f(x,y),y)

Proof:
 DP Processor:
  DPs:
   f#(s(x),y) -> f#(x,y)
   f#(s(x),y) -> f#(f(x,y),y)
  TRS:
   f(0(),y) -> 0()
   f(s(x),y) -> f(f(x,y),y)
  EDG Processor:
   DPs:
    f#(s(x),y) -> f#(x,y)
    f#(s(x),y) -> f#(f(x,y),y)
   TRS:
    f(0(),y) -> 0()
    f(s(x),y) -> f(f(x,y),y)
   graph:
    f#(s(x),y) -> f#(x,y) -> f#(s(x),y) -> f#(x,y)
    f#(s(x),y) -> f#(x,y) -> f#(s(x),y) -> f#(f(x,y),y)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     f#(s(x),y) -> f#(x,y)
    TRS:
     f(0(),y) -> 0()
     f(s(x),y) -> f(f(x,y),y)
    Size-Change Termination Processor:
     DPs:
      
     TRS:
      f(0(),y) -> 0()
      f(s(x),y) -> f(f(x,y),y)
     The DP: f#(s(x),y) -> f#(x,y) has the edges:
       0 >   0
       1 >=  1
     Qed