Average Error: 0.0 → 0.0
Time: 623.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 r110067 = a;
        double r110068 = r110067 * r110067;
        double r110069 = b;
        double r110070 = r110069 * r110069;
        double r110071 = r110068 - r110070;
        return r110071;
}
↓
double f(double a, double b) {
        double r110072 = a;
        double r110073 = r110072 * r110072;
        double r110074 = b;
        double r110075 = r110074 * r110074;
        double r110076 = r110073 - r110075;
        return r110076;
}

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

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

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