Average Error: 0.0 → 0.1
Time: 2.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 r434019 = 2.0;
        double r434020 = x;
        double r434021 = r434020 * r434020;
        double r434022 = y;
        double r434023 = r434020 * r434022;
        double r434024 = r434021 - r434023;
        double r434025 = r434019 * r434024;
        return r434025;
}
↓
double f(double x, double y) {
        double r434026 = x;
        double r434027 = y;
        double r434028 = r434026 - r434027;
        double r434029 = 2.0;
        double r434030 = r434028 * r434029;
        double r434031 = r434026 * r434030;
        return r434031;
}

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.1
\[\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.1

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

  5. Final simplification0.1

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

Reproduce

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