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

0 QTRS
↳1 Overlay + Local Confluence (⇔)
↳2 QTRS
↳3 DependencyPairsProof (⇔)
↳4 QDP
↳5 DependencyGraphProof (⇔)
↳6 AND
  ↳7 QDP
    ↳8 QDPOrderProof (⇔)
    ↳9 QDP
    ↳10 PisEmptyProof (⇔)
    ↳11 TRUE
  ↳12 QDP
    ↳13 QDPOrderProof (⇔)
    ↳14 QDP
    ↳15 PisEmptyProof (⇔)
    ↳16 TRUE

(0) Obligation:

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

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

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(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(app(curry, x0), x1), x2)
add

(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(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(app(curry, f), x), y) → APP(app(f, x), y)
APP(app(app(curry, f), x), y) → APP(f, x)
ADD → APP(curry, plus)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(app(curry, x0), x1), x2)
add

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 3 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

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

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(app(curry, x0), x1), x2)
add

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.


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

Lexicographic path order with status [LPO].
Precedence:
0 > plus
add > app2 > s > plus
add > curry > plus

Status:
app2: [1,2]
plus: []
s: []
0: []
curry: []
add: []

The following usable rules [FROCOS05] were oriented:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

(9) Obligation:

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

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(app(curry, x0), x1), x2)
add

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(app(curry, f), x), y) → APP(f, x)
APP(app(app(curry, f), x), y) → APP(app(f, x), y)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(app(curry, x0), x1), x2)
add

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.


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

Lexicographic path order with status [LPO].
Precedence:
s > app2
add > curry > app2
add > plus > app2

Status:
app2: [1,2]
curry: []
plus: []
0: []
s: []
add: []

The following usable rules [FROCOS05] were oriented:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

(14) Obligation:

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

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) → app(app(f, x), y)
add → app(curry, plus)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(app(curry, x0), x1), x2)
add

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