Disney BSSRDF, sample scattering profile, lower

Percentage Accurate: 60.6% → 99.4%
Time: 12.5s
Alternatives: 10
Speedup: 21.8×

Specification

?
\[\left(0 \leq s \land s \leq 256\right) \land \left(2.328306437 \cdot 10^{-10} \leq u \land u \leq 0.25\right)\]
\[\begin{array}{l} \\ s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))
float code(float s, float u) {
	return s * logf((1.0f / (1.0f - (4.0f * u))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * log((1.0e0 / (1.0e0 - (4.0e0 * u))))
end function
function code(s, u)
	return Float32(s * log(Float32(Float32(1.0) / Float32(Float32(1.0) - Float32(Float32(4.0) * u)))))
end
function tmp = code(s, u)
	tmp = s * log((single(1.0) / (single(1.0) - (single(4.0) * u))));
end
\begin{array}{l}

\\
s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right)
\end{array}

Sampling outcomes in binary32 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 10 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 60.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))
float code(float s, float u) {
	return s * logf((1.0f / (1.0f - (4.0f * u))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * log((1.0e0 / (1.0e0 - (4.0e0 * u))))
end function
function code(s, u)
	return Float32(s * log(Float32(Float32(1.0) / Float32(Float32(1.0) - Float32(Float32(4.0) * u)))))
end
function tmp = code(s, u)
	tmp = s * log((single(1.0) / (single(1.0) - (single(4.0) * u))));
end
\begin{array}{l}

\\
s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right)
\end{array}

Alternative 1: 99.4% accurate, 1.0× speedup?

\[\begin{array}{l} \\ s \cdot \left(-\mathsf{log1p}\left(u \cdot -4\right)\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (- (log1p (* u -4.0)))))
float code(float s, float u) {
	return s * -log1pf((u * -4.0f));
}
function code(s, u)
	return Float32(s * Float32(-log1p(Float32(u * Float32(-4.0)))))
end
\begin{array}{l}

\\
s \cdot \left(-\mathsf{log1p}\left(u \cdot -4\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Step-by-step derivation
    1. log-rec61.8%

      \[\leadsto s \cdot \color{blue}{\left(-\log \left(1 - 4 \cdot u\right)\right)} \]
    2. distribute-rgt-neg-out61.8%

      \[\leadsto \color{blue}{-s \cdot \log \left(1 - 4 \cdot u\right)} \]
    3. distribute-lft-neg-out61.8%

      \[\leadsto \color{blue}{\left(-s\right) \cdot \log \left(1 - 4 \cdot u\right)} \]
    4. cancel-sign-sub-inv61.8%

      \[\leadsto \left(-s\right) \cdot \log \color{blue}{\left(1 + \left(-4\right) \cdot u\right)} \]
    5. log1p-define99.4%

      \[\leadsto \left(-s\right) \cdot \color{blue}{\mathsf{log1p}\left(\left(-4\right) \cdot u\right)} \]
    6. *-commutative99.4%

      \[\leadsto \left(-s\right) \cdot \mathsf{log1p}\left(\color{blue}{u \cdot \left(-4\right)}\right) \]
    7. metadata-eval99.4%

      \[\leadsto \left(-s\right) \cdot \mathsf{log1p}\left(u \cdot \color{blue}{-4}\right) \]
  3. Simplified99.4%

    \[\leadsto \color{blue}{\left(-s\right) \cdot \mathsf{log1p}\left(u \cdot -4\right)} \]
  4. Add Preprocessing
  5. Final simplification99.4%

    \[\leadsto s \cdot \left(-\mathsf{log1p}\left(u \cdot -4\right)\right) \]
  6. Add Preprocessing

Alternative 2: 93.5% accurate, 5.2× speedup?

\[\begin{array}{l} \\ u \cdot \left(s \cdot 4 + u \cdot \left(s \cdot 8 + s \cdot \left(u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)\right)\right) \end{array} \]
(FPCore (s u)
 :precision binary32
 (*
  u
  (+
   (* s 4.0)
   (* u (+ (* s 8.0) (* s (* u (+ (* u 64.0) 21.333333333333332))))))))
float code(float s, float u) {
	return u * ((s * 4.0f) + (u * ((s * 8.0f) + (s * (u * ((u * 64.0f) + 21.333333333333332f))))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = u * ((s * 4.0e0) + (u * ((s * 8.0e0) + (s * (u * ((u * 64.0e0) + 21.333333333333332e0))))))
end function
function code(s, u)
	return Float32(u * Float32(Float32(s * Float32(4.0)) + Float32(u * Float32(Float32(s * Float32(8.0)) + Float32(s * Float32(u * Float32(Float32(u * Float32(64.0)) + Float32(21.333333333333332))))))))
end
function tmp = code(s, u)
	tmp = u * ((s * single(4.0)) + (u * ((s * single(8.0)) + (s * (u * ((u * single(64.0)) + single(21.333333333333332)))))));
end
\begin{array}{l}

\\
u \cdot \left(s \cdot 4 + u \cdot \left(s \cdot 8 + s \cdot \left(u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 94.2%

    \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(21.333333333333332 \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
  4. Taylor expanded in s around 0 94.2%

    \[\leadsto u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + \color{blue}{s \cdot \left(u \cdot \left(21.333333333333332 + 64 \cdot u\right)\right)}\right)\right) \]
  5. Step-by-step derivation
    1. +-commutative94.2%

      \[\leadsto u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + s \cdot \left(u \cdot \color{blue}{\left(64 \cdot u + 21.333333333333332\right)}\right)\right)\right) \]
    2. *-commutative94.2%

      \[\leadsto u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + s \cdot \left(u \cdot \left(\color{blue}{u \cdot 64} + 21.333333333333332\right)\right)\right)\right) \]
  6. Simplified94.2%

    \[\leadsto u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + \color{blue}{s \cdot \left(u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)}\right)\right) \]
  7. Final simplification94.2%

    \[\leadsto u \cdot \left(s \cdot 4 + u \cdot \left(s \cdot 8 + s \cdot \left(u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)\right)\right) \]
  8. Add Preprocessing

Alternative 3: 93.2% accurate, 6.4× speedup?

\[\begin{array}{l} \\ s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)\right)\right) \end{array} \]
(FPCore (s u)
 :precision binary32
 (* s (* u (+ 4.0 (* u (+ 8.0 (* u (+ (* u 64.0) 21.333333333333332))))))))
