Average Error: 0.0 → 0.0
Time: 30.0s
Precision: 64
\[2.0 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[x \cdot \left(x \cdot 2.0\right) + y \cdot \left(x \cdot 2.0\right)\]
2.0 \cdot \left(x \cdot x + x \cdot y\right)
↓
x \cdot \left(x \cdot 2.0\right) + y \cdot \left(x \cdot 2.0\right)
double f(double x, double y) {
        double r25834710 = 2.0;
        double r25834711 = x;
        double r25834712 = r25834711 * r25834711;
        double r25834713 = y;
        double r25834714 = r25834711 * r25834713;
        double r25834715 = r25834712 + r25834714;
        double r25834716 = r25834710 * r25834715;
        return r25834716;
}
↓
double f(double x, double y) {
        double r25834717 = x;
        double r25834718 = 2.0;
        double r25834719 = r25834717 * r25834718;
        double r25834720 = r25834717 * r25834719;
        double r25834721 = y;
        double r25834722 = r25834721 * r25834719;
        double r25834723 = r25834720 + r25834722;
        return r25834723;
}

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.0\right) \cdot \left(x + y\right)\]

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

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

  4. Applied distribute-rgt-in0.0

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

  5. Final simplification0.0

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

Reproduce

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