Average Error: 0.0 → 0.0
Time: 2.4s
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 r195431 = x;
        double r195432 = y;
        double r195433 = 4.0;
        double r195434 = r195432 * r195433;
        double r195435 = z;
        double r195436 = r195434 * r195435;
        double r195437 = r195431 - r195436;
        return r195437;
}
↓
double f(double x, double y, double z) {
        double r195438 = x;
        double r195439 = y;
        double r195440 = 4.0;
        double r195441 = r195439 * r195440;
        double r195442 = z;
        double r195443 = r195441 * r195442;
        double r195444 = r195438 - r195443;
        return r195444;
}

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