Average Error: 0.0 → 0.0
Time: 793.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 r68509 = x;
        double r68510 = y;
        double r68511 = r68510 + r68510;
        double r68512 = r68509 * r68511;
        return r68512;
}
↓
double f(double x, double y) {
        double r68513 = x;
        double r68514 = y;
        double r68515 = r68514 + r68514;
        double r68516 = r68513 * r68515;
        return r68516;
}

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