Average Error: 0.0 → 0.0
Time: 11.3s
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 r148086 = x;
        double r148087 = y;
        double r148088 = 4.0;
        double r148089 = r148087 * r148088;
        double r148090 = z;
        double r148091 = r148089 * r148090;
        double r148092 = r148086 - r148091;
        return r148092;
}
↓
double f(double x, double y, double z) {
        double r148093 = x;
        double r148094 = y;
        double r148095 = 4.0;
        double r148096 = r148094 * r148095;
        double r148097 = z;
        double r148098 = r148096 * r148097;
        double r148099 = r148093 - r148098;
        return r148099;
}

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