Average Error: 0.0 → 0.0
Time: 1.3s
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 r69728 = x;
        double r69729 = y;
        double r69730 = r69729 + r69729;
        double r69731 = r69728 * r69730;
        return r69731;
}
↓
double f(double x, double y) {
        double r69732 = x;
        double r69733 = y;
        double r69734 = r69733 + r69733;
        double r69735 = r69732 * r69734;
        return r69735;
}

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