float code(float s, float u) {
	return s * (u * (4.0f + (u * (8.0f + (u * ((u * 64.0f) + 21.333333333333332f))))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * (u * (4.0e0 + (u * (8.0e0 + (u * ((u * 64.0e0) + 21.333333333333332e0))))))
end function
function code(s, u)
	return Float32(s * Float32(u * Float32(Float32(4.0) + Float32(u * Float32(Float32(8.0) + Float32(u * Float32(Float32(u * Float32(64.0)) + Float32(21.333333333333332))))))))
end
function tmp = code(s, u)
	tmp = s * (u * (single(4.0) + (u * (single(8.0) + (u * ((u * single(64.0)) + single(21.333333333333332)))))));
end
\begin{array}{l}

\\
s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 93.8%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot \left(8 + u \cdot \left(21.333333333333332 + 64 \cdot u\right)\right)\right)\right)} \]
  4. Step-by-step derivation
    1. *-commutative93.8%

      \[\leadsto s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot \left(21.333333333333332 + \color{blue}{u \cdot 64}\right)\right)\right)\right) \]
  5. Simplified93.8%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot \left(8 + u \cdot \left(21.333333333333332 + u \cdot 64\right)\right)\right)\right)} \]
  6. Final simplification93.8%

    \[\leadsto s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot \left(u \cdot 64 + 21.333333333333332\right)\right)\right)\right) \]
  7. Add Preprocessing

Alternative 4: 91.4% accurate, 7.3× speedup?

