Average Error: 0.0 → 0.0
Time: 4.2s
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 r252628 = x;
        double r252629 = y;
        double r252630 = 4.0;
        double r252631 = r252629 * r252630;
        double r252632 = z;
        double r252633 = r252631 * r252632;
        double r252634 = r252628 - r252633;
        return r252634;
}
↓
double f(double x, double y, double z) {
        double r252635 = x;
        double r252636 = y;
        double r252637 = 4.0;
        double r252638 = r252636 * r252637;
        double r252639 = z;
        double r252640 = r252638 * r252639;
        double r252641 = r252635 - r252640;
        return r252641;
}

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