Average Error: 0.0 → 0.0
Time: 637.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 r242829 = x;
        double r242830 = y;
        double r242831 = 4.0;
        double r242832 = r242830 * r242831;
        double r242833 = z;
        double r242834 = r242832 * r242833;
        double r242835 = r242829 - r242834;
        return r242835;
}
↓
double f(double x, double y, double z) {
        double r242836 = x;
        double r242837 = y;
        double r242838 = 4.0;
        double r242839 = r242837 * r242838;
        double r242840 = z;
        double r242841 = r242839 * r242840;
        double r242842 = r242836 - r242841;
        return r242842;
}

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