Termination Competition 2015 (Demonstration)
General Information wc = 300 a = 1 b = 1 c = 0.1 ( 2015-08-05 19:04:13.66475 UTC ) 8939 pairs, 1874790.2 / 991560.7 s finished in 399688h 22m 26s
Termination of Term Rewriting (and Transition Systems)
finished in 399686h 51m 0s, 1099 pairs, 117905.2 / 66655.6 s
Combined Ranking (Rules):
- 1. AProVE certified (0)
- AProVE 2015 (0)
- Wanda (0)
| category | post-proc | rankings | statistics |
|---|---|---|---|
| TRS Outermost | plain.3 | AProVE 2015 (205), | 279 pairs, 33539.6 / 19824.8 s |
| TRS Innermost certified | ceta-2.20-2 | AProVE certified (269), | 366 pairs, 65369.4 / 30916.9 s |
| TRS Outermost certified | ceta-2.20-2 | AProVE certified (174), | 279 pairs, 16067.6 / 14508.1 s |
| Higher-Order rewriting (union beta) | plain.3 | Wanda (152), | 175 pairs, 2928.6 / 1405.8 s |
Complexity Analysis of Term Rewriting
finished in 399688h 22m 26s, 5536 pairs, 1645750.2 / 840979.2 s
Combined Ranking (Rules):
- 1. TCT3_2015 (2)
- 2. TCT2_20150725 (0)
| category | post-proc | rankings | statistics |
|---|---|---|---|
| Derivational Complexity - Full Rewriting certified | ceta-2.20-2 | TCT3_2015 (428), TCT2_20150725 (0), | 3618 pairs, 966170.3 / 528798.3 s |
| Runtime Complexity - Full Rewriting certified | ceta-2.20-2 | TCT3_2015 (175), TCT2_20150725 (0), | 1918 pairs, 679579.8 / 312180.9 s |
Termination of Programming Languages
finished in 399687h 25m 38s, 2304 pairs, 111134.9 / 83925.9 s
Combined Ranking (Rules):
- 1. AProVE 2015 (0)
| category | post-proc | rankings | statistics |
|---|---|---|---|
| Logic Programming | plain.3 | AProVE 2015 (478), | 633 pairs, 28774.3 / 13060.1 s |
| Functional Programming | plain.3 | AProVE 2015 (1406), | 1671 pairs, 82360.5 / 70865.8 s |