Average Error: 0.1 → 0.1
Time: 4.8s
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 r166285 = x;
        double r166286 = y;
        double r166287 = r166285 * r166286;
        double r166288 = z;
        double r166289 = r166287 + r166288;
        double r166290 = r166289 * r166286;
        double r166291 = t;
        double r166292 = r166290 + r166291;
        return r166292;
}
↓
double f(double x, double y, double z, double t) {
        double r166293 = x;
        double r166294 = y;
        double r166295 = r166293 * r166294;
        double r166296 = z;
        double r166297 = r166295 + r166296;
        double r166298 = r166297 * r166294;
        double r166299 = t;
        double r166300 = r166298 + r166299;
        return r166300;
}

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