Average Error: 0.0 → 0.0
Time: 9.3s
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 r7192741 = x;
        double r7192742 = y;
        double r7192743 = r7192741 + r7192742;
        double r7192744 = r7192741 - r7192742;
        double r7192745 = r7192743 * r7192744;
        return r7192745;
}
↓
double f(double x, double y) {
        double r7192746 = y;
        double r7192747 = x;
        double r7192748 = r7192746 + r7192747;
        double r7192749 = r7192747 - r7192746;
        double r7192750 = r7192748 * r7192749;
        return r7192750;
}

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