Average Error: 0.0 → 0.0
Time: 5.4s
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 r8861126 = x;
        double r8861127 = y;
        double r8861128 = r8861126 + r8861127;
        double r8861129 = r8861126 - r8861127;
        double r8861130 = r8861128 * r8861129;
        return r8861130;
}
↓
double f(double x, double y) {
        double r8861131 = y;
        double r8861132 = x;
        double r8861133 = r8861131 + r8861132;
        double r8861134 = r8861132 - r8861131;
        double r8861135 = r8861133 * r8861134;
        return r8861135;
}

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