Average Error: 0.0 → 0.0
Time: 348.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 r117106 = x;
        double r117107 = y;
        double r117108 = r117107 + r117107;
        double r117109 = r117106 * r117108;
        return r117109;
}
↓
double f(double x, double y) {
        double r117110 = x;
        double r117111 = y;
        double r117112 = r117111 + r117111;
        double r117113 = r117110 * r117112;
        return r117113;
}

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