Certification Problem
Input (TPDB TRS_Standard/SK90/4.22)
The rewrite relation of the following TRS is considered.
|
not(and(x,y)) |
→ |
or(not(x),not(y)) |
(1) |
|
not(or(x,y)) |
→ |
and(not(x),not(y)) |
(2) |
|
and(x,or(y,z)) |
→ |
or(and(x,y),and(x,z)) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Rule Removal
Using the
| prec(not) |
= |
2 |
|
stat(not) |
= |
mul
|
| prec(and) |
= |
1 |
|
stat(and) |
= |
mul
|
| prec(or) |
= |
0 |
|
stat(or) |
= |
mul
|
| π(not) |
= |
[1] |
| π(and) |
= |
[1,2] |
| π(or) |
= |
[1,2] |
all of the following rules can be deleted.
|
not(and(x,y)) |
→ |
or(not(x),not(y)) |
(1) |
|
not(or(x,y)) |
→ |
and(not(x),not(y)) |
(2) |
|
and(x,or(y,z)) |
→ |
or(and(x,y),and(x,z)) |
(3) |
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.