Average Error: 0.0 → 0.0
Time: 828.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 r4479192 = x;
        double r4479193 = y;
        double r4479194 = r4479193 + r4479193;
        double r4479195 = r4479192 * r4479194;
        return r4479195;
}
↓
double f(double x, double y) {
        double r4479196 = x;
        double r4479197 = y;
        double r4479198 = r4479197 + r4479197;
        double r4479199 = r4479196 * r4479198;
        return r4479199;
}

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