Average Error: 0.0 → 0.0
Time: 1.7s
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 r71253 = x;
        double r71254 = y;
        double r71255 = r71254 + r71254;
        double r71256 = r71253 * r71255;
        return r71256;
}
↓
double f(double x, double y) {
        double r71257 = x;
        double r71258 = y;
        double r71259 = r71258 + r71258;
        double r71260 = r71257 * r71259;
        return r71260;
}

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