Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/25731)

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

  0#(1(2(1(x1))))	→	0#(1(2(0(1(2(x1))))))	(3)
  0#(1(2(1(x1))))	→	0#(1(2(0(1(2(0(1(2(x1)))))))))	(5)
  0#(1(2(1(x1))))	→	0#(1(2(x1)))	(4)
  0#(1(2(1(x1))))	→	0#(1(2(x1)))	(4)
  0#(1(2(1(x1))))	→	0#(1(2(0(1(2(x1))))))	(3)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the matrix interpretations of dimension 2 with strict dimension 1 over the naturals

  [0#(x1)]	=	0 1 1 0 · x1 + 0 0
  [1(x1)]	=	1 0 1 1 · x1 + 58099 1
  [0(x1)]	=	0 1 0 1 · x1 + 0 145246
  [2(x1)]	=	0 0 1 0 · x1 + 1 29047

  together with the usable rules

  0(1(2(1(x1))))	→	1(2(1(1(0(1(2(0(1(2(x1))))))))))	(1)
  0(1(2(1(x1))))	→	1(2(1(1(0(1(2(0(1(2(0(1(2(x1)))))))))))))	(2)

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

  0#(1(2(1(x1))))	→	0#(1(2(0(1(2(x1))))))	(3)
  0#(1(2(1(x1))))	→	0#(1(2(0(1(2(0(1(2(x1)))))))))	(5)
  0#(1(2(1(x1))))	→	0#(1(2(x1)))	(4)
  0#(1(2(1(x1))))	→	0#(1(2(x1)))	(4)
  0#(1(2(1(x1))))	→	0#(1(2(0(1(2(x1))))))	(3)

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.