b parameter of renormalized beta distribution

Percentage Accurate: 99.9% → 99.9%

Time: 4.5s

Alternatives: 15

Speedup: 1.1×

• 41.6% 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 \left(1 - m\right) \end{array} \]

FPCore

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

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (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) * (1.0d0 - m)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (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) * (1.0d0 - m)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. +-commutative N/A

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

   2. associate-*r/ N/A

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

   3. div-add-rev N/A

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

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

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

   5. metadata-eval N/A

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

   6. *-lft-identity N/A

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

   7. associate-/l* N/A

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

   8. metadata-eval N/A

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

   9. metadata-eval N/A

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

   10. *-inverses N/A

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

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

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

   12. *-commutative N/A

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

   13. associate-/l* N/A

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

   14. *-inverses N/A

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

   15. metadata-eval N/A

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

   16. lower-fma.f64 N/A

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

   17. lower--.f64 N/A

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

   18. lower-/.f64 99.9

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

5. Applied rewrites 99.9%

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

Alternative 2: 98.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 2.70000000000000016e-67

   1. Initial program 100.0%

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

   3. Taylor expanded in m around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt1-in N/A

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

      4. lower--.f64 N/A

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

      5. associate-*l/ N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. lower-/.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if 2.70000000000000016e-67 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in v around inf

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

      1. mul-1-neg N/A

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

      2. *-lft-identity N/A

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

      3. metadata-eval N/A

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

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

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

      5. distribute-neg-in N/A

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

      6. metadata-eval N/A

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

      7. mul-1-neg N/A

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

      8. remove-double-neg N/A

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

      9. lower-+.f64 4.9

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

   5. Applied rewrites 4.9%

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

   6. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

   8. Applied rewrites 99.9%

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

   9. Taylor expanded in m around inf

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

   11. Applied rewrites 99.8%

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

Alternative 3: 98.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.619999999999999996

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt1-in N/A

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

      4. lower--.f64 N/A

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

   5. Applied rewrites 97.6%

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

   if 0.619999999999999996 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

Alternative 4: 98.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.619999999999999996

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt1-in N/A

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

      4. lower--.f64 N/A

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

   5. Applied rewrites 97.6%

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

   if 0.619999999999999996 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

   7. Applied rewrites 97.9%

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

4. Final simplification 97.8%

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

Alternative 5: 98.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.619999999999999996

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt1-in N/A

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

      4. lower--.f64 N/A

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

   5. Applied rewrites 97.6%

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

   if 0.619999999999999996 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in v around inf

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

      1. mul-1-neg N/A

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

      2. *-lft-identity N/A

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

      3. metadata-eval N/A

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

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

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

      5. distribute-neg-in N/A

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

      6. metadata-eval N/A

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

      7. mul-1-neg N/A

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

      8. remove-double-neg N/A

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

      9. lower-+.f64 5.8

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

   5. Applied rewrites 5.8%

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

   6. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

   8. Applied rewrites 99.9%

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

   9. Taylor expanded in m around inf

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

   11. Applied rewrites 97.9%

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

Alternative 6: 98.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.419999999999999984

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt1-in N/A

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

      4. lower--.f64 N/A

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

   5. Applied rewrites 97.6%

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

   if 0.419999999999999984 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

   7. Applied rewrites 97.9%

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

   8. Taylor expanded in m around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 97.8

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

   10. Applied rewrites 97.8%

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

4. Final simplification 97.7%

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

Alternative 7: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. div-add-rev N/A

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. associate-/l* N/A

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

      8. metadata-eval N/A

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

      9. metadata-eval N/A

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

      10. *-inverses N/A

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

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

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

      12. *-commutative N/A

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

      13. associate-/l* N/A

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

      14. *-inverses N/A

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

      15. metadata-eval N/A

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

      16. lower-fma.f64 N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in m around 0

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

   8. Applied rewrites 95.6%

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

   if 1 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

   7. Applied rewrites 97.9%

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

   8. Taylor expanded in m around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 97.8

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

   10. Applied rewrites 97.8%

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

4. Final simplification 96.8%

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

Alternative 8: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   3. Taylor expanded in m around 0

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

      1. lower-/.f64 95.6

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

   5. Applied rewrites 95.6%

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

   if 1 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in m around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 97.9

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

   5. Applied rewrites 97.9%

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

   7. Applied rewrites 97.9%

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

   8. Taylor expanded in m around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 97.8

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

   10. Applied rewrites 97.8%

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

4. Final simplification 96.8%

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

Alternative 9: 88.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 2.35000000000000009

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. lower-/.f64 95.6

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

   5. Applied rewrites 95.6%

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

   6. Taylor expanded in m around 0

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

   8. Applied rewrites 95.4%

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

   if 2.35000000000000009 < m

   1. Initial program 99.9%

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

   3. Taylor expanded in v around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in m around 0

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

   8. Applied rewrites 0.1%

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

   10. Applied rewrites 76.6%

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

