Average Error: 0.1 → 0.1
Time: 10.9s
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 r89310 = x;
        double r89311 = y;
        double r89312 = r89310 * r89311;
        double r89313 = z;
        double r89314 = r89312 + r89313;
        double r89315 = r89314 * r89311;
        double r89316 = t;
        double r89317 = r89315 + r89316;
        return r89317;
}
↓
double f(double x, double y, double z, double t) {
        double r89318 = x;
        double r89319 = y;
        double r89320 = r89318 * r89319;
        double r89321 = z;
        double r89322 = r89320 + r89321;
        double r89323 = r89322 * r89319;
        double r89324 = t;
        double r89325 = r89323 + r89324;
        return r89325;
}

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