Average Error: 0.1 → 0.1
Time: 4.4s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
↓
\[\left(x \cdot y + z\right) \cdot y + t\]
\left(x \cdot y + z\right) \cdot y + t
↓
\left(x \cdot y + z\right) \cdot y + t
double f(double x, double y, double z, double t) {
        double r162025 = x;
        double r162026 = y;
        double r162027 = r162025 * r162026;
        double r162028 = z;
        double r162029 = r162027 + r162028;
        double r162030 = r162029 * r162026;
        double r162031 = t;
        double r162032 = r162030 + r162031;
        return r162032;
}
↓
double f(double x, double y, double z, double t) {
        double r162033 = x;
        double r162034 = y;
        double r162035 = r162033 * r162034;
        double r162036 = z;
        double r162037 = r162035 + r162036;
        double r162038 = r162037 * r162034;
        double r162039 = t;
        double r162040 = r162038 + r162039;
        return r162040;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(x \cdot y + z\right) \cdot y + t\]

  2. Final simplification0.1

    \[\leadsto \left(x \cdot y + z\right) \cdot y + t\]

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))