experiment

	TcTAra			TcTNoAra			AraTrs			AraTrsHeuristics			AraTrsCostFree			Aprove
Problem (all selected)	*	answer		*	answer		*	answer		*	answer		*	answer		*	answer
#3.42	*	WORST_CASE(?,O(n^1))	7.37	*	WORST_CASE(?,O(n^2))	25.25	*	WORST_CASE(?,O(n^1))	0.25	*	WORST_CASE(?,O(n^1))	0.38	*	WORST_CASE(?,O(n^1))	0.65	*	TIMEOUT	60.06
4.61	*	MAYBE	57.64	*	MAYBE	56.58	*	MAYBE	10.98	*	MAYBE	0.87	*	MAYBE	21.40	*	MAYBE	1.41
String0_prefix.raml	*	WORST_CASE(?,O(n^1))	3.98	*	WORST_CASE(?,O(n^1))	3.26	*	WORST_CASE(?,O(n^1))	0.74	*	MAYBE	0.60	*	WORST_CASE(?,O(n^1))	1.90	*	WORST_CASE(?,O(n^1))	1.85
String0_string_dec.raml	*	WORST_CASE(?,O(n^1))	5.92	*	WORST_CASE(?,O(n^1))	3.97	*	WORST_CASE(?,O(n^1))	0.85	*	MAYBE	0.75	*	WORST_CASE(?,O(n^1))	3.10	*	WORST_CASE(?,O(n^1))	1.93
ack	*	MAYBE	37.78	*	MAYBE	56.20	*	MAYBE	0.94	*	MAYBE	0.30	*	MAYBE	2.67	*	TIMEOUT	60.01
add	*	WORST_CASE(?,O(n^1))	2.42	*	WORST_CASE(?,O(n^1))	0.64	*	WORST_CASE(?,O(n^1))	0.46	*	MAYBE	0.27	*	WORST_CASE(?,O(n^1))	0.91	*	WORST_CASE(?,O(n^1))	1.76
addition	*	WORST_CASE(?,O(n^1))	1.73	*	WORST_CASE(?,O(n^1))	0.50	*	WORST_CASE(?,O(n^1))	0.52	*	WORST_CASE(?,O(n^1))	0.24	*	WORST_CASE(?,O(n^1))	0.63	*	WORST_CASE(?,O(n^1))	2.60
addlists	*	WORST_CASE(?,O(n^1))	1.43	*	WORST_CASE(?,O(n^1))	1.65	*	WORST_CASE(?,O(n^1))	0.39	*	MAYBE	0.19	*	WORST_CASE(?,O(n^1))	1.02	*	WORST_CASE(?,O(n^1))	0.96
anchored	*	WORST_CASE(?,O(n^1))	1.50	*	WORST_CASE(?,O(n^1))	0.75	*	WORST_CASE(?,O(n^1))	0.22	*	MAYBE	0.14	*	WORST_CASE(?,O(n^1))	0.41	*	WORST_CASE(?,O(n^1))	1.22
append	*	WORST_CASE(?,O(n^1))	1.40	*	WORST_CASE(?,O(n^1))	0.45	*	WORST_CASE(?,O(n^1))	0.40	*	WORST_CASE(?,O(n^1))	0.17	*	WORST_CASE(?,O(n^1))	0.33	*	WORST_CASE(?,O(n^1))	1.87
appendAll.raml	*	WORST_CASE(?,O(n^1))	14.02	*	WORST_CASE(?,O(n^1))	6.95	*	MAYBE	1.40	*	MAYBE	0.52	*	WORST_CASE(?,O(n^2))	10.49	*	WORST_CASE(?,O(n^1))	7.58
assrewrite	*	MAYBE	56.16	*	MAYBE	56.27	*	MAYBE	12.72	*	MAYBE	1.24	*	TIMEOUT	60.06	*	TIMEOUT	60.06
badd	*	MAYBE	20.91	*	MAYBE	39.02	*	MAYBE	0.33	*	MAYBE	0.15	*	MAYBE	0.55	*	MAYBE	1.58
bfs.raml	*	WORST_CASE(?,O(n^3))	54.43	*	TIMEOUT	60.07	*	MAYBE	7.61	*	MAYBE	1.77	*	TIMEOUT	60.06	*	TIMEOUT	60.01
bft_mmult.raml	*	TIMEOUT	60.00	*	TIMEOUT	60.06	*	MAYBE	11.84	*	MAYBE	4.12	*	TIMEOUT	60.06	*	TIMEOUT	60.00
binom	*	MAYBE	56.29	*	MAYBE	56.60	*	MAYBE	4.22	*	MAYBE	1.21	*	MAYBE	9.34	*	MAYBE	2.50
binomialHeaps.okasaki	*	TIMEOUT	60.06	*	TIMEOUT	60.06	*	MAYBE	37.00	*	MAYBE	4.59	*	TIMEOUT	60.07	*	TIMEOUT	60.00
binomialHeaps_insTree.okasaki	*	WORST_CASE(?,O(n^1))	9.19	*	WORST_CASE(?,O(n^1))	7.34	*	WORST_CASE(?,O(n^1))	3.00	*	WORST_CASE(?,O(n^2))	1.53	*	WORST_CASE(?,O(n^1))	2.15	*	WORST_CASE(?,O(n^1))	9.32
binomialHeaps_merge.okasaki	*	TIMEOUT	60.00	*	TIMEOUT	60.06	*	MAYBE	57.52	*	MAYBE	6.47	*	TIMEOUT	60.06	*	TIMEOUT	60.02
bitonic.raml	*	MAYBE	58.83	*	MAYBE	56.35	*	MAYBE	16.55	*	MAYBE	2.71	*	TIMEOUT	60.06	*	TIMEOUT	60.00
bits	*	WORST_CASE(?,O(n^1))	7.17	*	WORST_CASE(?,O(n^1))	7.51	*	WORST_CASE(?,O(n^1))	0.52	*	WORST_CASE(?,O(n^1))	0.36	*	WORST_CASE(?,O(n^1))	0.54	*	TIMEOUT	60.06
bitvectors.raml	*	MAYBE	56.57	*	MAYBE	56.13	*	MAYBE	35.09	*	MAYBE	11.30	*	TIMEOUT	60.06	*	TIMEOUT	60.00
bottomUpMergeSort.okasaki	*	MAYBE	56.63	*	MAYBE	57.00	*	MAYBE	5.07	*	MAYBE	1.38	*	MAYBE	20.74	*	TIMEOUT	60.06
btree_lookup	*	WORST_CASE(?,O(n^1))	4.86	*	WORST_CASE(?,O(n^1))	7.22	*	WORST_CASE(?,O(n^1))	0.51	*	MAYBE	0.21	*	WORST_CASE(?,O(n^1))	1.55	*	WORST_CASE(?,O(n^1))	6.21
btree_takeWhile	*	MAYBE	56.46	*	MAYBE	57.12	*	MAYBE	3.28	*	MAYBE	0.83	*	MAYBE	22.14	*	MAYBE	1.01
bubblesort-nat	*	WORST_CASE(?,O(n^2))	32.05	*	WORST_CASE(?,O(n^2))	25.50	*	MAYBE	3.25	*	MAYBE	0.92	*	MAYBE	59.36	*	TIMEOUT	60.05
clevermmult.raml	*	MAYBE	59.10	*	MAYBE	56.67	*	MAYBE	5.60	*	MAYBE	1.97	*	TIMEOUT	60.06	*	TIMEOUT	60.05
clique	*	WORST_CASE(?,O(n^3))	25.75	*	WORST_CASE(?,O(n^3))	25.23	*	TIMEOUT	60.06	*	TIMEOUT	60.06	*	TIMEOUT	60.06	*	TIMEOUT	60.06
cube	*	WORST_CASE(?,O(n^4))	56.38	*	WORST_CASE(?,O(n^4))	56.46	*	MAYBE	1.11	*	MAYBE	0.65	*	MAYBE	2.53	*	TIMEOUT	60.00
dcquad	*	WORST_CASE(?,O(n^2))	49.10	*	WORST_CASE(?,O(n^2))	5.05	*	MAYBE	1.97	*	MAYBE	0.46	*	MAYBE	4.54	*	TIMEOUT	60.06
decrease	*	WORST_CASE(?,O(n^1))	6.83	*	TIMEOUT	60.10	*	WORST_CASE(?,O(n^1))	2.84	*	MAYBE	1.08	*	WORST_CASE(?,O(n^1))	6.63	*	WORST_CASE(?,O(n^1))	1.73
dense.okasaki	*	WORST_CASE(?,O(n^1))	12.85	*	WORST_CASE(?,O(n^1))	7.12	*	MAYBE	4.71	*	MAYBE	1.44	*	WORST_CASE(?,O(n^2))	11.99	*	WORST_CASE(?,O(n^1))	2.50
dfs-flatten	*	WORST_CASE(?,O(n^1))	3.08	*	WORST_CASE(?,O(n^1))	3.02	*	WORST_CASE(?,O(n^1))	0.34	*	MAYBE	0.19	*	WORST_CASE(?,O(n^1))	0.35	*	WORST_CASE(?,O(n^1))	1.16
disjconj	*	MAYBE	56.22	*	MAYBE	56.26	*	MAYBE	11.01	*	MAYBE	2.03	*	MAYBE	9.77	*	MAYBE	1.35
duplicates.raml	*	WORST_CASE(?,O(n^2))	50.60	*	WORST_CASE(?,O(n^2))	50.41	*	MAYBE	4.18	*	MAYBE	0.87	*	TIMEOUT	60.06	*	TIMEOUT	60.03
dyade	*	WORST_CASE(?,O(n^2))	5.87	*	WORST_CASE(?,O(n^2))	8.88	*	MAYBE	0.48	*	MAYBE	0.18	*	MAYBE	1.50	*	WORST_CASE(?,O(n^2))	5.49
dyade.raml	*	WORST_CASE(?,O(n^2))	24.19	*	WORST_CASE(?,O(n^2))	19.98	*	MAYBE	2.63	*	MAYBE	1.05	*	MAYBE	35.39	*	TIMEOUT	60.05
egypt	*	WORST_CASE(?,O(n^1))	17.26	*	TIMEOUT	60.13	*	WORST_CASE(?,O(n^1))	1.78	*	MAYBE	1.04	*	WORST_CASE(?,O(n^1))	3.24	*	WORST_CASE(?,O(n^1))	10.45
eq	*	WORST_CASE(?,O(1))	0.45	*	WORST_CASE(?,O(1))	0.14	*	WORST_CASE(?,O(1))	0.18	*	WORST_CASE(?,O(1))	0.13	*	WORST_CASE(?,O(1))	0.18	*	WORST_CASE(?,O(1))	2.72
eratosthenes	*	MAYBE	58.96	*	TIMEOUT	60.06	*	MAYBE	12.21	*	MAYBE	4.66	*	TIMEOUT	60.06	*	TIMEOUT	60.01
evenodd	*	WORST_CASE(?,O(n^1))	1.27	*	WORST_CASE(?,O(n^1))	1.33	*	WORST_CASE(?,O(n^1))	0.15	*	MAYBE	0.16	*	WORST_CASE(?,O(n^1))	0.27	*	WORST_CASE(?,O(n^1))	0.84
exp	*	MAYBE	56.09	*	MAYBE	56.06	*	MAYBE	0.87	*	MAYBE	0.46	*	MAYBE	1.72	*	TIMEOUT	60.02
fib_llist	*	MAYBE	56.55	*	MAYBE	56.41	*	MAYBE	32.15	*	MAYBE	2.08	*	TIMEOUT	60.06	*	TIMEOUT	60.00
flatten	*	WORST_CASE(?,O(n^1))	1.62	*	WORST_CASE(?,O(n^1))	1.29	*	WORST_CASE(?,O(n^1))	1.05	*	MAYBE	0.21	*	WORST_CASE(?,O(n^1))	0.55	*	WORST_CASE(?,O(n^1))	1.50
flatten.raml	*	WORST_CASE(?,O(n^3))	57.15	*	WORST_CASE(?,O(n^2))	33.09	*	MAYBE	3.97	*	MAYBE	2.04	*	MAYBE	48.77	*	TIMEOUT	60.04
flatten_hoca	*	WORST_CASE(?,O(n^1))	9.48	*	WORST_CASE(?,O(n^1))	3.17	*	WORST_CASE(?,O(n^1))	1.26	*	MAYBE	0.79	*	WORST_CASE(?,O(n^1))	2.95	*	WORST_CASE(?,O(n^1))	1.86
flip	*	WORST_CASE(?,O(n^1))	1.69	*	WORST_CASE(?,O(n^1))	0.45	*	WORST_CASE(?,O(n^1))	0.45	*	WORST_CASE(?,O(n^1))	0.26	*	WORST_CASE(?,O(n^1))	0.21	*	WORST_CASE(?,O(n^1))	5.48
foldsum	*	WORST_CASE(?,O(n^1))	13.08	*	WORST_CASE(?,O(n^1))	7.45	*	WORST_CASE(?,O(n^1))	1.40	*	MAYBE	0.59	*	WORST_CASE(?,O(n^1))	1.73	*	WORST_CASE(?,O(n^1))	2.47
game	*	WORST_CASE(?,O(n^1))	3.96	*	WORST_CASE(?,O(n^1))	2.28	*	WORST_CASE(?,O(n^1))	0.52	*	MAYBE	0.44	*	WORST_CASE(?,O(n^1))	1.03	*	WORST_CASE(?,O(n^1))	1.33
gcd	*	MAYBE	56.24	*	MAYBE	56.44	*	MAYBE	2.70	*	MAYBE	0.33	*	MAYBE	58.54	*	TIMEOUT	60.01
id	*	WORST_CASE(?,O(n^1))	1.21	*	WORST_CASE(?,O(n^1))	0.74	*	WORST_CASE(?,O(n^1))	0.26	*	WORST_CASE(?,O(n^1))	0.17	*	WORST_CASE(?,O(n^1))	0.42	*	WORST_CASE(?,O(n^1))	1.48
id_hoca	*	WORST_CASE(?,O(n^1))	2.79	*	WORST_CASE(?,O(n^1))	1.76	*	WORST_CASE(?,O(n^1))	0.61	*	WORST_CASE(?,O(n^1))	0.53	*	WORST_CASE(?,O(n^1))	0.54	*	WORST_CASE(?,O(n^1))	1.51
insertionsort.raml	*	WORST_CASE(?,O(n^3))	56.74	*	WORST_CASE(?,O(n^2))	43.03	*	MAYBE	4.05	*	MAYBE	1.41	*	TIMEOUT	60.06	*	TIMEOUT	60.04
intlookup	*	MAYBE	33.19	*	MAYBE	44.57	*	MAYBE	0.78	*	MAYBE	0.17	*	MAYBE	1.27	*	MAYBE	1.52
isort	*	WORST_CASE(?,O(n^2))	22.49	*	WORST_CASE(?,O(n^2))	14.97	*	MAYBE	1.60	*	MAYBE	0.64	*	WORST_CASE(?,O(n^2))	4.52	*	TIMEOUT	60.06
isort-fold	*	WORST_CASE(?,O(n^2))	24.36	*	WORST_CASE(?,O(n^2))	25.40	*	MAYBE	1.57	*	MAYBE	0.33	*	WORST_CASE(?,O(n^2))	9.59	*	TIMEOUT	60.06
isort_hoca	*	WORST_CASE(?,O(n^2))	22.78	*	WORST_CASE(?,O(n^2))	14.86	*	MAYBE	1.57	*	MAYBE	0.59	*	WORST_CASE(?,O(n^2))	4.09	*	TIMEOUT	60.06
jones1	*	WORST_CASE(?,O(n^1))	0.84	*	WORST_CASE(?,O(n^1))	0.77	*	WORST_CASE(?,O(n^1))	0.31	*	WORST_CASE(?,O(n^1))	0.25	*	WORST_CASE(?,O(n^1))	0.25	*	WORST_CASE(?,O(n^1))	1.26
jones2	*	WORST_CASE(?,O(n^1))	2.55	*	WORST_CASE(?,O(n^1))	1.57	*	WORST_CASE(?,O(n^1))	0.41	*	MAYBE	0.30	*	WORST_CASE(?,O(n^1))	1.07	*	WORST_CASE(?,O(n^1))	11.51
jones4	*	WORST_CASE(?,O(n^1))	1.60	*	WORST_CASE(?,O(n^1))	1.48	*	WORST_CASE(?,O(n^1))	0.23	*	WORST_CASE(?,O(n^1))	0.15	*	WORST_CASE(?,O(n^1))	0.10	*	WORST_CASE(?,O(n^1))	0.94
jones5	*	MAYBE	50.28	*	MAYBE	56.14	*	MAYBE	0.37	*	MAYBE	0.09	*	MAYBE	0.87	*	TIMEOUT	60.06
jones6	*	WORST_CASE(?,O(n^1))	3.18	*	WORST_CASE(?,O(n^1))	2.30	*	WORST_CASE(?,O(n^1))	0.34	*	WORST_CASE(?,O(n^1))	0.44	*	WORST_CASE(?,O(n^1))	0.55	*	WORST_CASE(?,O(n^1))	1.38
kruskal	*	MAYBE	60.00	*	TIMEOUT	60.06	*	MAYBE	7.71	*	MAYBE	2.47	*	TIMEOUT	60.06	*	TIMEOUT	60.01
lcs	*	MAYBE	56.15	*	MAYBE	39.77	*	MAYBE	3.85	*	MAYBE	1.53	*	MAYBE	14.19	*	MAYBE	1.22
list	*	WORST_CASE(?,O(n^1))	3.18	*	WORST_CASE(?,O(n^1))	0.71	*	WORST_CASE(?,O(n^1))	0.57	*	MAYBE	0.41	*	WORST_CASE(?,O(n^1))	0.65	*	WORST_CASE(?,O(n^1))	1.70
lte	*	WORST_CASE(?,O(n^1))	2.41	*	WORST_CASE(?,O(n^1))	6.79	*	WORST_CASE(?,O(n^1))	0.49	*	MAYBE	0.49	*	WORST_CASE(?,O(n^1))	0.64	*	WORST_CASE(?,O(n^1))	5.88
map0	*	WORST_CASE(?,O(n^1))	2.13	*	WORST_CASE(?,O(n^1))	2.58	*	WORST_CASE(?,O(n^1))	0.25	*	MAYBE	0.26	*	WORST_CASE(?,O(n^1))	0.84	*	WORST_CASE(?,O(n^1))	7.04
mappplus	*	WORST_CASE(?,O(n^2))	5.62	*	WORST_CASE(?,O(n^2))	2.80	*	MAYBE	1.26	*	MAYBE	0.45	*	MAYBE	2.29	*	TIMEOUT	60.06
matrix.raml	*	MAYBE	56.28	*	MAYBE	56.16	*	MAYBE	9.85	*	MAYBE	3.54	*	TIMEOUT	60.06	*	TIMEOUT	60.00
member	*	WORST_CASE(?,O(n^1))	3.60	*	WORST_CASE(?,O(n^1))	3.53	*	WORST_CASE(?,O(n^1))	0.57	*	MAYBE	0.27	*	WORST_CASE(?,O(n^1))	0.99	*	WORST_CASE(?,O(n^1))	8.74
mergelists	*	WORST_CASE(?,O(n^1))	6.39	*	WORST_CASE(?,O(n^1))	4.20	*	WORST_CASE(?,O(n^1))	1.35	*	MAYBE	0.52	*	WORST_CASE(?,O(n^1))	2.20	*	WORST_CASE(?,O(n^1))	11.63
mergesort-dc	*	TIMEOUT	60.06	*	TIMEOUT	60.06	*	MAYBE	24.24	*	MAYBE	3.19	*	TIMEOUT	60.06	*	TIMEOUT	60.01
mergesort.raml	*	MAYBE	58.25	*	MAYBE	56.65	*	MAYBE	5.59	*	MAYBE	2.34	*	TIMEOUT	60.06	*	TIMEOUT	60.00
minsort.raml	*	WORST_CASE(?,O(n^3))	48.24	*	WORST_CASE(?,O(n^3))	25.59	*	MAYBE	4.81	*	MAYBE	0.81	*	TIMEOUT	60.06	*	TIMEOUT	60.04
minus	*	WORST_CASE(?,O(n^1))	0.86	*	WORST_CASE(?,O(n^1))	0.65	*	WORST_CASE(?,O(n^1))	0.31	*	WORST_CASE(?,O(n^1))	0.22	*	WORST_CASE(?,O(n^1))	0.37	*	WORST_CASE(?,O(n^1))	1.76
mss	*	MAYBE	56.27	*	MAYBE	56.18	*	MAYBE	28.65	*	MAYBE	2.63	*	WORST_CASE(?,O(n^3))	26.38	*	TIMEOUT	60.00
mult1	*	WORST_CASE(?,O(n^3))	56.30	*	WORST_CASE(?,O(n^3))	8.54	*	MAYBE	1.08	*	MAYBE	0.32	*	MAYBE	1.51	*	WORST_CASE(?,O(n^3))	10.78
mult2	*	WORST_CASE(?,O(n^2))	3.56	*	WORST_CASE(?,O(n^2))	1.94	*	MAYBE	0.64	*	MAYBE	0.27	*	MAYBE	1.04	*	WORST_CASE(?,O(n^2))	5.99
mult3	*	WORST_CASE(?,O(n^2))	2.58	*	WORST_CASE(?,O(n^2))	3.05	*	WORST_CASE(?,O(n^2))	0.27	*	WORST_CASE(?,O(n^2))	0.18	*	WORST_CASE(?,O(n^2))	0.53	*	TIMEOUT	60.06
naiverev	*	WORST_CASE(?,O(n^2))	14.89	*	WORST_CASE(?,O(n^2))	15.79	*	MAYBE	1.09	*	MAYBE	0.63	*	WORST_CASE(?,O(n^2))	2.12	*	WORST_CASE(?,O(n^2))	6.59
overlap	*	WORST_CASE(?,O(n^2))	11.56	*	WORST_CASE(?,O(n^2))	10.05	*	MAYBE	2.59	*	MAYBE	0.72	*	MAYBE	7.94	*	TIMEOUT	60.06
pairs	*	WORST_CASE(?,O(n^2))	7.36	*	WORST_CASE(?,O(n^2))	6.62	*	WORST_CASE(?,O(n^2))	0.52	*	WORST_CASE(?,O(n^2))	0.25	*	WORST_CASE(?,O(n^2))	1.17	*	WORST_CASE(?,O(n^2))	8.68
pairsp	*	WORST_CASE(?,O(n^3))	12.02	*	WORST_CASE(?,O(n^3))	14.66	*	MAYBE	0.78	*	MAYBE	0.32	*	WORST_CASE(?,O(n^3))	2.40	*	TIMEOUT	60.06
parsexp	*	MAYBE	56.51	*	MAYBE	56.45	*	MAYBE	10.62	*	MAYBE	3.09	*	TIMEOUT	60.06	*	MAYBE	3.26
permute	*	TIMEOUT	60.03	*	TIMEOUT	60.06	*	MAYBE	2.08	*	MAYBE	0.55	*	MAYBE	8.79	*	MAYBE	2.44
power	*	MAYBE	56.23	*	MAYBE	56.17	*	MAYBE	0.58	*	MAYBE	0.21	*	MAYBE	1.41	*	TIMEOUT	60.01
pred	*	WORST_CASE(?,O(1))	0.97	*	WORST_CASE(?,O(1))	0.17	*	WORST_CASE(?,O(1))	0.37	*	WORST_CASE(?,O(1))	0.44	*	WORST_CASE(?,O(1))	0.50	*	WORST_CASE(?,O(1))	2.77
qs	*	TIMEOUT	60.06	*	TIMEOUT	60.12	*	MAYBE	6.18	*	MAYBE	0.89	*	MAYBE	54.57	*	TIMEOUT	60.00
queue	*	WORST_CASE(?,O(n^1))	16.17	*	WORST_CASE(?,O(n^2))	25.58	*	WORST_CASE(?,O(n^1))	1.51	*	MAYBE	0.56	*	WORST_CASE(?,O(n^1))	1.59	*	TIMEOUT	60.05
queue.raml	*	MAYBE	56.51	*	MAYBE	56.85	*	MAYBE	53.67	*	MAYBE	1.29	*	TIMEOUT	60.06	*	TIMEOUT	60.01
quicksort-nat	*	WORST_CASE(?,O(n^2))	25.69	*	WORST_CASE(?,O(n^2))	25.43	*	MAYBE	6.97	*	MAYBE	0.80	*	WORST_CASE(?,O(n^2))	42.33	*	TIMEOUT	60.05
quotient	*	WORST_CASE(?,O(n^1))	1.86	*	WORST_CASE(?,O(n^1))	1.58	*	WORST_CASE(?,O(n^1))	0.25	*	WORST_CASE(?,O(n^1))	0.35	*	WORST_CASE(?,O(n^1))	0.57	*	TIMEOUT	60.06
rationalPotential.raml	*	WORST_CASE(?,O(n^1))	7.01	*	WORST_CASE(?,O(n^1))	7.33	*	WORST_CASE(?,O(n^1))	0.43	*	WORST_CASE(?,O(n^1))	0.41	*	WORST_CASE(?,O(n^1))	2.52	*	WORST_CASE(?,O(n^1))	1.62
rev	*	WORST_CASE(?,O(n^2))	9.37	*	WORST_CASE(?,O(n^2))	8.48	*	MAYBE	2.90	*	MAYBE	0.32	*	WORST_CASE(?,O(n^2))	3.02	*	WORST_CASE(?,O(n^2))	6.53
rev-dl	*	WORST_CASE(?,O(n^1))	6.29	*	WORST_CASE(?,O(n^1))	3.32	*	WORST_CASE(?,O(n^1))	0.99	*	MAYBE	0.59	*	WORST_CASE(?,O(n^1))	0.91	*	WORST_CASE(?,O(n^1))	1.66
rev-fletf	*	WORST_CASE(?,O(n^1))	3.75	*	WORST_CASE(?,O(n^1))	3.15	*	WORST_CASE(?,O(n^1))	0.92	*	MAYBE	0.45	*	WORST_CASE(?,O(n^1))	0.84	*	WORST_CASE(?,O(n^1))	1.76
rev-foldl	*	WORST_CASE(?,O(n^1))	1.43	*	WORST_CASE(?,O(n^1))	0.69	*	WORST_CASE(?,O(n^1))	0.30	*	MAYBE	0.33	*	WORST_CASE(?,O(n^1))	0.51	*	WORST_CASE(?,O(n^1))	1.61
reverse	*	WORST_CASE(?,O(n^2))	14.20	*	WORST_CASE(?,O(n^2))	16.68	*	MAYBE	0.88	*	MAYBE	0.26	*	WORST_CASE(?,O(n^2))	1.63	*	WORST_CASE(?,O(n^2))	6.14
rpm-lazy	*	MAYBE	57.83	*	MAYBE	57.03	*	TIMEOUT	60.06	*	TIMEOUT	60.06	*	TIMEOUT	60.06	*	TIMEOUT	60.01
sat	*	WORST_CASE(?,O(n^2))	26.98	*	WORST_CASE(?,O(n^2))	9.57	*	MAYBE	2.54	*	MAYBE	1.04	*	WORST_CASE(?,O(n^2))	10.26	*	TIMEOUT	60.05
select	*	WORST_CASE(?,O(n^2))	6.19	*	WORST_CASE(?,O(n^2))	7.37	*	MAYBE	1.02	*	MAYBE	0.37	*	MAYBE	2.22	*	TIMEOUT	60.06
shuffle	*	WORST_CASE(?,O(n^3))	25.14	*	WORST_CASE(?,O(n^3))	25.24	*	MAYBE	1.09	*	MAYBE	0.54	*	MAYBE	3.05	*	WORST_CASE(?,O(n^3))	6.18
sp1	*	MAYBE	42.40	*	MAYBE	56.53	*	MAYBE	0.90	*	MAYBE	0.45	*	MAYBE	4.54	*	MAYBE	1.53
sparseByWeight.okasaki	*	MAYBE	56.49	*	MAYBE	56.44	*	MAYBE	5.06	*	MAYBE	1.19	*	MAYBE	55.74	*	TIMEOUT	60.01
sparseByWeight_carry.okasaki	*	MAYBE	56.31	*	MAYBE	58.55	*	MAYBE	3.68	*	MAYBE	2.10	*	MAYBE	9.53	*	TIMEOUT	60.00
splayHeap_deleteMin.okasaki	*	WORST_CASE(?,O(n^1))	7.16	*	WORST_CASE(?,O(n^1))	7.21	*	WORST_CASE(?,O(n^1))	0.42	*	MAYBE	0.51	*	WORST_CASE(?,O(n^1))	0.64	*	WORST_CASE(?,O(n^1))	1.36
splayHeap_findMin.okasaki	*	WORST_CASE(?,O(n^1))	3.39	*	WORST_CASE(?,O(n^1))	0.97	*	WORST_CASE(?,O(n^1))	0.99	*	MAYBE	0.50	*	WORST_CASE(?,O(n^1))	1.51	*	WORST_CASE(?,O(n^1))	1.95
splayHeap_merge.okasaki	*	WORST_CASE(?,O(n^3))	59.53	*	WORST_CASE(?,O(n^2))	47.24	*	MAYBE	55.57	*	MAYBE	1.42	*	TIMEOUT	60.06	*	TIMEOUT	60.03
splayHeap_partition.okasaki	*	WORST_CASE(?,O(n^1))	16.76	*	WORST_CASE(?,O(n^1))	9.98	*	WORST_CASE(?,O(n^1))	1.98	*	MAYBE	1.68	*	WORST_CASE(?,O(n^1))	25.03	*	WORST_CASE(?,O(n^1))	8.80
splitandsort.raml	*	MAYBE	58.71	*	MAYBE	56.90	*	MAYBE	10.69	*	MAYBE	3.37	*	TIMEOUT	60.06	*	TIMEOUT	60.01
subsets	*	MAYBE	56.14	*	MAYBE	56.23	*	MAYBE	2.72	*	MAYBE	0.89	*	MAYBE	2.67	*	TIMEOUT	60.00
subtrees.raml	*	WORST_CASE(?,O(n^2))	13.14	*	WORST_CASE(?,O(n^2))	9.25	*	MAYBE	1.77	*	MAYBE	0.61	*	WORST_CASE(?,O(n^2))	5.70	*	TIMEOUT	60.06
sum	*	WORST_CASE(?,O(n^1))	3.15	*	WORST_CASE(?,O(n^1))	0.65	*	WORST_CASE(?,O(n^1))	0.73	*	MAYBE	0.32	*	WORST_CASE(?,O(n^1))	0.85	*	WORST_CASE(?,O(n^1))	1.61
sum_sqs3	*	MAYBE	56.21	*	MAYBE	56.66	*	MAYBE	3.96	*	MAYBE	1.72	*	MAYBE	5.68	*	TIMEOUT	60.00
tadd	*	WORST_CASE(?,O(n^2))	3.02	*	WORST_CASE(?,O(n^2))	2.74	*	MAYBE	0.51	*	MAYBE	0.26	*	MAYBE	1.60	*	TIMEOUT	60.06
take_lazy	*	WORST_CASE(?,O(n^1))	1.23	*	WORST_CASE(?,O(n^1))	0.60	*	WORST_CASE(?,O(n^1))	0.23	*	WORST_CASE(?,O(n^1))	0.12	*	WORST_CASE(?,O(n^1))	0.36	*	WORST_CASE(?,O(n^1))	2.42

