Average Error: 0.1 → 0.1
Time: 10.8s
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 r137856 = x;
        double r137857 = y;
        double r137858 = r137856 * r137857;
        double r137859 = z;
        double r137860 = r137858 + r137859;
        double r137861 = r137860 * r137857;
        double r137862 = t;
        double r137863 = r137861 + r137862;
        return r137863;
}
↓
double f(double x, double y, double z, double t) {
        double r137864 = x;
        double r137865 = y;
        double r137866 = r137864 * r137865;
        double r137867 = z;
        double r137868 = r137866 + r137867;
        double r137869 = r137868 * r137865;
        double r137870 = t;
        double r137871 = r137869 + r137870;
        return r137871;
}

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