b parameter of renormalized beta distribution

Percentage Accurate: 99.9% → 99.9%

Time: 5.9s

Alternatives: 9

Speedup: 1.0×

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

Specification

\[\left(0 < m \land 0 < v\right) \land v < 0.25\]

Math

\[\begin{array}{l} \\ \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (((m * (1.0d0 - m)) / v) - 1.0d0) * (1.0d0 - m)
end function

Java

public static double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}

Python

def code(m, v):
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m)

Julia

function code(m, v)
	return Float64(Float64(Float64(Float64(m * Float64(1.0 - m)) / v) - 1.0) * Float64(1.0 - m))
end

MATLAB

function tmp = code(m, v)
	tmp = (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
end

Wolfram

code[m_, v_] := N[(N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * N[(1.0 - m), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (((m * (1.0d0 - m)) / v) - 1.0d0) * (1.0d0 - m)
end function

Java

public static double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}

Python

def code(m, v):
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m)

Julia

function code(m, v)
	return Float64(Float64(Float64(Float64(m * Float64(1.0 - m)) / v) - 1.0) * Float64(1.0 - m))
end

MATLAB

function tmp = code(m, v)
	tmp = (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
end

Wolfram

code[m_, v_] := N[(N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * N[(1.0 - m), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} + -1\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- 1.0 m) (+ (/ (* m (- 1.0 m)) v) -1.0)))

C

double code(double m, double v) {
	return (1.0 - m) * (((m * (1.0 - m)) / v) + -1.0);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (1.0d0 - m) * (((m * (1.0d0 - m)) / v) + (-1.0d0))
end function

Java

public static double code(double m, double v) {
	return (1.0 - m) * (((m * (1.0 - m)) / v) + -1.0);
}

Python

def code(m, v):
	return (1.0 - m) * (((m * (1.0 - m)) / v) + -1.0)

Julia

function code(m, v)
	return Float64(Float64(1.0 - m) * Float64(Float64(Float64(m * Float64(1.0 - m)) / v) + -1.0))
end

MATLAB

function tmp = code(m, v)
	tmp = (1.0 - m) * (((m * (1.0 - m)) / v) + -1.0);
end

Wolfram

code[m_, v_] := N[(N[(1.0 - m), $MachinePrecision] * N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Add Preprocessing

3. Final simplification 99.9%

   \[\leadsto \left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} + -1\right) \]
4. Add Preprocessing

Alternative 2: 61.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 2.5 \cdot 10^{-210}:\\ \;\;\;\;-1\\ \mathbf{elif}\;m \leq 1.25 \cdot 10^{-191} \lor \neg \left(m \leq 8.8 \cdot 10^{-122}\right):\\ \;\;\;\;\frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;m + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 2.5e-210)
   -1.0
   (if (or (<= m 1.25e-191) (not (<= m 8.8e-122))) (/ m v) (+ m -1.0))))

C

