Average Error: 0.1 → 0.1
Time: 6.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 r112446 = x;
        double r112447 = y;
        double r112448 = r112446 * r112447;
        double r112449 = z;
        double r112450 = r112448 + r112449;
        double r112451 = r112450 * r112447;
        double r112452 = t;
        double r112453 = r112451 + r112452;
        return r112453;
}
↓
double f(double x, double y, double z, double t) {
        double r112454 = x;
        double r112455 = y;
        double r112456 = r112454 * r112455;
        double r112457 = z;
        double r112458 = r112456 + r112457;
        double r112459 = r112458 * r112455;
        double r112460 = t;
        double r112461 = r112459 + r112460;
        return r112461;
}

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