Average Error: 0.0 → 0.0
Time: 9.1s
Precision: 64
\[0.5 \cdot \left(x \cdot x - y\right)\]
↓
\[0.5 \cdot \left(x \cdot x - y\right)\]
0.5 \cdot \left(x \cdot x - y\right)
↓
0.5 \cdot \left(x \cdot x - y\right)
double f(double x, double y) {
        double r13499 = 0.5;
        double r13500 = x;
        double r13501 = r13500 * r13500;
        double r13502 = y;
        double r13503 = r13501 - r13502;
        double r13504 = r13499 * r13503;
        return r13504;
}
↓
double f(double x, double y) {
        double r13505 = 0.5;
        double r13506 = x;
        double r13507 = r13506 * r13506;
        double r13508 = y;
        double r13509 = r13507 - r13508;
        double r13510 = r13505 * r13509;
        return r13510;
}

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

    \[0.5 \cdot \left(x \cdot x - y\right)\]

  2. Final simplification0.0

    \[\leadsto 0.5 \cdot \left(x \cdot x - y\right)\]

Reproduce

herbie shell --seed 2019303 
(FPCore (x y)
  :name "System.Random.MWC.Distributions:standard from mwc-random-0.13.3.2"
  :precision binary64
  (* 0.5 (- (* x x) y)))