Average Error: 0.0 → 0.0
Time: 5.2s
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 r7598960 = x;
        double r7598961 = y;
        double r7598962 = r7598960 + r7598961;
        double r7598963 = r7598960 - r7598961;
        double r7598964 = r7598962 * r7598963;
        return r7598964;
}
↓
double f(double x, double y) {
        double r7598965 = y;
        double r7598966 = x;
        double r7598967 = r7598965 + r7598966;
        double r7598968 = r7598966 - r7598965;
        double r7598969 = r7598967 * r7598968;
        return r7598969;
}

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