Average Error: 0.0 → 0.0
Time: 597.0ms
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 r176317 = x;
        double r176318 = y;
        double r176319 = r176317 + r176318;
        double r176320 = r176317 - r176318;
        double r176321 = r176319 * r176320;
        return r176321;
}
↓
double f(double x, double y) {
        double r176322 = x;
        double r176323 = y;
        double r176324 = r176322 + r176323;
        double r176325 = r176322 - r176323;
        double r176326 = r176324 * r176325;
        return r176326;
}

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 2020020 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))