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 r160499 = x;
        double r160500 = y;
        double r160501 = r160499 * r160500;
        double r160502 = z;
        double r160503 = r160501 + r160502;
        double r160504 = r160503 * r160500;
        double r160505 = t;
        double r160506 = r160504 + r160505;
        return r160506;
}
↓
double f(double x, double y, double z, double t) {
        double r160507 = x;
        double r160508 = y;
        double r160509 = r160507 * r160508;
        double r160510 = z;
        double r160511 = r160509 + r160510;
        double r160512 = r160511 * r160508;
        double r160513 = t;
        double r160514 = r160512 + r160513;
        return r160514;
}

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