Metrics for simple fma test

analyze0.0ms (0%)

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 16 to 10 computations (37.5% saved)

Precisions

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

composed: 0.0ms (0% of total)

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

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

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

const: 0.0ms (0% of total)

sample24.8s (96%)

Results

18.4s	23691×	5	exit
929.0ms	8256×	0	valid

Precisions

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

backward-pass: 5.5s (28.7% of total)

composed: 5.1s (26.8% of total)

ival-mult: 4.0s (20.8% of total)

ival-add: 3.2s (16.6% of total)

ival-sub: 1.1s (5.9% of total)

const: 233.0ms (1.2% of total)

Bogosity

preprocess347.0ms (1.3%)

Algorithm

1×	egg-herbie

Rules

2603×	`fma-define`
911×	`fma-neg`
826×	`unsub-neg`
476×	`sub-neg`
291×	`distribute-neg-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	52	553
1	137	541
2	378	11
3	1534	11
4	3599	11
5	5046	11
6	5988	11
7	7022	11
8	7660	11
9	7744	11
10	7744	11
11	7852	11
12	7939	11
13	7960	11
14	7972	11
15	7978	11
16	7978	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)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.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)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x (neg.f64 y) z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x (neg.f64 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))))
#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))))
#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))))
#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)))))
#s(literal 1 binary64)
(-.f64 (fma.f64 y x z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 y x) z)))
#s(literal -1 binary64)
(-.f64 (fma.f64 z y x) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 z y) x)))
#s(literal -1 binary64)
(-.f64 (fma.f64 x z y) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x z) y)))
#s(literal -1 binary64)

Symmetry

(abs x)

(abs y)

(abs z)

(sort x y z)

explain197.0ms (0.8%)

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
104	17	(2.1292101896786975e-302 1.3012823217714575e-101 1583871134.4932122)	-	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`
0	0	-	-	`x`
0	0	-	-	`y`
0	0	-	-	`(*.f64 x y)`
0	0	-	-	`z`
0	0	-	-	`(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`(fma.f64 x y z)`
0	0	-	-	`(+.f64 (*.f64 x y) z)`

Results

48.0ms	364×	256	valid
29.0ms	78×	512	valid
69.0ms	66×	1024	valid
2.0ms	4×	2048	valid

Compiler

Compiled 93 to 35 computations (62.4% saved)

Precisions

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

ival-mult: 55.0ms (53.8% of total)

ival-add: 30.0ms (29.3% of total)

composed: 12.0ms (11.7% of total)

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

const: 2.0ms (2% of total)

eval0.0ms (0%)

Compiler: Compiled 4 to 4 computations (0% saved)

prune1.0ms (0%)

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)

localize16.0ms (0.1%)

Results

13.0ms

256×

256

valid

Compiler

Compiled 5 to 5 computations (0% saved)

Precisions

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

const: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

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%)

Accuracy

Total -25.2b remaining (-∞%)

Threshold costs -25.2b (-∞%)

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:

2.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%)

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)

soundness418.0ms (1.6%)

Rules

2603×	`fma-define`
911×	`fma-neg`
826×	`unsub-neg`
476×	`sub-neg`
291×	`distribute-neg-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	52	553
1	137	541
2	378	11
3	1534	11
4	3599	11
5	5046	11
6	5988	11
7	7022	11
8	7660	11
9	7744	11
10	7744	11
11	7852	11
12	7939	11
13	7960	11
14	7972	11
15	7978	11
16	7978	11

Stop Event

1×	done
1×	node limit

Compiler

Compiled 62 to 26 computations (58.1% saved)

preprocess46.0ms (0.2%)

Remove

(sort x y z)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 110 to 98 computations (10.9% saved)

simple fma test

analyze0.0ms (0%)

sample24.8s (96%)

preprocess347.0ms (1.3%)

explain197.0ms (0.8%)

eval0.0ms (0%)

prune1.0ms (0%)

localize16.0ms (0.1%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes6.0ms (0%)

simplify2.0ms (0%)

soundness418.0ms (1.6%)

preprocess46.0ms (0.2%)

end0.0ms (0%)

Profiling