\[\begin{array}{l} \\ s \cdot \left(u \cdot 4 + u \cdot \left(u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right) \end{array} \]
(FPCore (s u)
 :precision binary32
 (* s (+ (* u 4.0) (* u (* u (+ 8.0 (* u 21.333333333333332)))))))
float code(float s, float u) {
	return s * ((u * 4.0f) + (u * (u * (8.0f + (u * 21.333333333333332f)))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * ((u * 4.0e0) + (u * (u * (8.0e0 + (u * 21.333333333333332e0)))))
end function
function code(s, u)
	return Float32(s * Float32(Float32(u * Float32(4.0)) + Float32(u * Float32(u * Float32(Float32(8.0) + Float32(u * Float32(21.333333333333332)))))))
end
function tmp = code(s, u)
	tmp = s * ((u * single(4.0)) + (u * (u * (single(8.0) + (u * single(21.333333333333332))))));
end
\begin{array}{l}

\\
s \cdot \left(u \cdot 4 + u \cdot \left(u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 92.1%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot \left(8 + 21.333333333333332 \cdot u\right)\right)\right)} \]
  4. Step-by-step derivation
    1. *-commutative92.1%

      \[\leadsto s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + \color{blue}{u \cdot 21.333333333333332}\right)\right)\right) \]
  5. Simplified92.1%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right)} \]
  6. Step-by-step derivation
    1. distribute-lft-in92.1%

      \[\leadsto s \cdot \left(u \cdot \left(4 + \color{blue}{\left(u \cdot 8 + u \cdot \left(u \cdot 21.333333333333332\right)\right)}\right)\right) \]
  7. Applied egg-rr92.1%

    \[\leadsto s \cdot \left(u \cdot \left(4 + \color{blue}{\left(u \cdot 8 + u \cdot \left(u \cdot 21.333333333333332\right)\right)}\right)\right) \]
  8. Step-by-step derivation
    1. distribute-rgt-in92.5%

      \[\leadsto s \cdot \color{blue}{\left(4 \cdot u + \left(u \cdot 8 + u \cdot \left(u \cdot 21.333333333333332\right)\right) \cdot u\right)} \]
    2. *-commutative92.5%

      \[\leadsto s \cdot \left(\color{blue}{u \cdot 4} + \left(u \cdot 8 + u \cdot \left(u \cdot 21.333333333333332\right)\right) \cdot u\right) \]
    3. distribute-lft-out92.5%

      \[\leadsto s \cdot \left(u \cdot 4 + \color{blue}{\left(u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)} \cdot u\right) \]
  9. Applied egg-rr92.5%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot 4 + \left(u \cdot \left(8 + u \cdot 21.333333333333332\right)\right) \cdot u\right)} \]
  10. Final simplification92.5%

    \[\leadsto s \cdot \left(u \cdot 4 + u \cdot \left(u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right) \]
  11. Add Preprocessing

Alternative 5: 91.2% accurate, 8.4× speedup?

\[\begin{array}{l} \\ s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right) \end{array} \]
(FPCore (s u)
 :precision binary32
 (* s (* u (+ 4.0 (* u (+ 8.0 (* u 21.333333333333332)))))))
float code(float s, float u) {
	return s * (u * (4.0f + (u * (8.0f + (u * 21.333333333333332f)))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * (u * (4.0e0 + (u * (8.0e0 + (u * 21.333333333333332e0)))))
end function
function code(s, u)
	return Float32(s * Float32(u * Float32(Float32(4.0) + Float32(u * Float32(Float32(8.0) + Float32(u * Float32(21.333333333333332)))))))
end
function tmp = code(s, u)
	tmp = s * (u * (single(4.0) + (u * (single(8.0) + (u * single(21.333333333333332))))));
end
\begin{array}{l}

\\
s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 92.1%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot \left(8 + 21.333333333333332 \cdot u\right)\right)\right)} \]
  4. Step-by-step derivation
    1. *-commutative92.1%

      \[\leadsto s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + \color{blue}{u \cdot 21.333333333333332}\right)\right)\right) \]
  5. Simplified92.1%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right)} \]
  6. Final simplification92.1%

    \[\leadsto s \cdot \left(u \cdot \left(4 + u \cdot \left(8 + u \cdot 21.333333333333332\right)\right)\right) \]
  7. Add Preprocessing

Alternative 6: 87.2% accurate, 9.9× speedup?

\[\begin{array}{l} \\ u \cdot \left(s \cdot 4 + 8 \cdot \left(s \cdot u\right)\right) \end{array} \]
(FPCore (s u) :precision binary32 (* u (+ (* s 4.0) (* 8.0 (* s u)))))
float code(float s, float u) {
	return u * ((s * 4.0f) + (8.0f * (s * u)));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = u * ((s * 4.0e0) + (8.0e0 * (s * u)))
end function
function code(s, u)
	return Float32(u * Float32(Float32(s * Float32(4.0)) + Float32(Float32(8.0) * Float32(s * u))))
end
function tmp = code(s, u)
	tmp = u * ((s * single(4.0)) + (single(8.0) * (s * u)));
end
\begin{array}{l}

\\
u \cdot \left(s \cdot 4 + 8 \cdot \left(s \cdot u\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 88.0%

    \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + 8 \cdot \left(s \cdot u\right)\right)} \]
  4. Final simplification88.0%

    \[\leadsto u \cdot \left(s \cdot 4 + 8 \cdot \left(s \cdot u\right)\right) \]
  5. Add Preprocessing

Alternative 7: 87.1% accurate, 12.1× speedup?

