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

Percentage Accurate: 100.0% → 100.0%

Time: 7.6s

Alternatives: 11

Speedup: 1.0×

• 26.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: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((y + x) - z) / (2.0 * 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 = ((y + x) - z) / (2.0d0 * t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 2: 51.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y + x) <= -1e+53) {
		tmp = (0.5 * x) / t;
	} else if ((y + x) <= 1e+39) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (0.5 * y) / t;
	}
	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 ((y + x) <= (-1d+53)) then
        tmp = (0.5d0 * x) / t
    else if ((y + x) <= 1d+39) then
        tmp = ((-0.5d0) * z) / t
    else
        tmp = (0.5d0 * y) / t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.9999999999999999e52

   1. Initial program 99.9%

      \[\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. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 42.3

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

   5. Applied rewrites 42.3%

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

   7. Applied rewrites 42.4%

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

   if -9.9999999999999999e52 < (+.f64 x y) < 9.9999999999999994e38

   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 72.0

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

   5. Applied rewrites 72.0%

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

   7. Applied rewrites 72.1%

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

   if 9.9999999999999994e38 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 36.7

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

   5. Applied rewrites 36.7%

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

   7. Applied rewrites 36.8%

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

4. Final simplification 49.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + x \leq -1 \cdot 10^{+53}:\\ \;\;\;\;\frac{0.5 \cdot x}{t}\\ \mathbf{elif}\;y + x \leq 10^{+39}:\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5 \cdot y}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 51.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y + x) <= -1e+53) {
		tmp = (0.5 * x) / t;
	} else if ((y + x) <= 1e+39) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (0.5 / t) * y;
	}
	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 ((y + x) <= (-1d+53)) then
        tmp = (0.5d0 * x) / t
    else if ((y + x) <= 1d+39) then
        tmp = ((-0.5d0) * z) / t
    else
        tmp = (0.5d0 / t) * y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.9999999999999999e52

   1. Initial program 99.9%

      \[\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. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 42.3

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

   5. Applied rewrites 42.3%

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

   7. Applied rewrites 42.4%

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

   if -9.9999999999999999e52 < (+.f64 x y) < 9.9999999999999994e38

   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 72.0

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

   5. Applied rewrites 72.0%

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

   7. Applied rewrites 72.1%

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

   if 9.9999999999999994e38 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 36.7

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

   5. Applied rewrites 36.7%

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

4. Final simplification 49.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + x \leq -1 \cdot 10^{+53}:\\ \;\;\;\;\frac{0.5 \cdot x}{t}\\ \mathbf{elif}\;y + x \leq 10^{+39}:\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{t} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 51.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y + x) <= -1e+53) {
		tmp = (0.5 / t) * x;
	} else if ((y + x) <= 1e+39) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (0.5 / t) * y;
	}
	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 ((y + x) <= (-1d+53)) then
        tmp = (0.5d0 / t) * x
    else if ((y + x) <= 1d+39) then
        tmp = ((-0.5d0) * z) / t
    else
        tmp = (0.5d0 / t) * y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.9999999999999999e52

   1. Initial program 99.9%

      \[\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. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 42.3

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

   5. Applied rewrites 42.3%

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

   if -9.9999999999999999e52 < (+.f64 x y) < 9.9999999999999994e38

   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 72.0

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

   5. Applied rewrites 72.0%

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

   7. Applied rewrites 72.1%

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

   if 9.9999999999999994e38 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 36.7

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

   5. Applied rewrites 36.7%

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

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + x \leq -1 \cdot 10^{+53}:\\ \;\;\;\;\frac{0.5}{t} \cdot x\\ \mathbf{elif}\;y + x \leq 10^{+39}:\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{t} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 51.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y + x) <= -1e+53) {
		tmp = (0.5 / t) * x;
	} else if ((y + x) <= 1e+39) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (0.5 / t) * y;
	}
	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 ((y + x) <= (-1d+53)) then
        tmp = (0.5d0 / t) * x
    else if ((y + x) <= 1d+39) then
        tmp = ((-0.5d0) / t) * z
    else
        tmp = (0.5d0 / t) * y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.9999999999999999e52

   1. Initial program 99.9%

      \[\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. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 42.3

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

   5. Applied rewrites 42.3%

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

   if -9.9999999999999999e52 < (+.f64 x y) < 9.9999999999999994e38

   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 72.0

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

   5. Applied rewrites 72.0%

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

   if 9.9999999999999994e38 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 36.7

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

   5. Applied rewrites 36.7%

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

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + x \leq -1 \cdot 10^{+53}:\\ \;\;\;\;\frac{0.5}{t} \cdot x\\ \mathbf{elif}\;y + x \leq 10^{+39}:\\ \;\;\;\;\frac{-0.5}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{t} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 86.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - z}{2 \cdot t}\\ \mathbf{if}\;z \leq -10500000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.6 \cdot 10^{+23}:\\ \;\;\;\;\frac{y + x}{2 \cdot t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x z) (* 2.0 t))))
   (if (<= z -10500000000.0)
     t_1
     (if (<= z 2.6e+23) (/ (+ y x) (* 2.0 t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - z) / (2.0 * t);
	double tmp;
	if (z <= -10500000000.0) {
		tmp = t_1;
	} else if (z <= 2.6e+23) {
		tmp = (y + x) / (2.0 * t);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (x - z) / (2.0d0 * t)
    if (z <= (-10500000000.0d0)) then
        tmp = t_1
    else if (z <= 2.6d+23) then
        tmp = (y + x) / (2.0d0 * t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	t_1 = (x - z) / (2.0 * t)
	tmp = 0
	if z <= -10500000000.0:
		tmp = t_1
	elif z <= 2.6e+23:
		tmp = (y + x) / (2.0 * t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - z) / Float64(2.0 * t))
	tmp = 0.0
	if (z <= -10500000000.0)
		tmp = t_1;
	elseif (z <= 2.6e+23)
		tmp = Float64(Float64(y + x) / Float64(2.0 * t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - z) / (2.0 * t);
	tmp = 0.0;
	if (z <= -10500000000.0)
		tmp = t_1;
	elseif (z <= 2.6e+23)
		tmp = (y + x) / (2.0 * t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - z), $MachinePrecision] / N[(2.0 * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -10500000000.0], t$95$1, If[LessEqual[z, 2.6e+23], N[(N[(y + x), $MachinePrecision] / N[(2.0 * t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.05e10 or 2.59999999999999992e23 < z

   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 82.2

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

   5. Applied rewrites 82.2%

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

   if -1.05e10 < z < 2.59999999999999992e23

   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 \frac{\color{blue}{x + y}}{t \cdot 2} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 94.9

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

   5. Applied rewrites 94.9%

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

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -10500000000:\\ \;\;\;\;\frac{x - z}{2 \cdot t}\\ \mathbf{elif}\;z \leq 2.6 \cdot 10^{+23}:\\ \;\;\;\;\frac{y + x}{2 \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - z}{2 \cdot t}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 86.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x - z\right) \cdot \frac{0.5}{t}\\ \mathbf{if}\;z \leq -10500000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{+23}:\\ \;\;\;\;\frac{y + x}{2 \cdot t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- x z) (/ 0.5 t))))
   (if (<= z -10500000000.0)
     t_1
     (if (<= z 2.65e+23) (/ (+ y x) (* 2.0 t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - z) * (0.5 / t);
	double tmp;
	if (z <= -10500000000.0) {
		tmp = t_1;
	} else if (z <= 2.65e+23) {
		tmp = (y + x) / (2.0 * t);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (x - z) * (0.5d0 / t)
    if (z <= (-10500000000.0d0)) then
        tmp = t_1
    else if (z <= 2.65d+23) then
        tmp = (y + x) / (2.0d0 * t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	t_1 = (x - z) * (0.5 / t)
	tmp = 0
	if z <= -10500000000.0:
		tmp = t_1
	elif z <= 2.65e+23:
		tmp = (y + x) / (2.0 * t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - z) * Float64(0.5 / t))
	tmp = 0.0
	if (z <= -10500000000.0)
		tmp = t_1;
	elseif (z <= 2.65e+23)
		tmp = Float64(Float64(y + x) / Float64(2.0 * t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - z) * (0.5 / t);
	tmp = 0.0;
	if (z <= -10500000000.0)
		tmp = t_1;
	elseif (z <= 2.65e+23)
		tmp = (y + x) / (2.0 * t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - z), $MachinePrecision] * N[(0.5 / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -10500000000.0], t$95$1, If[LessEqual[z, 2.65e+23], N[(N[(y + x), $MachinePrecision] / N[(2.0 * t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.05e10 or 2.6500000000000001e23 < z

   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 \color{blue}{\frac{\left(x + y\right) - z}{t \cdot 2}} \]

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. metadata-eval 99.7

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 99.7

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\frac{1}{2}}{t} \cdot \color{blue}{\left(x - z\right)} \]
   6. Step-by-step derivation

      1. lower--.f64 82.1

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

   7. Applied rewrites 82.1%

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

   if -1.05e10 < z < 2.6500000000000001e23

   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 \frac{\color{blue}{x + y}}{t \cdot 2} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 94.9

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

   5. Applied rewrites 94.9%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -10500000000:\\ \;\;\;\;\left(x - z\right) \cdot \frac{0.5}{t}\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{+23}:\\ \;\;\;\;\frac{y + x}{2 \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\left(x - z\right) \cdot \frac{0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 62.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y + x) <= 1e+39) {
		tmp = (x - z) * (0.5 / t);
	} else {
		tmp = (0.5 * y) / t;
	}
	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 ((y + x) <= 1d+39) then
        tmp = (x - z) * (0.5d0 / t)
    else
        tmp = (0.5d0 * y) / t
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 9.9999999999999994e38

   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 \color{blue}{\frac{\left(x + y\right) - z}{t \cdot 2}} \]

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. metadata-eval 99.7

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 99.7

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{\frac{1}{2}}{t} \cdot \color{blue}{\left(x - z\right)} \]
   6. Step-by-step derivation

      1. lower--.f64 69.1

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

   7. Applied rewrites 69.1%

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

   if 9.9999999999999994e38 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 36.7

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

   5. Applied rewrites 36.7%

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

   7. Applied rewrites 36.8%

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

4. Final simplification 57.8%

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

Alternative 9: 44.4% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y + x) <= -1e+53) {
		tmp = (0.5 / t) * x;
	} else {
		tmp = (-0.5 / t) * z;
	}
	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 ((y + x) <= (-1d+53)) then
        tmp = (0.5d0 / t) * x
    else
        tmp = ((-0.5d0) / t) * z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -9.9999999999999999e52

   1. Initial program 99.9%

      \[\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. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 42.3

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

   5. Applied rewrites 42.3%

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

   if -9.9999999999999999e52 < (+.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 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 47.0

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

   5. Applied rewrites 47.0%

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

4. Final simplification 45.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + x \leq -1 \cdot 10^{+53}:\\ \;\;\;\;\frac{0.5}{t} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{-0.5}{t} \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((y + x) - z) * (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 = ((y + x) - z) * (0.5d0 / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(y + x), $MachinePrecision] - z), $MachinePrecision] * 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. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. clear-num N/A

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

   3. associate-/r/ N/A

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

   4. lower-*.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. associate-/r* N/A

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

   8. lower-/.f64 N/A

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

   9. metadata-eval 99.7

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

   10. lift-+.f64 N/A

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

   11. +-commutative N/A

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

   12. lower-+.f64 99.7

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

4. Applied rewrites 99.7%

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

5. Final simplification 99.7%

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

Alternative 11: 37.1% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

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 = ((-0.5d0) / t) * z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 36.7

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

5. Applied rewrites 36.7%

   \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]
6. Add Preprocessing

Reproduce

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