Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-450)

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(b(x1))))	→	b#(b(b(b(x1))))	(8)
  b#(b(a(a(x1))))	→	b#(b(x1))	(7)
  b#(a(b(b(x1))))	→	b#(b(b(x1)))	(5)
  b#(b(a(a(x1))))	→	b#(x1)	(4)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

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

  together with the usable rules

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

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

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

  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(b(x1))))

    →

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

    (8)

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

    together with the usable rules

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

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

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

    →

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

    (8)

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.