Average Error: 0.1 → 0.1
Time: 703.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 r277910 = x;
        double r277911 = y;
        double r277912 = 4.0;
        double r277913 = r277911 * r277912;
        double r277914 = z;
        double r277915 = r277913 * r277914;
        double r277916 = r277910 - r277915;
        return r277916;
}
↓
double f(double x, double y, double z) {
        double r277917 = x;
        double r277918 = y;
        double r277919 = 4.0;
        double r277920 = r277918 * r277919;
        double r277921 = z;
        double r277922 = r277920 * r277921;
        double r277923 = r277917 - r277922;
        return r277923;
}

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