Average Error: 0.1 → 0.1
Time: 676.0ms
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 r225950 = x;
        double r225951 = y;
        double r225952 = 4.0;
        double r225953 = r225951 * r225952;
        double r225954 = z;
        double r225955 = r225953 * r225954;
        double r225956 = r225950 - r225955;
        return r225956;
}
↓
double f(double x, double y, double z) {
        double r225957 = x;
        double r225958 = y;
        double r225959 = 4.0;
        double r225960 = r225958 * r225959;
        double r225961 = z;
        double r225962 = r225960 * r225961;
        double r225963 = r225957 - r225962;
        return r225963;
}

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.1

    \[x - \left(y \cdot 4\right) \cdot z\]

  2. Final simplification0.1

    \[\leadsto x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2020003 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))