Average Error: 0.0 → 0.0
Time: 2.9s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
2 \cdot \left(x \cdot x - x \cdot y\right)
double f(double x, double y) {
        double r390726 = 2.0;
        double r390727 = x;
        double r390728 = r390727 * r390727;
        double r390729 = y;
        double r390730 = r390727 * r390729;
        double r390731 = r390728 - r390730;
        double r390732 = r390726 * r390731;
        return r390732;
}
↓
double f(double x, double y) {
        double r390733 = 2.0;
        double r390734 = x;
        double r390735 = r390734 * r390734;
        double r390736 = y;
        double r390737 = r390734 * r390736;
        double r390738 = r390735 - r390737;
        double r390739 = r390733 * r390738;
        return r390739;
}

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

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

Reproduce

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