Average Error: 0.0 → 0.1
Time: 3.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 r619675 = 2.0;
        double r619676 = x;
        double r619677 = r619676 * r619676;
        double r619678 = y;
        double r619679 = r619676 * r619678;
        double r619680 = r619677 - r619679;
        double r619681 = r619675 * r619680;
        return r619681;
}
↓
double f(double x, double y) {
        double r619682 = x;
        double r619683 = y;
        double r619684 = r619682 - r619683;
        double r619685 = 2.0;
        double r619686 = r619684 * r619685;
        double r619687 = r619682 * r619686;
        return r619687;
}

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