Average Error: 0.0 → 0.0
Time: 3.3s
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 r7938143 = x;
        double r7938144 = y;
        double r7938145 = r7938143 + r7938144;
        double r7938146 = r7938143 - r7938144;
        double r7938147 = r7938145 * r7938146;
        return r7938147;
}
↓
double f(double x, double y) {
        double r7938148 = y;
        double r7938149 = x;
        double r7938150 = r7938148 + r7938149;
        double r7938151 = r7938149 - r7938148;
        double r7938152 = r7938150 * r7938151;
        return r7938152;
}

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