a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.8%

Time: 5.3s

Alternatives: 11

Speedup: 1.0×

• 41.8% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    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} \\ \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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    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]

Derivation

1. Initial program 99.8%

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

Alternative 2: 85.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (m v)
 :precision binary64
 (let* ((t_0 (* (- (/ (* m (- 1.0 m)) v) 1.0) m)))
   (if (<= t_0 -1e+17)
     (/ (* (- m) m) v)
     (if (<= t_0 -4e-307) (- m) (* (/ m v) m)))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (((m * (1.0d0 - m)) / v) - 1.0d0) * m
    if (t_0 <= (-1d+17)) then
        tmp = (-m * m) / v
    else if (t_0 <= (-4d-307)) 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 = (((m * (1.0 - m)) / v) - 1.0) * m;
	double tmp;
	if (t_0 <= -1e+17) {
		tmp = (-m * m) / v;
	} else if (t_0 <= -4e-307) {
		tmp = -m;
	} else {
		tmp = (m / v) * m;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := Block[{t$95$0 = N[(N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * m), $MachinePrecision]}, If[LessEqual[t$95$0, -1e+17], N[(N[((-m) * m), $MachinePrecision] / v), $MachinePrecision], If[LessEqual[t$95$0, -4e-307], (-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) < -1e17

   1. Initial program 99.9%

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

   4. Applied rewrites 0.1%

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

   5. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. unpow2 N/A

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

      6. lower-fma.f64 0.1

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

   7. Applied rewrites 0.1%

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

   8. Taylor expanded in m around 0

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

   10. Applied rewrites 0.1%

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

   12. Applied rewrites 78.4%

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

   if -1e17 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) m) < -3.99999999999999964e-307

   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 93.8

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

   5. Applied rewrites 93.8%

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

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

   1. Initial program 99.4%

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

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

   5. Applied rewrites 95.8%

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

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

4. Final simplification 86.3%

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

Alternative 3: 87.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	double tmp;
	if (((((m * (1.0 - m)) / v) - 1.0) * m) <= -1e+17) {
		tmp = (-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(m * Float64(1.0 - m)) / v) - 1.0) * m) <= -1e+17)
		tmp = Float64(Float64(Float64(-m) * 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[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * m), $MachinePrecision], -1e+17], N[(N[((-m) * m), $MachinePrecision] / v), $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) < -1e17

   1. Initial program 99.9%

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

   4. Applied rewrites 0.1%

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

   5. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. unpow2 N/A

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

      6. lower-fma.f64 0.1

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

   7. Applied rewrites 0.1%

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

   8. Taylor expanded in m around 0

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

   10. Applied rewrites 0.1%

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

   12. Applied rewrites 78.4%

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

   if -1e17 < (*.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 v around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   6. Taylor expanded in m around 0

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

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

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

      2. associate-*r/ 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{\color{blue}{{m}^{2} \cdot 1}}{v} - m \cdot 1 \]

      5. associate-*r/ N/A

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

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. *-rgt-identity N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. associate-*l/ N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. mul-1-neg N/A

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

      16. lower-neg.f64 97.8

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

   8. Applied rewrites 97.8%

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

4. Final simplification 88.9%

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

Alternative 4: 49.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (((((m * (1.0d0 - m)) / v) - 1.0d0) * m) <= (-4d-307)) 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 (((((m * (1.0 - m)) / v) - 1.0) * m) <= -4e-307) {
		tmp = -m;
	} else {
		tmp = (m / v) * m;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

   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 38.8

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

   5. Applied rewrites 38.8%

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

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

   1. Initial program 99.4%

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

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

   5. Applied rewrites 95.8%

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

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

Alternative 5: 43.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (((((m * (1.0d0 - m)) / v) - 1.0d0) * m) <= (-4d-307)) 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 * (1.0 - m)) / v) - 1.0) * m) <= -4e-307) {
		tmp = -m;
	} else {
		tmp = (m * m) / v;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

   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 38.8

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

   5. Applied rewrites 38.8%

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

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

   1. Initial program 99.4%

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

   4. Applied rewrites 70.8%

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

   5. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. unpow2 N/A

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

      6. lower-fma.f64 74.2

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

   7. Applied rewrites 74.2%

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

   8. Taylor expanded in m around 0

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

   10. Applied rewrites 74.3%

       \[\leadsto \frac{m \cdot m}{v} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 99.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 5.99999999999999991e-24

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

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 35.9

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

   5. Applied rewrites 35.9%

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

   6. Taylor expanded in m around 0

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

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

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

      2. associate-*r/ 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{\color{blue}{{m}^{2} \cdot 1}}{v} - m \cdot 1 \]

      5. associate-*r/ N/A

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

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. *-rgt-identity N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. associate-*l/ N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. mul-1-neg N/A

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

      16. lower-neg.f64 99.8

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

   8. Applied rewrites 99.8%

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

   if 5.99999999999999991e-24 < 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 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 99.5

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

   5. Applied rewrites 99.5%

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

Alternative 7: 97.9% 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}:\\ \;\;\;\;\frac{\left(m \cdot m\right) \cdot m}{-v}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double m, double v) {
	double tmp;
	if (m <= 1.0) {
		tmp = fma((m / v), m, -m);
	} else {
		tmp = ((m * m) * m) / -v;
	}
	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) / Float64(-v));
	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 * m), $MachinePrecision] * m), $MachinePrecision] / (-v)), $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 v around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   6. Taylor expanded in m around 0

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

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

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

      2. associate-*r/ 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{\color{blue}{{m}^{2} \cdot 1}}{v} - m \cdot 1 \]

      5. associate-*r/ N/A

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

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. *-rgt-identity N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. associate-*l/ N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. mul-1-neg N/A

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

      16. lower-neg.f64 97.8

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

   8. Applied rewrites 97.8%

      \[\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}{-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.9

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

   5. Applied rewrites 97.9%

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

   7. Applied rewrites 97.9%

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

4. Final simplification 97.8%

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

Alternative 8: 97.9% 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(\left(-m\right) \cdot m\right) \cdot \frac{m}{v}\\ \end{array} \end{array} \]

