Average Error: 0.0 → 0.0
Time: 3.3s
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 r8949370 = x;
        double r8949371 = y;
        double r8949372 = r8949370 + r8949371;
        double r8949373 = r8949370 - r8949371;
        double r8949374 = r8949372 * r8949373;
        return r8949374;
}
↓
double f(double x, double y) {
        double r8949375 = y;
        double r8949376 = x;
        double r8949377 = r8949375 + r8949376;
        double r8949378 = r8949376 - r8949375;
        double r8949379 = r8949377 * r8949378;
        return r8949379;
}

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 2019192 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  (* (+ x y) (- x y)))