Average Error: 0.0 → 0.0
Time: 939.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 r5948378 = x;
        double r5948379 = y;
        double r5948380 = r5948379 + r5948379;
        double r5948381 = r5948378 * r5948380;
        return r5948381;
}
↓
double f(double x, double y) {
        double r5948382 = x;
        double r5948383 = y;
        double r5948384 = r5948383 + r5948383;
        double r5948385 = r5948382 * r5948384;
        return r5948385;
}

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