Average Error: 0.1 → 0.1
Time: 11.7s
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 r145982 = x;
        double r145983 = y;
        double r145984 = r145982 * r145983;
        double r145985 = z;
        double r145986 = r145984 + r145985;
        double r145987 = r145986 * r145983;
        double r145988 = t;
        double r145989 = r145987 + r145988;
        return r145989;
}
↓
double f(double x, double y, double z, double t) {
        double r145990 = x;
        double r145991 = y;
        double r145992 = r145990 * r145991;
        double r145993 = z;
        double r145994 = r145992 + r145993;
        double r145995 = r145994 * r145991;
        double r145996 = t;
        double r145997 = r145995 + r145996;
        return r145997;
}

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