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-mult: 0.0ms (0% of total)

const: 0.0ms (0% of total)

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

compiled-spec: 0.0ms (0% of total)

sample21.7s (96.1%)

Results

16.7s	24249×	5	exit
773.0ms	8256×	0	valid

Precisions

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

backward-pass: 4.7s (32.6% of total)

compiled-spec: 3.5s (24.3% of total)

ival-mult: 3.1s (21.4% of total)

ival-add: 2.1s (14.7% of total)

ival-sub: 913.0ms (6.3% of total)

const: 120.0ms (0.8% of total)

Bogosity

preprocess226.0ms (1%)

Algorithm

2×	egg-herbie

Rules

1984×	`fmsub-define`
1846×	`sum3-define`
1806×	`fmm-def`
1790×	`fnmsub-define`
1700×	`+-lowering-+.f64`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	44	119
1	126	110
2	396	10
3	1785	10
4	6246	10
0	8	11
1	22	11
2	73	1
3	273	1
4	731	1
5	2883	1
6	7185	1
0	8109	1

Stop Event

1×	iter limit
1×	node limit
1×	node limit

Calls

Call 1

Inputs
(- (+ (* x y) z) (+ 1 (+ (* x y) z)))

Outputs
(- (+ (* x y) z) (+ 1 (+ (* x y) z)))
#s(literal -1 binary64)

Call 2

Inputs
(- (fma x y z) (+ 1 (+ (* x y) z)))
(- (fma (neg x) y z) (+ 1 (+ (* (neg x) y) z)))
(- (fma x (neg y) z) (+ 1 (+ (* x (neg y)) z)))
(- (fma x y (neg z)) (+ 1 (+ (* x y) (neg z))))
(neg (- (fma (neg x) y z) (+ 1 (+ (* (neg x) y) z))))
(neg (- (fma x (neg y) z) (+ 1 (+ (* x (neg y)) z))))
(neg (- (fma x y (neg z)) (+ 1 (+ (* x y) (neg z)))))
(- (fma y x z) (+ 1 (+ (* y x) z)))
(- (fma z y x) (+ 1 (+ (* z y) x)))
(- (fma x z y) (+ 1 (+ (* x z) y)))

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

Symmetry

(abs x)

(abs y)

(abs z)

(sort x y z)

explain350.0ms (1.6%)

FPErrors

Click to see full error table

Overpredictions	Example	Example	Subexpression
0	-	-	`x`
0	-	-	`y`
0	-	-	`(*.f64 x y)`
0	-	-	`z`
0	-	-	`(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(fma.f64 x y z)`
0	-	-	`(+.f64 (*.f64 x y) z)`
3	(5.451375773792062e-129 0.0005695352727446462 8135.704266420547)	-	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`

Results

256.0ms	258×	5	exit
32.0ms	254×	0	valid

Compiler

Compiled 93 to 29 computations (68.8% saved)

Precisions

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

backward-pass: 42.0ms (28.8% of total)

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

ival-sub: 27.0ms (18.5% of total)

compiled-spec: 22.0ms (15.1% of total)

ival-mult: 20.0ms (13.7% of total)

const: 2.0ms (1.4% 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)

simplify3.0ms (0%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated

Calls

Call 1

Inputs
-1

Outputs
-1
#s(literal -1 binary64)

localize10.0ms (0%)

Results

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

series0.0ms (0%)

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

rewrite47.0ms (0.2%)

Algorithm

1×	batch-egg-rewrite

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

simplify3.0ms (0%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

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

Threshold costs -29b (-∞%)

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)

simplify12.0ms (0.1%)

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)

soundness178.0ms (0.8%)

Rules

1700×	`+-lowering-+.f64`
1700×	`+-lowering-+.f32`
1384×	`fnmadd-define`
1324×	`fma-define`
1252×	`--lowering--.f32`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	8	11
1	22	11
2	73	1
3	273	1
4	731	1
5	2883	1
6	7185	1
0	8109	1

Stop Event

1×	done
1×	iter limit
1×	node limit

Compiler

Compiled 8 to 8 computations (0% saved)

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

analyze1.0ms (0%)

sample21.7s (96.1%)

preprocess226.0ms (1%)

explain350.0ms (1.6%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify3.0ms (0%)

localize10.0ms (0%)

series0.0ms (0%)

rewrite47.0ms (0.2%)

simplify3.0ms (0%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes6.0ms (0%)

simplify12.0ms (0.1%)

soundness178.0ms (0.8%)

preprocess37.0ms (0.2%)

end0.0ms (0%)

Profiling