Average Error: 0.1 → 0.1
Time: 4.8s
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 r161199 = x;
        double r161200 = y;
        double r161201 = r161199 * r161200;
        double r161202 = z;
        double r161203 = r161201 + r161202;
        double r161204 = r161203 * r161200;
        double r161205 = t;
        double r161206 = r161204 + r161205;
        return r161206;
}
↓
double f(double x, double y, double z, double t) {
        double r161207 = x;
        double r161208 = y;
        double r161209 = r161207 * r161208;
        double r161210 = z;
        double r161211 = r161209 + r161210;
        double r161212 = r161211 * r161208;
        double r161213 = t;
        double r161214 = r161212 + r161213;
        return r161214;
}

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