Average Error: 0.0 → 0.0
Time: 795.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 r101313 = x;
        double r101314 = y;
        double r101315 = r101314 + r101314;
        double r101316 = r101313 * r101315;
        return r101316;
}
↓
double f(double x, double y) {
        double r101317 = x;
        double r101318 = y;
        double r101319 = r101318 + r101318;
        double r101320 = r101317 * r101319;
        return r101320;
}

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