Average Error: 0.1 → 0.1
Time: 11.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 r137295 = x;
        double r137296 = y;
        double r137297 = r137295 * r137296;
        double r137298 = z;
        double r137299 = r137297 + r137298;
        double r137300 = r137299 * r137296;
        double r137301 = t;
        double r137302 = r137300 + r137301;
        return r137302;
}
↓
double f(double x, double y, double z, double t) {
        double r137303 = x;
        double r137304 = y;
        double r137305 = r137303 * r137304;
        double r137306 = z;
        double r137307 = r137305 + r137306;
        double r137308 = r137307 * r137304;
        double r137309 = t;
        double r137310 = r137308 + r137309;
        return r137310;
}

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