Average Error: 0.0 → 0.0
Time: 1.2s
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 r555096 = 2.0;
        double r555097 = x;
        double r555098 = r555097 * r555097;
        double r555099 = y;
        double r555100 = r555097 * r555099;
        double r555101 = r555098 - r555100;
        double r555102 = r555096 * r555101;
        return r555102;
}

double f(double x, double y) {
        double r555103 = 2.0;
        double r555104 = x;
        double r555105 = r555103 * r555104;
        double r555106 = y;
        double r555107 = r555104 - r555106;
        double r555108 = r555105 * r555107;
        return r555108;
}

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 2020018 
(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))))