Average Error: 0.0 → 0.0
Time: 594.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 r236009 = x;
        double r236010 = y;
        double r236011 = 4.0;
        double r236012 = r236010 * r236011;
        double r236013 = z;
        double r236014 = r236012 * r236013;
        double r236015 = r236009 - r236014;
        return r236015;
}
↓
double f(double x, double y, double z) {
        double r236016 = x;
        double r236017 = y;
        double r236018 = 4.0;
        double r236019 = r236017 * r236018;
        double r236020 = z;
        double r236021 = r236019 * r236020;
        double r236022 = r236016 - r236021;
        return r236022;
}

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