a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.8%

Time: 7.9s

Alternatives: 9

Speedup: 1.0×

• 41.7% 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.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1.60000000000000011e-16

   1. Initial program 99.8%

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

   3. Taylor expanded in m around 0

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

      1. lower-/.f64 99.8

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

   5. Applied rewrites 99.8%

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

   if 1.60000000000000011e-16 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. *-commutative N/A

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

      2. cube-mult N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-out-- N/A

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

      8. associate-/r* N/A

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

      9. associate-*r/ N/A

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

      10. rgt-mult-inverse N/A

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

      11. associate-*r/ N/A

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

      12. *-rgt-identity N/A

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

      13. div-sub N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 72.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\frac{\left(1 - m\right) \cdot m}{v} - 1\right) \cdot m\\ \mathbf{if}\;t\_0 \leq -4 \cdot 10^{+100}:\\ \;\;\;\;\frac{\left(-m\right) \cdot m}{m}\\ \mathbf{elif}\;t\_0 \leq -2 \cdot 10^{-305}:\\ \;\;\;\;-m\\ \mathbf{else}:\\ \;\;\;\;\frac{m}{v} \cdot m\\ \end{array} \end{array} \]

FPCore

(FPCore (m v)
 :precision binary64
 (let* ((t_0 (* (- (/ (* (- 1.0 m) m) v) 1.0) m)))
   (if (<= t_0 -4e+100)
     (/ (* (- m) m) m)
     (if (<= t_0 -2e-305) (- m) (* (/ m v) m)))))

C

double code(double m, double v) {
	double t_0 = ((((1.0 - m) * m) / v) - 1.0) * m;
	double tmp;
	if (t_0 <= -4e+100) {
		tmp = (-m * m) / m;
	} else if (t_0 <= -2e-305) {
		tmp = -m;
	} else {
		tmp = (m / v) * m;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double m, double v) {
	double t_0 = ((((1.0 - m) * m) / v) - 1.0) * m;
	double tmp;
	if (t_0 <= -4e+100) {
		tmp = (-m * m) / m;
	} else if (t_0 <= -2e-305) {
		tmp = -m;
	} else {
		tmp = (m / v) * m;
	}
	return tmp;
}

Python

def code(m, v):
	t_0 = ((((1.0 - m) * m) / v) - 1.0) * m
	tmp = 0
	if t_0 <= -4e+100:
		tmp = (-m * m) / m
	elif t_0 <= -2e-305:
		tmp = -m
	else:
		tmp = (m / v) * m
	return tmp

Julia

function code(m, v)
	t_0 = Float64(Float64(Float64(Float64(Float64(1.0 - m) * m) / v) - 1.0) * m)
	tmp = 0.0
	if (t_0 <= -4e+100)
		tmp = Float64(Float64(Float64(-m) * m) / m);
	elseif (t_0 <= -2e-305)
		tmp = Float64(-m);
	else
		tmp = Float64(Float64(m / v) * m);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	t_0 = ((((1.0 - m) * m) / v) - 1.0) * m;
	tmp = 0.0;
	if (t_0 <= -4e+100)
		tmp = (-m * m) / m;
	elseif (t_0 <= -2e-305)
		tmp = -m;
	else
		tmp = (m / v) * m;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := Block[{t$95$0 = N[(N[(N[(N[(N[(1.0 - m), $MachinePrecision] * m), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * m), $MachinePrecision]}, If[LessEqual[t$95$0, -4e+100], N[(N[((-m) * m), $MachinePrecision] / m), $MachinePrecision], If[LessEqual[t$95$0, -2e-305], (-m), N[(N[(m / v), $MachinePrecision] * m), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -4.00000000000000006e100

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(m\right)} \]

      2. lower-neg.f64 5.7

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

   5. Applied rewrites 5.7%

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

   7. Applied rewrites 54.2%

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

   if -4.00000000000000006e100 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -1.99999999999999999e-305

   1. Initial program 100.0%

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

   3. Taylor expanded in m around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(m\right)} \]

      2. lower-neg.f64 95.9

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

   5. Applied rewrites 95.9%

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

   if -1.99999999999999999e-305 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m)

   1. Initial program 99.6%

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

   3. Taylor expanded in m around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-lft-out-- N/A

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

      7. associate-/r* N/A

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

      8. associate-*r/ N/A

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

      9. rgt-mult-inverse N/A

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

      10. associate-*r/ N/A

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

      11. *-rgt-identity N/A

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

      12. div-sub N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 97.3

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

   5. Applied rewrites 97.3%

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

   6. Taylor expanded in m around 0

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

   8. Applied rewrites 92.2%

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

4. Final simplification 73.0%

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

Alternative 3: 97.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -2e86

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. *-commutative N/A

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

      2. cube-mult N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-out-- N/A

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

      8. associate-/r* N/A

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

      9. associate-*r/ N/A

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

      10. rgt-mult-inverse N/A

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

      11. associate-*r/ N/A

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

      12. *-rgt-identity N/A

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

      13. div-sub N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in m around inf

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

   8. Applied rewrites 99.3%

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

   if -2e86 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m)

   1. Initial program 99.8%

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

   3. Taylor expanded in m around 0

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

      1. lower-/.f64 97.7

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

   5. Applied rewrites 97.7%

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

4. Final simplification 98.5%

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

Alternative 4: 75.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -2e86

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(m\right)} \]

      2. lower-neg.f64 5.7

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

   5. Applied rewrites 5.7%

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

   7. Applied rewrites 53.8%

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

   if -2e86 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m)

   1. Initial program 99.8%

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

   3. Taylor expanded in m around 0

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

      1. lower-/.f64 97.7

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

   5. Applied rewrites 97.7%

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

4. Final simplification 74.2%

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

Alternative 5: 49.1% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -1.99999999999999999e-305

   1. Initial program 100.0%

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

   3. Taylor expanded in m around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(m\right)} \]

      2. lower-neg.f64 36.6

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

   5. Applied rewrites 36.6%

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

   if -1.99999999999999999e-305 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m)

   1. Initial program 99.6%

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

   3. Taylor expanded in m around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-lft-out-- N/A

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

      7. associate-/r* N/A

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

      8. associate-*r/ N/A

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

      9. rgt-mult-inverse N/A

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

      10. associate-*r/ N/A

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

      11. *-rgt-identity N/A

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

      12. div-sub N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 97.3

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

   5. Applied rewrites 97.3%

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

   6. Taylor expanded in m around 0

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

   8. Applied rewrites 92.2%

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

