a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.7%

Time: 8.7s

Alternatives: 14

Speedup: 1.0×

• 41.1% 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.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 5.20000000000000009e-15

   1. Initial program 99.9%

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

   2. Taylor expanded in m around 0 99.9%

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

   if 5.20000000000000009e-15 < 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

4. Final simplification 99.9%

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

Alternative 2: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 8.69999999999999962e-17

   1. Initial program 99.9%

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

   2. Taylor expanded in m around 0 99.9%

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

   if 8.69999999999999962e-17 < 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

      1. associate-/l* 99.9%

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

      2. associate-/r/ 99.9%

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

      3. un-div-inv 99.9%

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

      4. clear-num 99.9%

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

   8. Applied egg-rr 99.9%

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

4. Final simplification 99.9%

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

Alternative 3: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 8.39999999999999968e-17

   1. Initial program 99.9%

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

   2. Taylor expanded in m around 0 99.9%

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

   if 8.39999999999999968e-17 < 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

      1. associate-/l* 99.9%

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

      2. associate-/r/ 99.9%

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

      3. un-div-inv 99.9%

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

      4. clear-num 99.9%

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

   8. Applied egg-rr 99.9%

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

   9. Taylor expanded in v around 0 99.9%

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

4. Final simplification 99.9%

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

Alternative 4: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 2.9 \cdot 10^{-15}:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\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.9e-15) (* m (+ -1.0 (/ m v))) (* (/ (- 1.0 m) v) (* m m))))

C

double code(double m, double v) {
	double tmp;
	if (m <= 2.9e-15) {
		tmp = m * (-1.0 + (m / v));
	} 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.9d-15) then
        tmp = m * ((-1.0d0) + (m / v))
    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.9e-15) {
		tmp = m * (-1.0 + (m / v));
	} else {
		tmp = ((1.0 - m) / v) * (m * m);
	}
	return tmp;
}

Python

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

Julia

