Completion Proof

by kbcv

Input

For the following equations E

a(1,0) = 0
a(0,1) = 0
a(1,1) = 1
a(1,g) = g
a(g,1) = g
a(0,g) = 0
a(g,0) = 0
n(1) = 0
n(0) = 1
x(1,1) = 0
x(1,0) = 1
x(0,1) = 1
x(0,0) = 0
x(1,g) = n(g)
x(g,1) = n(g)
x(0,g) = g
x(g,0) = g
x(g,n(g)) = 1
x(n(g),g) = 1
x(g,g) = 0

and the following TRS R

a(1,g) → g
a(g,1) → g
a(0,g) → 0
a(g,0) → 0
x(1,g) → n(g)
x(g,1) → n(g)
x(0,g) → g
x(g,0) → g
x(g,n(g)) → 1
x(n(g),g) → 1
x(g,g) → 0
n(0) → 1
n(1) → 0

it is proven that E is equivalent to R, and R is convergent.

Proof

1 Completion Proof

We have to prove termination and local confluence of R, and equivalence of R and E.

1.1 Rule Removal

Using the recursive path order with the following precedence and status
prec(0) = 0 stat(0) = lex
prec(1) = 1 stat(1) = lex
prec(n) = 2 stat(n) = lex
prec(x) = 3 stat(x) = lex
all rules could be removed.

1.1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.

1.2 Local Confluence Proof

All critical pairs are joinable which can be seen by computing normal forms of all critical pairs.

1.3 Equivalence Proof of R and E

R can be simulated by E as follows. All rules could be derived from the equations

That E can be simulated by R can be shown by just computing normal forms of each equation in E.

Tool configuration

kbcv