Average Error: 0.0 → 0.0
Time: 7.9s
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 r169070 = x;
        double r169071 = y;
        double r169072 = r169070 + r169071;
        double r169073 = r169070 - r169071;
        double r169074 = r169072 * r169073;
        return r169074;
}
↓
double f(double x, double y) {
        double r169075 = y;
        double r169076 = x;
        double r169077 = r169075 + r169076;
        double r169078 = r169076 - r169075;
        double r169079 = r169077 * r169078;
        return r169079;
}

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