Average Error: 0.0 → 0.0
Time: 359.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 r120582 = x;
        double r120583 = y;
        double r120584 = r120583 + r120583;
        double r120585 = r120582 * r120584;
        return r120585;
}
↓
double f(double x, double y) {
        double r120586 = x;
        double r120587 = y;
        double r120588 = r120587 + r120587;
        double r120589 = r120586 * r120588;
        return r120589;
}

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