(0) Obligation:

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

fst(0, Z) → nil
fst(s, cons(Y)) → cons(Y)
from(X) → cons(X)
add(0, X) → X
add(s, Y) → s
len(nil) → 0
len(cons(X)) → s

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Precedence:
fst2 > nil
from1 > cons1
len1 > 0
len1 > s

Status:
fst2: [1,2]
0: []
nil: []
s: []
cons1: [1]
from1: [1]
add2: [1,2]
len1: [1]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

fst(0, Z) → nil
fst(s, cons(Y)) → cons(Y)
from(X) → cons(X)
add(0, X) → X
add(s, Y) → s
len(nil) → 0
len(cons(X)) → s


(2) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) TRUE