Average Error: 0.0 → 0.0
Time: 552.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 r69439 = x;
        double r69440 = y;
        double r69441 = r69440 + r69440;
        double r69442 = r69439 * r69441;
        return r69442;
}
↓
double f(double x, double y) {
        double r69443 = x;
        double r69444 = y;
        double r69445 = r69444 + r69444;
        double r69446 = r69443 * r69445;
        return r69446;
}

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