Average Error: 0.0 → 0.0
Time: 11.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 r6747748 = x;
        double r6747749 = y;
        double r6747750 = r6747748 + r6747749;
        double r6747751 = r6747748 - r6747749;
        double r6747752 = r6747750 * r6747751;
        return r6747752;
}
↓
double f(double x, double y) {
        double r6747753 = y;
        double r6747754 = x;
        double r6747755 = r6747753 + r6747754;
        double r6747756 = r6747754 - r6747753;
        double r6747757 = r6747755 * r6747756;
        return r6747757;
}

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