Average Error: 0.0 → 0.0
Time: 10.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 r12448840 = x;
        double r12448841 = y;
        double r12448842 = r12448840 + r12448841;
        double r12448843 = r12448840 - r12448841;
        double r12448844 = r12448842 * r12448843;
        return r12448844;
}
↓
double f(double x, double y) {
        double r12448845 = y;
        double r12448846 = x;
        double r12448847 = r12448845 + r12448846;
        double r12448848 = r12448846 - r12448845;
        double r12448849 = r12448847 * r12448848;
        return r12448849;
}

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)))