a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.5%

Time: 9.7s

Alternatives: 10

Speedup: 1.0×

• 41.6% 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 m \end{array} \]

FPCore

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

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 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) * m
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 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) * m
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 2.05e-23)
   (* m (+ -1.0 (/ 1.0 (/ v m))))
   (* (/ (- 1.0 m) v) (* m m))))

C

double code(double m, double v) {
	double tmp;
	if (m <= 2.05e-23) {
		tmp = m * (-1.0 + (1.0 / (v / m)));
	} else {
		tmp = ((1.0 - m) / v) * (m * m);
	}
	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.05d-23) then
        tmp = m * ((-1.0d0) + (1.0d0 / (v / m)))
    else
        tmp = ((1.0d0 - m) / v) * (m * m)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 2.05000000000000015e-23

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-/l* 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

      1. associate-*r/ 99.7%

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

      2. clear-num 99.8%

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in m around 0 99.8%

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

   if 2.05000000000000015e-23 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{m \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}^{2} \cdot \left(1 - m\right)}{v}} \]
   6. Step-by-step derivation

      1. associate-/l* 99.9%

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

   7. Simplified 99.9%

      \[\leadsto \color{blue}{{m}^{2} \cdot \frac{1 - m}{v}} \]
   8. Step-by-step derivation

      1. unpow2 99.9%

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

   9. Applied egg-rr 99.9%

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

4. Final simplification 99.8%

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

Alternative 2: 74.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 6 \cdot 10^{-156}:\\ \;\;\;\;-m\\ \mathbf{elif}\;m \leq 1:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(-1 - \frac{m}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 6e-156) (- m) (if (<= m 1.0) (* m (/ m v)) (* m (- -1.0 (/ m v))))))

C

