YES

Prover = TRS(tech=PATTERN_RULES, nb_unfoldings=unlimited, max_nb_unfolded_rules=200)

** BEGIN proof argument **
All the DP problems were proved finite.
As all the involved DP processors are sound,
the TRS under analysis terminates.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Applying the DP framework...
## Round 1:
  ## DP problem: 
  Dependency pairs = [not^#(and(_0,_1)) -> not^#(_0), not^#(and(_0,_1)) -> not^#(_1), not^#(or(_0,_1)) -> not^#(_0), not^#(or(_0,_1)) -> not^#(_1)]
  TRS = {or(_0,_0) -> _0, and(_0,_0) -> _0, not(not(_0)) -> _0, not(and(_0,_1)) -> or(not(_0),not(_1)), not(or(_0,_1)) -> and(not(_0),not(_1))}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.

** END proof description **

Proof stopped at iteration 0
Number of unfolded rules generated by this proof = 0
Number of unfolded rules generated by all the parallel proofs = 0