Average Error: 0.1 → 0.1
Time: 12.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 r145275 = x;
        double r145276 = y;
        double r145277 = r145275 * r145276;
        double r145278 = z;
        double r145279 = r145277 + r145278;
        double r145280 = r145279 * r145276;
        double r145281 = t;
        double r145282 = r145280 + r145281;
        return r145282;
}
↓
double f(double x, double y, double z, double t) {
        double r145283 = x;
        double r145284 = y;
        double r145285 = r145283 * r145284;
        double r145286 = z;
        double r145287 = r145285 + r145286;
        double r145288 = r145287 * r145284;
        double r145289 = t;
        double r145290 = r145288 + r145289;
        return r145290;
}

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 2019212 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))