Average Error: 0.0 → 0.0
Time: 3.5s
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 r214959 = x;
        double r214960 = y;
        double r214961 = 4.0;
        double r214962 = r214960 * r214961;
        double r214963 = z;
        double r214964 = r214962 * r214963;
        double r214965 = r214959 - r214964;
        return r214965;
}
↓
double f(double x, double y, double z) {
        double r214966 = x;
        double r214967 = y;
        double r214968 = 4.0;
        double r214969 = r214967 * r214968;
        double r214970 = z;
        double r214971 = r214969 * r214970;
        double r214972 = r214966 - r214971;
        return r214972;
}

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