Average Error: 0.0 → 0.0
Time: 6.9s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r16240 = x;
        double r16241 = y;
        double r16242 = r16240 + r16241;
        double r16243 = r16240 - r16241;
        double r16244 = r16242 * r16243;
        return r16244;
}
↓
double f(double x, double y) {
        double r16245 = x;
        double r16246 = y;
        double r16247 = r16245 + r16246;
        double r16248 = r16245 - r16246;
        double r16249 = r16247 * r16248;
        return r16249;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(x - y\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019310 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))