Average Error: 0.1 → 0.1
Time: 17.1s
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 r120168 = x;
        double r120169 = y;
        double r120170 = r120168 * r120169;
        double r120171 = z;
        double r120172 = r120170 + r120171;
        double r120173 = r120172 * r120169;
        double r120174 = t;
        double r120175 = r120173 + r120174;
        return r120175;
}
↓
double f(double x, double y, double z, double t) {
        double r120176 = x;
        double r120177 = y;
        double r120178 = r120176 * r120177;
        double r120179 = z;
        double r120180 = r120178 + r120179;
        double r120181 = r120180 * r120177;
        double r120182 = t;
        double r120183 = r120181 + r120182;
        return r120183;
}

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