Average Error: 0.0 → 0.0
Time: 394.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 r108227 = x;
        double r108228 = y;
        double r108229 = r108228 + r108228;
        double r108230 = r108227 * r108229;
        return r108230;
}
↓
double f(double x, double y) {
        double r108231 = x;
        double r108232 = y;
        double r108233 = r108232 + r108232;
        double r108234 = r108231 * r108233;
        return r108234;
}

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