Average Error: 0.0 → 0.0
Time: 730.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 r74647 = x;
        double r74648 = y;
        double r74649 = r74648 + r74648;
        double r74650 = r74647 * r74649;
        return r74650;
}
↓
double f(double x, double y) {
        double r74651 = x;
        double r74652 = y;
        double r74653 = r74652 + r74652;
        double r74654 = r74651 * r74653;
        return r74654;
}

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