Average Error: 0.1 → 0.1
Time: 13.0s
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 r155323 = x;
        double r155324 = y;
        double r155325 = r155323 * r155324;
        double r155326 = z;
        double r155327 = r155325 + r155326;
        double r155328 = r155327 * r155324;
        double r155329 = t;
        double r155330 = r155328 + r155329;
        return r155330;
}
↓
double f(double x, double y, double z, double t) {
        double r155331 = x;
        double r155332 = y;
        double r155333 = r155331 * r155332;
        double r155334 = z;
        double r155335 = r155333 + r155334;
        double r155336 = r155335 * r155332;
        double r155337 = t;
        double r155338 = r155336 + r155337;
        return r155338;
}

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