Average Error: 0.0 → 0.0
Time: 6.6s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[x \cdot \left(x \cdot 2\right) + y \cdot \left(x \cdot 2\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
x \cdot \left(x \cdot 2\right) + y \cdot \left(x \cdot 2\right)
double f(double x, double y) {
        double r354565 = 2.0;
        double r354566 = x;
        double r354567 = r354566 * r354566;
        double r354568 = y;
        double r354569 = r354566 * r354568;
        double r354570 = r354567 + r354569;
        double r354571 = r354565 * r354570;
        return r354571;
}
↓
double f(double x, double y) {
        double r354572 = x;
        double r354573 = 2.0;
        double r354574 = r354572 * r354573;
        double r354575 = r354572 * r354574;
        double r354576 = y;
        double r354577 = r354576 * r354574;
        double r354578 = r354575 + r354577;
        return r354578;
}

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-in0.0

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

  4. Simplified0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2019179 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, B"

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

  (* 2.0 (+ (* x x) (* x y))))