Statistics.Distribution.Binomial:$cvariance from math-functions-0.1.5.2

Percentage Accurate: 99.9% → 99.9%

Time: 6.0s

Alternatives: 6

Speedup: 1.0×

• 24.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot y\right) \cdot \left(1 - y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (* x y) (- 1.0 y)))

C

double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) * (1.0d0 - y)
end function

Java

public static double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Python

def code(x, y):
	return (x * y) * (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x * y) * Float64(1.0 - y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) * (1.0 - y);
end

Wolfram

code[x_, y_] := N[(N[(x * y), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot y\right) \cdot \left(1 - y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (* x y) (- 1.0 y)))

C

double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) * (1.0d0 - y)
end function

Java

public static double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Python

def code(x, y):
	return (x * y) * (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x * y) * Float64(1.0 - y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) * (1.0 - y);
end

Wolfram

code[x_, y_] := N[(N[(x * y), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+154} \lor \neg \left(y \leq 10^{+132}\right):\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(1 - y\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.35e+154) (not (<= y 1e+132)))
   (* y (* x (- y)))
   (* x (* y (- 1.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.35e+154) || !(y <= 1e+132)) {
		tmp = y * (x * -y);
	} else {
		tmp = x * (y * (1.0 - y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.35d+154)) .or. (.not. (y <= 1d+132))) then
        tmp = y * (x * -y)
    else
        tmp = x * (y * (1.0d0 - y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.35e+154) || !(y <= 1e+132)) {
		tmp = y * (x * -y);
	} else {
		tmp = x * (y * (1.0 - y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.35e+154) or not (y <= 1e+132):
		tmp = y * (x * -y)
	else:
		tmp = x * (y * (1.0 - y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.35e+154) || !(y <= 1e+132))
		tmp = Float64(y * Float64(x * Float64(-y)));
	else
		tmp = Float64(x * Float64(y * Float64(1.0 - y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.35e+154) || ~((y <= 1e+132)))
		tmp = y * (x * -y);
	else
		tmp = x * (y * (1.0 - y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.35e+154], N[Not[LessEqual[y, 1e+132]], $MachinePrecision]], N[(y * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.35000000000000003e154 or 9.99999999999999991e131 < y

   1. Initial program 99.9%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 76.6%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 76.6%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.9%

      \[\leadsto \color{blue}{y \cdot \left(x + -1 \cdot \left(x \cdot y\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 99.9%

         \[\leadsto y \cdot \left(x + \color{blue}{\left(-1 \cdot x\right) \cdot y}\right) \]

      2. mul-1-neg 99.9%

         \[\leadsto y \cdot \left(x + \color{blue}{\left(-x\right)} \cdot y\right) \]

   7. Simplified 99.9%

      \[\leadsto \color{blue}{y \cdot \left(x + \left(-x\right) \cdot y\right)} \]

   8. Taylor expanded in y around inf 99.9%

      \[\leadsto y \cdot \color{blue}{\left(-1 \cdot \left(x \cdot y\right)\right)} \]
   9. Step-by-step derivation

      1. mul-1-neg 99.9%

         \[\leadsto y \cdot \color{blue}{\left(-x \cdot y\right)} \]

      2. distribute-rgt-neg-in 99.9%

         \[\leadsto y \cdot \color{blue}{\left(x \cdot \left(-y\right)\right)} \]

   10. Simplified 99.9%

       \[\leadsto y \cdot \color{blue}{\left(x \cdot \left(-y\right)\right)} \]

   if -1.35000000000000003e154 < y < 9.99999999999999991e131

   1. Initial program 99.9%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 99.9%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+154} \lor \neg \left(y \leq 10^{+132}\right):\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(1 - y\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0))) (* y (* x (- y))) (* x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x * -y);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = y * (x * -y)
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x * -y);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = y * (x * -y)
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(y * Float64(x * Float64(-y)));
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 1.0)))
		tmp = y * (x * -y);
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(y * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 99.8%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 89.0%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 89.0%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 99.7%

      \[\leadsto \color{blue}{y \cdot \left(x + -1 \cdot \left(x \cdot y\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 99.7%

         \[\leadsto y \cdot \left(x + \color{blue}{\left(-1 \cdot x\right) \cdot y}\right) \]

      2. mul-1-neg 99.7%

         \[\leadsto y \cdot \left(x + \color{blue}{\left(-x\right)} \cdot y\right) \]

   7. Simplified 99.7%

      \[\leadsto \color{blue}{y \cdot \left(x + \left(-x\right) \cdot y\right)} \]

   8. Taylor expanded in y around inf 99.4%

      \[\leadsto y \cdot \color{blue}{\left(-1 \cdot \left(x \cdot y\right)\right)} \]
   9. Step-by-step derivation

      1. mul-1-neg 99.4%

         \[\leadsto y \cdot \color{blue}{\left(-x \cdot y\right)} \]

      2. distribute-rgt-neg-in 99.4%

         \[\leadsto y \cdot \color{blue}{\left(x \cdot \left(-y\right)\right)} \]

   10. Simplified 99.4%

       \[\leadsto y \cdot \color{blue}{\left(x \cdot \left(-y\right)\right)} \]

   if -1 < y < 1

   1. Initial program 100.0%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 97.6%

      \[\leadsto \color{blue}{x \cdot y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot y\right) \cdot \left(1 - y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (* x y) (- 1.0 y)))

C

double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) * (1.0d0 - y)
end function

Java

public static double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Python

def code(x, y):
	return (x * y) * (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x * y) * Float64(1.0 - y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) * (1.0 - y);
end

Wolfram

code[x_, y_] := N[(N[(x * y), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 4: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ y \cdot \left(x - x \cdot y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* y (- x (* x y))))

C

double code(double x, double y) {
	return y * (x - (x * y));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y * (x - (x * y))
end function

Java

public static double code(double x, double y) {
	return y * (x - (x * y));
}

Python

def code(x, y):
	return y * (x - (x * y))

Julia

function code(x, y)
	return Float64(y * Float64(x - Float64(x * y)))
end

MATLAB

function tmp = code(x, y)
	tmp = y * (x - (x * y));
end

Wolfram

code[x_, y_] := N[(y * N[(x - N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. associate-*l* 94.8%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

3. Simplified 94.8%

   \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 99.9%

   \[\leadsto \color{blue}{y \cdot \left(x + -1 \cdot \left(x \cdot y\right)\right)} \]
6. Step-by-step derivation

   1. associate-*r* 99.9%

      \[\leadsto y \cdot \left(x + \color{blue}{\left(-1 \cdot x\right) \cdot y}\right) \]

   2. mul-1-neg 99.9%

      \[\leadsto y \cdot \left(x + \color{blue}{\left(-x\right)} \cdot y\right) \]

7. Simplified 99.9%

   \[\leadsto \color{blue}{y \cdot \left(x + \left(-x\right) \cdot y\right)} \]
8. Step-by-step derivation

   1. distribute-lft-neg-out 99.9%

      \[\leadsto y \cdot \left(x + \color{blue}{\left(-x \cdot y\right)}\right) \]

   2. unsub-neg 99.9%

      \[\leadsto y \cdot \color{blue}{\left(x - x \cdot y\right)} \]

   3. *-commutative 99.9%

      \[\leadsto y \cdot \left(x - \color{blue}{y \cdot x}\right) \]

9. Applied egg-rr 99.9%

   \[\leadsto y \cdot \color{blue}{\left(x - y \cdot x\right)} \]

10. Final simplification 99.9%

    \[\leadsto y \cdot \left(x - x \cdot y\right) \]
11. Add Preprocessing

Alternative 5: 56.3% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ x \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x y))

C

double code(double x, double y) {
	return x * y;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * y
end function

Java

public static double code(double x, double y) {
	return x * y;
}

Python

def code(x, y):
	return x * y

Julia

function code(x, y)
	return Float64(x * y)
end

MATLAB

function tmp = code(x, y)
	tmp = x * y;
end

Wolfram

code[x_, y_] := N[(x * y), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. associate-*l* 94.8%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

3. Simplified 94.8%

   \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 58.6%

   \[\leadsto \color{blue}{x \cdot y} \]
6. Add Preprocessing

Alternative 6: 2.8% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 x)

C

double code(double x, double y) {
	return x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x
end function

Java

public static double code(double x, double y) {
	return x;
}

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

function tmp = code(x, y)
	tmp = x;
end

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. associate-*l* 94.8%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

3. Simplified 94.8%

   \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. associate-*r* 99.9%

      \[\leadsto \color{blue}{\left(x \cdot y\right) \cdot \left(1 - y\right)} \]

   2. flip-- 94.8%

      \[\leadsto \left(x \cdot y\right) \cdot \color{blue}{\frac{1 \cdot 1 - y \cdot y}{1 + y}} \]

   3. associate-*r/ 89.8%

      \[\leadsto \color{blue}{\frac{\left(x \cdot y\right) \cdot \left(1 \cdot 1 - y \cdot y\right)}{1 + y}} \]

   4. metadata-eval 89.8%

      \[\leadsto \frac{\left(x \cdot y\right) \cdot \left(\color{blue}{1} - y \cdot y\right)}{1 + y} \]

   5. pow2 89.8%

      \[\leadsto \frac{\left(x \cdot y\right) \cdot \left(1 - \color{blue}{{y}^{2}}\right)}{1 + y} \]

   6. +-commutative 89.8%

      \[\leadsto \frac{\left(x \cdot y\right) \cdot \left(1 - {y}^{2}\right)}{\color{blue}{y + 1}} \]

6. Applied egg-rr 89.8%

   \[\leadsto \color{blue}{\frac{\left(x \cdot y\right) \cdot \left(1 - {y}^{2}\right)}{y + 1}} \]
7. Step-by-step derivation

   1. associate-*l* 86.1%

      \[\leadsto \frac{\color{blue}{x \cdot \left(y \cdot \left(1 - {y}^{2}\right)\right)}}{y + 1} \]

   2. associate-/l* 87.1%

      \[\leadsto \color{blue}{x \cdot \frac{y \cdot \left(1 - {y}^{2}\right)}{y + 1}} \]

   3. distribute-rgt-out-- 87.1%

      \[\leadsto x \cdot \frac{\color{blue}{1 \cdot y - {y}^{2} \cdot y}}{y + 1} \]

   4. *-lft-identity 87.1%

      \[\leadsto x \cdot \frac{\color{blue}{y} - {y}^{2} \cdot y}{y + 1} \]

   5. unpow2 87.1%

      \[\leadsto x \cdot \frac{y - \color{blue}{\left(y \cdot y\right)} \cdot y}{y + 1} \]

   6. unpow3 87.1%

      \[\leadsto x \cdot \frac{y - \color{blue}{{y}^{3}}}{y + 1} \]

8. Simplified 87.1%

   \[\leadsto \color{blue}{x \cdot \frac{y - {y}^{3}}{y + 1}} \]

9. Taylor expanded in x around 0 86.1%

   \[\leadsto \color{blue}{\frac{x \cdot \left(y - {y}^{3}\right)}{1 + y}} \]
10. Step-by-step derivation

    1. +-commutative 86.1%

       \[\leadsto \frac{x \cdot \left(y - {y}^{3}\right)}{\color{blue}{y + 1}} \]

    2. *-commutative 86.1%

       \[\leadsto \frac{\color{blue}{\left(y - {y}^{3}\right) \cdot x}}{y + 1} \]

    3. associate-/l* 82.2%

       \[\leadsto \color{blue}{\left(y - {y}^{3}\right) \cdot \frac{x}{y + 1}} \]

11. Simplified 82.2%

    \[\leadsto \color{blue}{\left(y - {y}^{3}\right) \cdot \frac{x}{y + 1}} \]

12. Taylor expanded in y around inf 31.3%

    \[\leadsto \left(y - {y}^{3}\right) \cdot \color{blue}{\frac{x}{y}} \]

13. Taylor expanded in y around 0 2.6%

    \[\leadsto \color{blue}{x} \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2024086 
(FPCore (x y)
  :name "Statistics.Distribution.Binomial:$cvariance from math-functions-0.1.5.2"
  :precision binary64
  (* (* x y) (- 1.0 y)))