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

Proof:
 DP Processor:
  DPs:
   h#(f(x,y)) -> h#(x)
   h#(f(x,y)) -> h#(h(x))
  TRS:
   h(f(x,y)) -> f(y,f(h(h(x)),a()))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {5,3,1}
    transitions:
     f1(2,9) -> 10*
     f1(8,10) -> 7*
     h1(2) -> 2*
     a1() -> 9*
     h{#,1}(2) -> 3,1
     f40() -> 2*
     h{#,0}(2) -> 3,1
     h{#,0}(4) -> 3*
     h0(2) -> 4*
     h0(4) -> 7*
     f0(8,8) -> 7*
     f0(7,6) -> 8*
     f0(2,8) -> 5*
     a0() -> 6*
     3 -> 1*
     5 -> 4*
   problem:
    DPs:
     
    TRS:
     h(f(x,y)) -> f(y,f(h(h(x)),a()))
   Qed