Average Error: 5.4 → 0.1
Time: 16.0s
Precision: 64
\[x \cdot \left(1 + y \cdot y\right)\]
↓
\[1 \cdot x + y \cdot \left(y \cdot x\right)\]
x \cdot \left(1 + y \cdot y\right)
↓
1 \cdot x + y \cdot \left(y \cdot x\right)
double f(double x, double y) {
        double r368366 = x;
        double r368367 = 1.0;
        double r368368 = y;
        double r368369 = r368368 * r368368;
        double r368370 = r368367 + r368369;
        double r368371 = r368366 * r368370;
        return r368371;
}
↓
double f(double x, double y) {
        double r368372 = 1.0;
        double r368373 = x;
        double r368374 = r368372 * r368373;
        double r368375 = y;
        double r368376 = r368375 * r368373;
        double r368377 = r368375 * r368376;
        double r368378 = r368374 + r368377;
        return r368378;
}

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.3

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

  4. Simplified5.3

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

  5. Simplified5.3

    \[\leadsto 1 \cdot x + \color{blue}{\left(y \cdot y\right) \cdot x}\]
  6. Using strategy rm

  7. Applied associate-*l*0.1

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

  8. Final simplification0.1

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

Reproduce

herbie shell --seed 2019304 +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))))