Average Error: 17.9 → 0.0
Time: 19.9s
Precision: 64
\[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y\]
↓
\[y \cdot \left(-z\right) + x \cdot y\]
\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y
↓
y \cdot \left(-z\right) + x \cdot y
double f(double x, double y, double z) {
        double r23953319 = x;
        double r23953320 = y;
        double r23953321 = r23953319 * r23953320;
        double r23953322 = r23953320 * r23953320;
        double r23953323 = r23953321 + r23953322;
        double r23953324 = z;
        double r23953325 = r23953320 * r23953324;
        double r23953326 = r23953323 - r23953325;
        double r23953327 = r23953326 - r23953322;
        return r23953327;
}
↓
double f(double x, double y, double z) {
        double r23953328 = y;
        double r23953329 = z;
        double r23953330 = -r23953329;
        double r23953331 = r23953328 * r23953330;
        double r23953332 = x;
        double r23953333 = r23953332 * r23953328;
        double r23953334 = r23953331 + r23953333;
        return r23953334;
}

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

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

Derivation

  1. Initial program 17.9

    \[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y\]

  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-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot y + \left(-z\right) \cdot y}\]

  6. Final simplification0.0

    \[\leadsto y \cdot \left(-z\right) + x \cdot y\]

Reproduce

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

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

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