Average Error: 0.1 → 0.1
Time: 5.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 r123082 = x;
        double r123083 = y;
        double r123084 = r123082 * r123083;
        double r123085 = z;
        double r123086 = r123084 + r123085;
        double r123087 = r123086 * r123083;
        double r123088 = t;
        double r123089 = r123087 + r123088;
        return r123089;
}

double f(double x, double y, double z, double t) {
        double r123090 = x;
        double r123091 = y;
        double r123092 = r123090 * r123091;
        double r123093 = z;
        double r123094 = r123092 + r123093;
        double r123095 = r123094 * r123091;
        double r123096 = t;
        double r123097 = r123095 + r123096;
        return r123097;
}

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