Average Error: 0.1 → 0.1
Time: 4.3s
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 r131435 = x;
        double r131436 = y;
        double r131437 = r131435 * r131436;
        double r131438 = z;
        double r131439 = r131437 + r131438;
        double r131440 = r131439 * r131436;
        double r131441 = t;
        double r131442 = r131440 + r131441;
        return r131442;
}
↓
double f(double x, double y, double z, double t) {
        double r131443 = x;
        double r131444 = y;
        double r131445 = r131443 * r131444;
        double r131446 = z;
        double r131447 = r131445 + r131446;
        double r131448 = r131447 * r131444;
        double r131449 = t;
        double r131450 = r131448 + r131449;
        return r131450;
}

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