Average Error: 0.0 → 0.0
Time: 4.5s
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 r7258723 = x;
        double r7258724 = y;
        double r7258725 = r7258723 + r7258724;
        double r7258726 = r7258723 - r7258724;
        double r7258727 = r7258725 * r7258726;
        return r7258727;
}
↓
double f(double x, double y) {
        double r7258728 = y;
        double r7258729 = x;
        double r7258730 = r7258728 + r7258729;
        double r7258731 = r7258729 - r7258728;
        double r7258732 = r7258730 * r7258731;
        return r7258732;
}

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