a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.8%

Time: 7.5s

Alternatives: 10

Speedup: 0.1×

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

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

   1. distribute-rgt-in 99.8%

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

   2. fma-define 99.8%

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

   3. associate-*r/ 99.8%

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

   4. *-commutative 99.8%

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

   5. associate-*r/ 99.9%

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

   6. neg-mul-1 99.9%

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

6. Applied egg-rr 99.9%

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

Alternative 2: 99.8% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. *-commutative 99.8%

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

   3. associate-/l* 99.9%

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

   4. fma-neg 99.9%

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

   5. metadata-eval 99.9%

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

3. Simplified 99.9%

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

Alternative 3: 98.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-/l* 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in m around 0 97.8%

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

      1. div-inv 97.8%

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

      2. clear-num 97.8%

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

   7. Applied egg-rr 97.8%

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

   if 1 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in m around inf 98.3%

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

      1. neg-mul-1 98.3%

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

      2. distribute-neg-frac2 98.3%

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

   7. Simplified 98.3%

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

4. Final simplification 98.0%

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

Alternative 4: 87.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-/l* 99.7%

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

      4. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in m around 0 97.8%

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

      1. div-inv 97.8%

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

      2. clear-num 97.8%

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

   7. Applied egg-rr 97.8%

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

   if 1 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in m around 0 0.1%

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

      1. div-inv 0.1%

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

      2. frac-2neg 0.1%

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

      3. neg-sub0 0.1%

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

      4. div-sub 0.1%

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

      5. add-sqr-sqrt 0.1%

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

      6. sqrt-prod 0.1%

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

      7. sqr-neg 0.1%

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

      8. sqrt-unprod 0.0%

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

      9. add-sqr-sqrt 80.0%

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

      10. frac-2neg 80.0%

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

   7. Applied egg-rr 80.0%

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

      1. div0 80.0%

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

      2. neg-sub0 80.0%

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

      3. distribute-frac-neg2 80.0%

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

   9. Simplified 80.0%

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

4. Final simplification 89.9%

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

Alternative 5: 87.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

   3. Taylor expanded in m around 0 97.8%

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

   if 1 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in m around 0 0.1%

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

      1. div-inv 0.1%

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

      2. frac-2neg 0.1%

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

      3. neg-sub0 0.1%

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

      4. div-sub 0.1%

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

      5. add-sqr-sqrt 0.1%

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

      6. sqrt-prod 0.1%

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

      7. sqr-neg 0.1%

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

      8. sqrt-unprod 0.0%

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

      9. add-sqr-sqrt 80.0%

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

      10. frac-2neg 80.0%

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

   7. Applied egg-rr 80.0%

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

      1. div0 80.0%

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

      2. neg-sub0 80.0%

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

      3. distribute-frac-neg2 80.0%

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

   9. Simplified 80.0%

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

4. Final simplification 89.9%

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

Alternative 6: 52.2% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

   3. Taylor expanded in m around 0 97.8%

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

   if 1 < m

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-/l* 99.9%

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

      4. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in m around 0 5.9%

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

      1. neg-mul-1 5.9%

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

   7. Simplified 5.9%

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

4. Final simplification 56.9%

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

Alternative 7: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

   1. associate-*r/ 99.8%

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

   2. *-commutative 99.8%

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

   3. associate-*r/ 99.9%

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

   4. clear-num 99.9%

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

   5. un-div-inv 99.8%

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

6. Applied egg-rr 99.8%

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

7. Final simplification 99.8%

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

Alternative 8: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 9: 27.7% accurate, 5.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(m, v):
	return -m

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in m around 0 30.3%

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

   1. neg-mul-1 30.3%

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

7. Simplified 30.3%

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

Alternative 10: 3.1% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (m v) :precision binary64 m)

C

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

Fortran

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

Java

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

Python

def code(m, v):
	return m

Julia

function code(m, v)
	return m
end

MATLAB

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

Wolfram

code[m_, v_] := m

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-/l* 99.8%

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

   4. metadata-eval 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in m around 0 54.3%

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

6. Taylor expanded in v around 0 37.3%

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

   1. +-commutative 37.3%

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

   2. mul-1-neg 37.3%

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

   3. unpow2 37.3%

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

   4. *-commutative 37.3%

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

   5. distribute-lft-neg-out 37.3%

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

   6. distribute-rgt-out 37.3%

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

8. Simplified 37.3%

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

9. Taylor expanded in m around 0 20.6%

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

    1. associate-*r* 20.6%

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

    2. neg-mul-1 20.6%

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

11. Simplified 20.6%

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

    1. associate-/l* 30.3%

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

    2. *-inverses 30.3%

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

    3. distribute-lft-neg-out 30.3%

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

    4. metadata-eval 30.3%

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

    5. div-inv 30.3%

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

    6. /-rgt-identity 30.3%

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

    7. neg-sub0 30.3%

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

    8. sub-neg 30.3%

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

    9. add-sqr-sqrt 0.0%

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

    10. sqrt-unprod 3.3%

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

    11. sqr-neg 3.3%

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

    12. sqrt-unprod 3.3%

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

    13. add-sqr-sqrt 3.3%

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

13. Applied egg-rr 3.3%

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

    1. +-lft-identity 3.3%

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

15. Simplified 3.3%

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

Reproduce

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