Average Error: 45.1 → 0
Time: 1.1s
Precision: 64
\[\mathsf{fma}\left(x, y, z\right) - \left(1 + \left(x \cdot y + z\right)\right)\]
↓
\[-1\]
\mathsf{fma}\left(x, y, z\right) - \left(1 + \left(x \cdot y + z\right)\right)
↓
-1
double code(double x, double y, double z) {
	return (fma(x, y, z) - (1.0 + ((x * y) + z)));
}
↓
double code(double x, double y, double z) {
	return -1.0;
}

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

Target

Original45.1
Target0
Herbie0
\[-1\]

Derivation

  1. Initial program 45.1

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

  2. Simplified0

    \[\leadsto \color{blue}{-1}\]

  3. Final simplification0

    \[\leadsto -1\]

Reproduce

herbie shell --seed 2020091 +o rules:numerics
(FPCore (x y z)
  :name "simple fma test"
  :precision binary64

  :herbie-target
  -1

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