Average Error: 0.1 → 0.1
Time: 1.3s
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 r190731 = x;
        double r190732 = y;
        double r190733 = 4.0;
        double r190734 = r190732 * r190733;
        double r190735 = z;
        double r190736 = r190734 * r190735;
        double r190737 = r190731 - r190736;
        return r190737;
}

double f(double x, double y, double z) {
        double r190738 = x;
        double r190739 = y;
        double r190740 = 4.0;
        double r190741 = r190739 * r190740;
        double r190742 = z;
        double r190743 = r190741 * r190742;
        double r190744 = r190738 - r190743;
        return r190744;
}

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