Average Error: 0.0 → 0.0
Time: 771.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 r4230437 = x;
        double r4230438 = y;
        double r4230439 = r4230438 + r4230438;
        double r4230440 = r4230437 * r4230439;
        return r4230440;
}
↓
double f(double x, double y) {
        double r4230441 = x;
        double r4230442 = y;
        double r4230443 = r4230442 + r4230442;
        double r4230444 = r4230441 * r4230443;
        return r4230444;
}

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