Average Error: 5.3 → 0.1
Time: 12.5s
Precision: 64
\[x \cdot \left(1 + y \cdot y\right)\]
↓
\[x \cdot 1 + \left(x \cdot y\right) \cdot y\]
x \cdot \left(1 + y \cdot y\right)
↓
x \cdot 1 + \left(x \cdot y\right) \cdot y
double f(double x, double y) {
        double r473049 = x;
        double r473050 = 1.0;
        double r473051 = y;
        double r473052 = r473051 * r473051;
        double r473053 = r473050 + r473052;
        double r473054 = r473049 * r473053;
        return r473054;
}
↓
double f(double x, double y) {
        double r473055 = x;
        double r473056 = 1.0;
        double r473057 = r473055 * r473056;
        double r473058 = y;
        double r473059 = r473055 * r473058;
        double r473060 = r473059 * r473058;
        double r473061 = r473057 + r473060;
        return r473061;
}

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 x \cdot 1 + \color{blue}{x \cdot {y}^{2}}\]
  5. Using strategy rm

  6. Applied unpow25.3

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

  7. Applied associate-*r*0.1

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

  8. Final simplification0.1

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

Reproduce

herbie shell --seed 2020045 +o rules:numerics
(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))))