Average Error: 0.0 → 0.0
Time: 916.0ms
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[\left(x \cdot \left(x - y\right)\right) \cdot 2\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
\left(x \cdot \left(x - y\right)\right) \cdot 2
double f(double x, double y) {
        double r620773 = 2.0;
        double r620774 = x;
        double r620775 = r620774 * r620774;
        double r620776 = y;
        double r620777 = r620774 * r620776;
        double r620778 = r620775 - r620777;
        double r620779 = r620773 * r620778;
        return r620779;
}
↓
double f(double x, double y) {
        double r620780 = x;
        double r620781 = y;
        double r620782 = r620780 - r620781;
        double r620783 = r620780 * r620782;
        double r620784 = 2.0;
        double r620785 = r620783 * r620784;
        return r620785;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2020001 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"
  :precision binary64

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

  (* 2 (- (* x x) (* x y))))