Average Error: 0.1 → 0.1
Time: 937.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 r159678 = x;
        double r159679 = y;
        double r159680 = 4.0;
        double r159681 = r159679 * r159680;
        double r159682 = z;
        double r159683 = r159681 * r159682;
        double r159684 = r159678 - r159683;
        return r159684;
}

double f(double x, double y, double z) {
        double r159685 = x;
        double r159686 = y;
        double r159687 = 4.0;
        double r159688 = r159686 * r159687;
        double r159689 = z;
        double r159690 = r159688 * r159689;
        double r159691 = r159685 - r159690;
        return r159691;
}

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.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.1

    \[\leadsto x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2019212 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))