Average Error: 0.1 → 0.1
Time: 13.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 r179200 = x;
        double r179201 = y;
        double r179202 = r179200 * r179201;
        double r179203 = z;
        double r179204 = r179202 + r179203;
        double r179205 = r179204 * r179201;
        double r179206 = t;
        double r179207 = r179205 + r179206;
        return r179207;
}
↓
double f(double x, double y, double z, double t) {
        double r179208 = x;
        double r179209 = y;
        double r179210 = r179208 * r179209;
        double r179211 = z;
        double r179212 = r179210 + r179211;
        double r179213 = r179212 * r179209;
        double r179214 = t;
        double r179215 = r179213 + r179214;
        return r179215;
}

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