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, 95 ms]
(2) YES


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

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

   plus(f(x), g(x)) -> plus(g(x), plus(g(x), g(x)))
   f(x) -> plus(g(x), a)

The set E consists of the following equations:

   plus(x, y) == plus(y, x)
   plus(plus(x, y), z) == plus(x, plus(y, z))


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

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

Precedence:
f_1 > plus_2
f_1 > g_1
f_1 > a


Status:
plus_2: flat status



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

(2)
YES