Average Error: 0.0 → 0.0
Time: 3.7s
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 r133164 = x;
        double r133165 = y;
        double r133166 = 4.0;
        double r133167 = r133165 * r133166;
        double r133168 = z;
        double r133169 = r133167 * r133168;
        double r133170 = r133164 - r133169;
        return r133170;
}
↓
double f(double x, double y, double z) {
        double r133171 = x;
        double r133172 = y;
        double r133173 = 4.0;
        double r133174 = r133172 * r133173;
        double r133175 = z;
        double r133176 = r133174 * r133175;
        double r133177 = r133171 - r133176;
        return r133177;
}

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