Average Error: 0.0 → 0.0
Time: 13.1s
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 r142892 = x;
        double r142893 = y;
        double r142894 = 4.0;
        double r142895 = r142893 * r142894;
        double r142896 = z;
        double r142897 = r142895 * r142896;
        double r142898 = r142892 - r142897;
        return r142898;
}
↓
double f(double x, double y, double z) {
        double r142899 = x;
        double r142900 = y;
        double r142901 = 4.0;
        double r142902 = r142900 * r142901;
        double r142903 = z;
        double r142904 = r142902 * r142903;
        double r142905 = r142899 - r142904;
        return r142905;
}

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