Average Error: 0.0 → 0.0
Time: 1.3s
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 r519156 = 2.0;
        double r519157 = x;
        double r519158 = r519157 * r519157;
        double r519159 = y;
        double r519160 = r519157 * r519159;
        double r519161 = r519158 - r519160;
        double r519162 = r519156 * r519161;
        return r519162;
}
↓
double f(double x, double y) {
        double r519163 = x;
        double r519164 = y;
        double r519165 = r519163 - r519164;
        double r519166 = r519163 * r519165;
        double r519167 = 2.0;
        double r519168 = r519166 * r519167;
        return r519168;
}

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 2020036 +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))))