Average Error: 0.1 → 0.1
Time: 6.4s
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 r160988 = x;
        double r160989 = y;
        double r160990 = r160988 * r160989;
        double r160991 = z;
        double r160992 = r160990 + r160991;
        double r160993 = r160992 * r160989;
        double r160994 = t;
        double r160995 = r160993 + r160994;
        return r160995;
}
↓
double f(double x, double y, double z, double t) {
        double r160996 = x;
        double r160997 = y;
        double r160998 = r160996 * r160997;
        double r160999 = z;
        double r161000 = r160998 + r160999;
        double r161001 = r161000 * r160997;
        double r161002 = t;
        double r161003 = r161001 + r161002;
        return r161003;
}

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