Average Error: 0.0 → 0.0
Time: 512.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 r207877 = x;
        double r207878 = y;
        double r207879 = 4.0;
        double r207880 = r207878 * r207879;
        double r207881 = z;
        double r207882 = r207880 * r207881;
        double r207883 = r207877 - r207882;
        return r207883;
}
↓
double f(double x, double y, double z) {
        double r207884 = x;
        double r207885 = y;
        double r207886 = 4.0;
        double r207887 = r207885 * r207886;
        double r207888 = z;
        double r207889 = r207887 * r207888;
        double r207890 = r207884 - r207889;
        return r207890;
}

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