Average Error: 0.1 → 0.1
Time: 633.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 r197946 = x;
        double r197947 = y;
        double r197948 = 4.0;
        double r197949 = r197947 * r197948;
        double r197950 = z;
        double r197951 = r197949 * r197950;
        double r197952 = r197946 - r197951;
        return r197952;
}
↓
double f(double x, double y, double z) {
        double r197953 = x;
        double r197954 = y;
        double r197955 = 4.0;
        double r197956 = r197954 * r197955;
        double r197957 = z;
        double r197958 = r197956 * r197957;
        double r197959 = r197953 - r197958;
        return r197959;
}

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