Average Error: 0.1 → 0.1
Time: 2.2m
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
\[y \cdot \left(z + x \cdot y\right) + t\]
\left(x \cdot y + z\right) \cdot y + t
y \cdot \left(z + x \cdot y\right) + t
double f(double x, double y, double z, double t) {
        double r6812778 = x;
        double r6812779 = y;
        double r6812780 = r6812778 * r6812779;
        double r6812781 = z;
        double r6812782 = r6812780 + r6812781;
        double r6812783 = r6812782 * r6812779;
        double r6812784 = t;
        double r6812785 = r6812783 + r6812784;
        return r6812785;
}

double f(double x, double y, double z, double t) {
        double r6812786 = y;
        double r6812787 = z;
        double r6812788 = x;
        double r6812789 = r6812788 * r6812786;
        double r6812790 = r6812787 + r6812789;
        double r6812791 = r6812786 * r6812790;
        double r6812792 = t;
        double r6812793 = r6812791 + r6812792;
        return r6812793;
}

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

Reproduce

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