Average Error: 0.1 → 0.1
Time: 15.2s
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 r119119 = x;
        double r119120 = y;
        double r119121 = r119119 * r119120;
        double r119122 = z;
        double r119123 = r119121 + r119122;
        double r119124 = r119123 * r119120;
        double r119125 = t;
        double r119126 = r119124 + r119125;
        return r119126;
}
↓
double f(double x, double y, double z, double t) {
        double r119127 = x;
        double r119128 = y;
        double r119129 = r119127 * r119128;
        double r119130 = z;
        double r119131 = r119129 + r119130;
        double r119132 = r119131 * r119128;
        double r119133 = t;
        double r119134 = r119132 + r119133;
        return r119134;
}

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