Average Error: 0.1 → 0.1
Time: 3.5s
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 r113200 = x;
        double r113201 = y;
        double r113202 = r113200 * r113201;
        double r113203 = z;
        double r113204 = r113202 + r113203;
        double r113205 = r113204 * r113201;
        double r113206 = t;
        double r113207 = r113205 + r113206;
        return r113207;
}
↓
double f(double x, double y, double z, double t) {
        double r113208 = x;
        double r113209 = y;
        double r113210 = r113208 * r113209;
        double r113211 = z;
        double r113212 = r113210 + r113211;
        double r113213 = r113212 * r113209;
        double r113214 = t;
        double r113215 = r113213 + r113214;
        return r113215;
}

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 2020060 +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))