Average Error: 0.0 → 0.0
Time: 1.0s
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 r73135 = x;
        double r73136 = y;
        double r73137 = r73136 + r73136;
        double r73138 = r73135 * r73137;
        return r73138;
}
↓
double f(double x, double y) {
        double r73139 = x;
        double r73140 = y;
        double r73141 = r73140 + r73140;
        double r73142 = r73139 * r73141;
        return r73142;
}

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