Average Error: 0.0 → 0.0
Time: 9.2s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[x \cdot \left(\left(x - y\right) \cdot 2\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
x \cdot \left(\left(x - y\right) \cdot 2\right)
double f(double x, double y) {
        double r103092314 = 2.0;
        double r103092315 = x;
        double r103092316 = r103092315 * r103092315;
        double r103092317 = y;
        double r103092318 = r103092315 * r103092317;
        double r103092319 = r103092316 - r103092318;
        double r103092320 = r103092314 * r103092319;
        return r103092320;
}
↓
double f(double x, double y) {
        double r103092321 = x;
        double r103092322 = y;
        double r103092323 = r103092321 - r103092322;
        double r103092324 = 2.0;
        double r103092325 = r103092323 * r103092324;
        double r103092326 = r103092321 * r103092325;
        return r103092326;
}

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

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

  4. Applied associate-*l*0.0

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

  5. Final simplification0.0

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

Reproduce

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