Average Error: 5.5 → 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 r407643 = x;
        double r407644 = 1.0;
        double r407645 = y;
        double r407646 = r407645 * r407645;
        double r407647 = r407644 + r407646;
        double r407648 = r407643 * r407647;
        return r407648;
}
↓
double f(double x, double y) {
        double r407649 = x;
        double r407650 = 1.0;
        double r407651 = r407649 * r407650;
        double r407652 = y;
        double r407653 = r407649 * r407652;
        double r407654 = r407653 * r407652;
        double r407655 = r407651 + r407654;
        return r407655;
}

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

Derivation

  1. Initial program 5.5

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

  3. Applied distribute-lft-in5.5

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