Average Error: 0.0 → 0.0
Time: 644.0ms
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 r268477 = x;
        double r268478 = y;
        double r268479 = 4.0;
        double r268480 = r268478 * r268479;
        double r268481 = z;
        double r268482 = r268480 * r268481;
        double r268483 = r268477 - r268482;
        return r268483;
}
↓
double f(double x, double y, double z) {
        double r268484 = x;
        double r268485 = y;
        double r268486 = 4.0;
        double r268487 = r268485 * r268486;
        double r268488 = z;
        double r268489 = r268487 * r268488;
        double r268490 = r268484 - r268489;
        return r268490;
}

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