Average Error: 0.0 → 0.0
Time: 7.3s
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 r13502 = x;
        double r13503 = y;
        double r13504 = r13502 + r13503;
        double r13505 = r13502 - r13503;
        double r13506 = r13504 * r13505;
        return r13506;
}
↓
double f(double x, double y) {
        double r13507 = x;
        double r13508 = y;
        double r13509 = r13507 + r13508;
        double r13510 = r13507 - r13508;
        double r13511 = r13509 * r13510;
        return r13511;
}

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