Result Summary

Average Times

	TcTAra	TcTNoAra	AraTrs	AraTrsHeuristics	AraTrsCostFree	Aprove
Success "MAYBE"	32	30	67	95	33	10
Success "WORST_CASE(?,O(1))"	2	2	2	2	2	2
Success "WORST_CASE(?,O(n^1))"	45	41	43	14	43	41
Success "WORST_CASE(?,O(n^2))"	21	26	2	3	13	6
Success "WORST_CASE(?,O(n^3))"	9	5	0	0	2	2
Success "WORST_CASE(?,O(n^4))"	1	1	0	0	0	0
Timeout	6	11	2	2	23	55

	TcTAra	TcTNoAra	AraTrs	AraTrsHeuristics	AraTrsCostFree	Aprove
Success "MAYBE"	53.88	55.01	8.46	1.20	14.48	1.78
Success "WORST_CASE(?,O(1))"	0.71	0.16	0.28	0.29	0.34	2.74
Success "WORST_CASE(?,O(n^1))"	5.14	3.14	0.75	0.29	1.72	3.47
Success "WORST_CASE(?,O(n^2))"	17.89	17.66	0.39	0.66	8.26	6.57
Success "WORST_CASE(?,O(n^3))"	43.92	19.85	0.00	0.00	14.39	8.48
Success "WORST_CASE(?,O(n^4))"	56.38	56.46	0.00	0.00	0.00	0.00
Timeout	60.04	60.08	60.06	60.06	60.06	60.03
Overall	27.11	26.34	6.21	2.08	17.85	30.38