Average Error: 0.0 → 0.0
Time: 593.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 r200409 = x;
        double r200410 = y;
        double r200411 = 4.0;
        double r200412 = r200410 * r200411;
        double r200413 = z;
        double r200414 = r200412 * r200413;
        double r200415 = r200409 - r200414;
        return r200415;
}
↓
double f(double x, double y, double z) {
        double r200416 = x;
        double r200417 = y;
        double r200418 = 4.0;
        double r200419 = r200417 * r200418;
        double r200420 = z;
        double r200421 = r200419 * r200420;
        double r200422 = r200416 - r200421;
        return r200422;
}

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 2020024 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))