Termination Proof using AProVE

Term Rewriting System R:
[x, y, z]
app(app(:, app(app(:, x), y)), z) -> app(app(:, x), app(app(:, y), z))
app(app(:, app(app(+, x), y)), z) -> app(app(+, app(app(:, x), z)), app(app(:, y), z))
app(app(:, z), app(app(+, x), app(f, y))) -> app(app(:, app(app(g, z), y)), app(app(+, x), a))

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

APP(app(:, app(app(:, x), y)), z) -> APP(app(:, x), app(app(:, y), z))
APP(app(:, app(app(:, x), y)), z) -> APP(app(:, y), z)
APP(app(:, app(app(:, x), y)), z) -> APP(:, y)
APP(app(:, app(app(+, x), y)), z) -> APP(app(+, app(app(:, x), z)), app(app(:, y), z))
APP(app(:, app(app(+, x), y)), z) -> APP(+, app(app(:, x), z))
APP(app(:, app(app(+, x), y)), z) -> APP(app(:, x), z)
APP(app(:, app(app(+, x), y)), z) -> APP(:, x)
APP(app(:, app(app(+, x), y)), z) -> APP(app(:, y), z)
APP(app(:, app(app(+, x), y)), z) -> APP(:, y)
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(:, app(app(g, z), y)), app(app(+, x), a))
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(:, app(app(g, z), y))
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(g, z), y)
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(g, z)
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(+, x), a)

Furthermore, R contains one SCC.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

Dependency Pairs:

APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(+, x), a)
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(g, z), y)
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(:, app(app(g, z), y)), app(app(+, x), a))
APP(app(:, app(app(+, x), y)), z) -> APP(app(:, y), z)
APP(app(:, app(app(+, x), y)), z) -> APP(app(:, x), z)
APP(app(:, app(app(+, x), y)), z) -> APP(app(+, app(app(:, x), z)), app(app(:, y), z))
APP(app(:, app(app(:, x), y)), z) -> APP(app(:, y), z)
APP(app(:, app(app(:, x), y)), z) -> APP(app(:, x), app(app(:, y), z))

Rules:

app(app(:, app(app(:, x), y)), z) -> app(app(:, x), app(app(:, y), z))
app(app(:, app(app(+, x), y)), z) -> app(app(+, app(app(:, x), z)), app(app(:, y), z))
app(app(:, z), app(app(+, x), app(f, y))) -> app(app(:, app(app(g, z), y)), app(app(+, x), a))

The following dependency pairs can be strictly oriented:

APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(+, x), a)
APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(g, z), y)
APP(app(:, app(app(+, x), y)), z) -> APP(app(+, app(app(:, x), z)), app(app(:, y), z))

The following usable rules using the Ce-refinement can be oriented:

app(app(:, app(app(:, x), y)), z) -> app(app(:, x), app(app(:, y), z))
app(app(:, app(app(+, x), y)), z) -> app(app(+, app(app(:, x), z)), app(app(:, y), z))
app(app(:, z), app(app(+, x), app(f, y))) -> app(app(:, app(app(g, z), y)), app(app(+, x), a))

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

: > +
: > g

resulting in one new DP problem.
Used Argument Filtering System:

APP(x₁, x₂) -> x₁
app(x₁, x₂) -> x₁

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 2

             ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

APP(app(:, z), app(app(+, x), app(f, y))) -> APP(app(:, app(app(g, z), y)), app(app(+, x), a))
APP(app(:, app(app(+, x), y)), z) -> APP(app(:, y), z)
APP(app(:, app(app(+, x), y)), z) -> APP(app(:, x), z)
APP(app(:, app(app(:, x), y)), z) -> APP(app(:, y), z)
APP(app(:, app(app(:, x), y)), z) -> APP(app(:, x), app(app(:, y), z))

Rules:

app(app(:, app(app(:, x), y)), z) -> app(app(:, x), app(app(:, y), z))
app(app(:, app(app(+, x), y)), z) -> app(app(+, app(app(:, x), z)), app(app(:, y), z))
app(app(:, z), app(app(+, x), app(f, y))) -> app(app(:, app(app(g, z), y)), app(app(+, x), a))

Termination of R could not be shown.
Duration:
0:02 minutes