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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB 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)

sample464.0ms (42.2%)

Memory

6.3MiB live, 511.2MiB allocated; 100ms collecting garbage

Samples

312.0ms

8 256×

valid

Precisions

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

const: 128.0ms (96.5% of total)

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

adjust: 2.0ms (1.5% of total)

Bogosity

explain490.0ms (44.6%)

Memory

58.2MiB live, 713.4MiB allocated; 144ms 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

198.0ms

512×

valid

Compiler

Compiled 563 to 94 computations (83.3% saved)

Precisions

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

adjust: 57.0ms (37.6% of total)

ival-mult: 41.0ms (27.1% of total)

ival-pow: 18.0ms (11.9% of total)

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

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

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

exact: 2.0ms (1.3% of total)

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

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

preprocess145.0ms (13.2%)

Memory

-110.1MiB live, 61.3MiB allocated; 57ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	6
0	41	63
0	53	63
1	55	63
2	58	63
3	63	63
4	83	63
5	157	63
6	610	63
7	4722	63
0	8455	63

Stop Event

1×	saturated
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%)

sample464.0ms (42.2%)

explain490.0ms (44.6%)

preprocess145.0ms (13.2%)

end0.0ms (0%)

Profiling