Average Error: 0.0 → 0.0
Time: 1.2s
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 r23976199 = x;
        double r23976200 = y;
        double r23976201 = 4.0;
        double r23976202 = r23976200 * r23976201;
        double r23976203 = z;
        double r23976204 = r23976202 * r23976203;
        double r23976205 = r23976199 - r23976204;
        return r23976205;
}
↓
double f(double x, double y, double z) {
        double r23976206 = x;
        double r23976207 = y;
        double r23976208 = 4.0;
        double r23976209 = r23976207 * r23976208;
        double r23976210 = z;
        double r23976211 = r23976209 * r23976210;
        double r23976212 = r23976206 - r23976211;
        return r23976212;
}

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