Average Error: 0.0 → 0.0
Time: 351.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 r127441 = x;
        double r127442 = y;
        double r127443 = r127442 + r127442;
        double r127444 = r127441 * r127443;
        return r127444;
}
↓
double f(double x, double y) {
        double r127445 = x;
        double r127446 = y;
        double r127447 = r127446 + r127446;
        double r127448 = r127445 * r127447;
        return r127448;
}

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