Average Error: 0.0 → 0.0
Time: 912.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 r86469 = x;
        double r86470 = y;
        double r86471 = r86470 + r86470;
        double r86472 = r86469 * r86471;
        return r86472;
}
↓
double f(double x, double y) {
        double r86473 = x;
        double r86474 = y;
        double r86475 = r86474 + r86474;
        double r86476 = r86473 * r86475;
        return r86476;
}

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