Metrics for simple fma test

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

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 14 to 10 computations (28.6% saved)

sample1.7s (60.7%)

Memory

17.1MiB live, 1 357.1MiB allocated

Samples

1.0s	6 106×	1	valid
125.0ms	2 150×	0	valid

Precisions

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

adjust: 147.0ms (30.4% of total)

ival-add: 133.0ms (27.5% of total)

ival-mult: 124.0ms (25.7% of total)

ival-sub: 63.0ms (13% of total)

exact: 8.0ms (1.7% of total)

ival-true: 6.0ms (1.2% of total)

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

Bogosity

preprocess323.0ms (11.8%)

Memory

2.2MiB live, 80.0MiB allocated

Algorithm

1×	egg-herbie

Rules

911×	`fmm-def`
788×	`unsub-neg`
476×	`sub-neg`
379×	`fma-define`
287×	`distribute-neg-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	52	553
1	137	541
2	378	11
3	1556	11
4	3637	11
5	5091	11
6	6021	11
7	7055	11
8	7693	11
9	7777	11
10	7777	11
11	7885	11
12	7972	11
13	7993	11

Stop Event

1×	node limit

Calls

Call 1

Inputs
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
(-.f64 (fma.f64 (neg.f64 x) y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 (neg.f64 x) y) z)))
(-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x (neg.f64 y)) z)))
(-.f64 (fma.f64 x y (neg.f64 z)) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) (neg.f64 z))))
(neg.f64 (-.f64 (fma.f64 (neg.f64 x) y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 (neg.f64 x) y) z))))
(neg.f64 (-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x (neg.f64 y)) z))))
(neg.f64 (-.f64 (fma.f64 x y (neg.f64 z)) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) (neg.f64 z)))))
(-.f64 (fma.f64 y x z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 y x) z)))
(-.f64 (fma.f64 z y x) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 z y) x)))
(-.f64 (fma.f64 x z y) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x z) y)))

Outputs
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 (neg.f64 x) y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 (neg.f64 x) y) z)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x (neg.f64 y)) z)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x y (neg.f64 z)) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) (neg.f64 z))))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(neg.f64 (-.f64 (fma.f64 (neg.f64 x) y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 (neg.f64 x) y) z))))
(neg.f64 (-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (fma.f64 x (neg.f64 y) z))))
(+.f64 (-.f64 (.f64 x y) z) (+.f64 z (-.f64 #s(literal 1 binary64) (.f64 x y))))
#s(literal 1 binary64)
(neg.f64 (-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x (neg.f64 y)) z))))
(neg.f64 (-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (fma.f64 x (neg.f64 y) z))))
(+.f64 (-.f64 (.f64 x y) z) (+.f64 z (-.f64 #s(literal 1 binary64) (.f64 x y))))
#s(literal 1 binary64)
(neg.f64 (-.f64 (fma.f64 x y (neg.f64 z)) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) (neg.f64 z)))))
(neg.f64 (-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (fma.f64 x (neg.f64 y) z))))
(+.f64 (-.f64 (.f64 x y) z) (+.f64 z (-.f64 #s(literal 1 binary64) (.f64 x y))))
#s(literal 1 binary64)
(-.f64 (fma.f64 y x z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 y x) z)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 z y x) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 z y) x)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x z y) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x z) y)))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
#s(literal -1 binary64)

Symmetry

(abs x)

(abs y)

(abs z)

(sort x y z)

explain291.0ms (10.6%)

Memory

3.0MiB live, 277.8MiB allocated

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
224	6	(1.293090256766317e-265 5.031965401587792e-108 81063.90989672171)	-	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`
0	0	-	-	`(+.f64 (*.f64 x y) z)`
0	0	-	-	`(fma.f64 x y z)`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))`
0	0	-	-	`z`
0	0	-	-	`(*.f64 x y)`
0	0	-	-	`y`
0	0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`	cancellation	223	0
`-.f64`	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`	nan-rescue	7	0
↳	`(fma.f64 x y z)`	overflow	7
↳	`(+.f64 (*.f64 x y) z)`	overflow	7
↳	`(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))`	overflow	7
↳	`(*.f64 x y)`	overflow	7

Confusion

	Predicted +	Predicted -
+	224	0
-	6	26

Precision

0.9739130434782609

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	224	0	0
-	6	0	26

Precision?

0.9739130434782609

Recall?

1.0

Freqs

test

number	freq
0	26
1	230

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

154.0ms	456×	1	valid
3.0ms	56×	0	valid

Compiler

Compiled 104 to 38 computations (63.5% saved)

Precisions

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

ival-add: 47.0ms (70.7% of total)

adjust: 9.0ms (13.5% of total)

ival-mult: 6.0ms (9% of total)

ival-sub: 4.0ms (6% of total)

exact: 1.0ms (1.5% of total)

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

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

eval0.0ms (0%)

Memory: 1.4MiB live, 1.4MiB allocated
Compiler: Compiled 15 to 8 computations (46.7% saved)

prune1.0ms (0%)

Memory

2.8MiB live, 2.8MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(literal -1 binary64)

Compiler

Compiled 4 to 4 computations (0% saved)

simplify5.0ms (0.2%)

Memory

12.4MiB live, 12.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal -1 binary64)

Outputs
#s(literal -1 binary64)

localize9.0ms (0.3%)

Memory

-16.4MiB live, 22.2MiB allocated

Samples

5.0ms

256×

valid

Compiler

Compiled 3 to 6 computations (-100% saved)

Precisions

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

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

exact: 0.0ms (0% of total)

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

eval0.0ms (0%)

Memory: 0.6MiB live, 0.6MiB allocated
Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

Memory

4.0MiB live, 4.0MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(literal -1 binary64)

Compiler

Compiled 20 to 14 computations (30% saved)

regimes6.0ms (0.2%)

Memory

22.1MiB live, 22.1MiB allocated

Accuracy

Total -54.3b remaining (-∞%)

Threshold costs -54.3b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(literal -1 binary64)
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))

Outputs
#s(literal -1 binary64)

Calls

4 calls:

1.0ms	z
1.0ms	x
1.0ms	y
1.0ms	(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`
100.0%	1	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`

Compiler

Compiled 27 to 18 computations (33.3% saved)

simplify2.0ms (0.1%)

Memory

4.9MiB live, 4.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal -1 binary64)

Outputs
#s(literal -1 binary64)

soundness344.0ms (12.6%)

Memory

-32.2MiB live, 48.8MiB allocated

Rules

911×	`fmm-def`
788×	`unsub-neg`
476×	`sub-neg`
379×	`fma-define`
287×	`distribute-neg-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	52	553
1	137	541
2	378	11
3	1556	11
4	3637	11
5	5091	11
6	6021	11
7	7055	11
8	7693	11
9	7777	11
10	7777	11
11	7885	11
12	7972	11
13	7993	11

Stop Event

1×	done
1×	node limit

Compiler

Compiled 62 to 21 computations (66.1% saved)

preprocess96.0ms (3.5%)

Memory

35.2MiB live, 112.9MiB allocated

Remove

(sort x y z)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 110 to 98 computations (10.9% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

sample1.7s (60.7%)

preprocess323.0ms (11.8%)

explain291.0ms (10.6%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify5.0ms (0.2%)

localize9.0ms (0.3%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes6.0ms (0.2%)

simplify2.0ms (0.1%)

soundness344.0ms (12.6%)

preprocess96.0ms (3.5%)

end0.0ms (0%)

Profiling