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

(0) Obligation:

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

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

Q is empty.

(1) AAECC Innermost (EQUIVALENT transformation)

We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x

The TRS R 2 is

f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

The signature Sigma is {f}

(2) Obligation:

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

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

The set Q consists of the following terms:

-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), x1)
f(x0, s(x1))

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(4) Obligation:

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

-¹(s(x), s(y)) → -¹(x, y)
F(s(x), y) → F(p(-(s(x), y)), p(-(y, s(x))))
F(s(x), y) → P(-(s(x), y))
F(s(x), y) → -¹(s(x), y)
F(s(x), y) → P(-(y, s(x)))
F(s(x), y) → -¹(y, s(x))
F(x, s(y)) → F(p(-(x, s(y))), p(-(s(y), x)))
F(x, s(y)) → P(-(x, s(y)))
F(x, s(y)) → -¹(x, s(y))
F(x, s(y)) → P(-(s(y), x))
F(x, s(y)) → -¹(s(y), x)

The TRS R consists of the following rules:

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

The set Q consists of the following terms:

-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), x1)
f(x0, s(x1))

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

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 8 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

-¹(s(x), s(y)) → -¹(x, y)

The TRS R consists of the following rules:

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

The set Q consists of the following terms:

-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), x1)
f(x0, s(x1))

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

-¹(s(x), s(y)) → -¹(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
-¹(x1, x2)  =  x2
s(x1)  =  s(x1)

Recursive path order with status [RPO].
Quasi-Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

The set Q consists of the following terms:

-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), x1)
f(x0, s(x1))

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

(10) PisEmptyProof (EQUIVALENT transformation)

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

(11) TRUE

(12) Obligation:

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

F(x, s(y)) → F(p(-(x, s(y))), p(-(s(y), x)))
F(s(x), y) → F(p(-(s(x), y)), p(-(y, s(x))))

The TRS R consists of the following rules:

-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), y) → f(p(-(s(x), y)), p(-(y, s(x))))
f(x, s(y)) → f(p(-(x, s(y))), p(-(s(y), x)))

The set Q consists of the following terms:

-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), x1)
f(x0, s(x1))

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