Average Error: 0.0 → 0.0
Time: 10.8s
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 r133008 = x;
        double r133009 = y;
        double r133010 = r133008 + r133009;
        double r133011 = r133008 - r133009;
        double r133012 = r133010 * r133011;
        return r133012;
}
↓
double f(double x, double y) {
        double r133013 = x;
        double r133014 = y;
        double r133015 = r133013 + r133014;
        double r133016 = r133013 - r133014;
        double r133017 = r133015 * r133016;
        return r133017;
}

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