Average Error: 0.0 → 0.0
Time: 796.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 r317757 = x;
        double r317758 = y;
        double r317759 = 4.0;
        double r317760 = r317758 * r317759;
        double r317761 = z;
        double r317762 = r317760 * r317761;
        double r317763 = r317757 - r317762;
        return r317763;
}
↓
double f(double x, double y, double z) {
        double r317764 = x;
        double r317765 = y;
        double r317766 = 4.0;
        double r317767 = r317765 * r317766;
        double r317768 = z;
        double r317769 = r317767 * r317768;
        double r317770 = r317764 - r317769;
        return r317770;
}

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