Average Error: 0.0 → 0.0
Time: 1.7m
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 r890881 = x;
        double r890882 = y;
        double r890883 = 4.0;
        double r890884 = r890882 * r890883;
        double r890885 = z;
        double r890886 = r890884 * r890885;
        double r890887 = r890881 - r890886;
        return r890887;
}
↓
double f(double x, double y, double z) {
        double r890888 = x;
        double r890889 = y;
        double r890890 = 4.0;
        double r890891 = r890889 * r890890;
        double r890892 = z;
        double r890893 = r890891 * r890892;
        double r890894 = r890888 - r890893;
        return r890894;
}

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