Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B

Percentage Accurate: 100.0% → 99.9%

Time: 7.1s

Alternatives: 10

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (/ (- (* x (/ x (- x y))) (fma y (/ y (- x y)) z)) (* t 2.0)))

C

double code(double x, double y, double z, double t) {
	return ((x * (x / (x - y))) - fma(y, (y / (x - y)), z)) / (t * 2.0);
}

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x * Float64(x / Float64(x - y))) - fma(y, Float64(y / Float64(x - y)), z)) / Float64(t * 2.0))
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. flip-+ N/A

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

   4. div-sub N/A

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

   5. associate--l- N/A

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

   6. lower--.f64 N/A

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

   7. associate-/l* N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower--.f64 N/A

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

   11. associate-/l* N/A

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

   12. lower-fma.f64 N/A

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

   13. lower-/.f64 N/A

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

   14. lower--.f64 100.0

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

4. Applied rewrites 100.0%

   \[\leadsto \frac{\color{blue}{x \cdot \frac{x}{x - y} - \mathsf{fma}\left(y, \frac{y}{x - y}, z\right)}}{t \cdot 2} \]
5. Add Preprocessing

Alternative 2: 50.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{+82}:\\ \;\;\;\;\frac{x}{t} \cdot 0.5\\ \mathbf{elif}\;x + y \leq 10^{-33}:\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e+82)
   (* (/ x t) 0.5)
   (if (<= (+ x y) 1e-33) (/ (* -0.5 z) t) (* (/ y t) 0.5))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e+82) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 1e-33) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-2d+82)) then
        tmp = (x / t) * 0.5d0
    else if ((x + y) <= 1d-33) then
        tmp = ((-0.5d0) * z) / t
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e+82) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 1e-33) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e+82:
		tmp = (x / t) * 0.5
	elif (x + y) <= 1e-33:
		tmp = (-0.5 * z) / t
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -2e+82)
		tmp = Float64(Float64(x / t) * 0.5);
	elseif (Float64(x + y) <= 1e-33)
		tmp = Float64(Float64(-0.5 * z) / t);
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e+82)
		tmp = (x / t) * 0.5;
	elseif ((x + y) <= 1e-33)
		tmp = (-0.5 * z) / t;
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -2e+82], N[(N[(x / t), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 1e-33], N[(N[(-0.5 * z), $MachinePrecision] / t), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -1.9999999999999999e82

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 47.3

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 47.3%

      \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]

   if -1.9999999999999999e82 < (+.f64 x y) < 1.0000000000000001e-33

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right)} \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right) \cdot z} \]

      7. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{1}{2} \cdot 1}{t}}\right)\right) \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{1}{2}}}{t}\right)\right) \cdot z \]

      9. distribute-neg-frac N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\frac{1}{2}\right)}{t}} \cdot z \]

      10. metadata-eval N/A

          \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      11. lower-/.f64 73.2

          \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 73.2%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]
   6. Step-by-step derivation

   7. Applied rewrites 73.4%

      \[\leadsto \frac{-0.5 \cdot z}{\color{blue}{t}} \]

   if 1.0000000000000001e-33 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 82.0

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

   5. Applied rewrites 82.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 49.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{+82}:\\ \;\;\;\;\frac{x}{t} \cdot 0.5\\ \mathbf{elif}\;x + y \leq 10^{-33}:\\ \;\;\;\;\frac{-0.5}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e+82)
   (* (/ x t) 0.5)
   (if (<= (+ x y) 1e-33) (* (/ -0.5 t) z) (* (/ y t) 0.5))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e+82) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 1e-33) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-2d+82)) then
        tmp = (x / t) * 0.5d0
    else if ((x + y) <= 1d-33) then
        tmp = ((-0.5d0) / t) * z
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e+82) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 1e-33) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e+82:
		tmp = (x / t) * 0.5
	elif (x + y) <= 1e-33:
		tmp = (-0.5 / t) * z
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -2e+82)
		tmp = Float64(Float64(x / t) * 0.5);
	elseif (Float64(x + y) <= 1e-33)
		tmp = Float64(Float64(-0.5 / t) * z);
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e+82)
		tmp = (x / t) * 0.5;
	elseif ((x + y) <= 1e-33)
		tmp = (-0.5 / t) * z;
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -2e+82], N[(N[(x / t), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 1e-33], N[(N[(-0.5 / t), $MachinePrecision] * z), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -1.9999999999999999e82

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 47.3

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 47.3%

      \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]

   if -1.9999999999999999e82 < (+.f64 x y) < 1.0000000000000001e-33

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right)} \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right) \cdot z} \]

      7. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{1}{2} \cdot 1}{t}}\right)\right) \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{1}{2}}}{t}\right)\right) \cdot z \]

      9. distribute-neg-frac N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\frac{1}{2}\right)}{t}} \cdot z \]

      10. metadata-eval N/A

          \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      11. lower-/.f64 73.2

          \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 73.2%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]

   if 1.0000000000000001e-33 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 82.0

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

   5. Applied rewrites 82.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 49.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{+82}:\\ \;\;\;\;x \cdot \frac{0.5}{t}\\ \mathbf{elif}\;x + y \leq 10^{-33}:\\ \;\;\;\;\frac{-0.5}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e+82)
   (* x (/ 0.5 t))
   (if (<= (+ x y) 1e-33) (* (/ -0.5 t) z) (* (/ y t) 0.5))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e+82) {
		tmp = x * (0.5 / t);
	} else if ((x + y) <= 1e-33) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-2d+82)) then
        tmp = x * (0.5d0 / t)
    else if ((x + y) <= 1d-33) then
        tmp = ((-0.5d0) / t) * z
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e+82) {
		tmp = x * (0.5 / t);
	} else if ((x + y) <= 1e-33) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e+82:
		tmp = x * (0.5 / t)
	elif (x + y) <= 1e-33:
		tmp = (-0.5 / t) * z
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -2e+82)
		tmp = Float64(x * Float64(0.5 / t));
	elseif (Float64(x + y) <= 1e-33)
		tmp = Float64(Float64(-0.5 / t) * z);
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e+82)
		tmp = x * (0.5 / t);
	elseif ((x + y) <= 1e-33)
		tmp = (-0.5 / t) * z;
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -2e+82], N[(x * N[(0.5 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 1e-33], N[(N[(-0.5 / t), $MachinePrecision] * z), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -1.9999999999999999e82

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 47.3

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 47.3%

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

   7. Applied rewrites 47.2%

      \[\leadsto x \cdot \color{blue}{\frac{0.5}{t}} \]

   if -1.9999999999999999e82 < (+.f64 x y) < 1.0000000000000001e-33

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right)} \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right) \cdot z} \]

      7. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{1}{2} \cdot 1}{t}}\right)\right) \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{1}{2}}}{t}\right)\right) \cdot z \]

      9. distribute-neg-frac N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\frac{1}{2}\right)}{t}} \cdot z \]

      10. metadata-eval N/A

          \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      11. lower-/.f64 73.2

          \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 73.2%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]

   if 1.0000000000000001e-33 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 82.0

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

   5. Applied rewrites 82.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 46.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 82.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.5 \cdot 10^{+84} \lor \neg \left(z \leq 2.3 \cdot 10^{+110}\right):\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -2.5e+84) (not (<= z 2.3e+110)))
   (/ (* -0.5 z) t)
   (* (/ (+ y x) t) 0.5)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -2.5e+84) || !(z <= 2.3e+110)) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = ((y + x) / t) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z <= (-2.5d+84)) .or. (.not. (z <= 2.3d+110))) then
        tmp = ((-0.5d0) * z) / t
    else
        tmp = ((y + x) / t) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -2.5e+84) || !(z <= 2.3e+110)) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = ((y + x) / t) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -2.5e+84) or not (z <= 2.3e+110):
		tmp = (-0.5 * z) / t
	else:
		tmp = ((y + x) / t) * 0.5
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -2.5e+84) || !(z <= 2.3e+110))
		tmp = Float64(Float64(-0.5 * z) / t);
	else
		tmp = Float64(Float64(Float64(y + x) / t) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -2.5e+84) || ~((z <= 2.3e+110)))
		tmp = (-0.5 * z) / t;
	else
		tmp = ((y + x) / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -2.5e+84], N[Not[LessEqual[z, 2.3e+110]], $MachinePrecision]], N[(N[(-0.5 * z), $MachinePrecision] / t), $MachinePrecision], N[(N[(N[(y + x), $MachinePrecision] / t), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.5e84 or 2.3e110 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right)} \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{t}\right)\right) \cdot z} \]

      7. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{1}{2} \cdot 1}{t}}\right)\right) \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{1}{2}}}{t}\right)\right) \cdot z \]

      9. distribute-neg-frac N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\frac{1}{2}\right)}{t}} \cdot z \]

      10. metadata-eval N/A

          \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      11. lower-/.f64 83.4

          \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 83.4%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]
   6. Step-by-step derivation

   7. Applied rewrites 83.7%

      \[\leadsto \frac{-0.5 \cdot z}{\color{blue}{t}} \]

   if -2.5e84 < z < 2.3e110

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 84.8

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

   5. Applied rewrites 84.8%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]
