Average Error: 5.3 → 0.1
Time: 8.9s
Precision: 64
\[x \cdot \left(1 + y \cdot y\right)\]
↓
\[1 \cdot x + \left(x \cdot y\right) \cdot y\]
x \cdot \left(1 + y \cdot y\right)
↓
1 \cdot x + \left(x \cdot y\right) \cdot y
double f(double x, double y) {
        double r511469 = x;
        double r511470 = 1.0;
        double r511471 = y;
        double r511472 = r511471 * r511471;
        double r511473 = r511470 + r511472;
        double r511474 = r511469 * r511473;
        return r511474;
}
↓
double f(double x, double y) {
        double r511475 = 1.0;
        double r511476 = x;
        double r511477 = r511475 * r511476;
        double r511478 = y;
        double r511479 = r511476 * r511478;
        double r511480 = r511479 * r511478;
        double r511481 = r511477 + r511480;
        return r511481;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original5.3
Target0.1
Herbie0.1
\[x + \left(x \cdot y\right) \cdot y\]

Derivation

  1. Initial program 5.3

    \[x \cdot \left(1 + y \cdot y\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-in5.3

    \[\leadsto \color{blue}{x \cdot 1 + x \cdot \left(y \cdot y\right)}\]

  4. Simplified5.3

    \[\leadsto \color{blue}{1 \cdot x} + x \cdot \left(y \cdot y\right)\]
  5. Using strategy rm

  6. Applied associate-*r*0.1

    \[\leadsto 1 \cdot x + \color{blue}{\left(x \cdot y\right) \cdot y}\]

  7. Final simplification0.1

    \[\leadsto 1 \cdot x + \left(x \cdot y\right) \cdot y\]

Reproduce

herbie shell --seed 2020045 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:everywhere from integration-0.2.1"
  :precision binary64

  :herbie-target
  (+ x (* (* x y) y))

  (* x (+ 1 (* y y))))