Average Error: 17.5 → 0.0
Time: 2.3s
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 r483170 = x;
        double r483171 = y;
        double r483172 = r483170 * r483171;
        double r483173 = r483171 * r483171;
        double r483174 = r483172 + r483173;
        double r483175 = z;
        double r483176 = r483171 * r483175;
        double r483177 = r483174 - r483176;
        double r483178 = r483177 - r483173;
        return r483178;
}
↓
double f(double x, double y, double z) {
        double r483179 = y;
        double r483180 = x;
        double r483181 = r483179 * r483180;
        double r483182 = z;
        double r483183 = -r483182;
        double r483184 = r483179 * r483183;
        double r483185 = r483181 + r483184;
        return r483185;
}

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

Derivation

  1. Initial program 17.5

    \[\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 2020024 
(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)))