b parameter of renormalized beta distribution

Percentage Accurate: 99.9% → 99.9%

Time: 6.3s

Alternatives: 9

Speedup: 1.0×

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

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

2. Final simplification 99.9%

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

Alternative 2: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. *-commutative 99.9%

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

   2. sub-neg 99.9%

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

   3. associate-*l/ 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Final simplification 99.9%

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

Alternative 3: 97.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 2.35000000000000009

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 97.5%

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

      1. sub-neg 97.5%

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

      2. *-commutative 97.5%

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

      3. distribute-rgt-in 97.5%

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

      4. *-lft-identity 97.5%

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

      5. associate-*l/ 97.7%

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

      6. *-lft-identity 97.7%

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

      7. metadata-eval 97.7%

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

   6. Simplified 97.7%

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

   7. Taylor expanded in v around 0 97.7%

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

   if 2.35000000000000009 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around inf 98.3%

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

      1. mul-1-neg 98.3%

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

      2. unpow2 98.3%

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

   6. Simplified 98.3%

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

   7. Taylor expanded in v around 0 98.3%

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

      1. mul-1-neg 98.3%

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

      2. unpow2 98.3%

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

      3. associate-/l* 98.3%

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

      4. distribute-neg-frac 98.3%

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

   9. Simplified 98.3%

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

   10. Taylor expanded in m around 0 21.3%

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

       1. *-commutative 21.3%

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

       2. unpow2 21.3%

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

       3. associate-*r/ 21.3%

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

       4. unpow3 21.2%

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

       5. associate-*l/ 21.2%

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

       6. associate-*r/ 21.2%

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

       7. distribute-lft-in 98.3%

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

       8. associate-*l* 98.3%

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

       9. +-commutative 98.3%

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

   12. Simplified 98.3%

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

4. Final simplification 98.0%

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

Alternative 4: 97.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 97.8%

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

   if 1 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around inf 98.3%

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

      1. mul-1-neg 98.3%

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

      2. unpow2 98.3%

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

   6. Simplified 98.3%

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

   7. Taylor expanded in v around 0 98.3%

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

      1. mul-1-neg 98.3%

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

      2. unpow2 98.3%

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

      3. associate-/l* 98.3%

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

      4. distribute-neg-frac 98.3%

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

   9. Simplified 98.3%

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

   10. Taylor expanded in m around 0 21.3%

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

       1. *-commutative 21.3%

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

       2. unpow2 21.3%

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

       3. associate-*r/ 21.3%

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

       4. unpow3 21.2%

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

       5. associate-*l/ 21.2%

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

       6. associate-*r/ 21.2%

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

       7. distribute-lft-in 98.3%

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

       8. associate-*l* 98.3%

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

       9. +-commutative 98.3%

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

   12. Simplified 98.3%

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

4. Final simplification 98.0%

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

