Average Error: 0.0 → 0.0
Time: 1.3s
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 r5572195 = x;
        double r5572196 = y;
        double r5572197 = r5572196 + r5572196;
        double r5572198 = r5572195 * r5572197;
        return r5572198;
}
↓
double f(double x, double y) {
        double r5572199 = x;
        double r5572200 = y;
        double r5572201 = r5572200 + r5572200;
        double r5572202 = r5572199 * r5572201;
        return r5572202;
}

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