Average Error: 0.0 → 0.0
Time: 3.8s
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 r129493 = x;
        double r129494 = y;
        double r129495 = 4.0;
        double r129496 = r129494 * r129495;
        double r129497 = z;
        double r129498 = r129496 * r129497;
        double r129499 = r129493 - r129498;
        return r129499;
}
↓
double f(double x, double y, double z) {
        double r129500 = x;
        double r129501 = y;
        double r129502 = 4.0;
        double r129503 = r129501 * r129502;
        double r129504 = z;
        double r129505 = r129503 * r129504;
        double r129506 = r129500 - r129505;
        return r129506;
}

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