Average Error: 0.0 → 0.0
Time: 381.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 r95731 = x;
        double r95732 = y;
        double r95733 = r95732 + r95732;
        double r95734 = r95731 * r95733;
        return r95734;
}
↓
double f(double x, double y) {
        double r95735 = x;
        double r95736 = y;
        double r95737 = r95736 + r95736;
        double r95738 = r95735 * r95737;
        return r95738;
}

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