b parameter of renormalized beta distribution

Percentage Accurate: 99.9% → 99.9%

Time: 6.9s

Alternatives: 14

Speedup: 1.0×

• 42.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 \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 100.0%

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

2. Final simplification 100.0%

   \[\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} \\ \begin{array}{l} \mathbf{if}\;m \leq 7.6 \cdot 10^{-14}:\\ \;\;\;\;\left(1 - m\right) \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 - m\right) \cdot \left(m \cdot \frac{1 - m}{v}\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 7.6000000000000004e-14

   1. Initial program 100.0%

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

   2. Taylor expanded in m around 0 99.9%

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

   if 7.6000000000000004e-14 < 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. sub-neg 99.9%

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

      2. distribute-rgt-in 99.9%

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

      3. *-un-lft-identity 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in v around 0 99.6%

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

      1. associate-/l* 99.6%

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

      2. associate-/r/ 99.6%

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

      3. +-commutative 99.6%

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

      4. unpow2 99.6%

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

      5. mul-1-neg 99.6%

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

      6. sub-neg 99.6%

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

      7. *-rgt-identity 99.6%

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

      8. distribute-lft-out-- 99.6%

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

   6. Simplified 99.6%

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

   7. Taylor expanded in m around 0 50.0%

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

      1. *-rgt-identity 50.0%

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

      2. mul-1-neg 50.0%

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

      3. unpow2 50.0%

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

      4. associate-*l/ 49.9%

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

      5. distribute-rgt-neg-in 49.9%

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

      6. distribute-lft-in 99.6%

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

      7. sub-neg 99.6%

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

      8. associate-*l/ 99.6%

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

      9. associate-*r/ 99.6%

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

   9. Simplified 99.6%

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

4. Final simplification 99.7%

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

Alternative 3: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 7.6000000000000004e-14

   1. Initial program 100.0%

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

   2. Taylor expanded in m around 0 99.9%

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

   if 7.6000000000000004e-14 < 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. sub-neg 99.9%

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

      2. distribute-rgt-in 99.9%

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

      3. *-un-lft-identity 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in v around 0 99.6%

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

      1. associate-/l* 99.6%

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

      2. associate-/r/ 99.6%

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

      3. +-commutative 99.6%

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

      4. unpow2 99.6%

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

      5. mul-1-neg 99.6%

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

      6. sub-neg 99.6%

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

      7. *-rgt-identity 99.6%

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

      8. distribute-lft-out-- 99.6%

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

   6. Simplified 99.6%

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

4. Final simplification 99.7%

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

Alternative 4: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. *-commutative 100.0%

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

   2. sub-neg 100.0%

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

   3. associate-/l* 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

   1. clear-num 99.8%

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

   2. associate-/r/ 99.8%

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

   3. clear-num 99.8%

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

5. Applied egg-rr 99.8%

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

6. Final simplification 99.8%

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

Alternative 5: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. *-commutative 100.0%

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

   2. sub-neg 100.0%

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

   3. associate-/l* 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Final simplification 99.9%

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

Alternative 6: 97.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.25

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 96.4%

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

      1. sub-neg 96.4%

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

      2. metadata-eval 96.4%

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

      3. +-commutative 96.4%

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

      4. *-commutative 96.4%

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

      5. distribute-rgt-in 96.4%

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

      6. *-lft-identity 96.4%

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

      7. associate-*l/ 96.7%

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

      8. *-lft-identity 96.7%

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

   6. Simplified 96.7%

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

   7. Taylor expanded in v around 0 96.7%

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

   if 0.25 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around inf 97.9%

      \[\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 97.9%

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

      2. unpow2 97.9%

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

      3. associate-*l/ 97.9%

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

      4. distribute-rgt-neg-out 97.9%

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

   6. Simplified 97.9%

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

   7. Taylor expanded in v around 0 97.9%

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

      1. mul-1-neg 97.9%

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

      2. unpow2 97.9%

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

      3. associate-/l* 97.9%

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

      4. distribute-neg-frac 97.9%

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

      5. distribute-rgt-neg-in 97.9%

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

   9. Simplified 97.9%

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

       1. associate-/r/ 97.9%

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

       2. *-commutative 97.9%

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

       3. associate-/l* 97.9%

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

       4. add-sqr-sqrt 0.0%

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

       5. sqrt-unprod 0.3%

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

       6. sqr-neg 0.3%

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

       7. sqrt-prod 0.3%

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

       8. add-sqr-sqrt 0.3%

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

       9. un-div-inv 0.3%

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

       10. clear-num 0.3%

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

       11. sub-neg 0.3%

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

       12. add-sqr-sqrt 0.0%

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

       13. sqrt-unprod 98.1%

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

       14. sqr-neg 98.1%

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

       15. sqrt-prod 98.0%

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

       16. add-sqr-sqrt 98.1%

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

       17. +-commutative 98.1%

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

   11. Applied egg-rr 98.1%

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

4. Final simplification 97.4%

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

Alternative 7: 97.8% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := If[LessEqual[m, 1.0], N[(N[(1.0 - m), $MachinePrecision] * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(m / N[(v / N[(m * m), $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. Taylor expanded in m around 0 95.5%

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

   if 1 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 99.9%

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

      1. associate-*l/ 99.9%

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

   6. Simplified 99.9%

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

   7. Taylor expanded in m around inf 99.3%

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

      1. unpow2 99.3%

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

   9. Simplified 99.3%

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

       1. associate-*l/ 99.3%

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

       2. associate-/l* 99.3%

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

   11. Applied egg-rr 99.3%

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

4. Final simplification 97.5%

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

Alternative 8: 98.4% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1.6200000000000001

   1. Initial program 99.9%

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

   2. Taylor expanded in m around 0 95.5%

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

   if 1.6200000000000001 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 99.9%

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

      1. associate-*l/ 99.9%

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

   6. Simplified 99.9%

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

   7. Taylor expanded in m around inf 99.7%

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

      1. unpow2 99.7%

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

      2. distribute-rgt-out 99.7%

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

   9. Simplified 99.7%

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

4. Final simplification 97.7%

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

Alternative 9: 97.7% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.39000000000000001

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 95.8%

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

      1. sub-neg 95.8%

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

      2. metadata-eval 95.8%

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

      3. +-commutative 95.8%

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

      4. *-commutative 95.8%

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

      5. distribute-rgt-in 95.8%

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

      6. *-lft-identity 95.8%

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

      7. associate-*l/ 96.0%

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

      8. *-lft-identity 96.0%

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

   6. Simplified 96.0%

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

   7. Taylor expanded in v around 0 96.0%

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

   if 0.39000000000000001 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 99.9%

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

      1. associate-*l/ 99.9%

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

   6. Simplified 99.9%

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

   7. Taylor expanded in m around inf 98.6%

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

      1. unpow2 98.6%

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

   9. Simplified 98.6%

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

4. Final simplification 97.4%

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

Alternative 10: 97.7% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.39000000000000001

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 95.8%

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

      1. sub-neg 95.8%

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

      2. metadata-eval 95.8%

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

      3. +-commutative 95.8%

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

      4. *-commutative 95.8%

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

      5. distribute-rgt-in 95.8%

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

      6. *-lft-identity 95.8%

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

      7. associate-*l/ 96.0%

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

      8. *-lft-identity 96.0%

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

   6. Simplified 96.0%

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

   7. Taylor expanded in v around 0 96.0%

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

   if 0.39000000000000001 < m

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in v around 0 99.9%

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

      1. associate-*l/ 99.9%

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

   6. Simplified 99.9%

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

   7. Taylor expanded in m around inf 98.6%

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

      1. unpow2 98.6%

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

   9. Simplified 98.6%

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

       1. associate-*l/ 98.6%

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

       2. associate-/l* 98.7%

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

   11. Applied egg-rr 98.7%

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

4. Final simplification 97.4%

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

Alternative 11: 62.6% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1.06e-40

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in m around 0 57.1%

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

   if 1.06e-40 < m

   1. Initial program 99.9%

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

   2. Taylor expanded in m around 0 9.5%

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

      1. sub-neg 9.5%

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

      2. distribute-rgt-in 9.5%

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

      3. *-un-lft-identity 9.5%

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

      4. sub-neg 9.5%

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

      5. metadata-eval 9.5%

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

      6. add-sqr-sqrt 0.0%

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

      7. sqrt-unprod 81.4%

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

      8. sqr-neg 81.4%

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

      9. sqrt-unprod 81.4%

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

      10. add-sqr-sqrt 81.4%

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

      11. sub-neg 81.4%

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

      12. metadata-eval 81.4%

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

   4. Applied egg-rr 81.4%

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

      1. distribute-rgt1-in 81.4%

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

   6. Simplified 81.4%

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

   7. Taylor expanded in m around inf 73.6%

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

      1. unpow2 73.6%

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

      2. associate-*r/ 73.6%

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

   9. Simplified 73.6%

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

4. Final simplification 67.1%

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

Alternative 12: 86.9% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.28000000000000003

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in m around 0 96.4%

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

      1. sub-neg 96.4%

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

      2. metadata-eval 96.4%

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

      3. +-commutative 96.4%

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

      4. *-commutative 96.4%

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

      5. distribute-rgt-in 96.4%

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

      6. *-lft-identity 96.4%

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

      7. associate-*l/ 96.7%

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

      8. *-lft-identity 96.7%

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

   6. Simplified 96.7%

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

   7. Taylor expanded in v around 0 96.7%

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

   if 0.28000000000000003 < m

   1. Initial program 100.0%

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

   2. Taylor expanded in m around 0 0.4%

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

      1. sub-neg 0.4%

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

      2. distribute-rgt-in 0.4%

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

      3. *-un-lft-identity 0.4%

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

      4. sub-neg 0.4%

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

      5. metadata-eval 0.4%

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

      6. add-sqr-sqrt 0.0%

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

      7. sqrt-unprod 82.0%

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

      8. sqr-neg 82.0%

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

      9. sqrt-unprod 82.0%

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

      10. add-sqr-sqrt 82.0%

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

      11. sub-neg 82.0%

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

      12. metadata-eval 82.0%

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

   4. Applied egg-rr 82.0%

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

      1. distribute-rgt1-in 82.0%

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

   6. Simplified 82.0%

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

   7. Taylor expanded in m around inf 82.0%

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

      1. unpow2 82.0%

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

      2. associate-*r/ 82.0%

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

   9. Simplified 82.0%

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

4. Final simplification 88.9%

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

Alternative 13: 26.1% 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 100.0%

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

   1. *-commutative 100.0%

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

   2. sub-neg 100.0%

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

   3. associate-/l* 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in v around inf 25.7%

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

   1. neg-mul-1 25.7%

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

   2. neg-sub0 25.7%

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

   3. associate--r- 25.7%

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

   4. metadata-eval 25.7%

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

6. Simplified 25.7%

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

7. Final simplification 25.7%

   \[\leadsto m + -1 \]

Alternative 14: 23.7% 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 100.0%

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

   1. *-commutative 100.0%

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

   2. sub-neg 100.0%

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

   3. associate-/l* 99.9%

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

   4. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in m around 0 23.2%

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

5. Final simplification 23.2%

   \[\leadsto -1 \]

Reproduce

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