Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-215)

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

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

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

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

  together with the usable rules

  a(a(b(a(x1))))	→	a(a(a(a(x1))))	(1)
  a(a(a(b(x1))))	→	b(a(b(a(x1))))	(2)

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

  a#(a(b(a(x1))))	→	a#(a(a(x1)))	(7)
  a#(a(b(a(x1))))	→	a#(a(x1))	(4)
  a#(a(a(b(x1))))	→	a#(x1)	(3)

  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

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

    →

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

    (5)

    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)]	=	1 1 1 1 · x1 + 1 1
    [b(x1)]	=	1 1 1 1 · x1 + 2749 1
    [a#(x1)]	=	1 1 1 1 · x1 + 0 0

    together with the usable rules

    a(a(b(a(x1))))	→	a(a(a(a(x1))))	(1)
    a(a(a(b(x1))))	→	b(a(b(a(x1))))	(2)

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

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

    →

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

    (5)

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.