HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%

Time: 10.2s

Alternatives: 13

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} \\ \log \left(e^{\frac{-2}{v}} \cdot \left(1 - u\right) + u\right) \cdot v + 1 \end{array} \]

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.4%

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

3. Final simplification 99.4%

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

Alternative 2: 90.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if ((logf(((expf((-2.0f / v)) * (1.0f - u)) + u)) * v) <= -1.0f) {
		tmp = ((((((-1.0f / v) - (-1.0f / ((u * v) * u))) * (u * u)) / (u + 1.0f)) * -2.0f) * v) + 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 ((log(((exp(((-2.0e0) / v)) * (1.0e0 - u)) + u)) * v) <= (-1.0e0)) then
        tmp = (((((((-1.0e0) / v) - ((-1.0e0) / ((u * v) * u))) * (u * u)) / (u + 1.0e0)) * (-2.0e0)) * v) + 1.0e0
    else
        tmp = 1.0e0
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (*.f32 v (log.f32 (+.f32 u (*.f32 (-.f32 #s(literal 1 binary32) u) (exp.f32 (/.f32 #s(literal -2 binary32) v)))))) < -1

   1. Initial program 93.8%

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

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

      1. *-commutative N/A

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

      2. lower-*.f32 N/A

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

      3. lower-/.f32 N/A

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

      4. lower--.f32 52.8

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

   5. Applied rewrites 52.8%

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

   7. Applied rewrites 52.8%

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

   8. Taylor expanded in u around inf

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

   10. Applied rewrites 52.8%

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

   if -1 < (*.f32 v (log.f32 (+.f32 u (*.f32 (-.f32 #s(literal 1 binary32) u) (exp.f32 (/.f32 #s(literal -2 binary32) v))))))

   1. Initial program 99.9%

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

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

   5. Applied rewrites 92.5%

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

4. Final simplification 89.4%

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

Alternative 3: 90.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if ((logf(((expf((-2.0f / v)) * (1.0f - u)) + u)) * v) <= -1.0f) {
		tmp = ((((v - (u * v)) / (v * v)) * -2.0f) * v) + 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 ((log(((exp(((-2.0e0) / v)) * (1.0e0 - u)) + u)) * v) <= (-1.0e0)) then
        tmp = ((((v - (u * v)) / (v * v)) * (-2.0e0)) * v) + 1.0e0
    else
        tmp = 1.0e0
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (*.f32 v (log.f32 (+.f32 u (*.f32 (-.f32 #s(literal 1 binary32) u) (exp.f32 (/.f32 #s(literal -2 binary32) v)))))) < -1

   1. Initial program 93.8%

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

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

      1. *-commutative N/A

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

      2. lower-*.f32 N/A

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

      3. lower-/.f32 N/A

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

      4. lower--.f32 52.8

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

   5. Applied rewrites 52.8%

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

   7. Applied rewrites 52.8%

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

   if -1 < (*.f32 v (log.f32 (+.f32 u (*.f32 (-.f32 #s(literal 1 binary32) u) (exp.f32 (/.f32 #s(literal -2 binary32) v))))))

   1. Initial program 99.9%

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

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

   5. Applied rewrites 92.5%

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

4. Final simplification 89.4%

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

Alternative 4: 90.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if ((logf(((expf((-2.0f / v)) * (1.0f - u)) + u)) * v) <= -1.0f) {
		tmp = (2.0f * u) + -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 ((log(((exp(((-2.0e0) / v)) * (1.0e0 - u)) + u)) * v) <= (-1.0e0)) then
        tmp = (2.0e0 * u) + (-1.0e0)
    else
        tmp = 1.0e0
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if (*.f32 v (log.f32 (+.f32 u (*.f32 (-.f32 #s(literal 1 binary32) u) (exp.f32 (/.f32 #s(literal -2 binary32) v)))))) < -1

   1. Initial program 93.8%

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

      1. lift-exp.f32 N/A

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

      2. lift-/.f32 N/A

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

      3. frac-2neg N/A

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

      4. distribute-frac-neg2 N/A

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

      5. exp-neg N/A

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

      6. lower-/.f32 N/A

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

      7. lower-exp.f32 N/A

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

      8. lower-/.f32 N/A

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

      9. metadata-eval 92.7

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

   4. Applied rewrites 92.7%

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

   5. Taylor expanded in v around -inf

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

      1. distribute-lft-in N/A

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

      2. metadata-eval N/A

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

      3. associate-+r+ N/A

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

      4. metadata-eval N/A

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

      5. associate-*r* N/A

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

      6. metadata-eval N/A

         \[\leadsto -1 + \color{blue}{2} \cdot u \]

      7. lower-+.f32 N/A

         \[\leadsto \color{blue}{-1 + 2 \cdot u} \]

      8. *-commutative N/A

         \[\leadsto -1 + \color{blue}{u \cdot 2} \]

      9. lower-*.f32 52.8

         \[\leadsto -1 + \color{blue}{u \cdot 2} \]

   7. Applied rewrites 52.8%

      \[\leadsto \color{blue}{-1 + u \cdot 2} \]

   if -1 < (*.f32 v (log.f32 (+.f32 u (*.f32 (-.f32 #s(literal 1 binary32) u) (exp.f32 (/.f32 #s(literal -2 binary32) v))))))

   1. Initial program 99.9%

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

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

   5. Applied rewrites 92.5%

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

4. Final simplification 89.4%

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

Alternative 5: 95.1% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.4%

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

   1. lift-exp.f32 N/A

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

   2. lift-/.f32 N/A

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

   3. frac-2neg N/A

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

   4. distribute-frac-neg2 N/A

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

   5. exp-neg N/A

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

   6. lower-/.f32 N/A

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

   7. lower-exp.f32 N/A

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

   8. lower-/.f32 N/A

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

   9. metadata-eval 99.4

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

4. Applied rewrites 99.4%

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

5. Taylor expanded in v around -inf

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

   1. mul-1-neg N/A

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

   2. unsub-neg N/A

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

   3. lower--.f32 N/A

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

   4. lower-/.f32 N/A

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

7. Applied rewrites 94.6%

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

8. Final simplification 94.6%

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

Alternative 6: 93.5% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.4%

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

   1. lift-exp.f32 N/A

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

   2. lift-/.f32 N/A

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

   3. frac-2neg N/A

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

   4. distribute-frac-neg2 N/A

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

   5. exp-neg N/A

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

   6. lower-/.f32 N/A

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

   7. lower-exp.f32 N/A

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

   8. lower-/.f32 N/A

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

   9. metadata-eval 99.4

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

4. Applied rewrites 99.4%

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

   1. lift-+.f32 N/A

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

   2. +-commutative N/A

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

   3. lower-+.f32 99.4

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

   4. lift-*.f32 N/A

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

   5. lift-/.f32 N/A

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

   6. un-div-inv N/A

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

   7. lower-/.f32 99.4

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

6. Applied rewrites 99.4%

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

7. Taylor expanded in v around inf

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

   1. metadata-eval N/A

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

   2. associate-*r/ N/A

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

   3. +-commutative N/A

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

   4. associate-+r+ N/A

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

   5. lower-+.f32 N/A

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

   6. lower-+.f32 N/A

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

   7. associate-*r/ N/A

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

   8. metadata-eval N/A

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

   9. lower-/.f32 N/A

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

   10. unpow2 N/A

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

   11. lower-*.f32 N/A

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

   12. associate-*r/ N/A

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

   13. metadata-eval N/A

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

   14. lower-/.f32 93.0

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

9. Applied rewrites 93.0%

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

10. Final simplification 93.0%

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

Alternative 7: 91.0% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.4%

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

   1. lift-exp.f32 N/A

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

   2. lift-/.f32 N/A

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

   3. frac-2neg N/A

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

   4. distribute-frac-neg2 N/A

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

   5. exp-neg N/A

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

   6. lower-/.f32 N/A

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

   7. lower-exp.f32 N/A

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

   8. lower-/.f32 N/A

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

   9. metadata-eval 99.4

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

4. Applied rewrites 99.4%

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

5. Taylor expanded in v around inf

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

   1. +-commutative N/A

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

   2. lower-+.f32 N/A

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

   3. associate-*r/ N/A

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

   4. metadata-eval N/A

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

   5. lower-/.f32 90.6

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

7. Applied rewrites 90.6%

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

8. Final simplification 90.6%

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

Alternative 8: 91.0% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Initial program 99.4%

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

   1. lift-exp.f32 N/A

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

   2. lift-/.f32 N/A

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

   3. frac-2neg N/A

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

   4. distribute-frac-neg2 N/A

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

   5. exp-neg N/A

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

   6. lower-/.f32 N/A

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

   7. lower-exp.f32 N/A

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

   8. lower-/.f32 N/A

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

   9. metadata-eval 99.4

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

4. Applied rewrites 99.4%

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

5. Taylor expanded in v around inf

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

   1. +-commutative N/A

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

   2. lower-+.f32 N/A

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

   3. associate-*r/ N/A

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

   4. metadata-eval N/A

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

   5. lower-/.f32 90.6

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

7. Applied rewrites 90.6%

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

   1. lift-+.f32 N/A

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

   2. +-commutative N/A

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

   3. lower-+.f32 90.6

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

9. Applied rewrites 90.6%

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

Alternative 9: 90.7% accurate, 2.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.204999998

   1. Initial program 99.9%

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

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

   5. Applied rewrites 92.8%

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

   if 0.204999998 < v

   1. Initial program 94.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

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f32 N/A

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

   5. Applied rewrites 5.5%

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

   6. Taylor expanded in u around -inf

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

   8. Applied rewrites 63.9%

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

   9. Taylor expanded in u around -inf

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

   11. Applied rewrites 64.0%

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

4. Final simplification 90.4%

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

Alternative 10: 90.7% accurate, 2.5× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.20499999821186066f) {
		tmp = 1.0f;
	} else {
		tmp = (((((2.0f / v) - ((((2.0f / v) + 2.0f) - (2.0f / u)) / u)) * (u * u)) / -v) * v) + 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.20499999821186066e0) then
        tmp = 1.0e0
    else
        tmp = (((((2.0e0 / v) - ((((2.0e0 / v) + 2.0e0) - (2.0e0 / u)) / u)) * (u * u)) / -v) * v) + 1.0e0
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.204999998

   1. Initial program 99.9%

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

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

   5. Applied rewrites 92.8%

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

   if 0.204999998 < v

   1. Initial program 94.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

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f32 N/A

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

   5. Applied rewrites 5.5%

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

   6. Taylor expanded in u around -inf

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

   8. Applied rewrites 63.9%

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

4. Final simplification 90.4%

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

Alternative 11: 90.7% accurate, 2.8× speedup

Math

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

FPCore

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

C

float code(float u, float v) {
	float tmp;
	if (v <= 0.20499999821186066f) {
		tmp = 1.0f;
	} else {
		tmp = (((((2.0f - (2.0f / u)) * u) - ((((-2.0f / u) + 2.0f) / v) * (u * u))) / v) * v) + 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.20499999821186066e0) then
        tmp = 1.0e0
    else
        tmp = (((((2.0e0 - (2.0e0 / u)) * u) - (((((-2.0e0) / u) + 2.0e0) / v) * (u * u))) / v) * v) + 1.0e0
    end if
    code = tmp
end function

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if v < 0.204999998

   1. Initial program 99.9%

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

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

   5. Applied rewrites 92.8%

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

   if 0.204999998 < v

   1. Initial program 94.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

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f32 N/A

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

   5. Applied rewrites 5.5%

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

   6. Taylor expanded in u around -inf

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

   8. Applied rewrites 63.9%

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

   9. Taylor expanded in v around -inf

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

   11. Applied rewrites 63.8%

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

4. Final simplification 90.4%

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

Alternative 12: 86.7% accurate, 231.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.4%

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

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

5. Applied rewrites 85.5%

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

Alternative 13: 6.0% accurate, 231.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.4%

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

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

5. Applied rewrites 6.2%

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

Reproduce

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