Average Error: 0.0 → 0.0
Time: 887.0ms
Precision: 64
\[x \cdot \left(y + y\right)\]
↓
\[x \cdot \left(y + y\right)\]
x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)
double f(double x, double y) {
        double r4846180 = x;
        double r4846181 = y;
        double r4846182 = r4846181 + r4846181;
        double r4846183 = r4846180 * r4846182;
        return r4846183;
}
↓
double f(double x, double y) {
        double r4846184 = x;
        double r4846185 = y;
        double r4846186 = r4846185 + r4846185;
        double r4846187 = r4846184 * r4846186;
        return r4846187;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0.0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019162 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))