Average Error: 17.1 → 0.0
Time: 2.0s
Precision: 64
\[\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y\]
↓
\[y \cdot x + y \cdot \left(-z\right)\]
\left(\left(x \cdot y + y \cdot y\right) - y \cdot z\right) - y \cdot y
↓
y \cdot x + y \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r629049 = x;
        double r629050 = y;
        double r629051 = r629049 * r629050;
        double r629052 = r629050 * r629050;
        double r629053 = r629051 + r629052;
        double r629054 = z;
        double r629055 = r629050 * r629054;
        double r629056 = r629053 - r629055;
        double r629057 = r629056 - r629052;
        return r629057;
}
↓
double f(double x, double y, double z) {
        double r629058 = y;
        double r629059 = x;
        double r629060 = r629058 * r629059;
        double r629061 = z;
        double r629062 = -r629061;
        double r629063 = r629058 * r629062;
        double r629064 = r629060 + r629063;
        return r629064;
}

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

Derivation

  1. Initial program 17.1

    \[\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-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 2020057 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, C"
  :precision binary64

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

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