Certification Problem

Input (TPDB SRS_Standard/Secret_06_SRS/aprove02)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by AProVE @ termCOMP 2023)

1 Rule Removal

1.1 Dependency Pair Transformation

1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.

• The 1^st component contains the pair

  v#(s(x1))	→	w#(p(p(s(s(p(s(p(s(x1)))))))))	(10)
  w#(s(x1))	→	v#(p(p(s(s(s(p(p(s(s(x1))))))))))	(17)

  1.1.1.1 Switch to Innermost Termination

  The TRS does not have overlaps with the pairs and is locally confluent:

  20

  Hence, it suffices to show innermost termination in the following.

  1.1.1.1.1 Usable Rules Processor

  We restrict the rewrite rules to the following usable rules of the DP problem.

  p(s(x1))	→	x1	(6)
  p(0(x1))	→	0(s(s(s(s(s(s(s(p(s(x1))))))))))	(7)

  1.1.1.1.1.1 Innermost Lhss Removal Processor

  We restrict the innermost strategy to the following left hand sides.

  p(s(x0))

  p(0(x0))

  1.1.1.1.1.1.1 Reduction Pair Processor

  Using the linear polynomial interpretation over the naturals

  [v#(x1)]	=	-2 + x1
  [w#(x1)]	=	x1
  [p(x1)]	=	-2 + x1
  [s(x1)]	=	2 + x1
  [0(x1)]	=	0

  the pair

  w#(s(x1))

  →

  v#(p(p(s(s(s(p(p(s(s(x1))))))))))

  (17)

  could be deleted.

  1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules

  Using the linear polynomial interpretation over the naturals

  [v#(x1)]	=	1 + 1 · x1
  [s(x1)]	=	1 + 1 · x1
  [w#(x1)]	=	1
  [p(x1)]	=	1 + 1 · x1
  [0(x1)]	=	1

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

  v#(s(x1))

  →

  w#(p(p(s(s(p(s(p(s(x1)))))))))

  (10)

  could be deleted.

  1.1.1.1.1.1.1.1.1 P is empty

  There are no pairs anymore.

• The 2^nd component contains the pair

  p#(p(s(x1)))

  →

  p#(x1)

  (22)

  1.1.1.2 Monotonic Reduction Pair Processor with Usable Rules

  Using the linear polynomial interpretation over the naturals

  [p(x1)]	=	1 · x1
  [s(x1)]	=	1 · x1
  [p#(x1)]	=	1 · x1

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

  1.1.1.2.1 Size-Change Termination

  Using size-change termination in combination with the subterm criterion one obtains the following initial size-change graphs.

  p#(p(s(x1)))	→	p#(x1)	(22)
  1	>	1

  As there is no critical graph in the transitive closure, there are no infinite chains.