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 r134348 = x;
        double r134349 = y;
        double r134350 = r134348 * r134349;
        double r134351 = z;
        double r134352 = r134350 + r134351;
        double r134353 = r134352 * r134349;
        double r134354 = t;
        double r134355 = r134353 + r134354;
        return r134355;
}
↓
double f(double x, double y, double z, double t) {
        double r134356 = x;
        double r134357 = y;
        double r134358 = r134356 * r134357;
        double r134359 = z;
        double r134360 = r134358 + r134359;
        double r134361 = r134360 * r134357;
        double r134362 = t;
        double r134363 = r134361 + r134362;
        return r134363;
}

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