Certification Problem

Input (TPDB TRS_Standard/AotoYamada_05/024)

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

  app#(app(map,f),app(app(cons,x),xs))	→	app#(app(map,f),xs)	(6)
  app#(app(map,f),app(app(cons,x),xs))	→	app#(f,x)	(4)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the Max-polynomial interpretation

  [nil]	=	1
  [app#(x1, x2)]	=	x1 + 0
  [map]	=	1
  [cons]	=	1
  [app(x1, x2)]	=	x2 + 1

  together with the usable rules

  app(app(map,f),nil)	→	nil	(1)
  app(app(map,f),app(app(cons,x),xs))	→	app(app(cons,app(f,x)),app(app(map,f),xs))	(2)

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

  app#(app(map,f),app(app(cons,x),xs))

  →

  app#(f,x)

  (4)

  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

    app#(app(map,f),app(app(cons,x),xs))

    →

    app#(app(map,f),xs)

    (6)

    1.1.1.1.1 Reduction Pair Processor with Usable Rules

    Using the Max-polynomial interpretation

    [nil]	=	1
    [app#(x1, x2)]	=	x1 + x2 + 0
    [map]	=	1
    [cons]	=	1
    [app(x1, x2)]	=	x2 + 1

    together with the usable rules

    app(app(map,f),nil)	→	nil	(1)
    app(app(map,f),app(app(cons,x),xs))	→	app(app(cons,app(f,x)),app(app(map,f),xs))	(2)

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

    app#(app(map,f),app(app(cons,x),xs))

    →

    app#(app(map,f),xs)

    (6)

    could be deleted.

    1.1.1.1.1.1 Dependency Graph Processor

    The dependency pairs are split into 0 components.