Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z011)

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(x1))	→	a#(c(c(x1)))	(12)
  a#(b(x1))	→	b#(a(x1))	(11)
  b#(c(x1))	→	c#(b(b(x1)))	(10)
  b#(c(x1))	→	b#(x1)	(9)
  a#(b(x1))	→	a#(x1)	(6)
  c#(a(x1))	→	c#(x1)	(5)
  c#(a(x1))	→	c#(c(x1))	(8)
  a#(b(x1))	→	b#(b(a(x1)))	(7)
  b#(c(x1))	→	b#(b(x1))	(4)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

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

  together with the usable rules

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

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

  c#(a(x1))	→	a#(c(c(x1)))	(12)
  a#(b(x1))	→	b#(a(x1))	(11)
  b#(c(x1))	→	c#(b(b(x1)))	(10)
  b#(c(x1))	→	b#(x1)	(9)
  a#(b(x1))	→	b#(b(a(x1)))	(7)
  b#(c(x1))	→	b#(b(x1))	(4)

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 2 components.

  • The 1^st component contains the pair

    a#(b(x1))

    →

    a#(x1)

    (6)

    1.1.1.1.1 Reduction Pair Processor with Usable Rules

    Using the Max-polynomial interpretation

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

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

    a#(b(x1))

    →

    a#(x1)

    (6)

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.

  • The 2^nd component contains the pair

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

    1.1.1.1.2 Reduction Pair Processor with Usable Rules

    Using the Max-polynomial interpretation

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

    together with the usable rules

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

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

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

    could be deleted.

    1.1.1.1.2.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.