Average Error: 0.1 → 0.1
Time: 9.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 r108807 = x;
        double r108808 = y;
        double r108809 = r108807 * r108808;
        double r108810 = z;
        double r108811 = r108809 + r108810;
        double r108812 = r108811 * r108808;
        double r108813 = t;
        double r108814 = r108812 + r108813;
        return r108814;
}

double f(double x, double y, double z, double t) {
        double r108815 = x;
        double r108816 = y;
        double r108817 = r108815 * r108816;
        double r108818 = z;
        double r108819 = r108817 + r108818;
        double r108820 = r108819 * r108816;
        double r108821 = t;
        double r108822 = r108820 + r108821;
        return r108822;
}

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