Average Error: 5.4 → 0.1
Time: 2.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 r410374 = x;
        double r410375 = 1.0;
        double r410376 = y;
        double r410377 = r410376 * r410376;
        double r410378 = r410375 + r410377;
        double r410379 = r410374 * r410378;
        return r410379;
}
↓
double f(double x, double y) {
        double r410380 = x;
        double r410381 = 1.0;
        double r410382 = r410380 * r410381;
        double r410383 = y;
        double r410384 = r410380 * r410383;
        double r410385 = r410384 * r410383;
        double r410386 = r410382 + r410385;
        return r410386;
}

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.4
Target0.1
Herbie0.1
\[x + \left(x \cdot y\right) \cdot y\]

Derivation

  1. Initial program 5.4

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

  3. Applied distribute-lft-in5.4

    \[\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 2020065 +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))))