The following experimental results were obtained from our collection of programs, transformed by HOCA using defunctionalisation and simplifications.

The indicated results were obtained with TcT, version 2.1 to infer complexity bounds, TTT2, version 1.15 was used to check termination. Both tools were employed in their default configuration.

All experiments were performed on a machine with 16 core AMD Opteron(R) 885 Dual-Core @ 2.80GHz processors with 8x8 GB Memory. All runs were aborted after a timeout of 60 seconds.

Overview

	TTT2		TcT
	# systems	time	# systems	time

		-		0.231
O(1)	-	-	2	0.508
		-		0.785

		-		0.231
O(n^1)	-	-	14	2.525
		-		14.002

		-		0.231
O(n^2)	-	-	18	6.296
		-		30.116

		-		0.231
POLY	-	-	20	10.941
		-		60.101

		0.721		0.231
Total YES	25	1.434	20	10.941
		3.430		60.101

		-		60.090
Total MAYBE	-	-	5	60.116
		-		60.201

Details

	TTT2		TcT
Problem (all selected)	answer	time	answer	time
dfs-flatten	YES	0.933	O(n^1)	2.090
evenodd	YES	0.781	O(n^1)	0.669
fib llist	YES	2.610	MAYBE	60.090
fib memo	YES	3.236	MAYBE	60.099
flatten	YES	1.164	O(n^1)	4.454
flip	YES	0.820	O(n^1)	0.402
foldsum	YES	1.575	O(n^1)	4.456
id	YES	0.911	O(n^1)	1.347
isort	YES	1.026	O(n^2)	28.336
isort-fold	YES	1.012	O(n^2)	30.116
mappplus	YES	0.923	O(n^2)	7.259
mergesort-dc	YES	3.430	MAYBE	60.098
mss	YES	1.786	POLY	45.385
okasaki-parser-ab	YES	0.981	O(1)	0.785
okasaki-parser-anbn	YES	1.811	MAYBE	60.201
okasaki-parser-string	YES	2.045	O(n^1)	14.002
pred	YES	0.721	O(1)	0.231
rev	YES	1.229	O(n^2)	12.278
rev-dl	YES	0.947	O(n^1)	2.457
rev-fletf	YES	1.041	O(n^1)	1.888
rev-foldl	YES	0.876	O(n^1)	0.892
rpm-lazy	YES	3.167	MAYBE	60.094
sum	YES	0.849	O(n^1)	1.322
sum sqs3	YES	1.200	POLY	60.101
take lazy	YES	0.788	O(n^1)	0.352