Certification Problem

Input (TPDB SRS_Standard/Secret_06_SRS/aprove05)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by ttt2 @ termCOMP 2023)

1 Rule Removal

1.1 Dependency Pair Transformation

1.1.1 Dependency Graph Processor

The dependency pairs are split into 3 components.

• The 1^st component contains the pair

  twoto#(s(x1))

  →

  twoto#(p(s(p(s(x1)))))

  (18)

  1.1.1.1 Reduction Pair Processor with Usable Rules

  Using the linear polynomial interpretation over the arctic semiring over the integers

  [p(x1)]	=	-2 · x1 + 1
  [twoto#(x1)]	=	0 · x1 + 5
  [s(x1)]	=	2 · x1 + 6

  together with the usable rule

  p(s(x1))

  →

  x1

  (6)

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

  twoto#(s(x1))

  →

  twoto#(p(s(p(s(x1)))))

  (18)

  could be deleted.

  1.1.1.1.1 P is empty

  There are no pairs anymore.

• The 2^nd component contains the pair

  twice#(s(x1))

  →

  twice#(p(s(p(s(p(s(p(s(x1)))))))))

  (38)

  1.1.1.2 Reduction Pair Processor with Usable Rules

  Using the linear polynomial interpretation over the arctic semiring over the integers

  [p(x1)]	=	-5 · x1 + 2
  [twice#(x1)]	=	0 · x1 + 0
  [s(x1)]	=	5 · x1 + 4

  together with the usable rule

  p(s(x1))

  →

  x1

  (6)

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

  twice#(s(x1))

  →

  twice#(p(s(p(s(p(s(p(s(x1)))))))))

  (38)

  could be deleted.

  1.1.1.2.1 P is empty

  There are no pairs anymore.

• The 3^rd component contains the pair

  p#(p(s(x1)))

  →

  p#(x1)

  (43)

  1.1.1.3 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)	(43)
  1	>	1

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