Average Error: 0.0 → 0.0
Time: 1.0s
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 r4766440 = x;
        double r4766441 = y;
        double r4766442 = r4766441 + r4766441;
        double r4766443 = r4766440 * r4766442;
        return r4766443;
}
↓
double f(double x, double y) {
        double r4766444 = x;
        double r4766445 = y;
        double r4766446 = r4766445 + r4766445;
        double r4766447 = r4766444 * r4766446;
        return r4766447;
}

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