Average Error: 18.0 → 0.0
Time: 15.7s
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 r23077215 = x;
        double r23077216 = y;
        double r23077217 = r23077215 * r23077216;
        double r23077218 = z;
        double r23077219 = r23077216 * r23077218;
        double r23077220 = r23077217 - r23077219;
        double r23077221 = r23077216 * r23077216;
        double r23077222 = r23077220 - r23077221;
        double r23077223 = r23077222 + r23077221;
        return r23077223;
}
↓
double f(double x, double y, double z) {
        double r23077224 = y;
        double r23077225 = z;
        double r23077226 = -r23077225;
        double r23077227 = r23077224 * r23077226;
        double r23077228 = x;
        double r23077229 = r23077228 * r23077224;
        double r23077230 = r23077227 + r23077229;
        return r23077230;
}

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 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 2019172 
(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)))