Average Error: 0.1 → 0.1
Time: 11.9s
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 r113080 = x;
        double r113081 = y;
        double r113082 = r113080 * r113081;
        double r113083 = z;
        double r113084 = r113082 + r113083;
        double r113085 = r113084 * r113081;
        double r113086 = t;
        double r113087 = r113085 + r113086;
        return r113087;
}

double f(double x, double y, double z, double t) {
        double r113088 = x;
        double r113089 = y;
        double r113090 = r113088 * r113089;
        double r113091 = z;
        double r113092 = r113090 + r113091;
        double r113093 = r113092 * r113089;
        double r113094 = t;
        double r113095 = r113093 + r113094;
        return r113095;
}

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