3. Recombined 2 regimes into one program.

4. Final simplification 84.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.5 \cdot 10^{+84} \lor \neg \left(z \leq 2.3 \cdot 10^{+110}\right):\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{t} \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 69.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-202}:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - z}{t \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e-202) (/ (- x z) (* t 2.0)) (/ (- y z) (* t 2.0))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-202) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = (y - z) / (t * 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-2d-202)) then
        tmp = (x - z) / (t * 2.0d0)
    else
        tmp = (y - z) / (t * 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-202) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = (y - z) / (t * 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e-202:
		tmp = (x - z) / (t * 2.0)
	else:
		tmp = (y - z) / (t * 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -2e-202)
		tmp = Float64(Float64(x - z) / Float64(t * 2.0));
	else
		tmp = Float64(Float64(y - z) / Float64(t * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e-202)
		tmp = (x - z) / (t * 2.0);
	else
		tmp = (y - z) / (t * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -2e-202], N[(N[(x - z), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -2.0000000000000001e-202

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 76.0

         \[\leadsto \frac{\color{blue}{x - z}}{t \cdot 2} \]

   5. Applied rewrites 76.0%

      \[\leadsto \frac{\color{blue}{x - z}}{t \cdot 2} \]

   if -2.0000000000000001e-202 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower--.f64 74.7

         \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]

   5. Applied rewrites 74.7%

      \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 74.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq 10^{-33}:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) 1e-33) (/ (- x z) (* t 2.0)) (* (/ (+ y x) t) 0.5)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= 1e-33) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = ((y + x) / t) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= 1d-33) then
        tmp = (x - z) / (t * 2.0d0)
    else
        tmp = ((y + x) / t) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= 1e-33) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = ((y + x) / t) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= 1e-33:
		tmp = (x - z) / (t * 2.0)
	else:
		tmp = ((y + x) / t) * 0.5
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= 1e-33)
		tmp = Float64(Float64(x - z) / Float64(t * 2.0));
	else
		tmp = Float64(Float64(Float64(y + x) / t) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= 1e-33)
		tmp = (x - z) / (t * 2.0);
	else
		tmp = ((y + x) / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], 1e-33], N[(N[(x - z), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y + x), $MachinePrecision] / t), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 1.0000000000000001e-33

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 78.7

         \[\leadsto \frac{\color{blue}{x - z}}{t \cdot 2} \]

   5. Applied rewrites 78.7%

      \[\leadsto \frac{\color{blue}{x - z}}{t \cdot 2} \]

   if 1.0000000000000001e-33 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 82.0

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

   5. Applied rewrites 82.0%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 37.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(x + y\right) - z \leq -2 \cdot 10^{-191}:\\ \;\;\;\;x \cdot \frac{0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (- (+ x y) z) -2e-191) (* x (/ 0.5 t)) (* (/ y t) 0.5)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x + y) - z) <= -2e-191) {
		tmp = x * (0.5 / t);
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((x + y) - z) <= (-2d-191)) then
        tmp = x * (0.5d0 / t)
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((x + y) - z) <= -2e-191) {
		tmp = x * (0.5 / t);
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x + y) - z) <= -2e-191:
		tmp = x * (0.5 / t)
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(x + y) - z) <= -2e-191)
		tmp = Float64(x * Float64(0.5 / t));
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x + y) - z) <= -2e-191)
		tmp = x * (0.5 / t);
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(x + y), $MachinePrecision] - z), $MachinePrecision], -2e-191], N[(x * N[(0.5 / t), $MachinePrecision]), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 x y) z) < -2e-191

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 38.0

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 38.0%

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

   7. Applied rewrites 37.9%

      \[\leadsto x \cdot \color{blue}{\frac{0.5}{t}} \]

   if -2e-191 < (-.f64 (+.f64 x y) z)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 67.2

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

   5. Applied rewrites 67.2%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 38.8%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 10: 37.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ x \cdot \frac{0.5}{t} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* x (/ 0.5 t)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(x * N[(0.5 / t), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

   3. lower-/.f64 36.2

      \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

5. Applied rewrites 36.2%

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

7. Applied rewrites 36.2%

   \[\leadsto x \cdot \color{blue}{\frac{0.5}{t}} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024298 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2.0)))