Average Error: 0.0 → 0.0
Time: 14.4s
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 r59997 = a;
        double r59998 = r59997 * r59997;
        double r59999 = b;
        double r60000 = r59999 * r59999;
        double r60001 = r59998 - r60000;
        return r60001;
}
↓
double f(double a, double b) {
        double r60002 = a;
        double r60003 = r60002 * r60002;
        double r60004 = b;
        double r60005 = r60004 * r60004;
        double r60006 = r60003 - r60005;
        return r60006;
}

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

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

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