Average Error: 0.0 → 0.0
Time: 3.6s
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 r145257 = x;
        double r145258 = y;
        double r145259 = 4.0;
        double r145260 = r145258 * r145259;
        double r145261 = z;
        double r145262 = r145260 * r145261;
        double r145263 = r145257 - r145262;
        return r145263;
}
↓
double f(double x, double y, double z) {
        double r145264 = x;
        double r145265 = y;
        double r145266 = 4.0;
        double r145267 = r145265 * r145266;
        double r145268 = z;
        double r145269 = r145267 * r145268;
        double r145270 = r145264 - r145269;
        return r145270;
}

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