Metrics for simple fma test

analyze1.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

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

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

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

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample2.2s (60.5%)

Results

1.0s	3109×	2	valid
473.0ms	2920×	1	valid
250.0ms	2134×	0	valid
26.0ms	93×	3	valid

Precisions

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

ival-fma: 384.0ms (35.1% of total)

ival-add: 240.0ms (21.9% of total)

ival-mult: 207.0ms (18.9% of total)

backward-pass: 148.0ms (13.5% of total)

ival-sub: 97.0ms (8.9% of total)

const: 17.0ms (1.6% of total)

Bogosity

preprocess342.0ms (9.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)))
(-.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)

explain585.0ms (15.9%)

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
221	2	(3.641267570102039e-303 2.22724341913979e-125 9960289366112.97)	-	`(-.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

217.0ms	68×	0	valid
198.0ms	264×	2	valid
112.0ms	180×	1	valid

Compiler

Compiled 93 to 29 computations (68.8% saved)

Precisions

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

ival-add: 134.0ms (73.4% of total)

ival-fma: 17.0ms (9.3% of total)

backward-pass: 15.0ms (8.2% of total)

ival-mult: 10.0ms (5.5% of total)

ival-sub: 6.0ms (3.3% of total)

const: 1.0ms (0.5% of total)

eval0.0ms (0%)

Compiler: Compiled 15 to 8 computations (46.7% 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.4%)

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)

Results

9.0ms

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)

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

Accuracy

Total -53.6b remaining (-∞%)

Threshold costs -53.6b (-∞%)

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	y
1.0ms	x
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)

simplify1.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)

soundness457.0ms (12.5%)

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 21 computations (66.1% saved)

preprocess37.0ms (1%)

Remove

(sort x y z)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 110 to 98 computations (10.9% saved)

simple fma test

analyze1.0ms (0%)

sample2.2s (60.5%)

preprocess342.0ms (9.3%)

explain585.0ms (15.9%)

eval0.0ms (0%)

prune1.0ms (0%)

localize16.0ms (0.4%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes6.0ms (0.2%)

simplify1.0ms (0%)

soundness457.0ms (12.5%)

preprocess37.0ms (1%)

end0.0ms (0%)

Profiling