Certification Problem

Input (TPDB TRS_Standard/Beerendonk_07/3)

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

  cond#(true,x,y)

  →

  cond#(gr(x,y),x,add(x,y))

  (7)

  1.1.1.1 Usable Rules Processor

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

  gr(0,x)	→	false	(2)
  gr(s(x),0)	→	true	(3)
  gr(s(x),s(y))	→	gr(x,y)	(4)
  add(0,x)	→	x	(5)
  add(s(x),y)	→	s(add(x,y))	(6)

  1.1.1.1.1 Innermost Lhss Removal Processor

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

  gr(0,x0)

  gr(s(x0),0)

  gr(s(x0),s(x1))

  add(0,x0)

  add(s(x0),x1)

  1.1.1.1.1.1 Reduction Pair Processor

  We apply the generic reduction pair processor using the linear polynomial interpretation over the naturals

  [c]	=	-1
  [cond#(x1, x2, x3)]	=	-1 · x1 + 1 · x2 + -1 · x3 + -1
  [true]	=	0
  [gr(x1, x2)]	=	0
  [add(x1, x2)]	=	1 · x1
  [0]	=	0
  [false]	=	0
  [s(x1)]	=	1 · x1 + 1

  The pair(s)

  cond#(true,x,y)

  →

  cond#(gr(x,y),x,add(x,y))

  (7)

  are strictly oriented and the pair(s)

  cond#(true,x,y)

  →

  cond#(gr(x,y),x,add(x,y))

  (7)

  are bounded w.r.t. the constant c.

  The following constraints are generated for the pairs.

  • cond^#(true,s(x5),0)≥c
  • (cond^#(true,x7,x6)≥c⟹cond^#(true,s(x7),s(x6))≥c)
  • cond^#(true,s(x5),0) > cond^#(gr(s(x5),0),s(x5),add(s(x5),0))
  • (cond^#(true,x7,x6) > cond^#(gr(x7,x6),x7,add(x7,x6))⟹cond^#(true,s(x7),s(x6)) > cond^#(gr(s(x7),s(x6)),s(x7),add(s(x7),s(x6))))

  The details are shown below:

  • For the chain we build the initial constraint

    (cond^#(gr(x0,x1),x0,add(x0,x1))→^*cond^#(true,x2,x3)⟹cond^#(true,x0,x1)≥c)

    which is simplified as follows.

    • Applying Rule "Same Constructor" results in
      (gr(x0,x1)→^*true⟹x0→^*x2⟹add(x0,x1)→^*x3⟹cond^#(true,x0,x1)≥c)
    • Applying Rule "Delete Conditions" results in
      (gr(x0,x1)→^*true⟹add(x0,x1)→^*x3⟹cond^#(true,x0,x1)≥c)
    • Applying Rule "Delete Conditions" results in
      (gr(x0,x1)→^*true⟹cond^#(true,x0,x1)≥c)
    • Applying Rule "Induction" on gr(x0,x1)→^*true results in the following 3 new constraints.
      1. (false→^*true⟹cond^#(true,0,x4)≥c)
         • Applying Rule "Different Constructors" allows to drop this constraint.
      2. (true→^*true⟹cond^#(true,s(x5),0)≥c)
         • Applying Rule "Same Constructor" results in
           cond^#(true,s(x5),0)≥c

         • This constraint is kept as final constraint.

      3. (gr(x7,x6)→^*true⟹(gr(x7,x6)→^*true⟹cond^#(true,x7,x6)≥c)⟹cond^#(true,s(x7),s(x6))≥c)
         • Applying Rule "Simplify Conditions" results in
           (cond^#(true,x7,x6)≥c⟹cond^#(true,s(x7),s(x6))≥c)

         • This constraint is kept as final constraint.

  • For the chain we build the initial constraint

    (cond^#(gr(x0,x1),x0,add(x0,x1))→^*cond^#(true,x2,x3)⟹cond^#(true,x0,x1) > cond^#(gr(x0,x1),x0,add(x0,x1)))

    which is simplified as follows.

    • Applying Rule "Same Constructor" results in
      (gr(x0,x1)→^*true⟹x0→^*x2⟹add(x0,x1)→^*x3⟹cond^#(true,x0,x1) > cond^#(gr(x0,x1),x0,add(x0,x1)))
    • Applying Rule "Delete Conditions" results in
      (gr(x0,x1)→^*true⟹add(x0,x1)→^*x3⟹cond^#(true,x0,x1) > cond^#(gr(x0,x1),x0,add(x0,x1)))
    • Applying Rule "Delete Conditions" results in
      (gr(x0,x1)→^*true⟹cond^#(true,x0,x1) > cond^#(gr(x0,x1),x0,add(x0,x1)))
    • Applying Rule "Induction" on gr(x0,x1)→^*true results in the following 3 new constraints.
      1. (false→^*true⟹cond^#(true,0,x4) > cond^#(gr(0,x4),0,add(0,x4)))
         • Applying Rule "Different Constructors" allows to drop this constraint.
      2. (true→^*true⟹cond^#(true,s(x5),0) > cond^#(gr(s(x5),0),s(x5),add(s(x5),0)))
         • Applying Rule "Same Constructor" results in
           cond^#(true,s(x5),0) > cond^#(gr(s(x5),0),s(x5),add(s(x5),0))

         • This constraint is kept as final constraint.

      3. (gr(x7,x6)→^*true⟹(gr(x7,x6)→^*true⟹cond^#(true,x7,x6) > cond^#(gr(x7,x6),x7,add(x7,x6)))⟹cond^#(true,s(x7),s(x6)) > cond^#(gr(s(x7),s(x6)),s(x7),add(s(x7),s(x6))))
         • Applying Rule "Simplify Conditions" results in
           (cond^#(true,x7,x6) > cond^#(gr(x7,x6),x7,add(x7,x6))⟹cond^#(true,s(x7),s(x6)) > cond^#(gr(s(x7),s(x6)),s(x7),add(s(x7),s(x6))))

         • This constraint is kept as final constraint.

  We remove those pairs which are strictly decreasing and bounded.

  1.1.1.1.1.1.1 P is empty

  There are no pairs anymore.

• The 2^nd component contains the pair

  gr#(s(x),s(y))

  →

  gr#(x,y)

  (10)

  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.

  gr#(s(x),s(y))	→	gr#(x,y)	(10)
  1	>	1
  2	>	2

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

• The 3^rd component contains the pair

  add#(s(x),y)

  →

  add#(x,y)

  (11)

  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.

  add#(s(x),y)	→	add#(x,y)	(11)
  1	>	1
  2	≥	2

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