Average Error: 0.0 → 0.0
Time: 7.8s
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 r393572 = 2.0;
        double r393573 = x;
        double r393574 = r393573 * r393573;
        double r393575 = y;
        double r393576 = r393573 * r393575;
        double r393577 = r393574 - r393576;
        double r393578 = r393572 * r393577;
        return r393578;
}
↓
double f(double x, double y) {
        double r393579 = 2.0;
        double r393580 = x;
        double r393581 = r393579 * r393580;
        double r393582 = y;
        double r393583 = r393580 - r393582;
        double r393584 = r393581 * r393583;
        return r393584;
}

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