Average Error: 0.0 → 0.0
Time: 1.0s
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 r5528746 = x;
        double r5528747 = y;
        double r5528748 = r5528747 + r5528747;
        double r5528749 = r5528746 * r5528748;
        return r5528749;
}
↓
double f(double x, double y) {
        double r5528750 = x;
        double r5528751 = y;
        double r5528752 = r5528751 + r5528751;
        double r5528753 = r5528750 * r5528752;
        return r5528753;
}

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 2019163 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))