Average Error: 0.0 → 0.0
Time: 675.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 r3841279 = x;
        double r3841280 = y;
        double r3841281 = r3841280 + r3841280;
        double r3841282 = r3841279 * r3841281;
        return r3841282;
}
↓
double f(double x, double y) {
        double r3841283 = x;
        double r3841284 = y;
        double r3841285 = r3841284 + r3841284;
        double r3841286 = r3841283 * r3841285;
        return r3841286;
}

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