Average Error: 0.1 → 0.1
Time: 4.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 r174083 = x;
        double r174084 = y;
        double r174085 = r174083 * r174084;
        double r174086 = z;
        double r174087 = r174085 + r174086;
        double r174088 = r174087 * r174084;
        double r174089 = t;
        double r174090 = r174088 + r174089;
        return r174090;
}

double f(double x, double y, double z, double t) {
        double r174091 = x;
        double r174092 = y;
        double r174093 = r174091 * r174092;
        double r174094 = z;
        double r174095 = r174093 + r174094;
        double r174096 = r174095 * r174092;
        double r174097 = t;
        double r174098 = r174096 + r174097;
        return r174098;
}

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