Average Error: 0.0 → 0.0
Time: 6.0s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[\left(2 \cdot x\right) \cdot \left(x - y\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
\left(2 \cdot x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r31840049 = 2.0;
        double r31840050 = x;
        double r31840051 = r31840050 * r31840050;
        double r31840052 = y;
        double r31840053 = r31840050 * r31840052;
        double r31840054 = r31840051 - r31840053;
        double r31840055 = r31840049 * r31840054;
        return r31840055;
}
↓
double f(double x, double y) {
        double r31840056 = 2.0;
        double r31840057 = x;
        double r31840058 = r31840056 * r31840057;
        double r31840059 = y;
        double r31840060 = r31840057 - r31840059;
        double r31840061 = r31840058 * r31840060;
        return r31840061;
}

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. Using strategy rm

  3. Applied distribute-lft-out--0.0

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

  4. Applied associate-*r*0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019174 +o rules:numerics
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"

  :herbie-target
  (* (* x 2.0) (- x y))

  (* 2.0 (- (* x x) (* x y))))