Average Error: 0.0 → 0.0
Time: 1.3s
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 r191044 = x;
        double r191045 = y;
        double r191046 = 4.0;
        double r191047 = r191045 * r191046;
        double r191048 = z;
        double r191049 = r191047 * r191048;
        double r191050 = r191044 - r191049;
        return r191050;
}
↓
double f(double x, double y, double z) {
        double r191051 = x;
        double r191052 = y;
        double r191053 = 4.0;
        double r191054 = r191052 * r191053;
        double r191055 = z;
        double r191056 = r191054 * r191055;
        double r191057 = r191051 - r191056;
        return r191057;
}

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