Average Error: 0.0 → 0.0
Time: 1.1s
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 r68725 = x;
        double r68726 = y;
        double r68727 = r68726 + r68726;
        double r68728 = r68725 * r68727;
        return r68728;
}
↓
double f(double x, double y) {
        double r68729 = x;
        double r68730 = y;
        double r68731 = r68730 + r68730;
        double r68732 = r68729 * r68731;
        return r68732;
}

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