Average Error: 0.0 → 0.0
Time: 6.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 r250689 = x;
        double r250690 = y;
        double r250691 = 4.0;
        double r250692 = r250690 * r250691;
        double r250693 = z;
        double r250694 = r250692 * r250693;
        double r250695 = r250689 - r250694;
        return r250695;
}
↓
double f(double x, double y, double z) {
        double r250696 = x;
        double r250697 = y;
        double r250698 = 4.0;
        double r250699 = r250697 * r250698;
        double r250700 = z;
        double r250701 = r250699 * r250700;
        double r250702 = r250696 - r250701;
        return r250702;
}

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