Average Error: 0.0 → 0.0
Time: 4.8s
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 r289152 = x;
        double r289153 = y;
        double r289154 = 4.0;
        double r289155 = r289153 * r289154;
        double r289156 = z;
        double r289157 = r289155 * r289156;
        double r289158 = r289152 - r289157;
        return r289158;
}
↓
double f(double x, double y, double z) {
        double r289159 = x;
        double r289160 = y;
        double r289161 = 4.0;
        double r289162 = r289160 * r289161;
        double r289163 = z;
        double r289164 = r289162 * r289163;
        double r289165 = r289159 - r289164;
        return r289165;
}

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)))