Average Error: 0.0 → 0.0
Time: 928.0ms
Precision: binary64
\[\mathsf{fma}\left(x, y + z, y + x\right)\]
↓
\[\mathsf{fma}\left(x, y + z, y + x\right)\]
\mathsf{fma}\left(x, y + z, y + x\right)
↓
\mathsf{fma}\left(x, y + z, y + x\right)
double code(double x, double y, double z) {
	return ((double) fma(x, ((double) (y + z)), ((double) (y + x))));
}
↓
double code(double x, double y, double z) {
	return ((double) fma(x, ((double) (y + z)), ((double) (y + x))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\mathsf{fma}\left(x, y + z, y + x\right)\]

  2. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(x, y + z, y + x\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (x y z)
  :name "(fma x (+ y z) (+ y x))"
  :precision binary64
  (fma x (+ y z) (+ y x)))