Average Error: 0.1 → 0.1
Time: 2.7s
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 r128941 = x;
        double r128942 = y;
        double r128943 = r128941 * r128942;
        double r128944 = z;
        double r128945 = r128943 + r128944;
        double r128946 = r128945 * r128942;
        double r128947 = t;
        double r128948 = r128946 + r128947;
        return r128948;
}
↓
double f(double x, double y, double z, double t) {
        double r128949 = x;
        double r128950 = y;
        double r128951 = r128949 * r128950;
        double r128952 = z;
        double r128953 = r128951 + r128952;
        double r128954 = r128953 * r128950;
        double r128955 = t;
        double r128956 = r128954 + r128955;
        return r128956;
}

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