Average Error: 0.0 → 0.0
Time: 11.2s
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 r165727 = x;
        double r165728 = y;
        double r165729 = 4.0;
        double r165730 = r165728 * r165729;
        double r165731 = z;
        double r165732 = r165730 * r165731;
        double r165733 = r165727 - r165732;
        return r165733;
}
↓
double f(double x, double y, double z) {
        double r165734 = x;
        double r165735 = y;
        double r165736 = 4.0;
        double r165737 = r165735 * r165736;
        double r165738 = z;
        double r165739 = r165737 * r165738;
        double r165740 = r165734 - r165739;
        return r165740;
}

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