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:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

Q is empty.

(1) AAECC Innermost (EQUIVALENT transformation)

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

min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
min(0, y) → 0

The TRS R 2 is

f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The signature Sigma is {f}

(2) Obligation:

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

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(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:

MIN(s(x), s(y)) → MIN(x, y)
MAX(s(x), s(y)) → MAX(x, y)
TWICE(s(x)) → TWICE(x)
-¹(s(x), s(y)) → -¹(x, y)
F(s(x), s(y)) → F(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))
F(s(x), s(y)) → -¹(max(s(x), s(y)), min(s(x), s(y)))
F(s(x), s(y)) → MAX(s(x), s(y))
F(s(x), s(y)) → MIN(s(x), s(y))
F(s(x), s(y)) → P(twice(min(x, y)))
F(s(x), s(y)) → TWICE(min(x, y))
F(s(x), s(y)) → MIN(x, y)

The TRS R consists of the following rules:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(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 5 SCCs with 6 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:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(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)  =  -¹(x1)
s(x1)  =  s(x1)
min(x1, x2)  =  min(x2)
0  =  0
max(x1, x2)  =  max(x1, x2)
twice(x1)  =  twice(x1)
-(x1, x2)  =  -(x1, x2)
p(x1)  =  x1
f(x1, x2)  =  f

Recursive path order with status [RPO].
Precedence:

max₂ > s₁
f > min₁ > s₁
f > min₁ > 0
f > twice₁ > s₁
f > twice₁ > 0
f > -₂

Status:

-^1₁: [1]
s₁: multiset
min₁: [1]
0: multiset
max₂: [1,2]
twice₁: [1]
-₂: [2,1]
f: []

The following usable rules [FROCOS05] were oriented:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

(9) Obligation:

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

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(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:

TWICE(s(x)) → TWICE(x)

The TRS R consists of the following rules:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TWICE(s(x)) → TWICE(x)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
TWICE(x1)  =  TWICE(x1)
s(x1)  =  s(x1)
min(x1, x2)  =  min(x1, x2)
0  =  0
max(x1, x2)  =  max(x1, x2)
twice(x1)  =  twice(x1)
-(x1, x2)  =  -(x1)
p(x1)  =  x1
f(x1, x2)  =  f

Recursive path order with status [RPO].
Precedence:

0 > -₁
max₂ > s₁ > TWICE₁ > -₁
f > min₂ > s₁ > TWICE₁ > -₁
f > twice₁ > s₁ > TWICE₁ > -₁

Status:

TWICE₁: multiset
s₁: multiset
min₂: [2,1]
0: multiset
max₂: [1,2]
twice₁: [1]
-₁: multiset
f: []

The following usable rules [FROCOS05] were oriented:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

(14) Obligation:

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

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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

(15) PisEmptyProof (EQUIVALENT transformation)

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

(16) TRUE

(17) Obligation:

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

MAX(s(x), s(y)) → MAX(x, y)

The TRS R consists of the following rules:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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

(18) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MAX(s(x), s(y)) → MAX(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MAX(x1, x2)  =  MAX(x2)
s(x1)  =  s(x1)
min(x1, x2)  =  x2
0  =  0
max(x1, x2)  =  max(x1, x2)
twice(x1)  =  twice(x1)
-(x1, x2)  =  -(x1, x2)
p(x1)  =  p(x1)
f(x1, x2)  =  f

Recursive path order with status [RPO].
Precedence:

MAX₁ > 0
p₁ > 0
f > max₂ > s₁ > -₂ > 0
f > twice₁ > s₁ > -₂ > 0

Status:

MAX₁: multiset
s₁: [1]
0: multiset
max₂: [1,2]
twice₁: [1]
-₂: multiset
p₁: multiset
f: []

The following usable rules [FROCOS05] were oriented:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

(19) Obligation:

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

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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

(20) PisEmptyProof (EQUIVALENT transformation)

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

(21) TRUE

(22) Obligation:

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

MIN(s(x), s(y)) → MIN(x, y)

The TRS R consists of the following rules:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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

(23) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MIN(s(x), s(y)) → MIN(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MIN(x1, x2)  =  x2
s(x1)  =  s(x1)
min(x1, x2)  =  min(x2)
0  =  0
max(x1, x2)  =  max(x1, x2)
twice(x1)  =  twice(x1)
-(x1, x2)  =  -(x1, x2)
p(x1)  =  p(x1)
f(x1, x2)  =  f

Recursive path order with status [RPO].
Precedence:

min₁ > s₁ > -₂
min₁ > 0 > -₂
max₂ > s₁ > -₂
twice₁ > s₁ > -₂
twice₁ > 0 > -₂
p₁ > -₂
f > s₁ > -₂

Status:

s₁: multiset
min₁: [1]
0: multiset
max₂: [2,1]
twice₁: [1]
-₂: [2,1]
p₁: multiset
f: []

The following usable rules [FROCOS05] were oriented:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

(24) Obligation:

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

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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

(25) PisEmptyProof (EQUIVALENT transformation)

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

(26) TRUE

(27) Obligation:

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

F(s(x), s(y)) → F(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The TRS R consists of the following rules:

min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
twice(0) → 0
twice(s(x)) → s(s(twice(x)))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
p(s(x)) → x
f(s(x), s(y)) → f(-(max(s(x), s(y)), min(s(x), s(y))), p(twice(min(x, y))))

The set Q consists of the following terms:

min(0, x0)
min(x0, 0)
min(s(x0), s(x1))
max(0, x0)
max(x0, 0)
max(s(x0), s(x1))
twice(0)
twice(s(x0))
-(x0, 0)
-(s(x0), s(x1))
p(s(x0))
f(s(x0), s(x1))

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