Average Error: 0.0 → 0.0
Time: 1.7s
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 r309032 = x;
        double r309033 = y;
        double r309034 = 4.0;
        double r309035 = r309033 * r309034;
        double r309036 = z;
        double r309037 = r309035 * r309036;
        double r309038 = r309032 - r309037;
        return r309038;
}
↓
double f(double x, double y, double z) {
        double r309039 = x;
        double r309040 = y;
        double r309041 = 4.0;
        double r309042 = r309040 * r309041;
        double r309043 = z;
        double r309044 = r309042 * r309043;
        double r309045 = r309039 - r309044;
        return r309045;
}

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