simple fma test

Time bar (total: 3.7s)

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

sample2.9s (77.4%)

Results
520.0ms3027×256valid
1.0s2769×1024valid
485.0ms1336×512valid
638.0ms1122×2048valid
0.0ms1024valid
0.0ms4096valid
Precisions
Click to see histograms. Total time spent on operations: 1.8s
Operation ival-mult, time spent: 630.0ms, 36.0% of total-time
Operation composed, time spent: 552.0ms, 31.0% of total-time
Operation ival-add, time spent: 393.0ms, 22.0% of total-time
Operation ival-sub, time spent: 153.0ms, 9.0% of total-time
Operation const, time spent: 27.0ms, 2.0% of total-time
Bogosity

preprocess449.0ms (12.1%)

Algorithm
egg-herbie
Rules
911×fmm-def
788×unsub-neg
476×sub-neg
379×fma-define
287×distribute-neg-in
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
2195(9.773763227984312e-265 1.5088949841031431e-233 16212.253144509905)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
3155611
4363711
5509111
6602111
7705511
8769311
9777711
10777711
11788511
12797211
13799311
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: 83.0ms
Operation ival-add, time spent: 26.0ms, 31.0% of total-time
Operation composed, time spent: 24.0ms, 29.0% of total-time
Operation ival-mult, time spent: 22.0ms, 27.0% of total-time
Operation ival-sub, time spent: 8.0ms, 10.0% of total-time
Operation const, time spent: 3.0ms, 4.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.4%)

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)

regimes6.0ms (0.2%)

Accuracy

Total -53.1b remaining (-∞%)

Threshold costs -53.1b (-∞%)

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

soundness321.0ms (8.6%)

Rules
911×fmm-def
788×unsub-neg
476×sub-neg
379×fma-define
287×distribute-neg-in
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
052553
1137541
237811
3155611
4363711
5509111
6602111
7705511
8769311
9777711
10777711
11788511
12797211
13799311
Stop Event
node limit
Compiler

Compiled 58 to 22 computations (62.1% saved)

end0.0ms (0%)

preprocess44.0ms (1.2%)

Remove

(sort x y z)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 110 to 98 computations (10.9% saved)

Profiling

Loading profile data...