Average Error: 0.0 → 0.0
Time: 7.6s
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 r10704134 = x;
        double r10704135 = y;
        double r10704136 = r10704134 + r10704135;
        double r10704137 = r10704134 - r10704135;
        double r10704138 = r10704136 * r10704137;
        return r10704138;
}
↓
double f(double x, double y) {
        double r10704139 = y;
        double r10704140 = x;
        double r10704141 = r10704139 + r10704140;
        double r10704142 = r10704140 - r10704139;
        double r10704143 = r10704141 * r10704142;
        return r10704143;
}

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