b parameter of renormalized beta distribution

Percentage Accurate: 99.9% → 99.9%

Time: 7.0s

Alternatives: 16

Speedup: 1.0×

• 41.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

\[\left(0 < m \land 0 < v\right) \land v < 0.25\]

Math

\[\begin{array}{l} \\ \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \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

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

real(8) function code(m, v)
    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.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

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

   3. sub-neg N/A

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

   4. +-commutative N/A

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

   5. distribute-rgt-in N/A

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

   6. *-lft-identity N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-neg.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 99.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   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. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. lower-+.f64 N/A

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

      8. 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} \]

   6. Taylor expanded in v around 0

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

   8. Applied rewrites 100.0%

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

   if 2e15 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) 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)}^{2}}{v}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-/.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 3: 74.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := If[LessEqual[N[(N[(N[(N[(N[(1.0 - m), $MachinePrecision] * m), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * N[(1.0 - m), $MachinePrecision]), $MachinePrecision], -0.5], -1.0, 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)) (-.f64 #s(literal 1 binary64) m)) < -0.5

   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}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 97.2%

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

   if -0.5 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) 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 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 63.6

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

   5. Applied rewrites 63.6%

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

   6. Taylor expanded in m around inf

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

   8. Applied rewrites 63.0%

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

4. Final simplification 72.3%

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

Alternative 4: 74.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := If[LessEqual[N[(N[(N[(N[(N[(1.0 - m), $MachinePrecision] * m), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * N[(1.0 - m), $MachinePrecision]), $MachinePrecision], -0.5], -1.0, N[(m / 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)) (-.f64 #s(literal 1 binary64) m)) < -0.5

   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}{-1} \]
   4. Step-by-step derivation

   5. Applied rewrites 97.2%

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

   if -0.5 < (*.f64 (-.f64 (/.f64 (*.f64 m (-.f64 #s(literal 1 binary64) m)) v) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) 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 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 63.6

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

   5. Applied rewrites 63.6%

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

   6. Taylor expanded in v around 0

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

   8. Applied rewrites 63.0%

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

4. Final simplification 72.3%

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

Alternative 5: 98.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 1

   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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. 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} \]
   6. Step-by-step derivation

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. metadata-eval N/A

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

      6. associate-+l+ N/A

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

      7. *-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r/ N/A

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

      12. *-rgt-identity N/A

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

      13. distribute-lft1-in N/A

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

      14. metadata-eval N/A

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

      15. *-rgt-identity N/A

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

      16. rgt-mult-inverse N/A

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

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

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

      18. distribute-lft-in N/A

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

      19. sub-neg N/A

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

   7. Applied rewrites 99.0%

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

   8. Taylor expanded in m around 0

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

   10. Applied rewrites 99.0%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-2, m, 1\right), \frac{m}{v}, -1\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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in m around inf

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

      1. cube-mult N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 99.2

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

   7. Applied rewrites 99.2%

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

   9. Applied rewrites 99.2%

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

   10. Taylor expanded in m around inf

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

       1. sub-neg N/A

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

       2. associate-*r/ N/A

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

       3. metadata-eval N/A

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

       4. distribute-lft-in N/A

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

       5. associate-*r/ N/A

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

       6. *-rgt-identity N/A

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

       7. cube-mult N/A

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

       8. unpow2 N/A

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

       9. associate-/l* N/A

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

       10. distribute-neg-frac N/A

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

       11. metadata-eval N/A

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

       12. associate-*r/ N/A

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

       13. times-frac N/A

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

   12. Applied rewrites 99.8%

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

4. Final simplification 99.4%

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

Alternative 6: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := N[(N[(N[(N[(N[(1.0 - m), $MachinePrecision] * m), $MachinePrecision] / 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. Final simplification 99.9%

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

Alternative 7: 98.3% accurate, 1.0× 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}, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(m \cdot m\right) \cdot m}{v}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 0.419999999999999984

   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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. 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} \]
   6. Step-by-step derivation

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. metadata-eval N/A

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

      6. associate-+l+ N/A

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

      7. *-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r/ N/A

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

      12. *-rgt-identity N/A

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

      13. distribute-lft1-in N/A

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

      14. metadata-eval N/A

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

      15. *-rgt-identity N/A

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

      16. rgt-mult-inverse N/A

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

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

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

      18. distribute-lft-in N/A

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

      19. sub-neg N/A

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

   7. Applied rewrites 99.0%

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

   8. Taylor expanded in m around 0

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

   10. Applied rewrites 99.0%

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

   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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in m around inf

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

      1. cube-mult N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 99.2

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

   7. Applied rewrites 99.2%

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

   9. Applied rewrites 99.2%

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

Alternative 8: 97.8% accurate, 1.1× 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}:\\ \;\;\;\;\frac{\left(m \cdot m\right) \cdot m}{v}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (m <= 1.0d0) then
        tmp = ((m / v) - 1.0d0) * (1.0d0 - m)
    else
        tmp = ((m * m) * m) / v
    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 * m) * m) / v;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 1.0:
		tmp = ((m / v) - 1.0) * (1.0 - m)
	else:
		tmp = ((m * m) * m) / v
	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(m * m) * m) / v);
	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 * m) * m) / v;
	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 * m), $MachinePrecision] * m), $MachinePrecision] / v), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 1

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

      1. lower-/.f64 97.8

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

   5. Applied rewrites 97.8%

      \[\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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in m around inf

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

      1. cube-mult N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 99.2

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

   7. Applied rewrites 99.2%

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

   9. Applied rewrites 99.2%

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

Alternative 9: 99.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[m_, v_] := N[(N[(N[(m - N[(m * m + v), $MachinePrecision]), $MachinePrecision] / v), $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. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

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

   3. sub-neg N/A

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

   4. +-commutative N/A

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

   5. distribute-rgt-in N/A

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

   6. *-lft-identity N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-neg.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Taylor expanded in m around inf

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

   1. cube-mult N/A

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

   2. unpow2 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. unpow2 N/A

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

   7. associate-*l/ N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 54.9

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

7. Applied rewrites 54.9%

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

9. Applied rewrites 54.9%

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

10. Taylor expanded in v around 0

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

    1. associate-*r* N/A

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

    2. distribute-rgt-out N/A

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

    3. associate-/l* N/A

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

    4. lower-*.f64 N/A

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

    5. lower--.f64 N/A

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

    6. lower-/.f64 N/A

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

    7. +-commutative N/A

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

    8. mul-1-neg N/A

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

    9. unsub-neg N/A

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

    10. associate-+l- N/A

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

    11. lower--.f64 N/A

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

    12. cancel-sign-sub-inv N/A

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

    13. metadata-eval N/A

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

    14. *-lft-identity N/A

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

    15. unpow2 N/A

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

    16. lower-fma.f64 99.9

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

12. Applied rewrites 99.9%

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

13. Final simplification 99.9%

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

Alternative 10: 97.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 2.60000000000000009

   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. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 97.7

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

   5. Applied rewrites 97.7%

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

   6. Taylor expanded in v around 0

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

   8. Applied rewrites 97.7%

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

   if 2.60000000000000009 < 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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in m around inf

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

      1. cube-mult N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 99.2

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

   7. Applied rewrites 99.2%

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

   9. Applied rewrites 99.2%

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

Alternative 11: 97.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if m < 2.60000000000000009

   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. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 97.7

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

   5. Applied rewrites 97.7%

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

   6. Taylor expanded in v around 0

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

   8. Applied rewrites 97.7%

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

   if 2.60000000000000009 < 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}{\frac{{m}^{3}}{v}} \]
   4. Step-by-step derivation

      1. unpow3 N/A

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

      2. unpow2 N/A

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

      3. associate-*l/ N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. associate-*l/ N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 99.2

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

   5. Applied rewrites 99.2%

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

Alternative 12: 81.7% accurate, 1.1× 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}:\\ \;\;\;\;\frac{\mathsf{fma}\left(m, m, -1\right)}{m - -1}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double m, double v) {
	double tmp;
	if (m <= 1.35e+154) {
		tmp = ((m / v) + m) - 1.0;
	} else {
		tmp = fma(m, m, -1.0) / (m - -1.0);
	}
	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(fma(m, m, -1.0) / Float64(m - -1.0));
	end
	return tmp
end

Wolfram

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

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 72.3

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

   5. Applied rewrites 72.3%

      \[\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. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. *-lft-identity N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in v around inf

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

      1. mul-1-neg N/A

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

      2. neg-sub0 N/A

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

      3. associate--r- N/A

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

      4. metadata-eval N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 7.1

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

   7. Applied rewrites 7.1%

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

   9. Applied rewrites 100.0%

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

Alternative 13: 76.0% 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

real(8) function code(m, v)
    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. lower--.f64 N/A

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

   2. +-commutative N/A

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

   3. distribute-rgt-in N/A

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

   4. associate-*l/ N/A

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

   5. *-lft-identity N/A

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

   6. *-lft-identity N/A

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

   7. lower-+.f64 N/A

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

   8. lower-/.f64 73.5

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

5. Applied rewrites 73.5%

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

Alternative 14: 76.0% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := N[(N[(m / v), $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. lower--.f64 N/A

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

   2. +-commutative N/A

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

   3. distribute-rgt-in N/A

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

   4. associate-*l/ N/A

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

   5. *-lft-identity N/A

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

   6. *-lft-identity N/A

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

   7. lower-+.f64 N/A

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

   8. lower-/.f64 73.5

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

5. Applied rewrites 73.5%

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

6. Taylor expanded in v around 0

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

8. Applied rewrites 73.5%

   \[\leadsto \frac{m}{v} - 1 \]
9. Add Preprocessing

Alternative 15: 26.7% accurate, 7.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[m_, v_] := N[(m - 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 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. neg-sub0 N/A

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

   3. associate--r- N/A

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

   4. metadata-eval N/A

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

   5. +-commutative N/A

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

   6. metadata-eval N/A

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

   7. sub-neg N/A

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

   8. lower--.f64 29.8

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

5. Applied rewrites 29.8%

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

Alternative 16: 24.2% 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

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

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

Reproduce

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