double code(double m, double v) {
	double tmp;
	if (m <= 2.5e-210) {
		tmp = -1.0;
	} else if ((m <= 1.25e-191) || !(m <= 8.8e-122)) {
		tmp = m / v;
	} else {
		tmp = m + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (m <= 2.5d-210) then
        tmp = -1.0d0
    else if ((m <= 1.25d-191) .or. (.not. (m <= 8.8d-122))) then
        tmp = m / v
    else
        tmp = m + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (m <= 2.5e-210) {
		tmp = -1.0;
	} else if ((m <= 1.25e-191) || !(m <= 8.8e-122)) {
		tmp = m / v;
	} else {
		tmp = m + -1.0;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 2.5e-210:
		tmp = -1.0
	elif (m <= 1.25e-191) or not (m <= 8.8e-122):
		tmp = m / v
	else:
		tmp = m + -1.0
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (m <= 2.5e-210)
		tmp = -1.0;
	elseif ((m <= 1.25e-191) || !(m <= 8.8e-122))
		tmp = Float64(m / v);
	else
		tmp = Float64(m + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (m <= 2.5e-210)
		tmp = -1.0;
	elseif ((m <= 1.25e-191) || ~((m <= 8.8e-122)))
		tmp = m / v;
	else
		tmp = m + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[m, 2.5e-210], -1.0, If[Or[LessEqual[m, 1.25e-191], N[Not[LessEqual[m, 8.8e-122]], $MachinePrecision]], N[(m / v), $MachinePrecision], N[(m + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if m < 2.5000000000000001e-210

   1. Initial program 100.0%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
   2. Step-by-step derivation

      1. *-commutative 100.0%

         \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 100.0%

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

      3. associate-/l* 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 87.7%

      \[\leadsto \color{blue}{-1} \]

   if 2.5000000000000001e-210 < m < 1.25e-191 or 8.8e-122 < m

   1. Initial program 99.9%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
   2. Step-by-step derivation

      1. *-commutative 99.9%

         \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 99.9%

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

      3. associate-/l* 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in v around 0 93.4%

      \[\leadsto \color{blue}{\frac{m \cdot {\left(1 - m\right)}^{2}}{v}} \]

   6. Taylor expanded in m around 0 55.4%

      \[\leadsto \frac{\color{blue}{m}}{v} \]

   if 1.25e-191 < m < 8.8e-122

   1. Initial program 100.0%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
   2. Step-by-step derivation

      1. *-commutative 100.0%

         \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 100.0%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in v around inf 84.8%

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

      1. neg-mul-1 84.8%

         \[\leadsto \color{blue}{-\left(1 - m\right)} \]

      2. neg-sub0 84.8%

         \[\leadsto \color{blue}{0 - \left(1 - m\right)} \]

      3. associate--r- 84.8%

         \[\leadsto \color{blue}{\left(0 - 1\right) + m} \]

      4. metadata-eval 84.8%

         \[\leadsto \color{blue}{-1} + m \]

   7. Simplified 84.8%

      \[\leadsto \color{blue}{-1 + m} \]
3. Recombined 3 regimes into one program.

4. Final simplification 64.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq 2.5 \cdot 10^{-210}:\\ \;\;\;\;-1\\ \mathbf{elif}\;m \leq 1.25 \cdot 10^{-191} \lor \neg \left(m \leq 8.8 \cdot 10^{-122}\right):\\ \;\;\;\;\frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;m + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 4.3 \cdot 10^{-16}:\\ \;\;\;\;-1 + \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;\frac{m \cdot \left(1 + m \cdot \left(m - 2\right)\right)}{v}\\ \end{array} \end{array} \]

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 4.3e-16) (+ -1.0 (/ m v)) (/ (* m (+ 1.0 (* m (- m 2.0)))) v)))

C

double code(double m, double v) {
	double tmp;
	if (m <= 4.3e-16) {
		tmp = -1.0 + (m / v);
	} else {
		tmp = (m * (1.0 + (m * (m - 2.0)))) / v;
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (m <= 4.3d-16) then
        tmp = (-1.0d0) + (m / v)
    else
        tmp = (m * (1.0d0 + (m * (m - 2.0d0)))) / v
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (m <= 4.3e-16) {
		tmp = -1.0 + (m / v);
	} else {
		tmp = (m * (1.0 + (m * (m - 2.0)))) / v;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 4.3e-16:
		tmp = -1.0 + (m / v)
	else:
		tmp = (m * (1.0 + (m * (m - 2.0)))) / v
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (m <= 4.3e-16)
		tmp = Float64(-1.0 + Float64(m / v));
	else
		tmp = Float64(Float64(m * Float64(1.0 + Float64(m * Float64(m - 2.0)))) / v);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (m <= 4.3e-16)
		tmp = -1.0 + (m / v);
	else
		tmp = (m * (1.0 + (m * (m - 2.0)))) / v;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[m, 4.3e-16], N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision], N[(N[(m * N[(1.0 + N[(m * N[(m - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 4.2999999999999999e-16

   1. Initial program 100.0%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
   2. Step-by-step derivation

      1. *-commutative 100.0%

         \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 100.0%

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

      3. associate-/l* 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 99.8%

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

   6. Taylor expanded in v around 0 100.0%

      \[\leadsto \color{blue}{\frac{m}{v}} - 1 \]

   if 4.2999999999999999e-16 < m

   1. Initial program 99.9%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
   2. Step-by-step derivation

      1. *-commutative 99.9%

         \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in v around 0 99.9%

      \[\leadsto \color{blue}{\frac{m \cdot {\left(1 - m\right)}^{2}}{v}} \]

   6. Taylor expanded in m around 0 99.9%

      \[\leadsto \frac{\color{blue}{m \cdot \left(1 + m \cdot \left(m - 2\right)\right)}}{v} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq 4.3 \cdot 10^{-16}:\\ \;\;\;\;-1 + \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;\frac{m \cdot \left(1 + m \cdot \left(m - 2\right)\right)}{v}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 - m\right) \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- 1.0 m) (+ (/ m (/ v (- 1.0 m))) -1.0)))

C

double code(double m, double v) {
	return (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (1.0d0 - m) * ((m / (v / (1.0d0 - m))) + (-1.0d0))
end function

Java

public static double code(double m, double v) {
	return (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0);
}

Python

def code(m, v):
	return (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0)

Julia

function code(m, v)
	return Float64(Float64(1.0 - m) * Float64(Float64(m / Float64(v / Float64(1.0 - m))) + -1.0))
end

MATLAB

function tmp = code(m, v)
	tmp = (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0);
end

Wolfram

code[m_, v_] := N[(N[(1.0 - m), $MachinePrecision] * N[(N[(m / N[(v / N[(1.0 - m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

   1. clear-num 99.8%

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

   2. un-div-inv 99.9%

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

6. Applied egg-rr 99.9%

   \[\leadsto \left(1 - m\right) \cdot \left(\color{blue}{\frac{m}{\frac{v}{1 - m}}} + -1\right) \]
7. Add Preprocessing

Alternative 5: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 - m\right) \cdot \left(-1 + m \cdot \frac{1 - m}{v}\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- 1.0 m) (+ -1.0 (* m (/ (- 1.0 m) v)))))

C

double code(double m, double v) {
	return (1.0 - m) * (-1.0 + (m * ((1.0 - m) / v)));
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (1.0d0 - m) * ((-1.0d0) + (m * ((1.0d0 - m) / v)))
end function

Java

public static double code(double m, double v) {
	return (1.0 - m) * (-1.0 + (m * ((1.0 - m) / v)));
}

Python

def code(m, v):
	return (1.0 - m) * (-1.0 + (m * ((1.0 - m) / v)))

Julia

function code(m, v)
	return Float64(Float64(1.0 - m) * Float64(-1.0 + Float64(m * Float64(Float64(1.0 - m) / v))))
end

MATLAB

function tmp = code(m, v)
	tmp = (1.0 - m) * (-1.0 + (m * ((1.0 - m) / v)));
end

Wolfram

code[m_, v_] := N[(N[(1.0 - m), $MachinePrecision] * N[(-1.0 + N[(m * N[(N[(1.0 - m), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto \left(1 - m\right) \cdot \left(-1 + m \cdot \frac{1 - m}{v}\right) \]
6. Add Preprocessing

Alternative 6: 75.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ -1 + \left(m + \frac{m}{v}\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (+ -1.0 (+ m (/ m v))))

C

double code(double m, double v) {
	return -1.0 + (m + (m / v));
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (-1.0d0) + (m + (m / v))
end function

Java

public static double code(double m, double v) {
	return -1.0 + (m + (m / v));
}

Python

def code(m, v):
	return -1.0 + (m + (m / v))

Julia

function code(m, v)
	return Float64(-1.0 + Float64(m + Float64(m / v)))
end

MATLAB

function tmp = code(m, v)
	tmp = -1.0 + (m + (m / v));
end

Wolfram

code[m_, v_] := N[(-1.0 + N[(m + N[(m / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Taylor expanded in m around 0 72.9%

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

   1. +-commutative 72.9%

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

   2. distribute-lft-in 72.9%

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

   3. un-div-inv 73.0%

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

   4. *-rgt-identity 73.0%

      \[\leadsto \left(\frac{m}{v} + \color{blue}{m}\right) - 1 \]

7. Applied egg-rr 73.0%

   \[\leadsto \color{blue}{\left(\frac{m}{v} + m\right)} - 1 \]

8. Final simplification 73.0%

   \[\leadsto -1 + \left(m + \frac{m}{v}\right) \]
9. Add Preprocessing

Alternative 7: 75.8% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ -1 + \frac{m}{v} \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (+ -1.0 (/ m v)))

C

double code(double m, double v) {
	return -1.0 + (m / v);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (-1.0d0) + (m / v)
end function

Java

public static double code(double m, double v) {
	return -1.0 + (m / v);
}

Python

def code(m, v):
	return -1.0 + (m / v)

Julia

function code(m, v)
	return Float64(-1.0 + Float64(m / v))
end

MATLAB

function tmp = code(m, v)
	tmp = -1.0 + (m / v);
end

Wolfram

code[m_, v_] := N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Taylor expanded in m around 0 72.9%

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

6. Taylor expanded in v around 0 73.0%

   \[\leadsto \color{blue}{\frac{m}{v}} - 1 \]

7. Final simplification 73.0%

   \[\leadsto -1 + \frac{m}{v} \]
8. Add Preprocessing

Alternative 8: 26.6% accurate, 4.3× speedup

Math

\[\begin{array}{l} \\ m + -1 \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (+ m -1.0))

C

double code(double m, double v) {
	return m + -1.0;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = m + (-1.0d0)
end function

Java

public static double code(double m, double v) {
	return m + -1.0;
}

Python

def code(m, v):
	return m + -1.0

Julia

function code(m, v)
	return Float64(m + -1.0)
end

MATLAB

function tmp = code(m, v)
	tmp = m + -1.0;
end

Wolfram

code[m_, v_] := N[(m + -1.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Taylor expanded in v around inf 31.8%

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

   1. neg-mul-1 31.8%

      \[\leadsto \color{blue}{-\left(1 - m\right)} \]

   2. neg-sub0 31.8%

      \[\leadsto \color{blue}{0 - \left(1 - m\right)} \]

   3. associate--r- 31.8%

      \[\leadsto \color{blue}{\left(0 - 1\right) + m} \]

   4. metadata-eval 31.8%

      \[\leadsto \color{blue}{-1} + m \]

7. Simplified 31.8%

   \[\leadsto \color{blue}{-1 + m} \]

8. Final simplification 31.8%

   \[\leadsto m + -1 \]
9. Add Preprocessing

Alternative 9: 24.1% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (m v) :precision binary64 -1.0)

C

double code(double m, double v) {
	return -1.0;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = -1.0d0
end function

Java

public static double code(double m, double v) {
	return -1.0;
}

Python

def code(m, v):
	return -1.0

Julia

function code(m, v)
	return -1.0
end

MATLAB

function tmp = code(m, v)
	tmp = -1.0;
end

Wolfram

code[m_, v_] := -1.0

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Taylor expanded in m around 0 29.4%

   \[\leadsto \color{blue}{-1} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024103 
(FPCore (m v)
  :name "b parameter of renormalized beta distribution"
  :precision binary64
  :pre (and (and (< 0.0 m) (< 0.0 v)) (< v 0.25))
  (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))