function code(m, v)
	tmp = 0.0
	if (m <= 2.9e-15)
		tmp = Float64(m * Float64(-1.0 + Float64(m / v)));
	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.9e-15)
		tmp = m * (-1.0 + (m / v));
	else
		tmp = ((1.0 - m) / v) * (m * m);
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[m, 2.9e-15], N[(m * N[(-1.0 + N[(m / v), $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.90000000000000019e-15

   1. Initial program 99.9%

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

   2. Taylor expanded in m around 0 99.9%

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

   if 2.90000000000000019e-15 < 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

      1. div-inv 99.9%

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

      2. clear-num 99.9%

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

      3. *-commutative 99.9%

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

   8. Applied egg-rr 99.9%

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

4. Final simplification 99.9%

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

Alternative 5: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := N[(m * 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 m \]

2. Final simplification 99.9%

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

Alternative 6: 99.8% 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.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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

   1. clear-num 99.8%

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

   2. associate-/r/ 99.8%

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

   3. clear-num 99.8%

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

5. Applied egg-rr 99.8%

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

6. Final simplification 99.8%

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

Alternative 7: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := N[(m * 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 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Final simplification 99.9%

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

Alternative 8: 74.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 3.2 \cdot 10^{-159}:\\ \;\;\;\;-m\\ \mathbf{elif}\;m \leq 1:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;\frac{-m}{\frac{v}{m}}\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if m < 3.2e-159

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-/l* 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in m around 0 80.1%

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

      1. neg-mul-1 80.1%

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

   6. Simplified 80.1%

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

   if 3.2e-159 < 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in v around 0 72.9%

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

      1. unpow2 72.9%

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

      2. associate-/l* 72.9%

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

   6. Simplified 72.9%

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

      1. associate-/l* 73.5%

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

      2. associate-/r/ 73.5%

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

      3. un-div-inv 73.4%

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

      4. clear-num 73.4%

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

   8. Applied egg-rr 73.4%

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

   9. Taylor expanded in m around 0 68.8%

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

   if 1 < m

   1. Initial program 100.0%

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

   2. Taylor expanded in m around 0 0.1%

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

   3. Taylor expanded in m around inf 0.1%

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

      1. unpow2 0.1%

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

   5. Simplified 0.1%

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

      1. frac-2neg 0.1%

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

      2. distribute-frac-neg 0.1%

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

      3. add-sqr-sqrt 0.1%

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

      4. sqrt-prod 0.1%

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

      5. sqr-neg 0.1%

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

      6. sqrt-unprod 0.0%

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

      7. add-sqr-sqrt 75.7%

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

      8. distribute-rgt-neg-in 75.7%

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

      9. frac-2neg 75.7%

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

      10. associate-/l* 75.7%

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

   7. Applied egg-rr 75.7%

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

4. Final simplification 75.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq 3.2 \cdot 10^{-159}:\\ \;\;\;\;-m\\ \mathbf{elif}\;m \leq 1:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;\frac{-m}{\frac{v}{m}}\\ \end{array} \]

Alternative 9: 97.6% accurate, 1.1× 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(m \cdot \frac{-m}{v}\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

def code(m, v):
	tmp = 0
	if m <= 1.0:
		tmp = m * (-1.0 + (m / v))
	else:
		tmp = m * (m * (-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(m * Float64(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 * (m * (-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[(m * N[((-m) / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.8%

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

   2. Taylor expanded in m around 0 97.4%

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

   if 1 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

         \[\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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

      1. associate-/l* 100.0%

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

      2. associate-/r/ 99.9%

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

      3. un-div-inv 99.9%

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

      4. clear-num 99.9%

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

   8. Applied egg-rr 99.9%

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

   9. Taylor expanded in m around inf 99.1%

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

       1. mul-1-neg 99.1%

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

       2. unpow2 99.1%

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

       3. associate-*l/ 99.0%

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

       4. distribute-rgt-neg-in 99.0%

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

   11. Simplified 99.0%

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

4. Final simplification 98.2%

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

Alternative 10: 97.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Python

def code(m, v):
	tmp = 0
	if m <= 1.0:
		tmp = m * (-1.0 + (m / v))
	else:
		tmp = (m * m) * (-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(Float64(m * m) * Float64(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 * m) * (-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[(N[(m * m), $MachinePrecision] * N[((-m) / v), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.8%

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

   2. Taylor expanded in m around 0 97.4%

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

   if 1 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

         \[\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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

      1. div-inv 100.0%

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

      2. clear-num 99.9%

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

      3. *-commutative 99.9%

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

   8. Applied egg-rr 99.9%

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

   9. Taylor expanded in m around inf 99.1%

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

       1. neg-mul-1 99.1%

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

       2. distribute-neg-frac 99.1%

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

   11. Simplified 99.1%

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

4. Final simplification 98.2%

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

Alternative 11: 97.6% accurate, 1.1× 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 \frac{m \cdot \left(-m\right)}{v}\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

def code(m, v):
	tmp = 0
	if m <= 1.0:
		tmp = m * (-1.0 + (m / v))
	else:
		tmp = m * ((m * -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(Float64(m * 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 * ((m * -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[(N[(m * (-m)), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.8%

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

   2. Taylor expanded in m around 0 97.4%

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

   if 1 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

         \[\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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 100.0%

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

      1. unpow2 100.0%

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

      2. associate-/l* 100.0%

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

   6. Simplified 100.0%

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

      1. associate-/l* 100.0%

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

      2. associate-/r/ 99.9%

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

      3. un-div-inv 99.9%

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

      4. clear-num 99.9%

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

   8. Applied egg-rr 99.9%

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

   9. Taylor expanded in v around 0 100.0%

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

   10. Taylor expanded in m around inf 99.1%

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

       1. unpow2 99.1%

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

       2. mul-1-neg 99.1%

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

       3. distribute-rgt-neg-out 99.1%

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

   12. Simplified 99.1%

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

4. Final simplification 98.3%

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

Alternative 12: 87.2% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Python

def code(m, v):
	tmp = 0
	if m <= 1.0:
		tmp = m * (-1.0 + (m / v))
	else:
		tmp = -m / (v / m)
	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(Float64(-m) / Float64(v / m));
	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 / (v / m);
	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[(v / m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.8%

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

   2. Taylor expanded in m around 0 97.4%

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

   if 1 < m

   1. Initial program 100.0%

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

   2. Taylor expanded in m around 0 0.1%

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

   3. Taylor expanded in m around inf 0.1%

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

      1. unpow2 0.1%

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

   5. Simplified 0.1%

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

      1. frac-2neg 0.1%

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

      2. distribute-frac-neg 0.1%

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

      3. add-sqr-sqrt 0.1%

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

      4. sqrt-prod 0.1%

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

      5. sqr-neg 0.1%

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

      6. sqrt-unprod 0.0%

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

      7. add-sqr-sqrt 75.7%

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

      8. distribute-rgt-neg-in 75.7%

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

      9. frac-2neg 75.7%

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

      10. associate-/l* 75.7%

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

   7. Applied egg-rr 75.7%

      \[\leadsto \color{blue}{-\frac{m}{\frac{v}{m}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.5%

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

Alternative 13: 38.0% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (m v) :precision binary64 (if (<= v 8e-161) (* m (/ m v)) (- m)))

C

double code(double m, double v) {
	double tmp;
	if (v <= 8e-161) {
		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 <= 8d-161) 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 <= 8e-161) {
		tmp = m * (m / v);
	} else {
		tmp = -m;
	}
	return tmp;
}

Python

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

Julia

function code(m, v)
	tmp = 0.0
	if (v <= 8e-161)
		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 <= 8e-161)
		tmp = m * (m / v);
	else
		tmp = -m;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if v < 8.00000000000000022e-161

   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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 77.0%

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

      1. unpow2 77.0%

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

      2. associate-/l* 77.0%

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

   6. Simplified 77.0%

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

      1. associate-/l* 84.2%

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

      2. associate-/r/ 84.3%

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

      3. un-div-inv 84.2%

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

      4. clear-num 84.2%

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

   8. Applied egg-rr 84.2%

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

   9. Taylor expanded in m around 0 39.8%

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

   if 8.00000000000000022e-161 < 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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 37.9%

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

      1. neg-mul-1 37.9%

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

   6. Simplified 37.9%

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

4. Final simplification 38.7%

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

Alternative 14: 27.0% 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.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}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in m around 0 28.7%

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

   1. neg-mul-1 28.7%

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

6. Simplified 28.7%

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

7. Final simplification 28.7%

   \[\leadsto -m \]

Reproduce

herbie shell --seed 2023283 
(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))