Average Error: 0.0 → 0.0
Time: 6.8s
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 r638099 = 2.0;
        double r638100 = x;
        double r638101 = r638100 * r638100;
        double r638102 = y;
        double r638103 = r638100 * r638102;
        double r638104 = r638101 - r638103;
        double r638105 = r638099 * r638104;
        return r638105;
}
↓
double f(double x, double y) {
        double r638106 = 2.0;
        double r638107 = x;
        double r638108 = r638107 * r638107;
        double r638109 = y;
        double r638110 = r638107 * r638109;
        double r638111 = r638108 - r638110;
        double r638112 = r638106 * r638111;
        return r638112;
}

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