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

Percentage Accurate: 100.0% → 100.0%

Time: 5.4s

Alternatives: 8

Speedup: 1.0×

• 26.7% 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(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. Final simplification 100.0%

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

Alternative 2: 45.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 0.5 \cdot \frac{x}{t}\\ t_2 := z \cdot \frac{-0.5}{t}\\ \mathbf{if}\;x \leq -8.5 \cdot 10^{+138}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -2.2 \cdot 10^{+95}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -1.95 \cdot 10^{+31}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.12 \cdot 10^{-297}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* 0.5 (/ x t))) (t_2 (* z (/ -0.5 t))))
   (if (<= x -8.5e+138)
     t_1
     (if (<= x -2.2e+95)
       t_2
       (if (<= x -1.95e+31) t_1 (if (<= x 1.12e-297) t_2 (* 0.5 (/ y t))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = 0.5 * (x / t);
	double t_2 = z * (-0.5 / t);
	double tmp;
	if (x <= -8.5e+138) {
		tmp = t_1;
	} else if (x <= -2.2e+95) {
		tmp = t_2;
	} else if (x <= -1.95e+31) {
		tmp = t_1;
	} else if (x <= 1.12e-297) {
		tmp = t_2;
	} 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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = 0.5d0 * (x / t)
    t_2 = z * ((-0.5d0) / t)
    if (x <= (-8.5d+138)) then
        tmp = t_1
    else if (x <= (-2.2d+95)) then
        tmp = t_2
    else if (x <= (-1.95d+31)) then
        tmp = t_1
    else if (x <= 1.12d-297) then
        tmp = t_2
    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 t_1 = 0.5 * (x / t);
	double t_2 = z * (-0.5 / t);
	double tmp;
	if (x <= -8.5e+138) {
		tmp = t_1;
	} else if (x <= -2.2e+95) {
		tmp = t_2;
	} else if (x <= -1.95e+31) {
		tmp = t_1;
	} else if (x <= 1.12e-297) {
		tmp = t_2;
	} else {
		tmp = 0.5 * (y / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = 0.5 * (x / t)
	t_2 = z * (-0.5 / t)
	tmp = 0
	if x <= -8.5e+138:
		tmp = t_1
	elif x <= -2.2e+95:
		tmp = t_2
	elif x <= -1.95e+31:
		tmp = t_1
	elif x <= 1.12e-297:
		tmp = t_2
	else:
		tmp = 0.5 * (y / t)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(0.5 * Float64(x / t))
	t_2 = Float64(z * Float64(-0.5 / t))
	tmp = 0.0
	if (x <= -8.5e+138)
		tmp = t_1;
	elseif (x <= -2.2e+95)
		tmp = t_2;
	elseif (x <= -1.95e+31)
		tmp = t_1;
	elseif (x <= 1.12e-297)
		tmp = t_2;
	else
		tmp = Float64(0.5 * Float64(y / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = 0.5 * (x / t);
	t_2 = z * (-0.5 / t);
	tmp = 0.0;
	if (x <= -8.5e+138)
		tmp = t_1;
	elseif (x <= -2.2e+95)
		tmp = t_2;
	elseif (x <= -1.95e+31)
		tmp = t_1;
	elseif (x <= 1.12e-297)
		tmp = t_2;
	else
		tmp = 0.5 * (y / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(0.5 * N[(x / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(-0.5 / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e+138], t$95$1, If[LessEqual[x, -2.2e+95], t$95$2, If[LessEqual[x, -1.95e+31], t$95$1, If[LessEqual[x, 1.12e-297], t$95$2, N[(0.5 * N[(y / t), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -8.5000000000000006e138 or -2.1999999999999999e95 < x < -1.95e31

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.7%

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

      8. *-commutative 99.7%

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

      9. associate-/r* 99.7%

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

      10. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 76.3%

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

   if -8.5000000000000006e138 < x < -2.1999999999999999e95 or -1.95e31 < x < 1.11999999999999997e-297

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

      1. sub-neg 99.6%

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

      2. distribute-lft-in 93.4%

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

      3. fma-def 95.9%

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

   5. Applied egg-rr 95.9%

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

   6. Taylor expanded in z around inf 55.2%

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

      1. associate-*r/ 55.2%

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

      2. associate-*l/ 55.0%

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

      3. *-commutative 55.0%

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

   8. Simplified 55.0%

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

   if 1.11999999999999997e-297 < x

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in y around inf 40.3%

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

4. Final simplification 53.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{+138}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{elif}\;x \leq -2.2 \cdot 10^{+95}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{elif}\;x \leq -1.95 \cdot 10^{+31}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{elif}\;x \leq 1.12 \cdot 10^{-297}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \]

Alternative 3: 45.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 0.5 \cdot \frac{x}{t}\\ t_2 := \frac{z}{\frac{t}{-0.5}}\\ \mathbf{if}\;x \leq -8.5 \cdot 10^{+138}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -1.5 \cdot 10^{+95}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -1.26 \cdot 10^{+31}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{-308}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* 0.5 (/ x t))) (t_2 (/ z (/ t -0.5))))
   (if (<= x -8.5e+138)
     t_1
     (if (<= x -1.5e+95)
       t_2
       (if (<= x -1.26e+31) t_1 (if (<= x 8.6e-308) t_2 (* 0.5 (/ y t))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = 0.5 * (x / t);
	double t_2 = z / (t / -0.5);
	double tmp;
	if (x <= -8.5e+138) {
		tmp = t_1;
	} else if (x <= -1.5e+95) {
		tmp = t_2;
	} else if (x <= -1.26e+31) {
		tmp = t_1;
	} else if (x <= 8.6e-308) {
		tmp = t_2;
	} 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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = 0.5d0 * (x / t)
    t_2 = z / (t / (-0.5d0))
    if (x <= (-8.5d+138)) then
        tmp = t_1
    else if (x <= (-1.5d+95)) then
        tmp = t_2
    else if (x <= (-1.26d+31)) then
        tmp = t_1
    else if (x <= 8.6d-308) then
        tmp = t_2
    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 t_1 = 0.5 * (x / t);
	double t_2 = z / (t / -0.5);
	double tmp;
	if (x <= -8.5e+138) {
		tmp = t_1;
	} else if (x <= -1.5e+95) {
		tmp = t_2;
	} else if (x <= -1.26e+31) {
		tmp = t_1;
	} else if (x <= 8.6e-308) {
		tmp = t_2;
	} else {
		tmp = 0.5 * (y / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = 0.5 * (x / t)
	t_2 = z / (t / -0.5)
	tmp = 0
	if x <= -8.5e+138:
		tmp = t_1
	elif x <= -1.5e+95:
		tmp = t_2
	elif x <= -1.26e+31:
		tmp = t_1
	elif x <= 8.6e-308:
		tmp = t_2
	else:
		tmp = 0.5 * (y / t)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(0.5 * Float64(x / t))
	t_2 = Float64(z / Float64(t / -0.5))
	tmp = 0.0
	if (x <= -8.5e+138)
		tmp = t_1;
	elseif (x <= -1.5e+95)
		tmp = t_2;
	elseif (x <= -1.26e+31)
		tmp = t_1;
	elseif (x <= 8.6e-308)
		tmp = t_2;
	else
		tmp = Float64(0.5 * Float64(y / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = 0.5 * (x / t);
	t_2 = z / (t / -0.5);
	tmp = 0.0;
	if (x <= -8.5e+138)
		tmp = t_1;
	elseif (x <= -1.5e+95)
		tmp = t_2;
	elseif (x <= -1.26e+31)
		tmp = t_1;
	elseif (x <= 8.6e-308)
		tmp = t_2;
	else
		tmp = 0.5 * (y / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(0.5 * N[(x / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z / N[(t / -0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e+138], t$95$1, If[LessEqual[x, -1.5e+95], t$95$2, If[LessEqual[x, -1.26e+31], t$95$1, If[LessEqual[x, 8.6e-308], t$95$2, N[(0.5 * N[(y / t), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -8.5000000000000006e138 or -1.49999999999999996e95 < x < -1.26000000000000001e31

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.7%

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

      8. *-commutative 99.7%

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

      9. associate-/r* 99.7%

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

      10. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 76.3%

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

   if -8.5000000000000006e138 < x < -1.49999999999999996e95 or -1.26000000000000001e31 < x < 8.60000000000000041e-308

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around inf 55.2%

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

      1. *-commutative 55.2%

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

      2. associate-/r/ 55.2%

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

   6. Simplified 55.2%

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

   if 8.60000000000000041e-308 < x

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in y around inf 40.3%

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

4. Final simplification 53.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{+138}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{elif}\;x \leq -1.5 \cdot 10^{+95}:\\ \;\;\;\;\frac{z}{\frac{t}{-0.5}}\\ \mathbf{elif}\;x \leq -1.26 \cdot 10^{+31}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{-308}:\\ \;\;\;\;\frac{z}{\frac{t}{-0.5}}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \]

Alternative 4: 81.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.1e+181) (not (<= z 1.9e+99)))
   (/ z (/ t -0.5))
   (* 0.5 (/ (+ x y) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.1e+181) || !(z <= 1.9e+99)) {
		tmp = z / (t / -0.5);
	} else {
		tmp = 0.5 * ((x + 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 ((z <= (-1.1d+181)) .or. (.not. (z <= 1.9d+99))) then
        tmp = z / (t / (-0.5d0))
    else
        tmp = 0.5d0 * ((x + y) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.1e+181) || !(z <= 1.9e+99)) {
		tmp = z / (t / -0.5);
	} else {
		tmp = 0.5 * ((x + y) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -1.1e+181) or not (z <= 1.9e+99):
		tmp = z / (t / -0.5)
	else:
		tmp = 0.5 * ((x + y) / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.1e+181) || !(z <= 1.9e+99))
		tmp = Float64(z / Float64(t / -0.5));
	else
		tmp = Float64(0.5 * Float64(Float64(x + y) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.1e+181) || ~((z <= 1.9e+99)))
		tmp = z / (t / -0.5);
	else
		tmp = 0.5 * ((x + y) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.1e+181], N[Not[LessEqual[z, 1.9e+99]], $MachinePrecision]], N[(z / N[(t / -0.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(N[(x + y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.1000000000000001e181 or 1.9e99 < z

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.7%

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

      8. *-commutative 99.7%

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

      9. associate-/r* 99.7%

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

      10. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in z around inf 76.4%

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

      1. *-commutative 76.4%

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

      2. associate-/r/ 76.4%

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

   6. Simplified 76.4%

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

   if -1.1000000000000001e181 < z < 1.9e99

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around 0 87.6%

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

4. Final simplification 84.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{+181} \lor \neg \left(z \leq 1.9 \cdot 10^{+99}\right):\\ \;\;\;\;\frac{z}{\frac{t}{-0.5}}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x + y}{t}\\ \end{array} \]

Alternative 5: 78.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 7.1999999999999994e32

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0 76.5%

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

   if 7.1999999999999994e32 < y

   1. Initial program 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in z around 0 85.6%

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

4. Final simplification 78.6%

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

Alternative 6: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 - (x + y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. neg-sub0 100.0%

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

   4. associate-+l- 100.0%

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

   5. sub0-neg 100.0%

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

   6. neg-mul-1 100.0%

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

   7. associate-*l/ 99.7%

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

   8. *-commutative 99.7%

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

   9. associate-/r* 99.7%

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

   10. metadata-eval 99.7%

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

3. Simplified 99.7%

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

4. Final simplification 99.7%

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

Alternative 7: 47.8% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 4.8e+43) (* 0.5 (/ x t)) (* 0.5 (/ y t))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.80000000000000046e43

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. associate-*l/ 99.6%

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

      8. *-commutative 99.6%

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

      9. associate-/r* 99.6%

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

      10. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in x around inf 43.4%

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

   if 4.80000000000000046e43 < y

   1. Initial program 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. associate-*l/ 99.7%

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

      8. *-commutative 99.7%

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

      9. associate-/r* 99.7%

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

      10. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in y around inf 63.6%

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

4. Final simplification 47.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4.8 \cdot 10^{+43}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \]

Alternative 8: 38.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. neg-sub0 100.0%

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

   4. associate-+l- 100.0%

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

   5. sub0-neg 100.0%

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

   6. neg-mul-1 100.0%

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

   7. associate-*l/ 99.7%

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

   8. *-commutative 99.7%

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

   9. associate-/r* 99.7%

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

   10. metadata-eval 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in x around inf 39.6%

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

5. Final simplification 39.6%

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

Reproduce

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