Certification Problem

Input (TPDB TRS_Standard/Rubio_04/gm)

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 2 components.

• The 1^st component contains the pair

  div#(s(X),s(Y))

  →

  div#(minus(X,Y),s(Y))

  (7)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

  [div#(x1, x2)]	=	x1 + 0
  [s(x1)]	=	x1 + 2
  [minus(x1, x2)]	=	x1 + 1
  [div(x1, x2)]	=	0
  [p#(x1)]	=	0
  [p(x1)]	=	x1 + 0
  [0]	=	1
  [minus#(x1, x2)]	=	0

  together with the usable rules

  minus(X,0)	→	X	(1)
  p(s(X))	→	X	(3)
  minus(s(X),s(Y))	→	p(minus(X,Y))	(2)

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

  div#(s(X),s(Y))

  →

  div#(minus(X,Y),s(Y))

  (7)

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.

• The 2^nd component contains the pair

  minus#(s(X),s(Y))

  →

  minus#(X,Y)

  (6)

  1.1.2 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

  [div#(x1, x2)]	=	x1 + 0
  [s(x1)]	=	x1 + 2
  [minus(x1, x2)]	=	x1 + 1
  [div(x1, x2)]	=	0
  [p#(x1)]	=	0
  [p(x1)]	=	x1 + 0
  [0]	=	1
  [minus#(x1, x2)]	=	x1 + x2 + 0

  together with the usable rules

  minus(X,0)	→	X	(1)
  p(s(X))	→	X	(3)
  minus(s(X),s(Y))	→	p(minus(X,Y))	(2)

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

  minus#(s(X),s(Y))

  →

  minus#(X,Y)

  (6)

  could be deleted.

  1.1.2.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.