Average Error: 5.3 → 0.1
Time: 13.3s
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 r306299 = x;
        double r306300 = 1.0;
        double r306301 = y;
        double r306302 = r306301 * r306301;
        double r306303 = r306300 + r306302;
        double r306304 = r306299 * r306303;
        return r306304;
}
↓
double f(double x, double y) {
        double r306305 = x;
        double r306306 = 1.0;
        double r306307 = r306305 * r306306;
        double r306308 = y;
        double r306309 = r306305 * r306308;
        double r306310 = r306309 * r306308;
        double r306311 = r306307 + r306310;
        return r306311;
}

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. Using strategy rm

  5. Applied associate-*r*0.1

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

  6. Final simplification0.1

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

Reproduce

herbie shell --seed 2019303 
(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))))