Average Error: 0.0 → 0.0
Time: 429.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 r125496 = x;
        double r125497 = y;
        double r125498 = r125497 + r125497;
        double r125499 = r125496 * r125498;
        return r125499;
}
↓
double f(double x, double y) {
        double r125500 = x;
        double r125501 = y;
        double r125502 = r125501 + r125501;
        double r125503 = r125500 * r125502;
        return r125503;
}

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