Average Error: 0.0 → 0.0
Time: 675.0ms
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 r236770 = x;
        double r236771 = y;
        double r236772 = 4.0;
        double r236773 = r236771 * r236772;
        double r236774 = z;
        double r236775 = r236773 * r236774;
        double r236776 = r236770 - r236775;
        return r236776;
}
↓
double f(double x, double y, double z) {
        double r236777 = x;
        double r236778 = y;
        double r236779 = 4.0;
        double r236780 = r236778 * r236779;
        double r236781 = z;
        double r236782 = r236780 * r236781;
        double r236783 = r236777 - r236782;
        return r236783;
}

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