Average Error: 0.0 → 0.0
Time: 1.9s
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 r485841 = 2.0;
        double r485842 = x;
        double r485843 = r485842 * r485842;
        double r485844 = y;
        double r485845 = r485842 * r485844;
        double r485846 = r485843 - r485845;
        double r485847 = r485841 * r485846;
        return r485847;
}
↓
double f(double x, double y) {
        double r485848 = x;
        double r485849 = y;
        double r485850 = r485848 - r485849;
        double r485851 = r485848 * r485850;
        double r485852 = 2.0;
        double r485853 = r485851 * r485852;
        return r485853;
}

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