Metrics for Henrywood and Agarwal, Equation (9a)

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze353.0ms (4.5%)

Memory

1.9MiB live, 150.4MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.7%	0.3%	0%	0%	0%	0
0%	0%	99.7%	0.3%	0%	0%	0%	1
0%	0%	99.7%	0.3%	0%	0%	0%	2
0%	0%	99.7%	0.3%	0%	0%	0%	3
0%	0%	99.7%	0.3%	0%	0%	0%	4
0%	0%	99.7%	0.3%	0%	0%	0%	5
0%	0%	99.7%	0.3%	0%	0%	0%	6
12.5%	12.5%	87.2%	0.3%	0%	0%	0%	7
12.5%	12.5%	87.2%	0.3%	0%	0%	0%	8
12.5%	12.5%	87.2%	0.3%	0%	0%	0%	9
12.5%	12.5%	87.2%	0.3%	0%	0%	0%	10
12.5%	12.5%	87.2%	0.3%	0%	0%	0%	11
18.8%	18.7%	81%	0.3%	0%	0%	0%	12

Compiler

Compiled 20 to 19 computations (5% saved)

sample43.0ms (0.5%)

Memory

-0.2MiB live, 15.4MiB allocated

Samples

23.0ms	260×	0	valid
7.0ms	86×	0	invalid

Precisions

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

ival-mult: 7.0ms (37.5% of total)

ival-div: 4.0ms (21.4% of total)

ival-pow2: 3.0ms (16.1% of total)

ival-sqrt: 2.0ms (10.7% of total)

ival-sub: 1.0ms (5.4% of total)

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

exact: 0.0ms (0% of total)

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

Bogosity

explain7.3s (92.4%)

Memory

37.1MiB live, 4 144.5MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
43	-	2	(-1.3396027073458633e+268 4.082867316414559e-219 2.40609406519158e+259 1.712317033903853e-143 8.077941475007709e+170 -6.672794298370056e-77)	`(.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))`
23	-	0	-	`(sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))`
14	-	1	(2.624482772759977e-279 1.3210978503162452e-123 -8.24248328747005e-192 -1.2775872452444546e-228 6.539278278250349e-77 -2.9649004679045863e-280)	`(/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d))`
12	-	0	-	`(.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))`
0	-	0	-	`D`
0	-	0	-	`(*.f64 #s(literal 2 binary64) d)`
0	-	0	-	`(/.f64 h l)`
0	-	0	-	`(pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))`
0	-	0	-	`d`
0	-	0	-	`#s(literal 1 binary64)`
0	-	0	-	`(*.f64 M D)`
0	-	0	-	`w0`
0	-	0	-	`(-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))`
0	-	0	-	`#s(literal 2 binary64)`
0	-	0	-	`l`
0	-	0	-	`M`
0	-	0	-	`h`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`sqrt.f64`	`(sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))`	oflow-rescue	23	0
↳	`(pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))`	overflow	59
↳	`(-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))`	overflow	60
↳	`(sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))`	overflow	37
↳	`(*.f64 #s(literal 2 binary64) d)`	overflow	1
↳	`(*.f64 M D)`	overflow	23
↳	`(/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d))`	overflow	37
↳	`(.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))`	overflow	60
↳	`(/.f64 h l)`	overflow	27
`*.f64`	`(.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))`	*no**	12	0
`*.f64`	`(.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))`	*no**	7	0
`/.f64`	`(/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d))`	o/n	5	0
↳	`(*.f64 M D)`	overflow	23
`*.f64`	`(.f64 (pow.f64 (/.f64 (.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))`	*ou**	2	0
↳	`(pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64))`	overflow	59
↳	`(*.f64 #s(literal 2 binary64) d)`	overflow	1
↳	`(*.f64 M D)`	overflow	23
↳	`(/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d))`	overflow	37
↳	`(/.f64 h l)`	underflow	29

Confusion

	Predicted +	Predicted -
+	38	13
-	7	198

Precision

0.8444444444444444

Recall

0.7450980392156863

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	38	0	13
-	7	0	198

Precision?

0.8444444444444444

Recall?

0.7450980392156863

Freqs

test

number	freq
0	211
1	41
2	4

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Total Time

27.743408203125

Average Time

0.10837268829345703

Samples

2.3s

23 040×

valid

Compiler

Compiled 13 815 to 3 240 computations (76.5% saved)

Precisions

Click to see histograms. Total time spent on operations: 1.3s

ival-mult: 482.0ms (37% of total)

ival-div: 318.0ms (24.4% of total)

ival-pow2: 208.0ms (16% of total)

ival-sqrt: 140.0ms (10.7% of total)

ival-sub: 98.0ms (7.5% of total)

exact: 25.0ms (1.9% of total)

ival-true: 22.0ms (1.7% of total)

ival-assert: 9.0ms (0.7% of total)

preprocess128.0ms (1.6%)

Memory

3.5MiB live, 33.5MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	167	501
1	520	492
2	1570	492
3	4468	492
0	17	18
0	26	18
1	47	18
2	115	18
3	826	18
4	4554	18
5	7862	18
0	8022	18

Stop Event

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

Calls

Call 1

Inputs
(.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))

Outputs

(*.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))

(*.f64 (sqrt.f64 (fma.f64 (/.f64 (neg.f64 h) l) (pow.f64 (*.f64 (/.f64 (/.f64 M d) #s(literal 2 binary64)) D) #s(literal 2 binary64)) #s(literal 1 binary64))) w0)

Symmetry

(abs d)

(abs D)

(abs M)

(negabs w0)

(sort M D)

Compiler

Compiled 18 to 17 computations (5.6% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated
Compiler: Compiled 0 to 6 computations (-∞% saved)

prune1.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	80.6%	(.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))

Compiler

Compiled 36 to 34 computations (5.6% saved)

simplify26.0ms (0.3%)

Memory

-16.4MiB live, 18.2MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	18
1	29	18
2	40	18
3	50	18
4	58	18
5	63	18
6	65	18

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 M D) (.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))

Outputs

(*.f64 w0 (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))))

(*.f64 (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (/.f64 h l) (pow.f64 (/.f64 (*.f64 D M) (*.f64 d #s(literal 2 binary64))) #s(literal 2 binary64))))) w0)

soundness0.0ms (0%)

Memory

0.2MiB live, 0.2MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 18 to 17 computations (5.6% saved)

preprocess42.0ms (0.5%)

Memory

3.4MiB live, 18.7MiB allocated

Remove

(sort M D)

(negabs w0)

(abs M)

(abs D)

(abs d)

Compiler

Compiled 432 to 408 computations (5.6% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze353.0ms (4.5%)

sample43.0ms (0.5%)

explain7.3s (92.4%)

preprocess128.0ms (1.6%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify26.0ms (0.3%)

soundness0.0ms (0%)

preprocess42.0ms (0.5%)

end0.0ms (0%)

Profiling