Average Error: 5.7 → 5.7
Time: 11.7s
Precision: 64
\[x \cdot \left(1 + y \cdot y\right)\]
↓
\[x \cdot \left(1 + y \cdot y\right)\]
x \cdot \left(1 + y \cdot y\right)
↓
x \cdot \left(1 + y \cdot y\right)
double f(double x, double y) {
        double r289945 = x;
        double r289946 = 1.0;
        double r289947 = y;
        double r289948 = r289947 * r289947;
        double r289949 = r289946 + r289948;
        double r289950 = r289945 * r289949;
        return r289950;
}
↓
double f(double x, double y) {
        double r289951 = x;
        double r289952 = 1.0;
        double r289953 = y;
        double r289954 = r289953 * r289953;
        double r289955 = r289952 + r289954;
        double r289956 = r289951 * r289955;
        return r289956;
}

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

Derivation

  1. Initial program 5.7

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

  2. Final simplification5.7

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

Reproduce

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