Average Error: 0.0 → 0.0
Time: 10.3s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[\left(2 \cdot x\right) \cdot \left(x + y\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
\left(2 \cdot x\right) \cdot \left(x + y\right)
double f(double x, double y) {
        double r395700 = 2.0;
        double r395701 = x;
        double r395702 = r395701 * r395701;
        double r395703 = y;
        double r395704 = r395701 * r395703;
        double r395705 = r395702 + r395704;
        double r395706 = r395700 * r395705;
        return r395706;
}
↓
double f(double x, double y) {
        double r395707 = 2.0;
        double r395708 = x;
        double r395709 = r395707 * r395708;
        double r395710 = y;
        double r395711 = r395708 + r395710;
        double r395712 = r395709 * r395711;
        return r395712;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(x \cdot 2\right) \cdot \left(x + y\right)\]

Derivation

  1. Initial program 0.0

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

  3. Applied distribute-lft-out0.0

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

  4. Applied associate-*r*0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019303 +o rules:numerics
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, B"
  :precision binary64

  :herbie-target
  (* (* x 2) (+ x y))

  (* 2 (+ (* x x) (* x y))))