Average Error: 0.0 → 0.0
Time: 2.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 r159036 = x;
        double r159037 = y;
        double r159038 = 4.0;
        double r159039 = r159037 * r159038;
        double r159040 = z;
        double r159041 = r159039 * r159040;
        double r159042 = r159036 - r159041;
        return r159042;
}
↓
double f(double x, double y, double z) {
        double r159043 = x;
        double r159044 = y;
        double r159045 = 4.0;
        double r159046 = r159044 * r159045;
        double r159047 = z;
        double r159048 = r159046 * r159047;
        double r159049 = r159043 - r159048;
        return r159049;
}

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