Average Error: 0.0 → 0.0
Time: 392.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 r87460 = x;
        double r87461 = y;
        double r87462 = r87461 + r87461;
        double r87463 = r87460 * r87462;
        return r87463;
}
↓
double f(double x, double y) {
        double r87464 = x;
        double r87465 = y;
        double r87466 = r87465 + r87465;
        double r87467 = r87464 * r87466;
        return r87467;
}

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