Average Error: 0.0 → 0.0
Time: 1.3s
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 r199926 = x;
        double r199927 = y;
        double r199928 = 4.0;
        double r199929 = r199927 * r199928;
        double r199930 = z;
        double r199931 = r199929 * r199930;
        double r199932 = r199926 - r199931;
        return r199932;
}
↓
double f(double x, double y, double z) {
        double r199933 = x;
        double r199934 = y;
        double r199935 = 4.0;
        double r199936 = r199934 * r199935;
        double r199937 = z;
        double r199938 = r199936 * r199937;
        double r199939 = r199933 - r199938;
        return r199939;
}

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