Average Error: 18.0 → 0.0
Time: 40.4s
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 r19632313 = x;
        double r19632314 = y;
        double r19632315 = r19632313 * r19632314;
        double r19632316 = r19632314 * r19632314;
        double r19632317 = r19632315 + r19632316;
        double r19632318 = z;
        double r19632319 = r19632314 * r19632318;
        double r19632320 = r19632317 - r19632319;
        double r19632321 = r19632320 - r19632316;
        return r19632321;
}
↓
double f(double x, double y, double z) {
        double r19632322 = y;
        double r19632323 = z;
        double r19632324 = -r19632323;
        double r19632325 = r19632322 * r19632324;
        double r19632326 = x;
        double r19632327 = r19632326 * r19632322;
        double r19632328 = r19632325 + r19632327;
        return r19632328;
}

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

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

Derivation

  1. Initial program 18.0

    \[\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 2019165 +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)))