Average Error: 5.2 → 0.1
Time: 1.8s
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 r445920 = x;
        double r445921 = 1.0;
        double r445922 = y;
        double r445923 = r445922 * r445922;
        double r445924 = r445921 + r445923;
        double r445925 = r445920 * r445924;
        return r445925;
}
↓
double f(double x, double y) {
        double r445926 = x;
        double r445927 = 1.0;
        double r445928 = r445926 * r445927;
        double r445929 = y;
        double r445930 = r445926 * r445929;
        double r445931 = r445930 * r445929;
        double r445932 = r445928 + r445931;
        return r445932;
}

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

Derivation

  1. Initial program 5.2

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

  3. Applied distribute-lft-in5.2

    \[\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 2020024 
(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))))