Average Error: 0.1 → 0.1
Time: 12.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 r125163 = x;
        double r125164 = y;
        double r125165 = r125163 * r125164;
        double r125166 = z;
        double r125167 = r125165 + r125166;
        double r125168 = r125167 * r125164;
        double r125169 = t;
        double r125170 = r125168 + r125169;
        return r125170;
}
↓
double f(double x, double y, double z, double t) {
        double r125171 = x;
        double r125172 = y;
        double r125173 = r125171 * r125172;
        double r125174 = z;
        double r125175 = r125173 + r125174;
        double r125176 = r125175 * r125172;
        double r125177 = t;
        double r125178 = r125176 + r125177;
        return r125178;
}

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