Average Error: 0.0 → 0.0
Time: 1.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 r171939 = x;
        double r171940 = y;
        double r171941 = 4.0;
        double r171942 = r171940 * r171941;
        double r171943 = z;
        double r171944 = r171942 * r171943;
        double r171945 = r171939 - r171944;
        return r171945;
}
↓
double f(double x, double y, double z) {
        double r171946 = x;
        double r171947 = y;
        double r171948 = 4.0;
        double r171949 = r171947 * r171948;
        double r171950 = z;
        double r171951 = r171949 * r171950;
        double r171952 = r171946 - r171951;
        return r171952;
}

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