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


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


YES

Problem:
 f(x,x) -> f(a(),b())
 b() -> c()

Proof:
 DP Processor:
  DPs:
   f#(x,x) -> b#()
   f#(x,x) -> f#(a(),b())
  TRS:
   f(x,x) -> f(a(),b())
   b() -> c()
  TDG Processor:
   DPs:
    f#(x,x) -> b#()
    f#(x,x) -> f#(a(),b())
   TRS:
    f(x,x) -> f(a(),b())
    b() -> c()
   graph:
    f#(x,x) -> f#(a(),b()) -> f#(x,x) -> f#(a(),b())
    f#(x,x) -> f#(a(),b()) -> f#(x,x) -> b#()
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     f#(x,x) -> f#(a(),b())
    TRS:
     f(x,x) -> f(a(),b())
     b() -> c()
    Bounds Processor:
     bound: 1
     enrichment: match
     automaton:
      final states: {6,5,4,1}
      transitions:
       b0() -> 2*
       f0(3,2) -> 4*
       f0(3,6) -> 4*
       c1() -> 5,6*,2
       f{#,0}(3,2) -> 1*
       f{#,0}(3,6) -> 1*
       a0() -> 3*
     problem:
      DPs:
       
      TRS:
       f(x,x) -> f(a(),b())
       b() -> c()
     Qed