/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(a(),y) -> f(y,g(y))
 g(a()) -> b()
 g(b()) -> b()

Proof:
 DP Processor:
  DPs:
   f#(a(),y) -> g#(y)
   f#(a(),y) -> f#(y,g(y))
  TRS:
   f(a(),y) -> f(y,g(y))
   g(a()) -> b()
   g(b()) -> b()
  TDG Processor:
   DPs:
    f#(a(),y) -> g#(y)
    f#(a(),y) -> f#(y,g(y))
   TRS:
    f(a(),y) -> f(y,g(y))
    g(a()) -> b()
    g(b()) -> b()
   graph:
    f#(a(),y) -> f#(y,g(y)) -> f#(a(),y) -> f#(y,g(y))
    f#(a(),y) -> f#(y,g(y)) -> f#(a(),y) -> g#(y)
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     f#(a(),y) -> f#(y,g(y))
    TRS:
     f(a(),y) -> f(y,g(y))
     g(a()) -> b()
     g(b()) -> b()
    Bounds Processor:
     bound: 2
     enrichment: roof
     automaton:
      final states: {8}
      transitions:
       b0() -> 6*
       b1() -> 11,6
       f1(6,10) -> 6*
       f1(7,11) -> 6*
       g1(7) -> 11*
       g1(6) -> 10*
       f{#,1}(6,10) -> 8*
       f{#,1}(7,11) -> 8*
       b2() -> 15,10
       f2(11,15) -> 6*
       f{#,0}(6,6) -> 8*
       f{#,0}(7,7) -> 8*
       f{#,0}(6,7) -> 8*
       f{#,0}(7,6) -> 8*
       g2(11) -> 15*
       a0() -> 7*
       f{#,2}(11,15) -> 8*
       g0(7) -> 6*
       g0(6) -> 6*
       f0(6,6) -> 6*
       f0(7,7) -> 6*
       f0(6,7) -> 6*
       f0(7,6) -> 6*
     problem:
      DPs:
       
      TRS:
       f(a(),y) -> f(y,g(y))
       g(a()) -> b()
       g(b()) -> b()
     Qed