Average Error: 0.1 → 0.1
Time: 4.0s
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 r157943 = x;
        double r157944 = y;
        double r157945 = r157943 * r157944;
        double r157946 = z;
        double r157947 = r157945 + r157946;
        double r157948 = r157947 * r157944;
        double r157949 = t;
        double r157950 = r157948 + r157949;
        return r157950;
}
↓
double f(double x, double y, double z, double t) {
        double r157951 = x;
        double r157952 = y;
        double r157953 = r157951 * r157952;
        double r157954 = z;
        double r157955 = r157953 + r157954;
        double r157956 = r157955 * r157952;
        double r157957 = t;
        double r157958 = r157956 + r157957;
        return r157958;
}

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