Average Error: 0.0 → 0.0
Time: 903.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 r177987 = x;
        double r177988 = y;
        double r177989 = 4.0;
        double r177990 = r177988 * r177989;
        double r177991 = z;
        double r177992 = r177990 * r177991;
        double r177993 = r177987 - r177992;
        return r177993;
}
↓
double f(double x, double y, double z) {
        double r177994 = x;
        double r177995 = y;
        double r177996 = 4.0;
        double r177997 = r177995 * r177996;
        double r177998 = z;
        double r177999 = r177997 * r177998;
        double r178000 = r177994 - r177999;
        return r178000;
}

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