Certification Problem

Input (TPDB SRS_Standard/Wenzel_16/abbcaabbca-aabbcabbcaabbc.srs)

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

  a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(b(b(c(x1))))	(2)
  a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(b(b(c(a(b(b(c(a(a(b(b(c(x1)))))))))))))	(3)
  a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(b(b(c(a(a(b(b(c(x1)))))))))	(4)
  a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(a(b(b(c(x1)))))	(5)
  a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(a(b(b(c(a(b(b(c(a(a(b(b(c(x1))))))))))))))	(6)

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

  together with the usable rule

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

  →

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

  (1)

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

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

  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#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(b(b(c(x1))))	(2)
    a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(b(b(c(a(b(b(c(a(a(b(b(c(x1)))))))))))))	(3)
    a#(b(b(c(a(a(b(b(c(a(x1))))))))))	→	a#(b(b(c(a(a(b(b(c(x1)))))))))	(4)

    1.1.1.1.1 Reduction Pair Processor with Usable Rules

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

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

    together with the usable rule

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

    →

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

    (1)

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

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

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.