a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.8%

Time: 6.9s

Alternatives: 11

Speedup: 1.0×

• 42.3% 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, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\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. *-commutative N/A

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

   3. lift--.f64 N/A

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

   4. sub-neg N/A

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

   5. distribute-lft-in N/A

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

   6. lift-/.f64 N/A

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

   7. clear-num N/A

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

   8. associate-/r/ N/A

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

   9. associate-*r* N/A

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

   10. div-inv N/A

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

   11. distribute-rgt-neg-in N/A

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

   12. *-rgt-identity N/A

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

   13. lower-fma.f64 N/A

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

   14. lower-/.f64 N/A

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

   15. lift-*.f64 N/A

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

   16. *-commutative N/A

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

   17. lower-*.f64 N/A

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

   18. lower-neg.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 2: 73.3% 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 -1 \cdot 10^{+21}:\\ \;\;\;\;\frac{\left(-m\right) \cdot m}{m}\\ \mathbf{elif}\;t\_0 \leq -2 \cdot 10^{-306}:\\ \;\;\;\;-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 -1e+21)
     (/ (* (- m) m) m)
     (if (<= t_0 -2e-306) (- 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 <= -1e+21) {
		tmp = (-m * m) / m;
	} else if (t_0 <= -2e-306) {
		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 <= (-1d+21)) then
        tmp = (-m * m) / m
    else if (t_0 <= (-2d-306)) 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 <= -1e+21) {
		tmp = (-m * m) / m;
	} else if (t_0 <= -2e-306) {
		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 <= -1e+21:
		tmp = (-m * m) / m
	elif t_0 <= -2e-306:
		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 <= -1e+21)
		tmp = Float64(Float64(Float64(-m) * m) / m);
	elseif (t_0 <= -2e-306)
		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 <= -1e+21)
		tmp = (-m * m) / m;
	elseif (t_0 <= -2e-306)
		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, -1e+21], N[(N[((-m) * m), $MachinePrecision] / m), $MachinePrecision], If[LessEqual[t$95$0, -2e-306], (-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) < -1e21

   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 v around inf

      \[\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.8

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

   5. Applied rewrites 5.8%

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

   7. Applied rewrites 57.8%

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

   if -1e21 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -2.00000000000000006e-306

   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 v around inf

      \[\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 -2.00000000000000006e-306 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m)

   1. Initial program 99.5%

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

   3. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 98.0

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

   5. Applied rewrites 98.0%

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

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

4. Final simplification 75.3%

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

Alternative 3: 97.8% 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 -1 \cdot 10^{+21}:\\ \;\;\;\;\left(\left(-m\right) \cdot m\right) \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{m}{v}, m, -m\right)\\ \end{array} \end{array} \]

FPCore

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

C

double code(double m, double v) {
	double tmp;
	if ((((((1.0 - m) * m) / v) - 1.0) * m) <= -1e+21) {
		tmp = (-m * m) * (m / v);
	} else {
		tmp = fma((m / v), m, -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) <= -1e+21)
		tmp = Float64(Float64(Float64(-m) * m) * Float64(m / v));
	else
		tmp = fma(Float64(m / v), m, Float64(-m));
	end
	return 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], -1e+21], N[(N[((-m) * m), $MachinePrecision] * N[(m / v), $MachinePrecision]), $MachinePrecision], N[(N[(m / v), $MachinePrecision] * m + (-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) < -1e21

   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. metadata-eval N/A

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

      4. cube-prod N/A

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

      5. lower-pow.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.4

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

   5. Applied rewrites 97.4%

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

   7. Applied rewrites 97.4%

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

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

   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

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

4. Final simplification 97.6%

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

Alternative 4: 49.2% 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^{-306}:\\ \;\;\;\;-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-306) (- m) (* (/ m v) m)))

C

double code(double m, double v) {
	double tmp;
	if ((((((1.0 - m) * m) / v) - 1.0) * m) <= -2e-306) {
		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-306)) 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-306) {
		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-306:
		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-306)
		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-306)
		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-306], (-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) < -2.00000000000000006e-306

   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 v around inf

      \[\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 32.8

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

   5. Applied rewrites 32.8%

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

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

   1. Initial program 99.5%

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

   3. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 98.0

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

   5. Applied rewrites 98.0%

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

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

4. Final simplification 47.7%

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

Alternative 5: 99.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 5e-31) (fma (/ m v) m (- m)) (* (* (- 1.0 m) m) (/ m v))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 5e-31

   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 \color{blue}{m \cdot \left(\frac{m}{v} - 1\right)} \]
   4. Step-by-step derivation

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 99.8

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

   5. Applied rewrites 99.8%

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

   if 5e-31 < m

   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. *-commutative N/A

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

      3. lift--.f64 N/A

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

      4. sub-neg N/A

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

      5. distribute-rgt-in N/A

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

      6. metadata-eval N/A

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

      7. neg-mul-1 N/A

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-/l* N/A

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

      11. *-commutative N/A

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

      12. associate-*l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower-*.f64 N/A

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

      16. lower-neg.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in v around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

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

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

      4. *-commutative N/A

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

      5. rgt-mult-inverse N/A

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

      6. associate-*r/ N/A

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

      7. associate-/r* N/A

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

      8. associate-*l* N/A

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

      9. unpow2 N/A

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

      10. unpow3 N/A

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

      11. *-commutative N/A

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

      12. *-lft-identity N/A

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

      13. associate-*l/ N/A

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

      14. associate-*r* N/A

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

      15. unpow2 N/A

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

      16. cube-mult N/A

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

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

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

      18. 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) \]

      19. unpow2 N/A

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

      20. associate-*l* N/A

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

   7. Applied rewrites 99.8%

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

   9. Applied rewrites 99.9%

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

Alternative 6: 97.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

   if 1 < 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}{\left(-1 \cdot \frac{{m}^{2}}{v}\right)} \cdot m \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. associate-*r* N/A

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

      4. associate-*r/ N/A

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

      5. associate-*l/ N/A

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

      6. associate-*r/ N/A

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

      7. lower-*.f64 N/A

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

      8. associate-*r/ N/A

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

      9. lower-/.f64 N/A

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

      10. mul-1-neg N/A

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

      11. lower-neg.f64 97.4

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

   5. Applied rewrites 97.4%

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

Alternative 7: 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.8%

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

3. Final simplification 99.8%

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

Alternative 8: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(1 - m\right) \cdot \frac{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(1.0 - m) * Float64(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[(1.0 - m), $MachinePrecision] * N[(m / v), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] * m), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. associate-/l* N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 N/A

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

   7. lower-/.f64 99.8

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

4. Applied rewrites 99.8%

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

5. Final simplification 99.8%

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

Alternative 9: 75.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

   if 1 < 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 v around inf

      \[\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.8

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

   5. Applied rewrites 5.8%

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

   7. Applied rewrites 57.8%

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

Alternative 10: 99.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\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. Add Preprocessing

Alternative 11: 27.0% 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.8%

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

3. Taylor expanded in v around inf

   \[\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 25.4

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

5. Applied rewrites 25.4%

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

Reproduce

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