Average Error: 0.0 → 0.0
Time: 1.4s
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 r216018 = x;
        double r216019 = y;
        double r216020 = r216018 + r216019;
        double r216021 = r216018 - r216019;
        double r216022 = r216020 * r216021;
        return r216022;
}
↓
double f(double x, double y) {
        double r216023 = x;
        double r216024 = y;
        double r216025 = r216023 + r216024;
        double r216026 = r216023 - r216024;
        double r216027 = r216025 * r216026;
        return r216027;
}

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