Average Error: 0.0 → 0.0
Time: 2.6s
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 r248869 = x;
        double r248870 = y;
        double r248871 = 4.0;
        double r248872 = r248870 * r248871;
        double r248873 = z;
        double r248874 = r248872 * r248873;
        double r248875 = r248869 - r248874;
        return r248875;
}
↓
double f(double x, double y, double z) {
        double r248876 = x;
        double r248877 = y;
        double r248878 = 4.0;
        double r248879 = r248877 * r248878;
        double r248880 = z;
        double r248881 = r248879 * r248880;
        double r248882 = r248876 - r248881;
        return r248882;
}

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