Average Error: 0.0 → 0.0
Time: 3.8s
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 r392808 = 2.0;
        double r392809 = x;
        double r392810 = r392809 * r392809;
        double r392811 = y;
        double r392812 = r392809 * r392811;
        double r392813 = r392810 - r392812;
        double r392814 = r392808 * r392813;
        return r392814;
}
↓
double f(double x, double y) {
        double r392815 = x;
        double r392816 = y;
        double r392817 = r392815 - r392816;
        double r392818 = 2.0;
        double r392819 = r392817 * r392818;
        double r392820 = r392815 * r392819;
        return r392820;
}

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