?

Average Error: 0.0 → 0.0
Time: 18.9s
Precision: binary64
Cost: 320

?

\[x \cdot \left(1 - y\right) \]
\[x - x \cdot y \]
(FPCore (x y) :precision binary64 (* x (- 1.0 y)))
(FPCore (x y) :precision binary64 (- x (* x y)))
double code(double x, double y) {
	return x * (1.0 - y);
}
double code(double x, double y) {
	return x - (x * y);
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (1.0d0 - y)
end function
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x - (x * y)
end function
public static double code(double x, double y) {
	return x * (1.0 - y);
}
public static double code(double x, double y) {
	return x - (x * y);
}
def code(x, y):
	return x * (1.0 - y)
def code(x, y):
	return x - (x * y)
function code(x, y)
	return Float64(x * Float64(1.0 - y))
end
function code(x, y)
	return Float64(x - Float64(x * y))
end
function tmp = code(x, y)
	tmp = x * (1.0 - y);
end
function tmp = code(x, y)
	tmp = x - (x * y);
end
code[x_, y_] := N[(x * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]
code[x_, y_] := N[(x - N[(x * y), $MachinePrecision]), $MachinePrecision]
x \cdot \left(1 - y\right)
x - x \cdot y

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 0.0

    \[x \cdot \left(1 - y\right) \]
  2. Simplified0.0

    \[\leadsto \color{blue}{x - x \cdot y} \]
    Proof

Alternatives

Alternative 1
Error1.5
Cost520
\[\begin{array}{l} t_0 := -y \cdot x\\ \mathbf{if}\;y \leq -1:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]
Alternative 2
Error0.0
Cost320
\[x \cdot \left(1 - y\right) \]
Alternative 3
Error26.9
Cost64
\[x \]

Error

Reproduce?

herbie shell --seed 2023033 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, H"
  :precision binary64
  (* x (- 1.0 y)))