Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z047)

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

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

  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)]	=	x1 + 51668 1
  [b(x1)]	=	0 0 1 0 · x1 + 28579 51666
  [c(x1)]	=	0 1 1 1 · x1 + 0 74755
  [c#(x1)]	=	0 1 1 1 · x1 + 0 0

  together with the usable rule

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

  →

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

  (1)

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

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

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.