Average Error: 0.0 → 0.0
Time: 741.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 r66710 = x;
        double r66711 = y;
        double r66712 = r66711 + r66711;
        double r66713 = r66710 * r66712;
        return r66713;
}
↓
double f(double x, double y) {
        double r66714 = x;
        double r66715 = y;
        double r66716 = r66715 + r66715;
        double r66717 = r66714 * r66716;
        return r66717;
}

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