Average Error: 12.4 → 0.0
Time: 7.3s
Precision: 64
\[\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z\]
↓
\[\left(-z\right) \cdot y + y \cdot x\]
\left(\left(x \cdot y - y \cdot y\right) + y \cdot y\right) - y \cdot z
↓
\left(-z\right) \cdot y + y \cdot x
double f(double x, double y, double z) {
        double r8995210 = x;
        double r8995211 = y;
        double r8995212 = r8995210 * r8995211;
        double r8995213 = r8995211 * r8995211;
        double r8995214 = r8995212 - r8995213;
        double r8995215 = r8995214 + r8995213;
        double r8995216 = z;
        double r8995217 = r8995211 * r8995216;
        double r8995218 = r8995215 - r8995217;
        return r8995218;
}
↓
double f(double x, double y, double z) {
        double r8995219 = z;
        double r8995220 = -r8995219;
        double r8995221 = y;
        double r8995222 = r8995220 * r8995221;
        double r8995223 = x;
        double r8995224 = r8995221 * r8995223;
        double r8995225 = r8995222 + r8995224;
        return r8995225;
}

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

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

Derivation

  1. Initial program 12.4

    \[\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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019156 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, D"

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

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