Average Error: 0.0 → 0.0
Time: 637.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 r197046 = x;
        double r197047 = y;
        double r197048 = 4.0;
        double r197049 = r197047 * r197048;
        double r197050 = z;
        double r197051 = r197049 * r197050;
        double r197052 = r197046 - r197051;
        return r197052;
}
↓
double f(double x, double y, double z) {
        double r197053 = x;
        double r197054 = y;
        double r197055 = 4.0;
        double r197056 = r197054 * r197055;
        double r197057 = z;
        double r197058 = r197056 * r197057;
        double r197059 = r197053 - r197058;
        return r197059;
}

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