Certification Problem

Input (TPDB SRS_Standard/Secret_06_SRS/secr6)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 String Reversal

1.1 Dependency Pair Transformation

1.1.1 Monotonic Reduction Pair Processor with Usable Rules

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

• The 1^st component contains the pair

  c#(b(a(x1)))	→	c#(x1)	(8)
  c#(b(a(x1)))	→	c#(c(x1))	(9)
  c#(b(a(x1)))	→	c#(c(c(x1)))	(10)

  1.1.1.1.1 Reduction Pair Processor with Usable Rules

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

  [c(x1)]	=	0 0 0 0 · x1 + -∞ -∞
  [b(x1)]	=	0 2 -2 0 · x1 + -∞ -∞
  [a(x1)]	=	0 0 0 0 · x1 + -∞ -∞
  [c#(x1)]	=	8 9 8 9 · x1 + -∞ -∞

  together with the usable rules

  c(b(a(x1)))	→	a(a(a(b(b(b(c(c(c(x1)))))))))	(6)
  b(c(x1))	→	a(a(a(x1)))	(7)
  a(x1)	→	x1	(3)
  b(x1)	→	x1	(4)
  c(x1)	→	x1	(5)

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

  c#(b(a(x1)))	→	c#(x1)	(8)
  c#(b(a(x1)))	→	c#(c(x1))	(9)
  c#(b(a(x1)))	→	c#(c(c(x1)))	(10)

  could be deleted.

  1.1.1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.