HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%

Time: 20.8s

Alternatives: 14

Speedup: 1.0×

Specification

\[\left(10^{-5} \leq u \land u \leq 1\right) \land \left(0 \leq v \land v \leq 109.746574\right)\]

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end

Initial Program: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end

Alternative 1: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end

Derivation

1. Initial program 99.6%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 97.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + e^{\frac{2}{-v} - u}\right) \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (exp (- (/ 2.0 (- v)) u)))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + expf(((2.0f / -v) - u)))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + exp(((2.0e0 / -v) - u)))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + exp(Float32(Float32(Float32(2.0) / Float32(-v)) - u))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + exp(((single(2.0) / -v) - u)))));
end

Derivation

1. Initial program 99.6%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Step-by-step derivation

   1. +-commutative 99.6%

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

   2. fma-define 99.6%

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

   3. +-commutative 99.6%

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

   4. fma-define 99.5%

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

3. Simplified 99.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. fma-undefine 99.6%

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

6. Applied egg-rr 99.6%

   \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
7. Step-by-step derivation

   1. add-exp-log 99.6%

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

   2. *-commutative 99.6%

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

   3. log-prod 99.6%

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

   4. add-log-exp 99.6%

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

   5. sub-neg 99.6%

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

   6. log1p-define 99.6%

      \[\leadsto \mathsf{fma}\left(v, \log \left(e^{\frac{-2}{v} + \color{blue}{\mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

8. Applied egg-rr 99.6%

   \[\leadsto \mathsf{fma}\left(v, \log \left(\color{blue}{e^{\frac{-2}{v} + \mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

9. Taylor expanded in v around 0 99.6%

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

    1. associate-*r/ 99.6%

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

    2. metadata-eval 99.6%

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

11. Simplified 99.6%

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

12. Taylor expanded in u around 0 98.1%

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

    1. neg-mul-1 98.1%

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

14. Simplified 98.1%

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

15. Final simplification 98.1%

    \[\leadsto 1 + v \cdot \log \left(u + e^{\frac{2}{-v} - u}\right) \]
16. Add Preprocessing

Alternative 3: 95.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + e^{\frac{-2}{v}}\right) \end{array} \]

FPCore

(FPCore (u v) :precision binary32 (+ 1.0 (* v (log (+ u (exp (/ -2.0 v)))))))

C

float code(float u, float v) {
	return 1.0f + (v * logf((u + expf((-2.0f / v)))));
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + exp(((-2.0e0) / v)))))
end function

Julia

function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + exp(Float32(Float32(-2.0) / v))))))
end

MATLAB

function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + exp((single(-2.0) / v)))));
end

Derivation

1. Initial program 99.6%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Step-by-step derivation

   1. +-commutative 99.6%

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

   2. fma-define 99.6%

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

   3. +-commutative 99.6%

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

   4. fma-define 99.5%

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

3. Simplified 99.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. fma-undefine 99.6%

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

6. Applied egg-rr 99.6%

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

7. Taylor expanded in u around 0 96.1%

   \[\leadsto \mathsf{fma}\left(v, \log \left(\color{blue}{e^{\frac{-2}{v}}} + u\right), 1\right) \]
8. Step-by-step derivation

   1. fma-undefine 96.1%

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

   2. +-commutative 96.1%

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

9. Applied egg-rr 96.1%

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

10. Final simplification 96.1%

    \[\leadsto 1 + v \cdot \log \left(u + e^{\frac{-2}{v}}\right) \]
11. Add Preprocessing

Alternative 4: 97.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 1.0)
   (fma v (log u) 1.0)
   (+ (* u (* v (+ (exp (/ 2.0 v)) -1.0))) -1.0)))

C

