Average Error: 0.1 → 0.1
Time: 4.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 r209284 = x;
        double r209285 = y;
        double r209286 = r209284 * r209285;
        double r209287 = z;
        double r209288 = r209286 + r209287;
        double r209289 = r209288 * r209285;
        double r209290 = t;
        double r209291 = r209289 + r209290;
        return r209291;
}

double f(double x, double y, double z, double t) {
        double r209292 = x;
        double r209293 = y;
        double r209294 = r209292 * r209293;
        double r209295 = z;
        double r209296 = r209294 + r209295;
        double r209297 = r209296 * r209293;
        double r209298 = t;
        double r209299 = r209297 + r209298;
        return r209299;
}

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