Average Error: 0.1 → 0.1
Time: 4.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 r213064 = x;
        double r213065 = y;
        double r213066 = r213064 * r213065;
        double r213067 = z;
        double r213068 = r213066 + r213067;
        double r213069 = r213068 * r213065;
        double r213070 = t;
        double r213071 = r213069 + r213070;
        return r213071;
}

double f(double x, double y, double z, double t) {
        double r213072 = x;
        double r213073 = y;
        double r213074 = r213072 * r213073;
        double r213075 = z;
        double r213076 = r213074 + r213075;
        double r213077 = r213076 * r213073;
        double r213078 = t;
        double r213079 = r213077 + r213078;
        return r213079;
}

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