Numeric.SpecFunctions:choose from math-functions-0.1.5.2

Percentage Accurate: 84.7% → 96.7%

Time: 5.8s

Alternatives: 5

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot \left(y + z\right)}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* x (+ y z)) z))

C

double code(double x, double y, double z) {
	return (x * (y + z)) / z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * (y + z)) / z
end function

Java

public static double code(double x, double y, double z) {
	return (x * (y + z)) / z;
}

Python

def code(x, y, z):
	return (x * (y + z)) / z

Julia

function code(x, y, z)
	return Float64(Float64(x * Float64(y + z)) / z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * (y + z)) / z;
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]

Initial Program: 84.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot \left(y + z\right)}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* x (+ y z)) z))

C

double code(double x, double y, double z) {
	return (x * (y + z)) / z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * (y + z)) / z
end function

Java

public static double code(double x, double y, double z) {
	return (x * (y + z)) / z;
}

Python

def code(x, y, z):
	return (x * (y + z)) / z

Julia

function code(x, y, z)
	return Float64(Float64(x * Float64(y + z)) / z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * (y + z)) / z;
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]

Alternative 1: 96.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.3 \cdot 10^{-133}:\\ \;\;\;\;\mathsf{fma}\left(x, \frac{y}{z}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z}, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 3.3e-133) (fma x (/ y z) x) (fma (/ x z) y x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 3.3e-133) {
		tmp = fma(x, (y / z), x);
	} else {
		tmp = fma((x / z), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 3.3e-133)
		tmp = fma(x, Float64(y / z), x);
	else
		tmp = fma(Float64(x / z), y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 3.3e-133], N[(x * N[(y / z), $MachinePrecision] + x), $MachinePrecision], N[(N[(x / z), $MachinePrecision] * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.30000000000000009e-133

   1. Initial program 85.1%

      \[\frac{x \cdot \left(y + z\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{z}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto \color{blue}{x \cdot \frac{y + z}{z}} \]

      2. +-commutative N/A

         \[\leadsto x \cdot \frac{\color{blue}{z + y}}{z} \]

      3. *-lft-identity N/A

         \[\leadsto x \cdot \frac{z + \color{blue}{1 \cdot y}}{z} \]

      4. metadata-eval N/A

         \[\leadsto x \cdot \frac{z + \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot y}{z} \]

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

         \[\leadsto x \cdot \frac{\color{blue}{z - -1 \cdot y}}{z} \]

      6. div-sub N/A

         \[\leadsto x \cdot \color{blue}{\left(\frac{z}{z} - \frac{-1 \cdot y}{z}\right)} \]

      7. *-inverses N/A

         \[\leadsto x \cdot \left(\color{blue}{1} - \frac{-1 \cdot y}{z}\right) \]

      8. associate-*r/ N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{-1 \cdot \frac{y}{z}}\right) \]

      9. distribute-rgt-out-- N/A

         \[\leadsto \color{blue}{1 \cdot x - \left(-1 \cdot \frac{y}{z}\right) \cdot x} \]

      10. *-lft-identity N/A

          \[\leadsto \color{blue}{x} - \left(-1 \cdot \frac{y}{z}\right) \cdot x \]

      11. mul-1-neg N/A

          \[\leadsto x - \color{blue}{\left(\mathsf{neg}\left(\frac{y}{z}\right)\right)} \cdot x \]

      12. cancel-sign-sub N/A

          \[\leadsto \color{blue}{x + \frac{y}{z} \cdot x} \]

      13. distribute-rgt1-in N/A

          \[\leadsto \color{blue}{\left(\frac{y}{z} + 1\right) \cdot x} \]

      14. distribute-lft1-in N/A

          \[\leadsto \color{blue}{\frac{y}{z} \cdot x + x} \]

      15. *-commutative N/A

          \[\leadsto \color{blue}{x \cdot \frac{y}{z}} + x \]

      16. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{y}{z}, x\right)} \]

      17. lower-/.f64 98.3

          \[\leadsto \mathsf{fma}\left(x, \color{blue}{\frac{y}{z}}, x\right) \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{y}{z}, x\right)} \]

   if 3.30000000000000009e-133 < y

   1. Initial program 85.4%

      \[\frac{x \cdot \left(y + z\right)}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{z}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot \left(y + z\right)}}{z} \]

      3. associate-/l* N/A

         \[\leadsto \color{blue}{x \cdot \frac{y + z}{z}} \]

      4. clear-num N/A

         \[\leadsto x \cdot \color{blue}{\frac{1}{\frac{z}{y + z}}} \]

      5. un-div-inv N/A

         \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

      7. lower-/.f64 92.6

         \[\leadsto \frac{x}{\color{blue}{\frac{z}{y + z}}} \]

   4. Applied rewrites 92.6%

      \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

      2. div-inv N/A

         \[\leadsto \color{blue}{x \cdot \frac{1}{\frac{z}{y + z}}} \]

      3. lift-/.f64 N/A

         \[\leadsto x \cdot \frac{1}{\color{blue}{\frac{z}{y + z}}} \]

      4. associate-/r/ N/A

         \[\leadsto x \cdot \color{blue}{\left(\frac{1}{z} \cdot \left(y + z\right)\right)} \]

      5. lift-+.f64 N/A

         \[\leadsto x \cdot \left(\frac{1}{z} \cdot \color{blue}{\left(y + z\right)}\right) \]

      6. distribute-lft-in N/A

         \[\leadsto x \cdot \color{blue}{\left(\frac{1}{z} \cdot y + \frac{1}{z} \cdot z\right)} \]

      7. associate-/r/ N/A

         \[\leadsto x \cdot \left(\color{blue}{\frac{1}{\frac{z}{y}}} + \frac{1}{z} \cdot z\right) \]

      8. clear-num N/A

         \[\leadsto x \cdot \left(\color{blue}{\frac{y}{z}} + \frac{1}{z} \cdot z\right) \]

      9. lift-/.f64 N/A

         \[\leadsto x \cdot \left(\color{blue}{\frac{y}{z}} + \frac{1}{z} \cdot z\right) \]

      10. lft-mult-inverse N/A

          \[\leadsto x \cdot \left(\frac{y}{z} + \color{blue}{1}\right) \]

      11. distribute-lft-out N/A

          \[\leadsto \color{blue}{x \cdot \frac{y}{z} + x \cdot 1} \]

      12. *-rgt-identity N/A

          \[\leadsto x \cdot \frac{y}{z} + \color{blue}{x} \]

      13. lift-/.f64 N/A

          \[\leadsto x \cdot \color{blue}{\frac{y}{z}} + x \]

      14. associate-*r/ N/A

          \[\leadsto \color{blue}{\frac{x \cdot y}{z}} + x \]

      15. associate-*l/ N/A

          \[\leadsto \color{blue}{\frac{x}{z} \cdot y} + x \]

      16. lift-/.f64 N/A

          \[\leadsto \color{blue}{\frac{x}{z}} \cdot y + x \]

      17. lower-fma.f64 97.0

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{z}, y, x\right)} \]

   6. Applied rewrites 97.0%

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

