Average Error: 0.0 → 0.0
Time: 512.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 r200382 = x;
        double r200383 = y;
        double r200384 = 4.0;
        double r200385 = r200383 * r200384;
        double r200386 = z;
        double r200387 = r200385 * r200386;
        double r200388 = r200382 - r200387;
        return r200388;
}
↓
double f(double x, double y, double z) {
        double r200389 = x;
        double r200390 = y;
        double r200391 = 4.0;
        double r200392 = r200390 * r200391;
        double r200393 = z;
        double r200394 = r200392 * r200393;
        double r200395 = r200389 - r200394;
        return r200395;
}

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