Average Error: 0.0 → 0.0
Time: 1.1s
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 r246279 = x;
        double r246280 = y;
        double r246281 = 4.0;
        double r246282 = r246280 * r246281;
        double r246283 = z;
        double r246284 = r246282 * r246283;
        double r246285 = r246279 - r246284;
        return r246285;
}
↓
double f(double x, double y, double z) {
        double r246286 = x;
        double r246287 = y;
        double r246288 = 4.0;
        double r246289 = r246287 * r246288;
        double r246290 = z;
        double r246291 = r246289 * r246290;
        double r246292 = r246286 - r246291;
        return r246292;
}

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