Average Error: 0 → 0
Time: 524.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 r106493 = x;
        double r106494 = y;
        double r106495 = r106494 + r106494;
        double r106496 = r106493 * r106495;
        return r106496;
}
↓
double f(double x, double y) {
        double r106497 = x;
        double r106498 = y;
        double r106499 = r106498 + r106498;
        double r106500 = r106497 * r106499;
        return r106500;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020100 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))