simple fma test

Time bar (total: 41.2s)

analyze0.0ms (0%)

Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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
Operation composed, time spent: 0.0ms, 0.0% of total-time
Operation ival-sub, time spent: 0.0ms, 0.0% of total-time
Operation ival-add, time spent: 0.0ms, 0.0% of total-time
Operation ival-mult, time spent: 0.0ms, 0.0% of total-time
Operation const, time spent: 0.0ms, 0.0% of total-time

sample40.2s (97.6%)

Results
35.9s23340×5exit
1.6s8255×0valid
0.0ms0valid
Precisions
Click to see histograms. Total time spent on operations: 37.4s
Operation backward-pass, time spent: 20.0s, 53.0% of total-time
Operation composed, time spent: 8.9s, 24.0% of total-time
Operation ival-mult, time spent: 3.6s, 10.0% of total-time
Operation ival-add, time spent: 3.5s, 9.0% of total-time
Operation ival-sub, time spent: 1.2s, 3.0% of total-time
Operation const, time spent: 212.0ms, 1.0% of total-time
Bogosity

preprocess497.0ms (1.2%)

Algorithm
egg-herbie
Rules
2603×fma-define
911×fma-neg
826×unsub-neg
476×sub-neg
291×distribute-neg-in
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
1288(1.3161733005031393e-97 1.672874829621015e-80 3685419055.040884)0-(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
00-0-x
00-0-y
00-0-(*.f64 x y)
00-0-z
00-0-(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))
00-0-#s(literal 1 binary64)
00-0-(fma.f64 x y z)
00-0-(+.f64 (*.f64 x y) z)
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
052553
1137541
237811
3153411
4359911
5504611
6598811
7702211
8766011
9774411
10774411
11785211
12793911
13796011
14797211
15797811
16797811
Stop Event
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)

Compiler

Compiled 93 to 35 computations (62.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 71.0ms
Operation ival-add, time spent: 25.0ms, 35.0% of total-time
Operation ival-mult, time spent: 22.0ms, 31.0% of total-time
Operation composed, time spent: 17.0ms, 24.0% of total-time
Operation ival-sub, time spent: 4.0ms, 6.0% of total-time
Operation const, time spent: 2.0ms, 3.0% of total-time

eval0.0ms (0%)

Compiler

Compiled 15 to 8 computations (46.7% saved)

prune1.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(literal -1 binary64)
Compiler

Compiled 4 to 4 computations (0% saved)

localize15.0ms (0%)

Compiler

Compiled 5 to 5 computations (0% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
Operation const, time spent: 0.0ms, 0.0% of total-time

eval0.0ms (0%)

Compiler

Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(literal -1 binary64)
Compiler

Compiled 20 to 14 computations (30% saved)

regimes9.0ms (0%)

Accuracy

Total -31.0b remaining (-∞%)

Threshold costs -31b (-∞%)

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:

4.0ms
y
2.0ms
z
2.0ms
x
1.0ms
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
Results
AccuracySegmentsBranch
100.0%1x
100.0%1y
100.0%1z
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
egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
011
Stop Event
done
saturated
Calls
Call 1
Inputs
#s(literal -1 binary64)
Outputs
#s(literal -1 binary64)
Compiler

Compiled 4 to 4 computations (0% saved)

soundness402.0ms (1%)

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

Useful iterations: 2 (0.0ms)

IterNodesCost
052553
1137541
237811
3153411
4359911
5504611
6598811
7702211
8766011
9774411
10774411
11785211
12793911
13796011
14797211
15797811
16797811
Stop Event
node limit
Compiler

Compiled 58 to 22 computations (62.1% saved)

end0.0ms (0%)

preprocess44.0ms (0.1%)

Remove

(sort x y z)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 110 to 98 computations (10.9% saved)

Profiling

Loading profile data...