Average Error: 0.1 → 0.1
Time: 6.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 r104747 = x;
        double r104748 = y;
        double r104749 = r104747 * r104748;
        double r104750 = z;
        double r104751 = r104749 + r104750;
        double r104752 = r104751 * r104748;
        double r104753 = t;
        double r104754 = r104752 + r104753;
        return r104754;
}
↓
double f(double x, double y, double z, double t) {
        double r104755 = x;
        double r104756 = y;
        double r104757 = r104755 * r104756;
        double r104758 = z;
        double r104759 = r104757 + r104758;
        double r104760 = r104759 * r104756;
        double r104761 = t;
        double r104762 = r104760 + r104761;
        return r104762;
}

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