Average Error: 0.0 → 0.0
Time: 404.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 r99012 = x;
        double r99013 = y;
        double r99014 = r99013 + r99013;
        double r99015 = r99012 * r99014;
        return r99015;
}
↓
double f(double x, double y) {
        double r99016 = x;
        double r99017 = y;
        double r99018 = r99017 + r99017;
        double r99019 = r99016 * r99018;
        return r99019;
}

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