Average Error: 0.0 → 0.0
Time: 643.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 r160464 = x;
        double r160465 = y;
        double r160466 = 4.0;
        double r160467 = r160465 * r160466;
        double r160468 = z;
        double r160469 = r160467 * r160468;
        double r160470 = r160464 - r160469;
        return r160470;
}
↓
double f(double x, double y, double z) {
        double r160471 = x;
        double r160472 = y;
        double r160473 = 4.0;
        double r160474 = r160472 * r160473;
        double r160475 = z;
        double r160476 = r160474 * r160475;
        double r160477 = r160471 - r160476;
        return r160477;
}

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