Average Error: 0.0 → 0.0
Time: 625.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 r221907 = x;
        double r221908 = y;
        double r221909 = 4.0;
        double r221910 = r221908 * r221909;
        double r221911 = z;
        double r221912 = r221910 * r221911;
        double r221913 = r221907 - r221912;
        return r221913;
}
↓
double f(double x, double y, double z) {
        double r221914 = x;
        double r221915 = y;
        double r221916 = 4.0;
        double r221917 = r221915 * r221916;
        double r221918 = z;
        double r221919 = r221917 * r221918;
        double r221920 = r221914 - r221919;
        return r221920;
}

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