Certification Problem

Input (TPDB TRS_Standard/AG01/#3.41)

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

  fac#(s(x))

  →

  fac#(p(s(x)))

  (5)

  1.1.1 Reduction Pair Processor with Usable Rules

  Using the argument filter

  π(fac#)

  =

  1

  in combination with the following Weighted Path Order with the following precedence and status

  prec(s)	=	1		status(s)	=	[1]		list-extension(s)	=	Lex
  prec(p#)	=	0		status(p#)	=	[]		list-extension(p#)	=	Lex
  prec(p)	=	0		status(p)	=	[]		list-extension(p)	=	Lex
  prec(0)	=	0		status(0)	=	[]		list-extension(0)	=	Lex
  prec(times)	=	0		status(times)	=	[]		list-extension(times)	=	Lex
  prec(fac)	=	0		status(fac)	=	[]		list-extension(fac)	=	Lex

  and the following Max-polynomial interpretation

  [s(x1)]	=	x1 + 2438
  [p#(x1)]	=	1
  [p(x1)]	=	x1 + 0
  [0]	=	0
  [times(x1, x2)]	=	x2 + 1
  [fac(x1)]	=	1

  together with the usable rule

  p(s(x))

  →

  x

  (1)

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

  fac#(s(x))

  →

  fac#(p(s(x)))

  (5)

  could be deleted.

  1.1.1.1 Dependency Graph Processor

  The dependency pairs are split into 0 components.