Average Error: 0.0 → 0.0
Time: 4.9s
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 r468031 = x;
        double r468032 = y;
        double r468033 = 4.0;
        double r468034 = r468032 * r468033;
        double r468035 = z;
        double r468036 = r468034 * r468035;
        double r468037 = r468031 - r468036;
        return r468037;
}
↓
double f(double x, double y, double z) {
        double r468038 = x;
        double r468039 = y;
        double r468040 = 4.0;
        double r468041 = r468039 * r468040;
        double r468042 = z;
        double r468043 = r468041 * r468042;
        double r468044 = r468038 - r468043;
        return r468044;
}

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