(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus(minus(x)) → x
minus(h(x)) → h(minus(x))
minus(f(x, y)) → f(minus(y), minus(x))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

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:

MINUS(h(x)) → MINUS(x)
MINUS(f(x, y)) → MINUS(y)
MINUS(f(x, y)) → MINUS(x)

The TRS R consists of the following rules:

minus(minus(x)) → x
minus(h(x)) → h(minus(x))
minus(f(x, y)) → f(minus(y), minus(x))

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

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MINUS(f(x, y)) → MINUS(y)
MINUS(f(x, y)) → MINUS(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MINUS(x1)  =  x1
h(x1)  =  x1
f(x1, x2)  =  f(x1, x2)
minus(x1)  =  x1

Recursive Path Order [RPO].
Precedence:
trivial

The following usable rules [FROCOS05] were oriented:

minus(minus(x)) → x
minus(h(x)) → h(minus(x))
minus(f(x, y)) → f(minus(y), minus(x))

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MINUS(h(x)) → MINUS(x)

The TRS R consists of the following rules:

minus(minus(x)) → x
minus(h(x)) → h(minus(x))
minus(f(x, y)) → f(minus(y), minus(x))

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

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MINUS(h(x)) → MINUS(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MINUS(x1)  =  x1
h(x1)  =  h(x1)
minus(x1)  =  x1
f(x1, x2)  =  f

Recursive Path Order [RPO].
Precedence:
trivial

The following usable rules [FROCOS05] were oriented:

minus(minus(x)) → x
minus(h(x)) → h(minus(x))
minus(f(x, y)) → f(minus(y), minus(x))

(6) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus(minus(x)) → x
minus(h(x)) → h(minus(x))
minus(f(x, y)) → f(minus(y), minus(x))

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

(7) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(8) TRUE