Average Error: 0.0 → 0.0
Time: 1.1s
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 r132069 = x;
        double r132070 = y;
        double r132071 = r132070 + r132070;
        double r132072 = r132069 * r132071;
        return r132072;
}
↓
double f(double x, double y) {
        double r132073 = x;
        double r132074 = y;
        double r132075 = r132074 + r132074;
        double r132076 = r132073 * r132075;
        return r132076;
}

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