float code(float u, float v) {
	float tmp;
	if (v <= 1.0f) {
		tmp = fmaf(v, logf(u), 1.0f);
	} else {
		tmp = (u * (v * (expf((2.0f / v)) + -1.0f))) + -1.0f;
	}
	return tmp;
}

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(1.0))
		tmp = fma(v, log(u), Float32(1.0));
	else
		tmp = Float32(Float32(u * Float32(v * Float32(exp(Float32(Float32(2.0) / v)) + Float32(-1.0)))) + Float32(-1.0));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if v < 1

   1. Initial program 99.9%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. fma-define 99.9%

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

      3. +-commutative 99.9%

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

      4. fma-define 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 99.9%

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

   6. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
   7. Step-by-step derivation

      1. add-exp-log 99.9%

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

      2. *-commutative 99.9%

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

      3. log-prod 99.9%

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

      4. add-log-exp 99.9%

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

      5. sub-neg 99.9%

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

      6. log1p-define 99.9%

         \[\leadsto \mathsf{fma}\left(v, \log \left(e^{\frac{-2}{v} + \color{blue}{\mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   8. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \left(\color{blue}{e^{\frac{-2}{v} + \mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   9. Taylor expanded in u around inf 99.3%

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

       1. mul-1-neg 99.3%

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

       2. log-rec 99.3%

          \[\leadsto \mathsf{fma}\left(v, -\color{blue}{\left(-\log u\right)}, 1\right) \]

       3. remove-double-neg 99.3%

          \[\leadsto \mathsf{fma}\left(v, \color{blue}{\log u}, 1\right) \]

   11. Simplified 99.3%

       \[\leadsto \mathsf{fma}\left(v, \color{blue}{\log u}, 1\right) \]

   if 1 < v

   1. Initial program 95.1%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 83.6%

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

      1. add-log-exp 83.3%

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

      2. associate-*r* 83.3%

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

      3. fma-neg 83.3%

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

      4. rec-exp 83.3%

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

      5. expm1-define 83.3%

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

      6. metadata-eval 83.3%

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

   5. Applied egg-rr 83.3%

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

   6. Taylor expanded in u around 0 84.1%

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

4. Final simplification 98.3%

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

Alternative 5: 97.2% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 1.0)
   (+ 1.0 (* v (log u)))
   (+ (* u (* v (+ (exp (/ 2.0 v)) -1.0))) -1.0)))

C

float code(float u, float v) {
	float tmp;
	if (v <= 1.0f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = (u * (v * (expf((2.0f / v)) + -1.0f))) + -1.0f;
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 1.0e0) then
        tmp = 1.0e0 + (v * log(u))
    else
        tmp = (u * (v * (exp((2.0e0 / v)) + (-1.0e0)))) + (-1.0e0)
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(1.0))
		tmp = Float32(Float32(1.0) + Float32(v * log(u)));
	else
		tmp = Float32(Float32(u * Float32(v * Float32(exp(Float32(Float32(2.0) / v)) + Float32(-1.0)))) + Float32(-1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(1.0))
		tmp = single(1.0) + (v * log(u));
	else
		tmp = (u * (v * (exp((single(2.0) / v)) + single(-1.0)))) + single(-1.0);
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 1

   1. Initial program 99.9%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. fma-define 99.9%

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

      3. +-commutative 99.9%

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

      4. fma-define 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 99.9%

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

   6. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
   7. Step-by-step derivation

      1. add-exp-log 99.9%

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

      2. *-commutative 99.9%

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

      3. log-prod 99.9%

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

      4. add-log-exp 99.9%

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

      5. sub-neg 99.9%

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

      6. log1p-define 99.9%

         \[\leadsto \mathsf{fma}\left(v, \log \left(e^{\frac{-2}{v} + \color{blue}{\mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   8. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \left(\color{blue}{e^{\frac{-2}{v} + \mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   9. Taylor expanded in u around inf 99.3%

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

       1. mul-1-neg 99.3%

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

       2. distribute-rgt-neg-in 99.3%

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

       3. log-rec 99.3%

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

       4. remove-double-neg 99.3%

          \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   11. Simplified 99.3%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 1 < v

   1. Initial program 95.1%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 83.6%

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

      1. add-log-exp 83.3%

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

      2. associate-*r* 83.3%

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

      3. fma-neg 83.3%

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

      4. rec-exp 83.3%

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

      5. expm1-define 83.3%

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

      6. metadata-eval 83.3%

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

   5. Applied egg-rr 83.3%

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

   6. Taylor expanded in u around 0 84.1%

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

4. Final simplification 98.3%

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

Alternative 6: 97.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 1:\\ \;\;\;\;1 + v \cdot \log u\\ \mathbf{else}:\\ \;\;\;\;1 - \left(2 - u \cdot \left(v \cdot \mathsf{expm1}\left(\frac{2}{v}\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 1.0)
   (+ 1.0 (* v (log u)))
   (- 1.0 (- 2.0 (* u (* v (expm1 (/ 2.0 v))))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 1.0f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = 1.0f - (2.0f - (u * (v * expm1f((2.0f / v)))));
	}
	return tmp;
}

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(1.0))
		tmp = Float32(Float32(1.0) + Float32(v * log(u)));
	else
		tmp = Float32(Float32(1.0) - Float32(Float32(2.0) - Float32(u * Float32(v * expm1(Float32(Float32(2.0) / v))))));
	end
	return tmp
end

Derivation

1. Split input into 2 regimes

2. if v < 1

   1. Initial program 99.9%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. fma-define 99.9%

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

      3. +-commutative 99.9%

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

      4. fma-define 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 99.9%

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

   6. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
   7. Step-by-step derivation

      1. add-exp-log 99.9%

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

      2. *-commutative 99.9%

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

      3. log-prod 99.9%

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

      4. add-log-exp 99.9%

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

      5. sub-neg 99.9%

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

      6. log1p-define 99.9%

         \[\leadsto \mathsf{fma}\left(v, \log \left(e^{\frac{-2}{v} + \color{blue}{\mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   8. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \left(\color{blue}{e^{\frac{-2}{v} + \mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   9. Taylor expanded in u around inf 99.3%

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

       1. mul-1-neg 99.3%

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

       2. distribute-rgt-neg-in 99.3%

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

       3. log-rec 99.3%

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

       4. remove-double-neg 99.3%

          \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   11. Simplified 99.3%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 1 < v

   1. Initial program 95.1%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 83.6%

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

      1. sub-neg 83.6%

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

      2. rec-exp 83.6%

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

      3. metadata-eval 83.6%

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

   5. Applied egg-rr 83.6%

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

      1. metadata-eval 83.6%

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

      2. sub-neg 83.6%

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

      3. expm1-undefine 83.6%

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

      4. distribute-neg-frac 83.6%

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

      5. metadata-eval 83.6%

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

   7. Simplified 83.6%

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

4. Final simplification 98.3%

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

Alternative 7: 97.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 1:\\ \;\;\;\;1 + v \cdot \log u\\ \mathbf{else}:\\ \;\;\;\;-1 + \left(\frac{\frac{0.6666666666666666 \cdot \frac{u}{v} + u \cdot 1.3333333333333333}{v} - u \cdot -2}{v} + u \cdot 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 1.0)
   (+ 1.0 (* v (log u)))
   (+
    -1.0
    (+
     (/
      (-
       (/ (+ (* 0.6666666666666666 (/ u v)) (* u 1.3333333333333333)) v)
       (* u -2.0))
      v)
     (* u 2.0)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 1.0f) {
		tmp = 1.0f + (v * logf(u));
	} else {
		tmp = -1.0f + ((((((0.6666666666666666f * (u / v)) + (u * 1.3333333333333333f)) / v) - (u * -2.0f)) / v) + (u * 2.0f));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 1.0e0) then
        tmp = 1.0e0 + (v * log(u))
    else
        tmp = (-1.0e0) + ((((((0.6666666666666666e0 * (u / v)) + (u * 1.3333333333333333e0)) / v) - (u * (-2.0e0))) / v) + (u * 2.0e0))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(1.0))
		tmp = Float32(Float32(1.0) + Float32(v * log(u)));
	else
		tmp = Float32(Float32(-1.0) + Float32(Float32(Float32(Float32(Float32(Float32(Float32(0.6666666666666666) * Float32(u / v)) + Float32(u * Float32(1.3333333333333333))) / v) - Float32(u * Float32(-2.0))) / v) + Float32(u * Float32(2.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(1.0))
		tmp = single(1.0) + (v * log(u));
	else
		tmp = single(-1.0) + ((((((single(0.6666666666666666) * (u / v)) + (u * single(1.3333333333333333))) / v) - (u * single(-2.0))) / v) + (u * single(2.0)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 1

   1. Initial program 99.9%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. fma-define 99.9%

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

      3. +-commutative 99.9%

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

      4. fma-define 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 99.9%

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

   6. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \color{blue}{\left(\left(1 - u\right) \cdot e^{\frac{-2}{v}} + u\right)}, 1\right) \]
   7. Step-by-step derivation

      1. add-exp-log 99.9%

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

      2. *-commutative 99.9%

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

      3. log-prod 99.9%

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

      4. add-log-exp 99.9%

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

      5. sub-neg 99.9%

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

      6. log1p-define 99.9%

         \[\leadsto \mathsf{fma}\left(v, \log \left(e^{\frac{-2}{v} + \color{blue}{\mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   8. Applied egg-rr 99.9%

      \[\leadsto \mathsf{fma}\left(v, \log \left(\color{blue}{e^{\frac{-2}{v} + \mathsf{log1p}\left(-u\right)}} + u\right), 1\right) \]

   9. Taylor expanded in u around inf 99.3%

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

       1. mul-1-neg 99.3%

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

       2. distribute-rgt-neg-in 99.3%

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

       3. log-rec 99.3%

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

       4. remove-double-neg 99.3%

          \[\leadsto 1 + v \cdot \color{blue}{\log u} \]

   11. Simplified 99.3%

       \[\leadsto \color{blue}{1 + v \cdot \log u} \]

   if 1 < v

   1. Initial program 95.1%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 83.6%

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

   4. Taylor expanded in v around -inf 83.4%

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

4. Final simplification 98.3%

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

Alternative 8: 90.7% accurate, 9.7× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612)
   1.0
   (+
    -1.0
    (- (* u 2.0) (/ (+ (* u -2.0) (* (/ u v) -1.3333333333333333)) v)))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + ((u * 2.0f) - (((u * -2.0f) + ((u / v) * -1.3333333333333333f)) / v));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + ((u * 2.0e0) - (((u * (-2.0e0)) + ((u / v) * (-1.3333333333333333e0))) / v))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(Float32(u * Float32(2.0)) - Float32(Float32(Float32(u * Float32(-2.0)) + Float32(Float32(u / v) * Float32(-1.3333333333333333))) / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + ((u * single(2.0)) - (((u * single(-2.0)) + ((u / v) * single(-1.3333333333333333))) / v));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

      4. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in v around 0 93.8%

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

   if 0.100000001 < v

   1. Initial program 95.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 72.7%

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

   4. Taylor expanded in v around -inf 74.5%

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

4. Final simplification 92.3%

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

Alternative 9: 90.7% accurate, 10.6× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612)
   1.0
   (- 1.0 (- 2.0 (* u (+ 2.0 (/ (+ 2.0 (/ 1.3333333333333333 v)) v)))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f - (2.0f - (u * (2.0f + ((2.0f + (1.3333333333333333f / v)) / v))));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 - (2.0e0 - (u * (2.0e0 + ((2.0e0 + (1.3333333333333333e0 / v)) / v))))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) - Float32(Float32(2.0) - Float32(u * Float32(Float32(2.0) + Float32(Float32(Float32(2.0) + Float32(Float32(1.3333333333333333) / v)) / v)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(1.0) - (single(2.0) - (u * (single(2.0) + ((single(2.0) + (single(1.3333333333333333) / v)) / v))));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

      4. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in v around 0 93.8%

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

   if 0.100000001 < v

   1. Initial program 95.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 72.7%

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

   4. Taylor expanded in v around -inf 73.1%

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

   5. Taylor expanded in v around inf 74.3%

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

      1. mul-1-neg 74.3%

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

      2. distribute-neg-frac2 74.3%

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

      3. associate-*r/ 74.3%

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

      4. metadata-eval 74.3%

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

   7. Simplified 74.3%

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

4. Final simplification 92.3%

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

Alternative 10: 90.4% accurate, 15.2× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612) 1.0 (+ -1.0 (* 2.0 (+ u (/ u v))))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (2.0f * (u + (u / v)));
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (2.0e0 * (u + (u / v)))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(Float32(2.0) * Float32(u + Float32(u / v))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (single(2.0) * (u + (u / v)));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

      4. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in v around 0 93.8%

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

   if 0.100000001 < v

   1. Initial program 95.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 72.7%

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

   4. Taylor expanded in v around inf 69.2%

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

      1. sub-neg 69.2%

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

      2. distribute-lft-out 69.2%

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

      3. metadata-eval 69.2%

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

   6. Simplified 69.2%

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

4. Final simplification 92.0%

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

Alternative 11: 89.8% accurate, 17.7× speedup

Math

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

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612) 1.0 (+ 1.0 (* (- 1.0 u) -2.0))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = 1.0f + ((1.0f - u) * -2.0f);
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = 1.0e0 + ((1.0e0 - u) * (-2.0e0))
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(1.0) + Float32(Float32(Float32(1.0) - u) * Float32(-2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(1.0) + ((single(1.0) - u) * single(-2.0));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

      4. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in v around 0 93.8%

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

   if 0.100000001 < v

   1. Initial program 95.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in v around inf 60.0%

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

4. Final simplification 91.3%

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

Alternative 12: 89.8% accurate, 21.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (u v)
 :precision binary32
 (if (<= v 0.10000000149011612) 1.0 (+ -1.0 (* u 2.0))))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f + (u * 2.0f);
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = (-1.0e0) + (u * 2.0e0)
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(Float32(-1.0) + Float32(u * Float32(2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0) + (u * single(2.0));
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

      4. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in v around 0 93.8%

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

   if 0.100000001 < v

   1. Initial program 95.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 72.7%

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

   4. Taylor expanded in v around inf 60.0%

      \[\leadsto \color{blue}{2 \cdot u - 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1 + u \cdot 2\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 89.1% accurate, 35.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 0.10000000149011612:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (u v) :precision binary32 (if (<= v 0.10000000149011612) 1.0 -1.0))

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.10000000149011612f) {
		tmp = 1.0f;
	} else {
		tmp = -1.0f;
	}
	return tmp;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    real(4) :: tmp
    if (v <= 0.10000000149011612e0) then
        tmp = 1.0e0
    else
        tmp = -1.0e0
    end if
    code = tmp
end function

Julia

function code(u, v)
	tmp = Float32(0.0)
	if (v <= Float32(0.10000000149011612))
		tmp = Float32(1.0);
	else
		tmp = Float32(-1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v)
	tmp = single(0.0);
	if (v <= single(0.10000000149011612))
		tmp = single(1.0);
	else
		tmp = single(-1.0);
	end
	tmp_2 = tmp;
end

Derivation

1. Split input into 2 regimes

2. if v < 0.100000001

   1. Initial program 100.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

      4. fma-define 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(v, \log \left(\mathsf{fma}\left(1 - u, e^{\frac{-2}{v}}, u\right)\right), 1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in v around 0 93.8%

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

   if 0.100000001 < v

   1. Initial program 95.0%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in u around 0 48.0%

      \[\leadsto \color{blue}{-1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 5.8% accurate, 213.0× speedup

Math

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

FPCore

(FPCore (u v) :precision binary32 -1.0)

C

float code(float u, float v) {
	return -1.0f;
}

Fortran

real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = -1.0e0
end function

Julia

function code(u, v)
	return Float32(-1.0)
end

MATLAB

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

Derivation

1. Initial program 99.6%

   \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
2. Add Preprocessing

3. Taylor expanded in u around 0 6.5%

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

Reproduce

herbie shell --seed 2024087 
(FPCore (u v)
  :name "HairBSDF, sample_f, cosTheta"
  :precision binary32
  :pre (and (and (<= 1e-5 u) (<= u 1.0)) (and (<= 0.0 v) (<= v 109.746574)))
  (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))