/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) DependencyPairsProof [EQUIVALENT, 0 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) TRUE


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

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

   f(f(X, Y), Z) -> f(X, f(Y, Z))
   f(X, f(Y, Z)) -> f(Y, Y)

The set Q consists of the following terms:

   f(f(x0, x1), x2)
   f(x0, f(x1, x2))


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

(1) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(2)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   F(f(X, Y), Z) -> F(X, f(Y, Z))
   F(f(X, Y), Z) -> F(Y, Z)
   F(X, f(Y, Z)) -> F(Y, Y)

The TRS R consists of the following rules:

   f(f(X, Y), Z) -> f(X, f(Y, Z))
   f(X, f(Y, Z)) -> f(Y, Y)

The set Q consists of the following terms:

   f(f(x0, x1), x2)
   f(x0, f(x1, x2))

We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(3) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 3 less nodes.
----------------------------------------

(4)
TRUE