Average Error: 0.0 → 0.0
Time: 1.5s
Precision: binary64
Cost: 320
\[x \cdot y - x \]
\[x \cdot y - x \]
(FPCore (x y) :precision binary64 (- (* x y) x))
(FPCore (x y) :precision binary64 (- (* x y) x))
double code(double x, double y) {
	return (x * y) - x;
}
double code(double x, double y) {
	return (x * y) - x;
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) - x
end function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) - x
end function
public static double code(double x, double y) {
	return (x * y) - x;
}
public static double code(double x, double y) {
	return (x * y) - x;
}
def code(x, y):
	return (x * y) - x
def code(x, y):
	return (x * y) - x
function code(x, y)
	return Float64(Float64(x * y) - x)
end
function code(x, y)
	return Float64(Float64(x * y) - x)
end
function tmp = code(x, y)
	tmp = (x * y) - x;
end
function tmp = code(x, y)
	tmp = (x * y) - x;
end
code[x_, y_] := N[(N[(x * y), $MachinePrecision] - x), $MachinePrecision]
code[x_, y_] := N[(N[(x * y), $MachinePrecision] - x), $MachinePrecision]
x \cdot y - x
x \cdot y - x

Error

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

    \[\leadsto x \cdot y - x \]

Alternatives

Alternative 1
Error1.5
Cost456
\[\begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
Alternative 2
Error0.0
Cost320
\[x \cdot \left(y + -1\right) \]
Alternative 3
Error27.2
Cost128
\[-x \]

Error

Reproduce

herbie shell --seed 2022325 
(FPCore (x y)
  :name "Data.Histogram.Bin.LogBinD:$cbinSizeN from histogram-fill-0.8.4.1"
  :precision binary64
  (- (* x y) x))