Average Error: 0.0 → 0.0
Time: 7.1s
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 r153147 = x;
        double r153148 = y;
        double r153149 = r153147 + r153148;
        double r153150 = r153147 - r153148;
        double r153151 = r153149 * r153150;
        return r153151;
}
↓
double f(double x, double y) {
        double r153152 = y;
        double r153153 = x;
        double r153154 = r153152 + r153153;
        double r153155 = r153153 - r153152;
        double r153156 = r153154 * r153155;
        return r153156;
}

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