Average Error: 0.0 → 0.0
Time: 879.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 r144207 = x;
        double r144208 = y;
        double r144209 = r144208 + r144208;
        double r144210 = r144207 * r144209;
        return r144210;
}
↓
double f(double x, double y) {
        double r144211 = x;
        double r144212 = y;
        double r144213 = r144212 + r144212;
        double r144214 = r144211 * r144213;
        return r144214;
}

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