Average Error: 0.0 → 0.0
Time: 4.9s
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 r8551236 = x;
        double r8551237 = y;
        double r8551238 = r8551236 + r8551237;
        double r8551239 = r8551236 - r8551237;
        double r8551240 = r8551238 * r8551239;
        return r8551240;
}
↓
double f(double x, double y) {
        double r8551241 = y;
        double r8551242 = x;
        double r8551243 = r8551241 + r8551242;
        double r8551244 = r8551242 - r8551241;
        double r8551245 = r8551243 * r8551244;
        return r8551245;
}

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