Term Rewriting System R:
[x, y]
not(not(x)) -> x
not(or(x, y)) -> and(not(not(not(x))), not(not(not(y))))
not(and(x, y)) -> or(not(not(not(x))), not(not(not(y))))

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

NOT(or(x, y)) -> NOT(not(not(x)))
NOT(or(x, y)) -> NOT(not(x))
NOT(or(x, y)) -> NOT(x)
NOT(or(x, y)) -> NOT(not(not(y)))
NOT(or(x, y)) -> NOT(not(y))
NOT(or(x, y)) -> NOT(y)
NOT(and(x, y)) -> NOT(not(not(x)))
NOT(and(x, y)) -> NOT(not(x))
NOT(and(x, y)) -> NOT(x)
NOT(and(x, y)) -> NOT(not(not(y)))
NOT(and(x, y)) -> NOT(not(y))
NOT(and(x, y)) -> NOT(y)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Modular Removal of Rules


Dependency Pairs:

NOT(and(x, y)) -> NOT(y)
NOT(and(x, y)) -> NOT(not(y))
NOT(and(x, y)) -> NOT(not(not(y)))
NOT(and(x, y)) -> NOT(x)
NOT(and(x, y)) -> NOT(not(x))
NOT(and(x, y)) -> NOT(not(not(x)))
NOT(or(x, y)) -> NOT(y)
NOT(or(x, y)) -> NOT(not(y))
NOT(or(x, y)) -> NOT(not(not(y)))
NOT(or(x, y)) -> NOT(x)
NOT(or(x, y)) -> NOT(not(x))
NOT(or(x, y)) -> NOT(not(not(x)))


Rules:


not(not(x)) -> x
not(or(x, y)) -> and(not(not(not(x))), not(not(not(y))))
not(and(x, y)) -> or(not(not(not(x))), not(not(not(y))))


Strategy:

innermost




We have the following set of usable rules:

not(and(x, y)) -> or(not(not(not(x))), not(not(not(y))))
not(not(x)) -> x
not(or(x, y)) -> and(not(not(not(x))), not(not(not(y))))
To remove rules and DPs from this DP problem we used the following monotonic and CE-compatible order: Polynomial ordering.
Polynomial interpretation:
  POL(and(x1, x2))=  1 + x1 + x2  
  POL(NOT(x1))=  x1  
  POL(or(x1, x2))=  1 + x1 + x2  
  POL(not(x1))=  x1  

We have the following set D of usable symbols: {and, NOT, or, not}
The following Dependency Pairs can be deleted as the lhs is strictly greater than the corresponding rhs:

NOT(and(x, y)) -> NOT(y)
NOT(and(x, y)) -> NOT(not(y))
NOT(and(x, y)) -> NOT(not(not(y)))
NOT(and(x, y)) -> NOT(x)
NOT(and(x, y)) -> NOT(not(x))
NOT(and(x, y)) -> NOT(not(not(x)))
NOT(or(x, y)) -> NOT(y)
NOT(or(x, y)) -> NOT(not(y))
NOT(or(x, y)) -> NOT(not(not(y)))
NOT(or(x, y)) -> NOT(x)
NOT(or(x, y)) -> NOT(not(x))
NOT(or(x, y)) -> NOT(not(not(x)))

No Rules can be deleted.

After the removal, there are no SCCs in the dependency graph which results in no DP problems which have to be solved.


Innermost Termination of R successfully shown.
Duration:
0:01 minutes