Average Error: 0.1 → 0.1
Time: 3.2s
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 r173209 = x;
        double r173210 = y;
        double r173211 = r173209 * r173210;
        double r173212 = z;
        double r173213 = r173211 + r173212;
        double r173214 = r173213 * r173210;
        double r173215 = t;
        double r173216 = r173214 + r173215;
        return r173216;
}
↓
double f(double x, double y, double z, double t) {
        double r173217 = x;
        double r173218 = y;
        double r173219 = r173217 * r173218;
        double r173220 = z;
        double r173221 = r173219 + r173220;
        double r173222 = r173221 * r173218;
        double r173223 = t;
        double r173224 = r173222 + r173223;
        return r173224;
}

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