Average Error: 0.0 → 0.0
Time: 337.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 r97718 = x;
        double r97719 = y;
        double r97720 = r97719 + r97719;
        double r97721 = r97718 * r97720;
        return r97721;
}
↓
double f(double x, double y) {
        double r97722 = x;
        double r97723 = y;
        double r97724 = r97723 + r97723;
        double r97725 = r97722 * r97724;
        return r97725;
}

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