Average Error: 0 → 0
Time: 1.5s
Precision: 64
\[x \gt 9.999999999999999451532714542095716517295 \cdot 10^{-21} \land y \lt 9.999999999999999451532714542095716517295 \cdot 10^{-21}\]
\[x \cdot y\]
\[y \cdot x\]
x \cdot y
y \cdot x
double f(double x, double y) {
        double r16412333 = x;
        double r16412334 = y;
        double r16412335 = r16412333 * r16412334;
        return r16412335;
}

double f(double x, double y) {
        double r16412336 = y;
        double r16412337 = x;
        double r16412338 = r16412336 * r16412337;
        return r16412338;
}

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

    \[x \cdot y\]
  2. Final simplification0

    \[\leadsto y \cdot x\]

Reproduce

herbie shell --seed 1 
(FPCore (x y)
  :name "x*y"
  :pre (and (> x 1e-20) (< y 1e-20))
  (* x y))