Certification Problem

Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-106)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by matchbox @ 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#(b(x1))	→	a#(x1)	(4)
  a#(a(b(x1)))	→	c#(a(x1))	(5)
  a#(a(b(x1)))	→	a#(x1)	(6)

  1.1.1 Reduction Pair Processor with Usable Rules

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

  [c(x1)]	=	-∞ 0 0 -∞ 0 0 -∞ -∞ 0 · x1 + 0 -∞ -∞
  [b(x1)]	=	0 -∞ -∞ -∞ -∞ 15 0 0 0 · x1 + -∞ 4 0
  [a(x1)]	=	0 0 15 0 0 0 0 -∞ 0 · x1 + 4 0 -∞
  [c#(x1)]	=	0 -∞ 1 -∞ -∞ -∞ -∞ -∞ -∞ · x1 + -∞ -∞ -∞
  [a#(x1)]	=	0 1 -∞ -∞ -∞ -∞ -∞ -∞ -∞ · x1 + -∞ -∞ -∞

  together with the usable rules

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

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

  a#(a(b(x1)))	→	c#(a(x1))	(5)
  a#(a(b(x1)))	→	a#(x1)	(6)

  could be deleted.

  1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

  Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1

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

  together with the usable rules

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

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

  c#(b(x1))

  →

  a#(x1)

  (4)

  and no rules could be deleted.

  1.1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.