Average Error: 0.0 → 0.0
Time: 486.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 r208903 = x;
        double r208904 = y;
        double r208905 = 4.0;
        double r208906 = r208904 * r208905;
        double r208907 = z;
        double r208908 = r208906 * r208907;
        double r208909 = r208903 - r208908;
        return r208909;
}
↓
double f(double x, double y, double z) {
        double r208910 = x;
        double r208911 = y;
        double r208912 = 4.0;
        double r208913 = r208911 * r208912;
        double r208914 = z;
        double r208915 = r208913 * r208914;
        double r208916 = r208910 - r208915;
        return r208916;
}

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