Average Error: 0.0 → 0.0
Time: 5.7s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(y + x\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(y + x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r7288261 = x;
        double r7288262 = y;
        double r7288263 = r7288261 + r7288262;
        double r7288264 = r7288261 - r7288262;
        double r7288265 = r7288263 * r7288264;
        return r7288265;
}
↓
double f(double x, double y) {
        double r7288266 = y;
        double r7288267 = x;
        double r7288268 = r7288266 + r7288267;
        double r7288269 = r7288267 - r7288266;
        double r7288270 = r7288268 * r7288269;
        return r7288270;
}

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(y + x\right) \cdot \left(x - y\right)\]

Reproduce

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