Average Error: 0.0 → 0.0
Time: 904.0ms
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 r534277 = 2.0;
        double r534278 = x;
        double r534279 = r534278 * r534278;
        double r534280 = y;
        double r534281 = r534278 * r534280;
        double r534282 = r534279 + r534281;
        double r534283 = r534277 * r534282;
        return r534283;
}

double f(double x, double y) {
        double r534284 = 2.0;
        double r534285 = x;
        double r534286 = r534284 * r534285;
        double r534287 = y;
        double r534288 = r534285 + r534287;
        double r534289 = r534286 * r534288;
        return r534289;
}

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 2020018 
(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))))