FPCore

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

C

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.7%

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

   3. Taylor expanded in v around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   6. Taylor expanded in m around 0

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

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

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

      2. associate-*r/ 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{\color{blue}{{m}^{2} \cdot 1}}{v} - m \cdot 1 \]

      5. associate-*r/ N/A

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

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. *-rgt-identity N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. associate-*l/ N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. mul-1-neg N/A

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

      16. lower-neg.f64 97.8

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

   8. Applied rewrites 97.8%

      \[\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}{-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.9

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

   5. Applied rewrites 97.9%

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

   7. Applied rewrites 97.9%

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

4. Final simplification 97.8%

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

Alternative 9: 87.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 1.0) (fma (/ m v) m (- m)) (fma (/ (- 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 = fma((-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 = fma(Float64(Float64(-m) / v), m, Float64(-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) / v), $MachinePrecision] * m + (-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 v around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   6. Taylor expanded in m around 0

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

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

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

      2. associate-*r/ 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{\color{blue}{{m}^{2} \cdot 1}}{v} - m \cdot 1 \]

      5. associate-*r/ N/A

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

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. *-rgt-identity N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. associate-*l/ N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. mul-1-neg N/A

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

      16. lower-neg.f64 97.8

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

   8. Applied rewrites 97.8%

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

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 99.8

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

   5. Applied rewrites 99.8%

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

   6. Taylor expanded in m around 0

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

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

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

      2. associate-*r/ 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{\color{blue}{{m}^{2} \cdot 1}}{v} - m \cdot 1 \]

      5. associate-*r/ N/A

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

      6. fp-cancel-sub-sign N/A

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

      7. mul-1-neg N/A

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

      8. *-rgt-identity N/A

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

      9. associate-*r/ N/A

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

      10. *-rgt-identity N/A

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

      11. unpow2 N/A

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

      12. associate-*l/ N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. mul-1-neg N/A

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

      16. lower-neg.f64 0.1

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

   8. Applied rewrites 0.1%

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

   10. Applied rewrites 78.4%

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

4. Final simplification 88.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq 1:\\ \;\;\;\;\mathsf{fma}\left(\frac{m}{v}, m, -m\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-m}{v}, m, -m\right)\\ \end{array} \]
5. 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. Taylor expanded in m around 0

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

   1. *-commutative N/A

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

   2. associate-*r/ N/A

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

   3. div-add-rev N/A

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

   4. +-commutative N/A

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

   5. fp-cancel-sign-sub-inv N/A

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

   6. metadata-eval N/A

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

   7. *-lft-identity N/A

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

   8. *-commutative N/A

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

   9. associate-/l* N/A

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

   10. *-inverses N/A

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

   11. *-rgt-identity N/A

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

   12. metadata-eval N/A

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

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

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

   14. distribute-lft-neg-out N/A

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

   15. div-sub N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. *-commutative N/A

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

   18. +-commutative N/A

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

   19. +-commutative N/A

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

   20. div-add N/A

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

5. Applied rewrites 99.4%

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

Alternative 11: 27.5% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(m, v)
use fmin_fmax_functions
    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 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 29.2

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

5. Applied rewrites 29.2%

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

Reproduce

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