Average Error: 0.0 → 0.0
Time: 629.0ms
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 r104058 = a;
        double r104059 = r104058 * r104058;
        double r104060 = b;
        double r104061 = r104060 * r104060;
        double r104062 = r104059 - r104061;
        return r104062;
}
↓
double f(double a, double b) {
        double r104063 = a;
        double r104064 = r104063 * r104063;
        double r104065 = b;
        double r104066 = r104065 * r104065;
        double r104067 = r104064 - r104066;
        return r104067;
}

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

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

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