Average Error: 0.0 → 0.0
Time: 810.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 r77562 = x;
        double r77563 = y;
        double r77564 = r77563 + r77563;
        double r77565 = r77562 * r77564;
        return r77565;
}
↓
double f(double x, double y) {
        double r77566 = x;
        double r77567 = y;
        double r77568 = r77567 + r77567;
        double r77569 = r77566 * r77568;
        return r77569;
}

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