Metrics for FastMath dist

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample705.0ms (86%)

Memory

-1.4MiB live, 878.4MiB allocated; 188ms collecting garbage

Samples

476.0ms

8 256×

valid

Precisions

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

ival-mult: 128.0ms (76.8% of total)

ival-add: 34.0ms (20.4% of total)

adjust: 2.0ms (1.2% of total)

ival-assert: 2.0ms (1.2% of total)

Bogosity

explain62.0ms (7.6%)

Memory

-14.0MiB live, 92.8MiB allocated; 6ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
5	-	-	`(+.f64 (.f64 d1 d2) (.f64 d1 d3))`
0	-	-	`d2`
0	-	-	`d1`
0	-	-	`d3`
0	-	-	`(*.f64 d1 d2)`
0	-	-	`(*.f64 d1 d3)`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`+.f64`	`(+.f64 (.f64 d1 d2) (.f64 d1 d3))`	nan-rescue	5	0
↳	`(*.f64 d1 d2)`	overflow	28
↳	`(*.f64 d1 d3)`	overflow	32

Confusion

	Predicted +	Predicted -
+	5	0
-	0	251

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	5	0	0
-	0	0	251

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	251
1	5

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

24.0ms

512×

valid

Compiler

Compiled 43 to 22 computations (48.8% saved)

Precisions

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

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

ival-add: 2.0ms (20.9% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess25.0ms (3.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	30	55
1	85	55
2	203	51
3	354	51
4	447	51
5	554	51
6	607	51
7	647	51
8	657	51
0	10	7
0	16	7
0	16	7

Stop Event

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

Calls

Call 1

Inputs
(+.f64 (.f64 d1 d2) (.f64 d1 d3))

Outputs
(+.f64 (.f64 d1 d2) (.f64 d1 d3))

Symmetry

(negabs d1)

(sort d2 d3)

Compiler

Compiled 7 to 6 computations (14.3% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 3 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	98.0%	(+.f64 (.f64 d1 d2) (.f64 d1 d3))

Compiler

Compiled 7 to 6 computations (14.3% saved)

series7.0ms (0.9%)

Memory

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

Counts

6 → 14

Calls

Call 1

Inputs
(+.f64 (.f64 d1 d2) (.f64 d1 d3))
(*.f64 d1 d2)
d1
d2
(*.f64 d1 d3)
d3

Outputs
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* d1 (+ d2 d3))))
#s(approx (* d1 d2) #s(hole binary64 (* d1 d2)))
#s(approx d1 #s(hole binary64 d1))
#s(approx (* d1 d3) #s(hole binary64 (* d1 d3)))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* -1 (* d1 (+ (* -1 d2) (* -1 d3))))))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* d1 d3)))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (+ (* d1 d2) (* d1 d3))))
#s(approx d2 #s(hole binary64 d2))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* d1 d2)))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* d2 (+ d1 (/ (* d1 d3) d2)))))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* -1 (* d2 (+ (* -1 d1) (* -1 (/ (* d1 d3) d2)))))))
#s(approx d3 #s(hole binary64 d3))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* d3 (+ d1 (/ (* d1 d2) d3)))))
#s(approx (+ (* d1 d2) (* d1 d3)) #s(hole binary64 (* -1 (* d3 (+ (* -1 d1) (* -1 (/ (* d1 d2) d3)))))))

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	d1	@	-inf	((+ (* d1 d2) (* d1 d3)) (* d1 d2) d1 d2 (* d1 d3) d3)
1.0ms	d1	@	inf	((+ (* d1 d2) (* d1 d3)) (* d1 d2) d1 d2 (* d1 d3) d3)
1.0ms	d3	@	0	((+ (* d1 d2) (* d1 d3)) (* d1 d2) d1 d2 (* d1 d3) d3)
1.0ms	d1	@	0	((+ (* d1 d2) (* d1 d3)) (* d1 d2) d1 d2 (* d1 d3) d3)
1.0ms	d2	@	-inf	((+ (* d1 d2) (* d1 d3)) (* d1 d2) d1 d2 (* d1 d3) d3)

rewrite19.0ms (2.3%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	62	210
1	93	202
2	94	200
3	94	200
0	94	200
0	94	198
1	108	196
2	119	192
3	132	192
4	137	192

Stop Event

1×	saturated
1×	node limit
1×	saturated

end0.0ms (0%)

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

Iter	Nodes	Cost
0	30	55
1	85	55
2	203	51
3	354	51
4	447	51
5	554	51
6	607	51
7	647	51
8	657	51
0	10	7
0	16	7
0	16	7

Iter	Nodes	Cost
0	62	210
1	93	202
2	94	200
3	94	200
0	94	200
0	94	198
1	108	196
2	119	192
3	132	192
4	137	192

Iter	Nodes	Cost
0	30	55
1	85	55
2	203	51
3	354	51
4	447	51
5	554	51
6	607	51
7	647	51
8	657	51
0	10	7
0	16	7
0	16	7

Iter	Nodes	Cost
0	62	210
1	93	202
2	94	200
3	94	200
0	94	200
0	94	198
1	108	196
2	119	192
3	132	192
4	137	192

start0.0ms (0%)

analyze0.0ms (0%)

sample705.0ms (86%)

explain62.0ms (7.6%)

preprocess25.0ms (3.1%)

eval0.0ms (0%)

prune0.0ms (0%)

series7.0ms (0.9%)

rewrite19.0ms (2.3%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	30	55
1	85	55
2	203	51
3	354	51
4	447	51
5	554	51
6	607	51
7	647	51
8	657	51
0	10	7
0	16	7
0	16	7

Iter	Nodes	Cost
0	62	210
1	93	202
2	94	200
3	94	200
0	94	200
0	94	198
1	108	196
2	119	192
3	132	192
4	137	192