YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given ETRS could be proven:

(0) ETRS
(1) EDirectTerminationProof [EQUIVALENT, 0 ms]
(2) YES


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

(0)
Obligation:
Equational rewrite system:
The TRS R consists of the following rules:

   f(g(f(h(a), a)), a) -> f(h(a), f(a, a))
   f(h(a), g(a)) -> f(g(h(a)), a)
   f(g(h(a)), f(f(a, a), a)) -> f(g(f(h(a), a)), a)
   f(h(a), a) -> f(h(a), b)
   f(i(x, y), f(a, y)) -> f(g(i(x, y)), y)

The set E consists of the following equations:

   f(x, y) == f(y, x)
   f(f(x, y), z) == f(x, f(y, z))


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

(1) EDirectTerminationProof (EQUIVALENT)
We use [DA_FALKE] with the following order to prove termination.

Precedence:
h_1 > f_2 > g_1
a > b


Status:
f_2: flat status



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

(2)
YES