Average Error: 0.0 → 0.0
Time: 3.6s
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 r773584 = x;
        double r773585 = y;
        double r773586 = 4.0;
        double r773587 = r773585 * r773586;
        double r773588 = z;
        double r773589 = r773587 * r773588;
        double r773590 = r773584 - r773589;
        return r773590;
}
↓
double f(double x, double y, double z) {
        double r773591 = x;
        double r773592 = y;
        double r773593 = 4.0;
        double r773594 = r773592 * r773593;
        double r773595 = z;
        double r773596 = r773594 * r773595;
        double r773597 = r773591 - r773596;
        return r773597;
}

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