(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
admit(x, nil) → nil
admit(x, .(u, .(v, .(w, z)))) → cond(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
cond(true, y) → y
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
admit2 > w > [.2, cond2]
admit2 > =2 > [.2, cond2]
admit2 > sum3 > [.2, cond2]
admit2 > carry3 > [.2, cond2]
nil > [.2, cond2]
true > [.2, cond2]
Status:
admit2: [2,1]
nil: []
.2: [2,1]
w: []
cond2: [2,1]
=2: [2,1]
sum3: [3,2,1]
carry3: [3,2,1]
true: []
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
admit(x, nil) → nil
admit(x, .(u, .(v, .(w, z)))) → cond(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
cond(true, y) → y
(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