Certification Problem
Input (TPDB TRS_Standard/SK90/2.33)
The rewrite relation of the following TRS is considered.
|
or(x,x) |
→ |
x |
(1) |
|
and(x,x) |
→ |
x |
(2) |
|
not(not(x)) |
→ |
x |
(3) |
|
not(and(x,y)) |
→ |
or(not(x),not(y)) |
(4) |
|
not(or(x,y)) |
→ |
and(not(x),not(y)) |
(5) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 Rule Removal
Using the
Knuth Bendix order with w0 = 1 and the following precedence and weight functions
| prec(not) |
= |
3 |
|
weight(not) |
= |
0 |
|
|
|
| prec(and) |
= |
2 |
|
weight(and) |
= |
4 |
|
|
|
| prec(or) |
= |
0 |
|
weight(or) |
= |
4 |
|
|
|
all of the following rules can be deleted.
|
or(x,x) |
→ |
x |
(1) |
|
and(x,x) |
→ |
x |
(2) |
|
not(not(x)) |
→ |
x |
(3) |
|
not(and(x,y)) |
→ |
or(not(x),not(y)) |
(4) |
|
not(or(x,y)) |
→ |
and(not(x),not(y)) |
(5) |
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.