Alternative 10: 99.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in v around inf

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

   1. mul-1-neg N/A

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

   2. *-lft-identity N/A

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

   3. metadata-eval N/A

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

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

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

   5. distribute-neg-in N/A

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

   6. metadata-eval N/A

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

   7. mul-1-neg N/A

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

   8. remove-double-neg N/A

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

   9. lower-+.f64 23.6

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

5. Applied rewrites 23.6%

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

6. Taylor expanded in v around 0

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

   1. lower-/.f64 N/A

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

8. Applied rewrites 99.9%

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

Alternative 11: 82.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Java

public static double code(double m, double v) {
	double tmp;
	if (m <= 1.35e+154) {
		tmp = ((m / v) + m) - 1.0;
	} else {
		tmp = -1.0 + Math.sqrt((m * m));
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 1.35e+154:
		tmp = ((m / v) + m) - 1.0
	else:
		tmp = -1.0 + math.sqrt((m * m))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1.35000000000000003e154

   1. Initial program 99.9%

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

   3. Taylor expanded in m around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt1-in N/A

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

      4. lower--.f64 N/A

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

      5. associate-*l/ N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. lower-/.f64 72.4

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

   5. Applied rewrites 72.4%

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

   if 1.35000000000000003e154 < m

   1. Initial program 100.0%

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

   3. Taylor expanded in v around inf

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

      1. mul-1-neg N/A

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

      2. *-lft-identity N/A

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

      3. metadata-eval N/A

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

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

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

      5. distribute-neg-in N/A

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

      6. metadata-eval N/A

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

      7. mul-1-neg N/A

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

      8. remove-double-neg N/A

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

      9. lower-+.f64 6.9

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

   5. Applied rewrites 6.9%

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

   7. Applied rewrites 100.0%

      \[\leadsto -1 + \sqrt{m \cdot m} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 88.2% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

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 / v) - 1.0d0) * (m + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in m around 0

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

   1. lower-/.f64 44.5

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

5. Applied rewrites 44.5%

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

   1. lift--.f64 N/A

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

   2. unpow1 N/A

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

   3. *-lft-identity N/A

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

   4. *-commutative N/A

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

   5. metadata-eval N/A

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

   6. associate-*l* N/A

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

   7. *-commutative N/A

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

   8. unpow-prod-down N/A

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

   9. metadata-eval N/A

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

   10. sqrt-pow1 N/A

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

   11. pow2 N/A

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

   12. mul-1-neg N/A

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

   13. mul-1-neg N/A

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

   14. sqr-neg-rev N/A

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

   15. pow2 N/A

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

   16. sqrt-pow1 N/A

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

   17. metadata-eval N/A

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

   18. unpow1 N/A

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

   19. metadata-eval N/A

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

   20. *-lft-identity N/A

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

   21. *-commutative N/A

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

   22. metadata-eval N/A

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

   23. associate-*l* N/A

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

   24. *-commutative N/A

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

   25. mul-1-neg N/A

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

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

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

   27. *-commutative N/A

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

7. Applied rewrites 85.3%

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

Alternative 13: 76.3% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

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 / v) + m) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in m around 0

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

   1. *-commutative N/A

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

   2. +-commutative N/A

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

   3. distribute-rgt1-in N/A

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

   4. lower--.f64 N/A

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

   5. associate-*l/ N/A

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

   6. *-lft-identity N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 N/A

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

   9. lower-/.f64 72.8

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

5. Applied rewrites 72.8%

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

Alternative 14: 27.5% accurate, 7.8× speedup

Math

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

FPCore

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

C

double code(double m, double v) {
	return -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 = (-1.0d0) + m
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in v around inf

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

   1. mul-1-neg N/A

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

   2. *-lft-identity N/A

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

   3. metadata-eval N/A

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

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

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

   5. distribute-neg-in N/A

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

   6. metadata-eval N/A

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

   7. mul-1-neg N/A

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

   8. remove-double-neg N/A

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

   9. lower-+.f64 23.6

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

5. Applied rewrites 23.6%

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

Alternative 15: 25.1% accurate, 31.0× speedup

Math

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

FPCore

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

C

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

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 = -1.0d0
end function

Java

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

Python

def code(m, v):
	return -1.0

Julia

function code(m, v)
	return -1.0
end

MATLAB

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

Wolfram

code[m_, v_] := -1.0

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in m around 0

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

5. Applied rewrites 20.9%

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

Reproduce

herbie shell --seed 2024351 
(FPCore (m v)
  :name "b 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) (- 1.0 m)))