Average Error: 0 → 0
Time: 986.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 r104232 = x;
        double r104233 = y;
        double r104234 = r104233 + r104233;
        double r104235 = r104232 * r104234;
        return r104235;
}
↓
double f(double x, double y) {
        double r104236 = x;
        double r104237 = y;
        double r104238 = r104237 + r104237;
        double r104239 = r104236 * r104238;
        return r104239;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019194 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))