Average Error: 0.0 → 0.0
Time: 4.5s
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 r36675512 = 2.0;
        double r36675513 = x;
        double r36675514 = r36675513 * r36675513;
        double r36675515 = y;
        double r36675516 = r36675513 * r36675515;
        double r36675517 = r36675514 - r36675516;
        double r36675518 = r36675512 * r36675517;
        return r36675518;
}

double f(double x, double y) {
        double r36675519 = 2.0;
        double r36675520 = x;
        double r36675521 = r36675519 * r36675520;
        double r36675522 = y;
        double r36675523 = r36675520 - r36675522;
        double r36675524 = r36675521 * r36675523;
        return r36675524;
}

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-out--0.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 2019174 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"

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

  (* 2.0 (- (* x x) (* x y))))