Average Error: 0.0 → 0.0
Time: 3.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 r9638399 = x;
        double r9638400 = y;
        double r9638401 = r9638399 + r9638400;
        double r9638402 = r9638399 - r9638400;
        double r9638403 = r9638401 * r9638402;
        return r9638403;
}
↓
double f(double x, double y) {
        double r9638404 = y;
        double r9638405 = x;
        double r9638406 = r9638404 + r9638405;
        double r9638407 = r9638405 - r9638404;
        double r9638408 = r9638406 * r9638407;
        return r9638408;
}

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