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 17 to 11 computations (35.3% saved)

Precisions

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

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

ival-true: 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)

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

sample2.2s (63.2%)

Results

1.2s	3099×	2	valid
425.0ms	2892×	1	valid
146.0ms	2170×	0	valid
24.0ms	95×	3	valid

Precisions

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

ival-add: 502.0ms (37.1% of total)

ival-fma: 350.0ms (25.9% of total)

backward-pass: 228.0ms (16.8% of total)

ival-mult: 160.0ms (11.8% of total)

ival-sub: 91.0ms (6.7% of total)

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

const: 7.0ms (0.5% of total)

ival-assert: 7.0ms (0.5% of total)

Bogosity

preprocess265.0ms (7.8%)

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)

explain239.0ms (7%)

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
210	5	(3.6037332784752685e-237 2.1765938095704597e-44 3306.793340200616)	-	`(-.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	210	0
`-.f64`	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`	nan-rescue	5	0
↳	`(fma.f64 x y z)`	overflow	5
↳	`(+.f64 (*.f64 x y) z)`	overflow	5
↳	`(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))`	overflow	5
↳	`(*.f64 x y)`	overflow	5

Confusion

	Predicted +	Predicted -
+	210	0
-	5	41

Precision

0.9767441860465116

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	210	0	0
-	5	0	41

Precision?

0.9767441860465116

Recall?

1.0

Freqs

test

number	freq
0	41
1	215

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Results

73.0ms	182×	1	valid
70.0ms	242×	2	valid
8.0ms	88×	0	valid

Compiler

Compiled 110 to 40 computations (63.6% saved)

Precisions

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

ival-fma: 16.0ms (28% of total)

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

ival-add: 12.0ms (21% of total)

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

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

const: 1.0ms (1.8% of total)

ival-assert: 1.0ms (1.8% of total)

ival-true: 1.0ms (1.8% 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)

simplify6.0ms (0.2%)

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)

localize126.0ms (3.7%)

Results

6.0ms

256×

valid

Compiler

Compiled 6 to 6 computations (0% saved)

Precisions

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

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

const: 0.0ms (0% of total)

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

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

eval0.0ms (0%)

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

prune2.0ms (0.1%)

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 -50.9b remaining (-∞%)

Threshold costs -50.9b (-∞%)

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

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)

soundness348.0ms (10.2%)

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)

preprocess259.0ms (7.6%)

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

preprocess265.0ms (7.8%)

explain239.0ms (7%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify6.0ms (0.2%)

localize126.0ms (3.7%)

eval0.0ms (0%)

prune2.0ms (0.1%)

regimes6.0ms (0.2%)

simplify1.0ms (0%)

soundness348.0ms (10.2%)

preprocess259.0ms (7.6%)

end0.0ms (0%)

Profiling