Average Error: 0.0 → 0.0
Time: 3.5s
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 r181842 = x;
        double r181843 = y;
        double r181844 = 4.0;
        double r181845 = r181843 * r181844;
        double r181846 = z;
        double r181847 = r181845 * r181846;
        double r181848 = r181842 - r181847;
        return r181848;
}
↓
double f(double x, double y, double z) {
        double r181849 = x;
        double r181850 = y;
        double r181851 = 4.0;
        double r181852 = r181850 * r181851;
        double r181853 = z;
        double r181854 = r181852 * r181853;
        double r181855 = r181849 - r181854;
        return r181855;
}

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