Average Error: 0.0 → 0.0
Time: 359.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 r160777 = x;
        double r160778 = y;
        double r160779 = r160778 + r160778;
        double r160780 = r160777 * r160779;
        return r160780;
}
↓
double f(double x, double y) {
        double r160781 = x;
        double r160782 = y;
        double r160783 = r160782 + r160782;
        double r160784 = r160781 * r160783;
        return r160784;
}

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