Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[a \cdot a - b \cdot b\]
a \cdot a - b \cdot b
↓
a \cdot a - b \cdot b
double f(double a, double b) {
        double r61947 = a;
        double r61948 = r61947 * r61947;
        double r61949 = b;
        double r61950 = r61949 * r61949;
        double r61951 = r61948 - r61950;
        return r61951;
}
↓
double f(double a, double b) {
        double r61952 = a;
        double r61953 = r61952 * r61952;
        double r61954 = b;
        double r61955 = r61954 * r61954;
        double r61956 = r61953 - r61955;
        return r61956;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(a + b\right) \cdot \left(a - b\right)\]

Derivation

  1. Initial program 0.0

    \[a \cdot a - b \cdot b\]

  2. Final simplification0.0

    \[\leadsto a \cdot a - b \cdot b\]

Reproduce

herbie shell --seed 2019174 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"

  :herbie-target
  (* (+ a b) (- a b))

  (- (* a a) (* b b)))