Average Error: 0.1 → 0.1
Time: 4.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 r178941 = x;
        double r178942 = y;
        double r178943 = r178941 * r178942;
        double r178944 = z;
        double r178945 = r178943 + r178944;
        double r178946 = r178945 * r178942;
        double r178947 = t;
        double r178948 = r178946 + r178947;
        return r178948;
}
↓
double f(double x, double y, double z, double t) {
        double r178949 = x;
        double r178950 = y;
        double r178951 = r178949 * r178950;
        double r178952 = z;
        double r178953 = r178951 + r178952;
        double r178954 = r178953 * r178950;
        double r178955 = t;
        double r178956 = r178954 + r178955;
        return r178956;
}

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