Average Error: 0.0 → 0.0
Time: 3.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 r169452 = x;
        double r169453 = y;
        double r169454 = 4.0;
        double r169455 = r169453 * r169454;
        double r169456 = z;
        double r169457 = r169455 * r169456;
        double r169458 = r169452 - r169457;
        return r169458;
}
↓
double f(double x, double y, double z) {
        double r169459 = x;
        double r169460 = y;
        double r169461 = 4.0;
        double r169462 = r169460 * r169461;
        double r169463 = z;
        double r169464 = r169462 * r169463;
        double r169465 = r169459 - r169464;
        return r169465;
}

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