Average Error: 0.0 → 0.0
Time: 3.6s
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 r233676 = x;
        double r233677 = y;
        double r233678 = 4.0;
        double r233679 = r233677 * r233678;
        double r233680 = z;
        double r233681 = r233679 * r233680;
        double r233682 = r233676 - r233681;
        return r233682;
}
↓
double f(double x, double y, double z) {
        double r233683 = x;
        double r233684 = y;
        double r233685 = 4.0;
        double r233686 = r233684 * r233685;
        double r233687 = z;
        double r233688 = r233686 * r233687;
        double r233689 = r233683 - r233688;
        return r233689;
}

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