Average Error: 0.0 → 0.0
Time: 4.8s
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 r6973089 = x;
        double r6973090 = y;
        double r6973091 = r6973089 + r6973090;
        double r6973092 = r6973089 - r6973090;
        double r6973093 = r6973091 * r6973092;
        return r6973093;
}
↓
double f(double x, double y) {
        double r6973094 = y;
        double r6973095 = x;
        double r6973096 = r6973094 + r6973095;
        double r6973097 = r6973095 - r6973094;
        double r6973098 = r6973096 * r6973097;
        return r6973098;
}

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