Term Rewriting System R:
[x, y, z]
f(+(x, 0)) -> f(x)
+(x, +(y, z)) -> +(+(x, y), z)

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

F(+(x, 0)) -> F(x)
+'(x, +(y, z)) -> +'(+(x, y), z)
+'(x, +(y, z)) -> +'(x, y)

Furthermore, R contains two SCCs.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polynomial Ordering`
`       →DP Problem 2`
`         ↳Polo`

Dependency Pair:

F(+(x, 0)) -> F(x)

Rules:

f(+(x, 0)) -> f(x)
+(x, +(y, z)) -> +(+(x, y), z)

Strategy:

innermost

The following dependency pair can be strictly oriented:

F(+(x, 0)) -> F(x)

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(0) =  0 POL(F(x1)) =  x1 POL(+(x1, x2)) =  1 + x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 3`
`             ↳Dependency Graph`
`       →DP Problem 2`
`         ↳Polo`

Dependency Pair:

Rules:

f(+(x, 0)) -> f(x)
+(x, +(y, z)) -> +(+(x, y), z)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`       →DP Problem 2`
`         ↳Polynomial Ordering`

Dependency Pair:

+'(x, +(y, z)) -> +'(x, y)

Rules:

f(+(x, 0)) -> f(x)
+(x, +(y, z)) -> +(+(x, y), z)

Strategy:

innermost

The following dependency pair can be strictly oriented:

+'(x, +(y, z)) -> +'(x, y)

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(+(x1, x2)) =  1 + x1 POL(+'(x1, x2)) =  x2

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`       →DP Problem 2`
`         ↳Polo`
`           →DP Problem 4`
`             ↳Dependency Graph`

Dependency Pair:

Rules:

f(+(x, 0)) -> f(x)
+(x, +(y, z)) -> +(+(x, y), z)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://aprove.informatik.rwth-aachen.de/eval/JAR06/JAR_INN/TRS/SK90/2.04.trs.Thm26:POLO_7172_DP:NO.html.lzma", "fetch_time": 1718502679000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-26/segments/1718198861640.68/warc/CC-MAIN-20240616012706-20240616042706-00849.warc.gz", "warc_record_offset": 86761261, "warc_record_length": 1763, "token_count": 737, "char_count": 2167, "score": 3.640625, "int_score": 4, "crawl": "CC-MAIN-2024-26", "snapshot_type": "latest", "language": "en", "language_score": 0.7267485857009888, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00048-of-00064.parquet"}