Average Error: 0.0 → 0.0
Time: 762.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 r12043 = x;
        double r12044 = y;
        double r12045 = r12044 + r12044;
        double r12046 = r12043 * r12045;
        return r12046;
}
↓
double f(double x, double y) {
        double r12047 = x;
        double r12048 = y;
        double r12049 = r12048 + r12048;
        double r12050 = r12047 * r12049;
        return r12050;
}

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