Average Error: 12.9 → 0.0
Time: 1.5s
Precision: 64
\[\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z\]
\[\mathsf{fma}\left(y, x, y \cdot \left(-z\right)\right)\]
\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z
\mathsf{fma}\left(y, x, y \cdot \left(-z\right)\right)
double f(double x, double y, double z) {
        double r483794 = x;
        double r483795 = y;
        double r483796 = r483794 * r483795;
        double r483797 = r483795 * r483795;
        double r483798 = r483796 - r483797;
        double r483799 = r483798 + r483797;
        double r483800 = z;
        double r483801 = r483795 * r483800;
        double r483802 = r483799 - r483801;
        return r483802;
}

double f(double x, double y, double z) {
        double r483803 = y;
        double r483804 = x;
        double r483805 = z;
        double r483806 = -r483805;
        double r483807 = r483803 * r483806;
        double r483808 = fma(r483803, r483804, r483807);
        return r483808;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Target

Original12.9
Target0.0
Herbie0.0
\[\left(x - z\right) \cdot y\]

Derivation

  1. Initial program 12.9

    \[\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z\]
  2. Simplified0.0

    \[\leadsto \color{blue}{y \cdot \left(x - z\right)}\]
  3. Using strategy rm
  4. Applied sub-neg0.0

    \[\leadsto y \cdot \color{blue}{\left(x + \left(-z\right)\right)}\]
  5. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{y \cdot x + y \cdot \left(-z\right)}\]
  6. Using strategy rm
  7. Applied fma-def0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, y \cdot \left(-z\right)\right)}\]
  8. Final simplification0.0

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

Reproduce

herbie shell --seed 2019353 +o rules:numerics
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, D"
  :precision binary64

  :herbie-target
  (* (- x z) y)

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