Average Error: 0.1 → 0.1
Time: 9.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 r166598 = x;
        double r166599 = y;
        double r166600 = r166598 * r166599;
        double r166601 = z;
        double r166602 = r166600 + r166601;
        double r166603 = r166602 * r166599;
        double r166604 = t;
        double r166605 = r166603 + r166604;
        return r166605;
}
↓
double f(double x, double y, double z, double t) {
        double r166606 = x;
        double r166607 = y;
        double r166608 = r166606 * r166607;
        double r166609 = z;
        double r166610 = r166608 + r166609;
        double r166611 = r166610 * r166607;
        double r166612 = t;
        double r166613 = r166611 + r166612;
        return r166613;
}

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