Certification Problem

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

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 Dependency Pair Transformation

1.1 Monotonic Reduction Pair Processor with Usable Rules

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

• The 1^st component contains the pair

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

  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 -∞ · x1 + 4 5
  [b(x1)]	=	1 0 0 -∞ · x1 + 7 2
  [a(x1)]	=	0 1 -∞ 0 · x1 + 7 5
  [c#(x1)]	=	-∞ 18 -∞ -∞ · x1 + 24 -∞
  [a#(x1)]	=	-∞ 19 -∞ -∞ · x1 + 25 -∞

  together with the usable rules

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

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

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

  could be deleted.

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

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

  c#(c(b(x1)))

  →

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

  (7)

  and no rules could be deleted.

  1.1.1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 1 component.

  • The 1^st component contains the pair

    c#(c(b(x1)))

    →

    c#(x1)

    (4)

    1.1.1.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 + 1
    [b(x1)]	=	x1 + 1
    [c#(x1)]	=	x1 + 0

    having no usable rules (w.r.t. the implicit argument filter of the reduction pair), the pair

    c#(c(b(x1)))

    →

    c#(x1)

    (4)

    and no rules could be deleted.

    1.1.1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.