Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/212308)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by AProVE @ termCOMP 2023)

1 String Reversal

1.1 Closure Under Flat Contexts

{0(☐), 1(☐), 2(☐), 3(☐), 4(☐), 5(☐)}

There are 199 ruless (increase limit for explicit display).

1.1.1 Semantic Labeling

Root-labeling is applied.

There are 1194 ruless (increase limit for explicit display).

1.1.1.1 Rule Removal

There are 1163 ruless (increase limit for explicit display).

1.1.1.1.1 Dependency Pair Transformation

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.

• The 1^st component contains the pair

  40#(04(44(41(14(44(x1))))))

  →

  40#(04(44(x1)))

  (1520)

  1.1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

  Using the linear polynomial interpretation over the naturals

  [04(x1)]	=	1 · x1
  [44(x1)]	=	1 · x1
  [41(x1)]	=	1 · x1
  [14(x1)]	=	1 · x1
  [40#(x1)]	=	1 · x1

  having no usable rules (w.r.t. the implicit argument filter of the reduction pair), the rule could be deleted.

  1.1.1.1.1.1.1.1 Reduction Pair Processor

  Using the linear polynomial interpretation over the naturals

  [40#(x1)]	=	2 + 2 · x1
  [04(x1)]	=	1 + 2 · x1
  [44(x1)]	=	2 · x1
  [41(x1)]	=	2 · x1
  [14(x1)]	=	2 + 2 · x1

  the pair

  40#(04(44(41(14(44(x1))))))

  →

  40#(04(44(x1)))

  (1520)

  could be deleted.

  1.1.1.1.1.1.1.1.1 P is empty

  There are no pairs anymore.

• The 2^nd component contains the pair

  10#(00(01(14(41(x1)))))

  →

  10#(00(01(x1)))

  (1492)

  1.1.1.1.1.1.2 Monotonic Reduction Pair Processor with Usable Rules

  Using the linear polynomial interpretation over the naturals

  [00(x1)]	=	1 · x1
  [01(x1)]	=	1 · x1
  [13(x1)]	=	1 · x1
  [31(x1)]	=	1 · x1
  [03(x1)]	=	1 · x1
  [11(x1)]	=	1 · x1
  [14(x1)]	=	1 · x1
  [41(x1)]	=	1 · x1
  [10#(x1)]	=	1 · x1

  together with the usable rule

  00(01(13(31(x1))))

  →

  00(03(31(11(11(11(x1))))))

  (334)

  (w.r.t. the implicit argument filter of the reduction pair), the rule could be deleted.

  1.1.1.1.1.1.2.1 Switch to Innermost Termination

  The TRS does not have overlaps with the pairs and is locally confluent:

  20

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

  1.1.1.1.1.1.2.1.1 Reduction Pair Processor

  Using the linear polynomial interpretation over the naturals

  [10#(x1)]	=	1 · x1
  [00(x1)]	=	1 · x1
  [01(x1)]	=	1 + 1 · x1
  [14(x1)]	=	1 + 1 · x1
  [41(x1)]	=	1 + 1 · x1
  [13(x1)]	=	1 + 1 · x1
  [31(x1)]	=	1 + 1 · x1
  [03(x1)]	=	1 + 1 · x1
  [11(x1)]	=	1

  the pair

  10#(00(01(14(41(x1)))))

  →

  10#(00(01(x1)))

  (1492)

  could be deleted.

  1.1.1.1.1.1.2.1.1.1 P is empty

  There are no pairs anymore.