Certification Problem

Input (TPDB TRS_Standard/AG01/#3.42)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by AProVE @ termCOMP 2023)

1 Switch to Innermost Termination

The TRS is overlay and locally confluent:

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

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

  conv#(s(x))

  →

  conv#(half(s(x)))

  (11)

  1.1.1.1 Usable Rules Processor

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

  half(s(0))	→	0	(2)
  half(s(s(x)))	→	s(half(x))	(3)
  half(0)	→	0	(1)

  1.1.1.1.1 Innermost Lhss Removal Processor

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

  half(0)

  half(s(0))

  half(s(s(x0)))

  1.1.1.1.1.1 Monotonic Reduction Pair Processor

  Using the linear polynomial interpretation over the naturals

  [half(x1)]	=	1 · x1
  [s(x1)]	=	2 + 1 · x1
  [0]	=	0
  [conv#(x1)]	=	2 · x1

  the rules

  half(s(0))	→	0	(2)
  half(s(s(x)))	→	s(half(x))	(3)
  lastbit(0)	→	0	(4)
  lastbit(s(0))	→	s(0)	(5)
  lastbit(s(s(x)))	→	lastbit(x)	(6)
  conv(0)	→	cons(nil,0)	(7)
  conv(s(x))	→	cons(conv(half(s(x))),lastbit(s(x)))	(8)

  could be deleted.

  1.1.1.1.1.1.1 Usable Rules Processor

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

  There are no rules.

  1.1.1.1.1.1.1.1 Switch to TRS Processor

  We merge the DPs and rules into one TRS.

  1.1.1.1.1.1.1.1.1 Bounds

  The given TRS is match-(raise)-bounded by 1. This is shown by the following automaton.

  • final states:

    {0, 1, 2}

  • transitions:

    conv#0(0)	→	0
    conv#0(1)	→	0
    conv#0(2)	→	0
    s0(0)	→	1
    s0(1)	→	1
    s0(2)	→	1
    half0(0)	→	2
    half0(1)	→	2
    half0(2)	→	2
    s1(0)	→	4
    half1(4)	→	3
    conv#1(3)	→	0
    s1(1)	→	4
    s1(2)	→	4

• The 2^nd component contains the pair

  half#(s(s(x)))

  →

  half#(x)

  (9)

  1.1.1.2 Usable Rules Processor

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

  There are no rules.

  1.1.1.2.1 Innermost Lhss Removal Processor

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

  There are no lhss.

  1.1.1.2.1.1 Size-Change Termination

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

  half#(s(s(x)))	→	half#(x)	(9)
  1	>	1

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

• The 3^rd component contains the pair

  lastbit#(s(s(x)))

  →

  lastbit#(x)

  (10)

  1.1.1.3 Usable Rules Processor

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

  There are no rules.

  1.1.1.3.1 Innermost Lhss Removal Processor

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

  There are no lhss.

  1.1.1.3.1.1 Size-Change Termination

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

  lastbit#(s(s(x)))	→	lastbit#(x)	(10)
  1	>	1

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