Alternative 2: 71.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot y}{z}\\ \mathbf{if}\;y \leq -2 \cdot 10^{-35}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.1 \cdot 10^{+106}:\\ \;\;\;\;\frac{x}{1}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* x y) z)))
   (if (<= y -2e-35) t_0 (if (<= y 2.1e+106) (/ x 1.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double tmp;
	if (y <= -2e-35) {
		tmp = t_0;
	} else if (y <= 2.1e+106) {
		tmp = x / 1.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x * y) / z
    if (y <= (-2d-35)) then
        tmp = t_0
    else if (y <= 2.1d+106) then
        tmp = x / 1.0d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double tmp;
	if (y <= -2e-35) {
		tmp = t_0;
	} else if (y <= 2.1e+106) {
		tmp = x / 1.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x * y) / z
	tmp = 0
	if y <= -2e-35:
		tmp = t_0
	elif y <= 2.1e+106:
		tmp = x / 1.0
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x * y) / z)
	tmp = 0.0
	if (y <= -2e-35)
		tmp = t_0;
	elseif (y <= 2.1e+106)
		tmp = Float64(x / 1.0);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x * y) / z;
	tmp = 0.0;
	if (y <= -2e-35)
		tmp = t_0;
	elseif (y <= 2.1e+106)
		tmp = x / 1.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[y, -2e-35], t$95$0, If[LessEqual[y, 2.1e+106], N[(x / 1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.00000000000000002e-35 or 2.10000000000000005e106 < y

   1. Initial program 92.7%

      \[\frac{x \cdot \left(y + z\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \frac{\color{blue}{x \cdot y}}{z} \]
   4. Step-by-step derivation

      1. lower-*.f64 79.7

         \[\leadsto \frac{\color{blue}{x \cdot y}}{z} \]

   5. Applied rewrites 79.7%

      \[\leadsto \frac{\color{blue}{x \cdot y}}{z} \]

   if -2.00000000000000002e-35 < y < 2.10000000000000005e106

   1. Initial program 79.0%

      \[\frac{x \cdot \left(y + z\right)}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{z}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot \left(y + z\right)}}{z} \]

      3. associate-/l* N/A

         \[\leadsto \color{blue}{x \cdot \frac{y + z}{z}} \]

      4. clear-num N/A

         \[\leadsto x \cdot \color{blue}{\frac{1}{\frac{z}{y + z}}} \]

      5. un-div-inv N/A

         \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

      7. lower-/.f64 99.5

         \[\leadsto \frac{x}{\color{blue}{\frac{z}{y + z}}} \]

   4. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 81.5%

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

Alternative 3: 96.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{x}{\frac{z}{z + y}} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ x (/ z (+ z y))))

C

double code(double x, double y, double z) {
	return x / (z / (z + y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x / (z / (z + y))
end function

Java

public static double code(double x, double y, double z) {
	return x / (z / (z + y));
}

Python

def code(x, y, z):
	return x / (z / (z + y))

Julia

function code(x, y, z)
	return Float64(x / Float64(z / Float64(z + y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x / (z / (z + y));
end

Wolfram

code[x_, y_, z_] := N[(x / N[(z / N[(z + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.2%

   \[\frac{x \cdot \left(y + z\right)}{z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{z}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot \left(y + z\right)}}{z} \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{x \cdot \frac{y + z}{z}} \]

   4. clear-num N/A

      \[\leadsto x \cdot \color{blue}{\frac{1}{\frac{z}{y + z}}} \]

   5. un-div-inv N/A

      \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

   7. lower-/.f64 96.7

      \[\leadsto \frac{x}{\color{blue}{\frac{z}{y + z}}} \]

4. Applied rewrites 96.7%

   \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

5. Final simplification 96.7%

   \[\leadsto \frac{x}{\frac{z}{z + y}} \]
6. Add Preprocessing

Alternative 4: 96.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, \frac{y}{z}, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma x (/ y z) x))

C

double code(double x, double y, double z) {
	return fma(x, (y / z), x);
}

Julia

function code(x, y, z)
	return fma(x, Float64(y / z), x)
end

Wolfram

code[x_, y_, z_] := N[(x * N[(y / z), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 85.2%

   \[\frac{x \cdot \left(y + z\right)}{z} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{z}} \]
4. Step-by-step derivation

   1. associate-/l* N/A

      \[\leadsto \color{blue}{x \cdot \frac{y + z}{z}} \]

   2. +-commutative N/A

      \[\leadsto x \cdot \frac{\color{blue}{z + y}}{z} \]

   3. *-lft-identity N/A

      \[\leadsto x \cdot \frac{z + \color{blue}{1 \cdot y}}{z} \]

   4. metadata-eval N/A

      \[\leadsto x \cdot \frac{z + \color{blue}{\left(\mathsf{neg}\left(-1\right)\right)} \cdot y}{z} \]

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

      \[\leadsto x \cdot \frac{\color{blue}{z - -1 \cdot y}}{z} \]

   6. div-sub N/A

      \[\leadsto x \cdot \color{blue}{\left(\frac{z}{z} - \frac{-1 \cdot y}{z}\right)} \]

   7. *-inverses N/A

      \[\leadsto x \cdot \left(\color{blue}{1} - \frac{-1 \cdot y}{z}\right) \]

   8. associate-*r/ N/A

      \[\leadsto x \cdot \left(1 - \color{blue}{-1 \cdot \frac{y}{z}}\right) \]

   9. distribute-rgt-out-- N/A

      \[\leadsto \color{blue}{1 \cdot x - \left(-1 \cdot \frac{y}{z}\right) \cdot x} \]

   10. *-lft-identity N/A

       \[\leadsto \color{blue}{x} - \left(-1 \cdot \frac{y}{z}\right) \cdot x \]

   11. mul-1-neg N/A

       \[\leadsto x - \color{blue}{\left(\mathsf{neg}\left(\frac{y}{z}\right)\right)} \cdot x \]

   12. cancel-sign-sub N/A

       \[\leadsto \color{blue}{x + \frac{y}{z} \cdot x} \]

   13. distribute-rgt1-in N/A

       \[\leadsto \color{blue}{\left(\frac{y}{z} + 1\right) \cdot x} \]

   14. distribute-lft1-in N/A

       \[\leadsto \color{blue}{\frac{y}{z} \cdot x + x} \]

   15. *-commutative N/A

       \[\leadsto \color{blue}{x \cdot \frac{y}{z}} + x \]

   16. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{y}{z}, x\right)} \]

   17. lower-/.f64 95.9

       \[\leadsto \mathsf{fma}\left(x, \color{blue}{\frac{y}{z}}, x\right) \]

5. Applied rewrites 95.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{y}{z}, x\right)} \]
6. Add Preprocessing

Alternative 5: 50.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \frac{x}{1} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ x 1.0))

C

double code(double x, double y, double z) {
	return x / 1.0;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x / 1.0d0
end function

Java

public static double code(double x, double y, double z) {
	return x / 1.0;
}

Python

def code(x, y, z):
	return x / 1.0

Julia

function code(x, y, z)
	return Float64(x / 1.0)
end

MATLAB

function tmp = code(x, y, z)
	tmp = x / 1.0;
end

Wolfram

code[x_, y_, z_] := N[(x / 1.0), $MachinePrecision]

Derivation

1. Initial program 85.2%

   \[\frac{x \cdot \left(y + z\right)}{z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot \left(y + z\right)}{z}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot \left(y + z\right)}}{z} \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{x \cdot \frac{y + z}{z}} \]

   4. clear-num N/A

      \[\leadsto x \cdot \color{blue}{\frac{1}{\frac{z}{y + z}}} \]

   5. un-div-inv N/A

      \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

   7. lower-/.f64 96.7

      \[\leadsto \frac{x}{\color{blue}{\frac{z}{y + z}}} \]

4. Applied rewrites 96.7%

   \[\leadsto \color{blue}{\frac{x}{\frac{z}{y + z}}} \]

5. Taylor expanded in z around inf

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

7. Applied rewrites 52.7%

   \[\leadsto \frac{x}{\color{blue}{1}} \]
8. Add Preprocessing

Developer Target 1: 96.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{x}{\frac{z}{y + z}} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ x (/ z (+ y z))))

C

double code(double x, double y, double z) {
	return x / (z / (y + z));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x / (z / (y + z))
end function

Java

public static double code(double x, double y, double z) {
	return x / (z / (y + z));
}

Python

def code(x, y, z):
	return x / (z / (y + z))

Julia

function code(x, y, z)
	return Float64(x / Float64(z / Float64(y + z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = x / (z / (y + z));
end

Wolfram

code[x_, y_, z_] := N[(x / N[(z / N[(y + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024233 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:choose from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (/ x (/ z (+ y z))))

  (/ (* x (+ y z)) z))