Average Error: 0.0 → 0.0
Time: 1.0s
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 r102116 = x;
        double r102117 = y;
        double r102118 = r102117 + r102117;
        double r102119 = r102116 * r102118;
        return r102119;
}
↓
double f(double x, double y) {
        double r102120 = x;
        double r102121 = y;
        double r102122 = r102121 + r102121;
        double r102123 = r102120 * r102122;
        return r102123;
}

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