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 r161285 = x;
        double r161286 = y;
        double r161287 = r161285 * r161286;
        double r161288 = z;
        double r161289 = r161287 + r161288;
        double r161290 = r161289 * r161286;
        double r161291 = t;
        double r161292 = r161290 + r161291;
        return r161292;
}
↓
double f(double x, double y, double z, double t) {
        double r161293 = x;
        double r161294 = y;
        double r161295 = r161293 * r161294;
        double r161296 = z;
        double r161297 = r161295 + r161296;
        double r161298 = r161297 * r161294;
        double r161299 = t;
        double r161300 = r161298 + r161299;
        return r161300;
}

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