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

Proof:
 DP Processor:
  DPs:
   f#(f(x,a()),y) -> f#(a(),x)
   f#(f(x,a()),y) -> f#(a(),y)
   f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x))
  TRS:
   f(f(x,a()),y) -> f(f(a(),y),f(a(),x))
  EDG Processor:
   DPs:
    f#(f(x,a()),y) -> f#(a(),x)
    f#(f(x,a()),y) -> f#(a(),y)
    f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x))
   TRS:
    f(f(x,a()),y) -> f(f(a(),y),f(a(),x))
   graph:
    f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x)) ->
    f#(f(x,a()),y) -> f#(a(),x)
    f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x)) ->
    f#(f(x,a()),y) -> f#(a(),y)
    f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x)) -> f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x))
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 3/9
    DPs:
     f#(f(x,a()),y) -> f#(f(a(),y),f(a(),x))
    TRS:
     f(f(x,a()),y) -> f(f(a(),y),f(a(),x))
    Bounds Processor:
     bound: 1
     enrichment: match
     automaton:
      final states: {6,1}
      transitions:
       f1(9,4) -> 11*
       f1(11,10) -> 6*
       f1(9,3) -> 10*
       a1() -> 9*
       f30() -> 2*
       f{#,0}(5,4) -> 1*
       f0(3,3) -> 4*
       f0(4,4) -> 6*
       f0(3,2) -> 5,4
       f0(3,4) -> 5*
       f0(5,4) -> 6*
       a0() -> 3*
     problem:
      DPs:
       
      TRS:
       f(f(x,a()),y) -> f(f(a(),y),f(a(),x))
     Qed