Average Error: 0.0 → 0.0
Time: 1.3s
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 r275407 = x;
        double r275408 = y;
        double r275409 = 4.0;
        double r275410 = r275408 * r275409;
        double r275411 = z;
        double r275412 = r275410 * r275411;
        double r275413 = r275407 - r275412;
        return r275413;
}
↓
double f(double x, double y, double z) {
        double r275414 = x;
        double r275415 = y;
        double r275416 = 4.0;
        double r275417 = r275415 * r275416;
        double r275418 = z;
        double r275419 = r275417 * r275418;
        double r275420 = r275414 - r275419;
        return r275420;
}

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