(0) Obligation:

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

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

Q is empty.

(1) Overlay + Local Confluence (EQUIVALENT transformation)

The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.

(2) Obligation:

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

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

(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:

APP(app(add, app(s, x)), y) → APP(s, app(app(add, x), y))
APP(app(add, app(s, x)), y) → APP(app(add, x), y)
APP(app(add, app(s, x)), y) → APP(add, x)
APP(app(mult, app(s, x)), y) → APP(app(add, app(app(mult, x), y)), y)
APP(app(mult, app(s, x)), y) → APP(add, app(app(mult, x), y))
APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)
APP(app(mult, app(s, x)), y) → APP(mult, x)
APP(app(app(rec, f), x), app(s, y)) → APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) → APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) → APP(app(app(rec, f), x), y)
FACTAPP(app(rec, mult), app(s, 0))
FACTAPP(rec, mult)
FACTAPP(s, 0)

The TRS R consists of the following rules:

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

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

(5) DependencyGraphProof (EQUIVALENT transformation)

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

(6) Complex Obligation (AND)

(7) Obligation:

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

APP(app(add, app(s, x)), y) → APP(app(add, x), y)

The TRS R consists of the following rules:

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04]. Here, we combined the reduction pair processor with the A-transformation [FROCOS05] which results in the following intermediate Q-DP Problem.
The a-transformed P is

add1(s(x), y) → add1(x, y)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


APP(app(add, app(s, x)), y) → APP(app(add, x), y)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
add1(x1, x2)  =  x1
s(x1)  =  s(x1)

Lexicographic path order with status [LPO].
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:

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

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:

APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)

The TRS R consists of the following rules:

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04]. Here, we combined the reduction pair processor with the A-transformation [FROCOS05] which results in the following intermediate Q-DP Problem.
The a-transformed P is

mult1(s(x), y) → mult1(x, y)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
mult1(x1, x2)  =  x1
s(x1)  =  s(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
trivial

Status:
trivial


The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

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

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

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:

APP(app(app(rec, f), x), app(s, y)) → APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) → APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) → APP(app(app(rec, f), x), y)

The TRS R consists of the following rules:

app(app(add, 0), y) → y
app(app(add, app(s, x)), y) → app(s, app(app(add, x), y))
app(app(mult, 0), y) → 0
app(app(mult, app(s, x)), y) → app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) → x
app(app(app(rec, f), x), app(s, y)) → app(app(f, app(s, y)), app(app(app(rec, f), x), y))
factapp(app(rec, mult), app(s, 0))

The set Q consists of the following terms:

app(app(add, 0), x0)
app(app(add, app(s, x0)), x1)
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(app(rec, x0), x1), 0)
app(app(app(rec, x0), x1), app(s, x2))
fact

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