Certification Problem

Input (TPDB TRS_Standard/Waldmann_06/jwtpa2)

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

  f#(x,f(a,y))	→	f#(a,x)	(5)
  f#(x,f(a,y))	→	f#(a,f(f(f(a,x),h(a)),y))	(4)
  f#(x,f(a,y))	→	f#(f(f(a,x),h(a)),y)	(2)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

  [a]	=	0
  [h(x1)]	=	0
  [f(x1, x2)]	=	x2 + 1
  [f#(x1, x2)]	=	x1 + x2 + 0

  together with the usable rule

  f(x,f(a,y))

  →

  f(a,f(f(f(a,x),h(a)),y))

  (1)

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

  f#(x,f(a,y))

  →

  f#(a,x)

  (5)

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 1 component.

  • The 1^st component contains the pair

    f#(x,f(a,y))	→	f#(f(f(a,x),h(a)),y)	(2)
    f#(x,f(a,y))	→	f#(a,f(f(f(a,x),h(a)),y))	(4)

    1.1.1.1.1 Reduction Pair Processor with Usable Rules

    Using the Max-polynomial interpretation

    [a]	=	0
    [h(x1)]	=	1
    [f(x1, x2)]	=	x2 + 1
    [f#(x1, x2)]	=	x2 + 0

    together with the usable rule

    f(x,f(a,y))

    →

    f(a,f(f(f(a,x),h(a)),y))

    (1)

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

    f#(x,f(a,y))

    →

    f#(f(f(a,x),h(a)),y)

    (2)

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 1 component.

    • The 1^st component contains the pair

      f#(x,f(a,y))

      →

      f#(a,f(f(f(a,x),h(a)),y))

      (4)

      1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules

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

      [a]	=	1 1
      [h(x1)]	=	1 25469
      [f(x1, x2)]	=	0 0 1 0 · x1 + 0 0 0 1 · x2 + 0 47873
      [f#(x1, x2)]	=	0 1 0 0 · x2 + 0 0

      together with the usable rule

      f(x,f(a,y))

      →

      f(a,f(f(f(a,x),h(a)),y))

      (1)

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

      f#(x,f(a,y))

      →

      f#(a,f(f(f(a,x),h(a)),y))

      (4)

      could be deleted.

      1.1.1.1.1.1.1.1 Dependency Graph Processor

      The dependency pairs are split into 0 components.