a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.4%

Time: 8.1s

Alternatives: 11

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.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 7.0000000000000003e-40

   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 7.0000000000000003e-40 < 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 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.2

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

   5. Applied rewrites 5.2%

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

   6. Taylor expanded in m around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

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

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

      5. associate-*r/ N/A

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

      6. *-rgt-identity N/A

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

      7. unsub-neg N/A

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

      8. mul-1-neg N/A

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

      9. distribute-rgt-in N/A

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

      10. *-commutative N/A

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

      11. distribute-rgt-in N/A

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

      12. distribute-lft-in N/A

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

      13. associate-/r* N/A

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

      14. associate-*l/ N/A

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

      15. lft-mult-inverse N/A

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

   8. Applied rewrites 99.9%

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

   10. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 97.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

code[m_, v_] := If[LessEqual[N[(m * N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], -2e+86], N[(m * N[(N[(m * m), $MachinePrecision] / (-v)), $MachinePrecision]), $MachinePrecision], N[(m * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $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}{\left(-1 \cdot \frac{{m}^{2}}{v}\right)} \cdot m \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 99.3

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

   5. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\frac{m \cdot \left(-m\right)}{v}} \cdot 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 98.5%

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

Alternative 3: 97.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

code[m_, v_] := If[LessEqual[N[(m * N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], -2e+86], N[(N[(m * N[(m * (-m)), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision], N[(m * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $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}{-1 \cdot \frac{{m}^{3}}{v}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow3 N/A

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

      4. unpow2 N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 99.3

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

   5. Applied rewrites 99.3%

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

   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}\;m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} + -1\right) \leq -2 \cdot 10^{+86}:\\ \;\;\;\;\frac{m \cdot \left(m \cdot \left(-m\right)\right)}{v}\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

code[m_, v_] := If[LessEqual[N[(m * N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], -2e+86], (-N[(N[(m * m), $MachinePrecision] / m), $MachinePrecision]), N[(m * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $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{m \cdot \left(-m\right)}{\color{blue}{0 + 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}\;m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} + -1\right) \leq -2 \cdot 10^{+86}:\\ \;\;\;\;-\frac{m \cdot m}{m}\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 51.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

code[m_, v_] := If[LessEqual[N[(m * N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], -2e+86], (-m), N[(m * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $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} \]

   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 48.4%

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

Alternative 6: 49.1% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := If[LessEqual[N[(m * N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], -2e-305], (-m), N[(m * N[(m / v), $MachinePrecision]), $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. distribute-lft-out-- N/A

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

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

      4. associate-/r* N/A

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

      5. associate-*r/ N/A

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

      6. rgt-mult-inverse N/A

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

      7. unpow2 N/A

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

      8. associate-*r* N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

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

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

      12. div-sub N/A

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

      13. associate-/l* N/A

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

      14. lower-/.f64 N/A

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

      15. distribute-rgt-out-- N/A

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

      16. *-lft-identity N/A

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

      17. unpow2 N/A

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

      18. lower--.f64 N/A

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

      19. unpow2 N/A

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

      20. lower-*.f64 97.3

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

   5. Applied rewrites 97.3%

      \[\leadsto \color{blue}{\frac{m - m \cdot m}{v}} \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}\;m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} + -1\right) \leq -2 \cdot 10^{-305}:\\ \;\;\;\;-m\\ \mathbf{else}:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 44.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

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

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

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

      2. associate-/l* N/A

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

      3. unpow2 N/A

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

      4. *-rgt-identity N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 72.7

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

   5. Applied rewrites 72.7%

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

   6. Taylor expanded in m around inf

      \[\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}\;m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} + -1\right) \leq -2 \cdot 10^{-305}:\\ \;\;\;\;-m\\ \mathbf{else}:\\ \;\;\;\;\frac{m \cdot m}{v}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 99.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 7.0000000000000003e-40

   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 7.0000000000000003e-40 < 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 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.2

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

   5. Applied rewrites 5.2%

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

   6. Taylor expanded in m around inf

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

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

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

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

      5. associate-*r/ N/A

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

      6. *-rgt-identity N/A

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

      7. unsub-neg N/A

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

      8. mul-1-neg N/A

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

      9. distribute-rgt-in N/A

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

      10. *-commutative N/A

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

      11. distribute-rgt-in N/A

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

      12. distribute-lft-in N/A

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

      13. associate-/r* N/A

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

      14. associate-*l/ N/A

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

      15. lft-mult-inverse N/A

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

   8. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 9: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

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

Alternative 10: 99.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift--.f64 N/A

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

   2. sub-neg N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 N/A

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

   9. metadata-eval 99.8

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

4. Applied rewrites 99.8%

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

5. Final simplification 99.8%

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

Alternative 11: 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))