Average Error: 0.0 → 0.0
Time: 12.1s
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 r131035 = x;
        double r131036 = y;
        double r131037 = 4.0;
        double r131038 = r131036 * r131037;
        double r131039 = z;
        double r131040 = r131038 * r131039;
        double r131041 = r131035 - r131040;
        return r131041;
}
↓
double f(double x, double y, double z) {
        double r131042 = x;
        double r131043 = y;
        double r131044 = 4.0;
        double r131045 = r131043 * r131044;
        double r131046 = z;
        double r131047 = r131045 * r131046;
        double r131048 = r131042 - r131047;
        return r131048;
}

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