Average Error: 0.0 → 0.0
Time: 1.2s
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 r163885 = x;
        double r163886 = y;
        double r163887 = 4.0;
        double r163888 = r163886 * r163887;
        double r163889 = z;
        double r163890 = r163888 * r163889;
        double r163891 = r163885 - r163890;
        return r163891;
}
↓
double f(double x, double y, double z) {
        double r163892 = x;
        double r163893 = y;
        double r163894 = 4.0;
        double r163895 = r163893 * r163894;
        double r163896 = z;
        double r163897 = r163895 * r163896;
        double r163898 = r163892 - r163897;
        return r163898;
}

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