Average Error: 0.0 → 0.0
Time: 965.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 r3546003 = x;
        double r3546004 = y;
        double r3546005 = r3546004 + r3546004;
        double r3546006 = r3546003 * r3546005;
        return r3546006;
}
↓
double f(double x, double y) {
        double r3546007 = x;
        double r3546008 = y;
        double r3546009 = r3546008 + r3546008;
        double r3546010 = r3546007 * r3546009;
        return r3546010;
}

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