Average Error: 0.0 → 0.0
Time: 1.4s
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 r175346 = x;
        double r175347 = y;
        double r175348 = 4.0;
        double r175349 = r175347 * r175348;
        double r175350 = z;
        double r175351 = r175349 * r175350;
        double r175352 = r175346 - r175351;
        return r175352;
}
↓
double f(double x, double y, double z) {
        double r175353 = x;
        double r175354 = y;
        double r175355 = 4.0;
        double r175356 = r175354 * r175355;
        double r175357 = z;
        double r175358 = r175356 * r175357;
        double r175359 = r175353 - r175358;
        return r175359;
}

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