Average Error: 0.0 → 0.0
Time: 14.2s
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 r62004 = a;
        double r62005 = r62004 * r62004;
        double r62006 = b;
        double r62007 = r62006 * r62006;
        double r62008 = r62005 - r62007;
        return r62008;
}
↓
double f(double a, double b) {
        double r62009 = a;
        double r62010 = r62009 * r62009;
        double r62011 = b;
        double r62012 = r62011 * r62011;
        double r62013 = r62010 - r62012;
        return r62013;
}

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

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

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