Alternative 5: 74.4% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 2e-182) -1.0 (if (<= m 0.275) (/ m v) (* m (/ m v)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if m < 2.0000000000000001e-182

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-*l/ 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in m around 0 80.6%

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

   if 2.0000000000000001e-182 < m < 0.27500000000000002

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.8%

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

      4. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in m around 0 97.3%

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

   5. Taylor expanded in v around 0 70.0%

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

      1. associate-/l* 70.0%

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

   7. Simplified 70.0%

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

   8. Taylor expanded in m around 0 69.9%

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

   if 0.27500000000000002 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 0.3%

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

      1. sub-neg 0.3%

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

      2. metadata-eval 0.3%

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

      3. distribute-rgt-in 0.3%

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

      4. sub-neg 0.3%

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

      5. add-sqr-sqrt 0.0%

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

      6. sqrt-unprod 78.4%

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

      7. sqr-neg 78.4%

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

      8. sqrt-prod 78.4%

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

      9. add-sqr-sqrt 78.4%

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

      10. neg-mul-1 78.4%

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

      11. add-sqr-sqrt 78.3%

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

      12. sqrt-unprod 78.4%

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

      13. sqr-neg 78.4%

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

      14. sqrt-unprod 0.1%

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

      15. add-sqr-sqrt 78.4%

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

      16. sub-neg 78.4%

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

      17. add-sqr-sqrt 0.0%

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

      18. sqrt-unprod 78.4%

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

      19. sqr-neg 78.4%

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

      20. sqrt-prod 78.4%

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

      21. add-sqr-sqrt 78.4%

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

   6. Applied egg-rr 78.4%

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

      1. distribute-lft1-in 78.4%

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

      2. *-commutative 78.4%

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

      3. +-commutative 78.4%

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

   8. Simplified 78.4%

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

   9. Taylor expanded in m around inf 78.4%

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

       1. unpow2 78.4%

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

       2. associate-*r/ 78.4%

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

   11. Simplified 78.4%

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

4. Final simplification 76.0%

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

Alternative 6: 88.1% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.27500000000000002

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 98.1%

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

      1. sub-neg 98.1%

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

      2. *-commutative 98.1%

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

      3. distribute-rgt-in 98.1%

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

      4. *-lft-identity 98.1%

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

      5. associate-*l/ 98.3%

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

      6. *-lft-identity 98.3%

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

      7. metadata-eval 98.3%

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

   6. Simplified 98.3%

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

   7. Taylor expanded in v around 0 98.3%

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

   if 0.27500000000000002 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 0.3%

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

      1. sub-neg 0.3%

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

      2. metadata-eval 0.3%

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

      3. distribute-rgt-in 0.3%

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

      4. sub-neg 0.3%

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

      5. add-sqr-sqrt 0.0%

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

      6. sqrt-unprod 78.4%

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

      7. sqr-neg 78.4%

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

      8. sqrt-prod 78.4%

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

      9. add-sqr-sqrt 78.4%

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

      10. neg-mul-1 78.4%

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

      11. add-sqr-sqrt 78.3%

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

      12. sqrt-unprod 78.4%

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

      13. sqr-neg 78.4%

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

      14. sqrt-unprod 0.1%

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

      15. add-sqr-sqrt 78.4%

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

      16. sub-neg 78.4%

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

      17. add-sqr-sqrt 0.0%

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

      18. sqrt-unprod 78.4%

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

      19. sqr-neg 78.4%

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

      20. sqrt-prod 78.4%

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

      21. add-sqr-sqrt 78.4%

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

   6. Applied egg-rr 78.4%

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

      1. distribute-lft1-in 78.4%

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

      2. *-commutative 78.4%

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

      3. +-commutative 78.4%

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

   8. Simplified 78.4%

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

   9. Taylor expanded in m around inf 78.4%

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

       1. unpow2 78.4%

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

       2. associate-*r/ 78.4%

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

   11. Simplified 78.4%

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

4. Final simplification 89.8%

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

Alternative 7: 62.3% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (m v) :precision binary64 (if (<= m 1.8e-179) -1.0 (/ m v)))

C

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

Java

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

Python

def code(m, v):
	tmp = 0
	if m <= 1.8e-179:
		tmp = -1.0
	else:
		tmp = m / v
	return tmp

Julia

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

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (m <= 1.8e-179)
		tmp = -1.0;
	else
		tmp = m / v;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1.80000000000000004e-179

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-*l/ 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in m around 0 80.6%

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

   if 1.80000000000000004e-179 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-*l/ 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 43.4%

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

   5. Taylor expanded in v around 0 31.3%

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

      1. associate-/l* 31.3%

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

   7. Simplified 31.3%

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

   8. Taylor expanded in m around 0 61.8%

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

4. Final simplification 66.1%

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

Alternative 8: 27.2% accurate, 4.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. *-commutative 99.9%

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

   2. sub-neg 99.9%

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

   3. associate-*l/ 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in v around inf 28.0%

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

   1. neg-mul-1 28.0%

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

   2. neg-sub0 28.0%

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

   3. associate--r- 28.0%

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

   4. metadata-eval 28.0%

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

6. Simplified 28.0%

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

7. Final simplification 28.0%

   \[\leadsto m + -1 \]

Alternative 9: 24.8% accurate, 13.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(m, v):
	return -1.0

Julia

function code(m, v)
	return -1.0
end

MATLAB

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

Wolfram

code[m_, v_] := -1.0

Derivation

1. Initial program 99.9%

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

   1. *-commutative 99.9%

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

   2. sub-neg 99.9%

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

   3. associate-*l/ 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in m around 0 26.0%

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

5. Final simplification 26.0%

   \[\leadsto -1 \]

Reproduce

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