Average Error: 0.0 → 0.0
Time: 29.1s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r7559970 = x;
        double r7559971 = y;
        double r7559972 = r7559970 + r7559971;
        double r7559973 = r7559970 - r7559971;
        double r7559974 = r7559972 * r7559973;
        return r7559974;
}
↓
double f(double x, double y) {
        double r7559975 = x;
        double r7559976 = y;
        double r7559977 = r7559975 + r7559976;
        double r7559978 = r7559975 - r7559976;
        double r7559979 = r7559977 * r7559978;
        return r7559979;
}

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(x + y\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  (* (+ x y) (- x y)))