Average Error: 0.1 → 0.1
Time: 58.8s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
\[\left(y \cdot x + z\right) \cdot y + t\]
\left(x \cdot y + z\right) \cdot y + t
\left(y \cdot x + z\right) \cdot y + t
double f(double x, double y, double z, double t) {
        double r8593498 = x;
        double r8593499 = y;
        double r8593500 = r8593498 * r8593499;
        double r8593501 = z;
        double r8593502 = r8593500 + r8593501;
        double r8593503 = r8593502 * r8593499;
        double r8593504 = t;
        double r8593505 = r8593503 + r8593504;
        return r8593505;
}

double f(double x, double y, double z, double t) {
        double r8593506 = y;
        double r8593507 = x;
        double r8593508 = r8593506 * r8593507;
        double r8593509 = z;
        double r8593510 = r8593508 + r8593509;
        double r8593511 = r8593510 * r8593506;
        double r8593512 = t;
        double r8593513 = r8593511 + r8593512;
        return r8593513;
}

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(y \cdot x + z\right) \cdot y + t\]

Reproduce

herbie shell --seed 2019200 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  (+ (* (+ (* x y) z) y) t))