Average Error: 0.0 → 0.0
Time: 12.9s
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 r72949 = a;
        double r72950 = r72949 * r72949;
        double r72951 = b;
        double r72952 = r72951 * r72951;
        double r72953 = r72950 - r72952;
        return r72953;
}
↓
double f(double a, double b) {
        double r72954 = a;
        double r72955 = r72954 * r72954;
        double r72956 = b;
        double r72957 = r72956 * r72956;
        double r72958 = r72955 - r72957;
        return r72958;
}

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 2019323 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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