Average Error: 17.0 → 0.0
Time: 12.6s
Precision: 64
\[\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y\]
↓
\[y \cdot x + y \cdot \left(-z\right)\]
\left(\left(x \cdot y - y \cdot z\right) - y \cdot y\right) + y \cdot y
↓
y \cdot x + y \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r359020 = x;
        double r359021 = y;
        double r359022 = r359020 * r359021;
        double r359023 = z;
        double r359024 = r359021 * r359023;
        double r359025 = r359022 - r359024;
        double r359026 = r359021 * r359021;
        double r359027 = r359025 - r359026;
        double r359028 = r359027 + r359026;
        return r359028;
}
↓
double f(double x, double y, double z) {
        double r359029 = y;
        double r359030 = x;
        double r359031 = r359029 * r359030;
        double r359032 = z;
        double r359033 = -r359032;
        double r359034 = r359029 * r359033;
        double r359035 = r359031 + r359034;
        return r359035;
}

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.0
Target0.0
Herbie0.0
\[\left(x - z\right) \cdot y\]

Derivation

  1. Initial program 17.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-lft-in0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2019323 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, B"
  :precision binary64

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

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