Average Error: 0.0 → 0.0
Time: 1.1s
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 r932 = x;
        double r933 = y;
        double r934 = 4.0;
        double r935 = r933 * r934;
        double r936 = z;
        double r937 = r935 * r936;
        double r938 = r932 - r937;
        return r938;
}
↓
double f(double x, double y, double z) {
        double r939 = x;
        double r940 = y;
        double r941 = 4.0;
        double r942 = r940 * r941;
        double r943 = z;
        double r944 = r942 * r943;
        double r945 = r939 - r944;
        return r945;
}

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