Average Error: 0.0 → 0.0
Time: 9.4s
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 r157189 = x;
        double r157190 = y;
        double r157191 = 4.0;
        double r157192 = r157190 * r157191;
        double r157193 = z;
        double r157194 = r157192 * r157193;
        double r157195 = r157189 - r157194;
        return r157195;
}
↓
double f(double x, double y, double z) {
        double r157196 = x;
        double r157197 = y;
        double r157198 = 4.0;
        double r157199 = r157197 * r157198;
        double r157200 = z;
        double r157201 = r157199 * r157200;
        double r157202 = r157196 - r157201;
        return r157202;
}

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