Average Error: 0.0 → 0.0
Time: 11.0s
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 r288775 = x;
        double r288776 = y;
        double r288777 = 4.0;
        double r288778 = r288776 * r288777;
        double r288779 = z;
        double r288780 = r288778 * r288779;
        double r288781 = r288775 - r288780;
        return r288781;
}
↓
double f(double x, double y, double z) {
        double r288782 = x;
        double r288783 = y;
        double r288784 = 4.0;
        double r288785 = r288783 * r288784;
        double r288786 = z;
        double r288787 = r288785 * r288786;
        double r288788 = r288782 - r288787;
        return r288788;
}

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