Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z058)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by NaTT @ termCOMP 2023)

1 Dependency Pair Transformation

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

• The 1^st component contains the pair

  b#(a(b(a(b(b(x1))))))	→	b#(a(x1))	(5)
  b#(a(b(a(b(b(x1))))))	→	b#(b(a(b(b(a(x1))))))	(4)
  b#(a(b(a(b(b(x1))))))	→	b#(b(a(x1)))	(3)
  b#(a(b(a(b(b(x1))))))	→	b#(a(b(b(a(x1)))))	(2)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

  [a(x1)]	=	x1 + 0
  [b(x1)]	=	x1 + 21239
  [b#(x1)]	=	x1 + 0

  together with the usable rule

  b(a(b(a(b(b(x1))))))

  →

  a(b(b(a(b(b(a(x1)))))))

  (1)

  (w.r.t. the implicit argument filter of the reduction pair), the pairs

  b#(a(b(a(b(b(x1))))))	→	b#(a(x1))	(5)
  b#(a(b(a(b(b(x1))))))	→	b#(b(a(x1)))	(3)
  b#(a(b(a(b(b(x1))))))	→	b#(a(b(b(a(x1)))))	(2)

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 1 component.

  • The 1^st component contains the pair

    b#(a(b(a(b(b(x1))))))

    →

    b#(b(a(b(b(a(x1))))))

    (4)

    1.1.1.1.1 Reduction Pair Processor with Usable Rules

    Using the matrix interpretations of dimension 2 with strict dimension 1 over the naturals

    [a(x1)]	=	0 1 0 1 · x1 + 1 0
    [b(x1)]	=	0 1 1 0 · x1 + 0 0
    [b#(x1)]	=	1 1 0 1 · x1 + 0 0

    together with the usable rule

    b(a(b(a(b(b(x1))))))

    →

    a(b(b(a(b(b(a(x1)))))))

    (1)

    (w.r.t. the implicit argument filter of the reduction pair), the pair

    b#(a(b(a(b(b(x1))))))

    →

    b#(b(a(b(b(a(x1))))))

    (4)

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.