Average Error: 0.0 → 0.0
Time: 12.8s
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 r302155 = 2.0;
        double r302156 = x;
        double r302157 = r302156 * r302156;
        double r302158 = y;
        double r302159 = r302156 * r302158;
        double r302160 = r302157 + r302159;
        double r302161 = r302155 * r302160;
        return r302161;
}
↓
double f(double x, double y) {
        double r302162 = 2.0;
        double r302163 = x;
        double r302164 = r302162 * r302163;
        double r302165 = y;
        double r302166 = r302163 + r302165;
        double r302167 = r302164 * r302166;
        return r302167;
}

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 2019326 +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))))