Average Error: 0.0 → 0.0
Time: 5.4s
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 r10289340 = x;
        double r10289341 = y;
        double r10289342 = r10289340 + r10289341;
        double r10289343 = r10289340 - r10289341;
        double r10289344 = r10289342 * r10289343;
        return r10289344;
}
↓
double f(double x, double y) {
        double r10289345 = y;
        double r10289346 = x;
        double r10289347 = r10289345 + r10289346;
        double r10289348 = r10289346 - r10289345;
        double r10289349 = r10289347 * r10289348;
        return r10289349;
}

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