\[\begin{array}{l} \\ s \cdot \left(u \cdot \left(4 + u \cdot 8\right)\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (* u (+ 4.0 (* u 8.0)))))
float code(float s, float u) {
	return s * (u * (4.0f + (u * 8.0f)));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * (u * (4.0e0 + (u * 8.0e0)))
end function
function code(s, u)
	return Float32(s * Float32(u * Float32(Float32(4.0) + Float32(u * Float32(8.0)))))
end
function tmp = code(s, u)
	tmp = s * (u * (single(4.0) + (u * single(8.0))));
end
\begin{array}{l}

\\
s \cdot \left(u \cdot \left(4 + u \cdot 8\right)\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 87.8%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + 8 \cdot u\right)\right)} \]
  4. Step-by-step derivation
    1. *-commutative87.8%

      \[\leadsto s \cdot \left(u \cdot \left(4 + \color{blue}{u \cdot 8}\right)\right) \]
  5. Simplified87.8%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot \left(4 + u \cdot 8\right)\right)} \]
  6. Final simplification87.8%

    \[\leadsto s \cdot \left(u \cdot \left(4 + u \cdot 8\right)\right) \]
  7. Add Preprocessing

Alternative 8: 74.4% accurate, 21.8× speedup?

\[\begin{array}{l} \\ 4 \cdot \left(s \cdot u\right) \end{array} \]
(FPCore (s u) :precision binary32 (* 4.0 (* s u)))
float code(float s, float u) {
	return 4.0f * (s * u);
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = 4.0e0 * (s * u)
end function
function code(s, u)
	return Float32(Float32(4.0) * Float32(s * u))
end
function tmp = code(s, u)
	tmp = single(4.0) * (s * u);
end
\begin{array}{l}

\\
4 \cdot \left(s \cdot u\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 74.3%

    \[\leadsto \color{blue}{4 \cdot \left(s \cdot u\right)} \]
  4. Step-by-step derivation
    1. *-commutative74.3%

      \[\leadsto 4 \cdot \color{blue}{\left(u \cdot s\right)} \]
  5. Simplified74.3%

    \[\leadsto \color{blue}{4 \cdot \left(u \cdot s\right)} \]
  6. Final simplification74.3%

    \[\leadsto 4 \cdot \left(s \cdot u\right) \]
  7. Add Preprocessing

Alternative 9: 74.7% accurate, 21.8× speedup?

\[\begin{array}{l} \\ s \cdot \left(u \cdot 4\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (* u 4.0)))
float code(float s, float u) {
	return s * (u * 4.0f);
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * (u * 4.0e0)
end function
function code(s, u)
	return Float32(s * Float32(u * Float32(4.0)))
end
function tmp = code(s, u)
	tmp = s * (u * single(4.0));
end
\begin{array}{l}

\\
s \cdot \left(u \cdot 4\right)
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in u around 0 74.5%

    \[\leadsto s \cdot \color{blue}{\left(4 \cdot u\right)} \]
  4. Final simplification74.5%

    \[\leadsto s \cdot \left(u \cdot 4\right) \]
  5. Add Preprocessing

Alternative 10: 16.9% accurate, 36.3× speedup?

\[\begin{array}{l} \\ s \cdot 0 \end{array} \]
(FPCore (s u) :precision binary32 (* s 0.0))
float code(float s, float u) {
	return s * 0.0f;
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * 0.0e0
end function
function code(s, u)
	return Float32(s * Float32(0.0))
end
function tmp = code(s, u)
	tmp = s * single(0.0);
end
\begin{array}{l}

\\
s \cdot 0
\end{array}
Derivation
  1. Initial program 59.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Applied egg-rr15.5%

    \[\leadsto s \cdot \color{blue}{\left(0.5 \cdot \mathsf{log1p}\left(4 \cdot u\right) - 0.5 \cdot \mathsf{log1p}\left(4 \cdot u\right)\right)} \]
  4. Step-by-step derivation
    1. +-inverses15.5%

      \[\leadsto s \cdot \color{blue}{0} \]
  5. Simplified15.5%

    \[\leadsto s \cdot \color{blue}{0} \]
  6. Final simplification15.5%

    \[\leadsto s \cdot 0 \]
  7. Add Preprocessing

Reproduce

?
herbie shell --seed 2024079 
(FPCore (s u)
  :name "Disney BSSRDF, sample scattering profile, lower"
  :precision binary32
  :pre (and (and (<= 0.0 s) (<= s 256.0)) (and (<= 2.328306437e-10 u) (<= u 0.25)))
  (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))