4. Final simplification 47.3%

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

Alternative 6: 44.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -1.99999999999999999e-305

   1. Initial program 100.0%

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

   3. Taylor expanded in m around 0

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(m\right)} \]

      2. lower-neg.f64 36.6

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

   5. Applied rewrites 36.6%

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

   if -1.99999999999999999e-305 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m)

   1. Initial program 99.6%

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

   3. Taylor expanded in m around inf

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

      1. *-commutative N/A

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

      2. cube-mult N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-out-- N/A

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

      8. associate-/r* N/A

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

      9. associate-*r/ N/A

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

      10. rgt-mult-inverse N/A

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

      11. associate-*r/ N/A

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

      12. *-rgt-identity N/A

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

      13. div-sub N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 76.5

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

   5. Applied rewrites 76.5%

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

   6. Taylor expanded in m around 0

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

   8. Applied rewrites 71.4%

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

4. Final simplification 43.3%

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

Alternative 7: 99.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1.00000000000000001e-41

   1. Initial program 99.8%

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

   3. Taylor expanded in m around 0

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

      1. lower-/.f64 99.8

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

   5. Applied rewrites 99.8%

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

   if 1.00000000000000001e-41 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. *-commutative N/A

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

      2. cube-mult N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-out-- N/A

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

      8. associate-/r* N/A

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

      9. associate-*r/ N/A

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

      10. rgt-mult-inverse N/A

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

      11. associate-*r/ N/A

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

      12. *-rgt-identity N/A

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

      13. div-sub N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 N/A

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

      16. unpow2 N/A

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

      17. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 8: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

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

Alternative 9: 26.9% accurate, 9.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(m, v):
	return -m

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in m around 0

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(m\right)} \]

   2. lower-neg.f64 30.0

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

5. Applied rewrites 30.0%

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

Reproduce

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