Average Error: 0.0 → 0.0
Time: 517.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 r188420 = x;
        double r188421 = y;
        double r188422 = 4.0;
        double r188423 = r188421 * r188422;
        double r188424 = z;
        double r188425 = r188423 * r188424;
        double r188426 = r188420 - r188425;
        return r188426;
}
↓
double f(double x, double y, double z) {
        double r188427 = x;
        double r188428 = y;
        double r188429 = 4.0;
        double r188430 = r188428 * r188429;
        double r188431 = z;
        double r188432 = r188430 * r188431;
        double r188433 = r188427 - r188432;
        return r188433;
}

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