Average Error: 0.0 → 0.0
Time: 1.0s
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 r442804 = 2.0;
        double r442805 = x;
        double r442806 = r442805 * r442805;
        double r442807 = y;
        double r442808 = r442805 * r442807;
        double r442809 = r442806 - r442808;
        double r442810 = r442804 * r442809;
        return r442810;
}
↓
double f(double x, double y) {
        double r442811 = 2.0;
        double r442812 = x;
        double r442813 = r442812 * r442812;
        double r442814 = y;
        double r442815 = r442812 * r442814;
        double r442816 = r442813 - r442815;
        double r442817 = r442811 * r442816;
        return r442817;
}

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 2020021 +o rules:numerics
(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))))