double code(double m, double v) {
	double tmp;
	if (m <= 6e-156) {
		tmp = -m;
	} else if (m <= 1.0) {
		tmp = m * (m / v);
	} else {
		tmp = m * (-1.0 - (m / 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 <= 6d-156) then
        tmp = -m
    else if (m <= 1.0d0) then
        tmp = m * (m / v)
    else
        tmp = m * ((-1.0d0) - (m / v))
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (m <= 6e-156) {
		tmp = -m;
	} else if (m <= 1.0) {
		tmp = m * (m / v);
	} else {
		tmp = m * (-1.0 - (m / v));
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 6e-156:
		tmp = -m
	elif m <= 1.0:
		tmp = m * (m / v)
	else:
		tmp = m * (-1.0 - (m / v))
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (m <= 6e-156)
		tmp = Float64(-m);
	elseif (m <= 1.0)
		tmp = Float64(m * Float64(m / v));
	else
		tmp = Float64(m * Float64(-1.0 - Float64(m / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (m <= 6e-156)
		tmp = -m;
	elseif (m <= 1.0)
		tmp = m * (m / v);
	else
		tmp = m * (-1.0 - (m / v));
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[m, 6e-156], (-m), If[LessEqual[m, 1.0], N[(m * N[(m / v), $MachinePrecision]), $MachinePrecision], N[(m * N[(-1.0 - N[(m / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if m < 6e-156

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-/l* 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

      1. associate-*r/ 99.8%

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

      2. clear-num 99.9%

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

   6. Applied egg-rr 99.9%

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

   7. Taylor expanded in m around 0 82.1%

      \[\leadsto \color{blue}{-1 \cdot m} \]
   8. Step-by-step derivation

      1. neg-mul-1 82.1%

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

   9. Simplified 82.1%

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

   if 6e-156 < m < 1

   1. Initial program 99.6%

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

      1. *-commutative 99.6%

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

      2. sub-neg 99.6%

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

      3. associate-/l* 99.5%

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

      4. metadata-eval 99.5%

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

   3. Simplified 99.5%

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

   5. Taylor expanded in v around 0 70.5%

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

      1. associate-/l* 70.3%

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

   7. Simplified 70.3%

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

   8. Taylor expanded in m around 0 67.9%

      \[\leadsto \color{blue}{\frac{{m}^{2}}{v}} \]
   9. Step-by-step derivation

      1. pow2 67.9%

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

      2. associate-/l* 67.9%

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

   10. Applied egg-rr 67.9%

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

   if 1 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0 0.1%

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

      1. frac-2neg 0.1%

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

      2. neg-sub0 0.1%

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

      3. div-sub 0.1%

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

      4. add-sqr-sqrt 0.1%

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

      5. sqrt-prod 0.1%

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

      6. sqr-neg 0.1%

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

      7. sqrt-unprod 0.0%

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

      8. add-sqr-sqrt 78.3%

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

      9. frac-2neg 78.3%

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

   5. Applied egg-rr 78.3%

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

      1. div0 78.3%

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

      2. neg-sub0 78.3%

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

      3. distribute-neg-frac2 78.3%

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

   7. Simplified 78.3%

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

   8. Taylor expanded in m around 0 78.3%

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

      1. sub-neg 78.3%

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

      2. metadata-eval 78.3%

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

      3. neg-mul-1 78.3%

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

      4. +-commutative 78.3%

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

      5. unsub-neg 78.3%

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

   10. Simplified 78.3%

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

4. Final simplification 76.6%

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

Alternative 3: 87.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	double tmp;
	if (m <= 1.0) {
		tmp = m * (-1.0 + (1.0 / (v / m)));
	} else {
		tmp = m * (-1.0 - (m / 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 <= 1.0d0) then
        tmp = m * ((-1.0d0) + (1.0d0 / (v / m)))
    else
        tmp = m * ((-1.0d0) - (m / v))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-/l* 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

      1. associate-*r/ 99.7%

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

      2. clear-num 99.8%

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in m around 0 98.5%

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

   if 1 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0 0.1%

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

      1. frac-2neg 0.1%

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

      2. neg-sub0 0.1%

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

      3. div-sub 0.1%

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

      4. add-sqr-sqrt 0.1%

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

      5. sqrt-prod 0.1%

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

      6. sqr-neg 0.1%

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

      7. sqrt-unprod 0.0%

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

      8. add-sqr-sqrt 78.3%

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

      9. frac-2neg 78.3%

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

   5. Applied egg-rr 78.3%

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

      1. div0 78.3%

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

      2. neg-sub0 78.3%

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

      3. distribute-neg-frac2 78.3%

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

   7. Simplified 78.3%

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

   8. Taylor expanded in m around 0 78.3%

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

      1. sub-neg 78.3%

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

      2. metadata-eval 78.3%

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

      3. neg-mul-1 78.3%

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

      4. +-commutative 78.3%

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

      5. unsub-neg 78.3%

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

   10. Simplified 78.3%

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

4. Final simplification 88.5%

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

Alternative 4: 99.8% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

   1. associate-*r/ 99.8%

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

   2. clear-num 99.8%

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

6. Applied egg-rr 99.8%

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

Alternative 5: 87.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	double tmp;
	if (m <= 1.0) {
		tmp = m * (-1.0 + (m / v));
	} else {
		tmp = m * (-1.0 - (m / 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 <= 1.0d0) then
        tmp = m * ((-1.0d0) + (m / v))
    else
        tmp = m * ((-1.0d0) - (m / v))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

   3. Taylor expanded in m around 0 98.4%

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

   if 1 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0 0.1%

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

      1. frac-2neg 0.1%

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

      2. neg-sub0 0.1%

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

      3. div-sub 0.1%

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

      4. add-sqr-sqrt 0.1%

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

      5. sqrt-prod 0.1%

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

      6. sqr-neg 0.1%

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

      7. sqrt-unprod 0.0%

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

      8. add-sqr-sqrt 78.3%

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

      9. frac-2neg 78.3%

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

   5. Applied egg-rr 78.3%

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

      1. div0 78.3%

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

      2. neg-sub0 78.3%

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

      3. distribute-neg-frac2 78.3%

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

   7. Simplified 78.3%

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

   8. Taylor expanded in m around 0 78.3%

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

      1. sub-neg 78.3%

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

      2. metadata-eval 78.3%

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

      3. neg-mul-1 78.3%

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

      4. +-commutative 78.3%

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

      5. unsub-neg 78.3%

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

   10. Simplified 78.3%

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

4. Final simplification 88.5%

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

Alternative 6: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	return 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 = m * ((-1.0d0) + ((m * (1.0d0 - m)) / v))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Final simplification 99.8%

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

Alternative 7: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	return 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 = m * ((-1.0d0) + (m * ((1.0d0 - m) / v)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 8: 37.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 5.3 \cdot 10^{-188}:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (if (<= v 5.3e-188) (* m (/ m v)) (- m)))

C

double code(double m, double v) {
	double tmp;
	if (v <= 5.3e-188) {
		tmp = m * (m / v);
	} else {
		tmp = -m;
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (v <= 5.3d-188) then
        tmp = m * (m / v)
    else
        tmp = -m
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (v <= 5.3e-188) {
		tmp = m * (m / v);
	} else {
		tmp = -m;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if v <= 5.3e-188:
		tmp = m * (m / v)
	else:
		tmp = -m
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (v <= 5.3e-188)
		tmp = Float64(m * Float64(m / v));
	else
		tmp = Float64(-m);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (v <= 5.3e-188)
		tmp = m * (m / v);
	else
		tmp = -m;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[v, 5.3e-188], N[(m * N[(m / v), $MachinePrecision]), $MachinePrecision], (-m)]

Derivation

1. Split input into 2 regimes

2. if v < 5.30000000000000014e-188

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-/l* 99.6%

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

      4. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in v around 0 79.9%

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

      1. associate-/l* 79.9%

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

   7. Simplified 79.9%

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

   8. Taylor expanded in m around 0 29.6%

      \[\leadsto \color{blue}{\frac{{m}^{2}}{v}} \]
   9. Step-by-step derivation

      1. pow2 29.6%

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

      2. associate-/l* 40.9%

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

   10. Applied egg-rr 40.9%

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

   if 5.30000000000000014e-188 < v

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

      1. associate-*r/ 99.9%

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

      2. clear-num 99.9%

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

   6. Applied egg-rr 99.9%

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

   7. Taylor expanded in m around 0 41.1%

      \[\leadsto \color{blue}{-1 \cdot m} \]
   8. Step-by-step derivation

      1. neg-mul-1 41.1%

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

   9. Simplified 41.1%

      \[\leadsto \color{blue}{-m} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 27.7% accurate, 5.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(m, v):
	return -m

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := (-m)

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

   1. associate-*r/ 99.8%

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

   2. clear-num 99.8%

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

6. Applied egg-rr 99.8%

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

7. Taylor expanded in m around 0 31.1%

   \[\leadsto \color{blue}{-1 \cdot m} \]
8. Step-by-step derivation

   1. neg-mul-1 31.1%

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

9. Simplified 31.1%

   \[\leadsto \color{blue}{-m} \]
10. Add Preprocessing

Alternative 10: 3.0% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (m v) :precision binary64 m)

C

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

Fortran

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

Java

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

Python

def code(m, v):
	return m

Julia

function code(m, v)
	return m
end

MATLAB

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

Wolfram

code[m_, v_] := m

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in m around 0 31.1%

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

   1. *-commutative 31.1%

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

   2. neg-mul-1 31.1%

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

   3. neg-sub0 31.1%

      \[\leadsto \color{blue}{0 - m} \]

   4. sub-neg 31.1%

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

   5. add-sqr-sqrt 0.0%

      \[\leadsto 0 + \color{blue}{\sqrt{-m} \cdot \sqrt{-m}} \]

   6. sqrt-unprod 3.2%

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

   7. sqr-neg 3.2%

      \[\leadsto 0 + \sqrt{\color{blue}{m \cdot m}} \]

   8. sqrt-prod 3.0%

      \[\leadsto 0 + \color{blue}{\sqrt{m} \cdot \sqrt{m}} \]

   9. add-sqr-sqrt 3.0%

      \[\leadsto 0 + \color{blue}{m} \]

7. Applied egg-rr 3.0%

   \[\leadsto \color{blue}{0 + m} \]
8. Step-by-step derivation

   1. +-lft-identity 3.0%

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

9. Simplified 3.0%

   \[\leadsto \color{blue}{m} \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024132 
(FPCore (m v)
  :name "a 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) m))