Average Error: 0.0 → 0.0
Time: 623.0ms
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r249301 = x;
        double r249302 = y;
        double r249303 = 4.0;
        double r249304 = r249302 * r249303;
        double r249305 = z;
        double r249306 = r249304 * r249305;
        double r249307 = r249301 - r249306;
        return r249307;
}
↓
double f(double x, double y, double z) {
        double r249308 = x;
        double r249309 = y;
        double r249310 = 4.0;
        double r249311 = r249309 * r249310;
        double r249312 = z;
        double r249313 = r249311 * r249312;
        double r249314 = r249308 - r249313;
        return r249314;
}

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

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020046 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))