Metrics for Rump's expression from Stadtherr's award speech

start0.0ms (0%)

Memory: 0.1MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	0%	100%	0%	0%	0%	0
100%	0%	0%	100%	0%	0%	0%	1

Compiler

Compiled 9 to 9 computations (0% saved)

sample488.0ms (47.8%)

Memory

-4.0MiB live, 570.9MiB allocated; 104ms collecting garbage

Samples

337.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 132.0ms

const: 127.0ms (96.4% of total)

ival-assert: 3.0ms (2.3% of total)

adjust: 2.0ms (1.5% of total)

Bogosity

explain441.0ms (43.1%)

Memory

5.7MiB live, 598.3MiB allocated; 112ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
256	-	-	`(+.f64 (+.f64 (.f64 #s(literal 1335/4 binary64) (pow.f64 y #s(literal 6 binary64))) (.f64 (.f64 x x) (-.f64 (-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))) #s(literal 2 binary64)))) (*.f64 #s(literal 11/2 binary64) (pow.f64 y #s(literal 8 binary64))))`
0	-	-	`(+.f64 (.f64 #s(literal 1335/4 binary64) (pow.f64 y #s(literal 6 binary64))) (.f64 (.f64 x x) (-.f64 (-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))) #s(literal 2 binary64))))`
0	-	-	`(*.f64 #s(literal 2 binary64) y)`
0	-	-	`#s(literal 8 binary64)`
0	-	-	`#s(literal 11/2 binary64)`
0	-	-	`(pow.f64 y #s(literal 4 binary64))`
0	-	-	`(.f64 (.f64 (*.f64 #s(literal 11 binary64) x) x) y)`
0	-	-	`(.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y)`
0	-	-	`y`
0	-	-	`(.f64 (.f64 x x) (-.f64 (-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (*.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))) #s(literal 2 binary64)))`
0	-	-	`(pow.f64 y #s(literal 8 binary64))`
0	-	-	`#s(literal 121 binary64)`
0	-	-	`(*.f64 #s(literal 11 binary64) x)`
0	-	-	`#s(literal 1335/4 binary64)`
0	-	-	`(*.f64 #s(literal 1335/4 binary64) (pow.f64 y #s(literal 6 binary64)))`
0	-	-	`(-.f64 (-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (*.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))) #s(literal 2 binary64))`
0	-	-	`(.f64 (.f64 #s(literal 11 binary64) x) x)`
0	-	-	`(*.f64 #s(literal 11/2 binary64) (pow.f64 y #s(literal 8 binary64)))`
0	-	-	`#s(literal 4 binary64)`
0	-	-	`(*.f64 x x)`
0	-	-	`#s(literal 6 binary64)`
0	-	-	`(-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64)))`
0	-	-	`(/.f64 x (*.f64 #s(literal 2 binary64) y))`
0	-	-	`#s(literal 2 binary64)`
0	-	-	`(*.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))`
0	-	-	`(+.f64 (+.f64 (+.f64 (.f64 #s(literal 1335/4 binary64) (pow.f64 y #s(literal 6 binary64))) (.f64 (.f64 x x) (-.f64 (-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))) #s(literal 2 binary64)))) (.f64 #s(literal 11/2 binary64) (pow.f64 y #s(literal 8 binary64)))) (/.f64 x (.f64 #s(literal 2 binary64) y)))`
0	-	-	`(-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (*.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64))))`
0	-	-	`x`
0	-	-	`(pow.f64 y #s(literal 6 binary64))`
0	-	-	`#s(literal 11 binary64)`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`+.f64`	`(+.f64 (+.f64 (.f64 #s(literal 1335/4 binary64) (pow.f64 y #s(literal 6 binary64))) (.f64 (.f64 x x) (-.f64 (-.f64 (-.f64 (.f64 (.f64 (.f64 (.f64 #s(literal 11 binary64) x) x) y) y) (pow.f64 y #s(literal 6 binary64))) (.f64 #s(literal 121 binary64) (pow.f64 y #s(literal 4 binary64)))) #s(literal 2 binary64)))) (*.f64 #s(literal 11/2 binary64) (pow.f64 y #s(literal 8 binary64))))`	cancellation	1	0

Confusion

	Predicted +	Predicted -
+	256	0
-	0	0

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	256	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
1	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

178.0ms

512×

valid

Compiler

Compiled 563 to 94 computations (83.3% saved)

Precisions

Click to see histograms. Total time spent on operations: 127.0ms

adjust: 39.0ms (30.8% of total)

ival-mult: 36.0ms (28.4% of total)

ival-pow: 17.0ms (13.4% of total)

ival-sub: 13.0ms (10.3% of total)

ival-add: 12.0ms (9.5% of total)

ival-div: 8.0ms (6.3% of total)

exact: 2.0ms (1.6% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

preprocess93.0ms (9.1%)

Memory

-5.8MiB live, 91.2MiB allocated; 67ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	6
0	30	43
0	50	43
1	97	43
2	246	43
3	693	43
4	2398	43
5	6562	43
0	8659	43

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	saturated

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample488.0ms (47.8%)

explain441.0ms (43.1%)

preprocess93.0ms (9.1%)

end0.0ms (0%)

Profiling