Average Error: 0.0 → 0.0
Time: 777.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 r105524 = x;
        double r105525 = y;
        double r105526 = r105525 + r105525;
        double r105527 = r105524 * r105526;
        return r105527;
}
↓
double f(double x, double y) {
        double r105528 = x;
        double r105529 = y;
        double r105530 = r105529 + r105529;
        double r105531 = r105528 * r105530;
        return r105531;
}

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