Average Error: 16.8 → 0.0
Time: 12.3s
Precision: 64
\[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]
\[y \cdot \left(-z\right) + x \cdot y\]
\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y
y \cdot \left(-z\right) + x \cdot y
double f(double x, double y, double z) {
        double r29135512 = x;
        double r29135513 = y;
        double r29135514 = r29135512 * r29135513;
        double r29135515 = z;
        double r29135516 = r29135513 * r29135515;
        double r29135517 = r29135514 - r29135516;
        double r29135518 = r29135513 * r29135513;
        double r29135519 = r29135517 - r29135518;
        double r29135520 = r29135519 + r29135518;
        return r29135520;
}

double f(double x, double y, double z) {
        double r29135521 = y;
        double r29135522 = z;
        double r29135523 = -r29135522;
        double r29135524 = r29135521 * r29135523;
        double r29135525 = x;
        double r29135526 = r29135525 * r29135521;
        double r29135527 = r29135524 + r29135526;
        return r29135527;
}

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

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

Derivation

  1. Initial program 16.8

    \[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\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 2019164 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, B"

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

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