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

Percentage Accurate: 99.9% → 99.6%

Time: 5.5s

Alternatives: 8

Speedup: N/A×

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{-0.5}{\frac{t}{z - \left(x + y\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(-0.5 / Float64(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[(-0.5 / N[(t / N[(z - N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

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

   1. sub-neg 99.6%

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

   2. +-commutative 99.6%

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

   3. neg-sub0 99.6%

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

   4. associate-+l- 99.6%

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

   5. sub0-neg 99.6%

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

   6. neg-mul-1 99.6%

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

   7. associate-*l/ 99.3%

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

   8. *-commutative 99.3%

      \[\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. associate-*l/ 100.0%

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

   2. associate-/l* 99.7%

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

5. Applied egg-rr 99.7%

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

6. Final simplification 99.7%

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

Alternative 2: 47.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.9 \cdot 10^{+34}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{elif}\;x \leq -8.5 \cdot 10^{-196} \lor \neg \left(x \leq -1.45 \cdot 10^{-233}\right) \land x \leq -6.8 \cdot 10^{-283}:\\ \;\;\;\;\frac{z}{\frac{t}{-0.5}}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -3.9e+34)
   (* 0.5 (/ x t))
   (if (or (<= x -8.5e-196) (and (not (<= x -1.45e-233)) (<= x -6.8e-283)))
     (/ z (/ t -0.5))
     (* 0.5 (/ y t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -3.9e+34) {
		tmp = 0.5 * (x / t);
	} else if ((x <= -8.5e-196) || (!(x <= -1.45e-233) && (x <= -6.8e-283))) {
		tmp = z / (t / -0.5);
	} 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 (x <= (-3.9d+34)) then
        tmp = 0.5d0 * (x / t)
    else if ((x <= (-8.5d-196)) .or. (.not. (x <= (-1.45d-233))) .and. (x <= (-6.8d-283))) then
        tmp = z / (t / (-0.5d0))
    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 (x <= -3.9e+34) {
		tmp = 0.5 * (x / t);
	} else if ((x <= -8.5e-196) || (!(x <= -1.45e-233) && (x <= -6.8e-283))) {
		tmp = z / (t / -0.5);
	} else {
		tmp = 0.5 * (y / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -3.9e+34:
		tmp = 0.5 * (x / t)
	elif (x <= -8.5e-196) or (not (x <= -1.45e-233) and (x <= -6.8e-283)):
		tmp = z / (t / -0.5)
	else:
		tmp = 0.5 * (y / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -3.9e+34)
		tmp = Float64(0.5 * Float64(x / t));
	elseif ((x <= -8.5e-196) || (!(x <= -1.45e-233) && (x <= -6.8e-283)))
		tmp = Float64(z / Float64(t / -0.5));
	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 (x <= -3.9e+34)
		tmp = 0.5 * (x / t);
	elseif ((x <= -8.5e-196) || (~((x <= -1.45e-233)) && (x <= -6.8e-283)))
		tmp = z / (t / -0.5);
	else
		tmp = 0.5 * (y / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -3.9e+34], N[(0.5 * N[(x / t), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[x, -8.5e-196], And[N[Not[LessEqual[x, -1.45e-233]], $MachinePrecision], LessEqual[x, -6.8e-283]]], N[(z / N[(t / -0.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y / t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.90000000000000019e34

   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 63.9%

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

   if -3.90000000000000019e34 < x < -8.50000000000000004e-196 or -1.44999999999999991e-233 < x < -6.7999999999999996e-283

   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 64.8%

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

      1. *-commutative 64.8%

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

      2. associate-/r/ 64.8%

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

   6. Simplified 64.8%

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

   if -8.50000000000000004e-196 < x < -1.44999999999999991e-233 or -6.7999999999999996e-283 < x

   1. Initial program 99.2%

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

      1. sub-neg 99.2%

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

      2. +-commutative 99.2%

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

      3. neg-sub0 99.2%

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

      4. associate-+l- 99.2%

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

      5. sub0-neg 99.2%

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

      6. neg-mul-1 99.2%

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

      7. associate-*l/ 98.9%

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

      8. *-commutative 98.9%

         \[\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 54.5%

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

4. Final simplification 59.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.9 \cdot 10^{+34}:\\ \;\;\;\;0.5 \cdot \frac{x}{t}\\ \mathbf{elif}\;x \leq -8.5 \cdot 10^{-196} \lor \neg \left(x \leq -1.45 \cdot 10^{-233}\right) \land x \leq -6.8 \cdot 10^{-283}:\\ \;\;\;\;\frac{z}{\frac{t}{-0.5}}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{t}\\ \end{array} \]

Alternative 3: 77.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4.3 \cdot 10^{-19} \lor \neg \left(y \leq 23\right) \land y \leq 2.8 \cdot 10^{+100}:\\ \;\;\;\;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 (or (<= y 4.3e-19) (and (not (<= y 23.0)) (<= y 2.8e+100)))
   (* 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 <= 4.3e-19) || (!(y <= 23.0) && (y <= 2.8e+100))) {
		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 <= 4.3d-19) .or. (.not. (y <= 23.0d0)) .and. (y <= 2.8d+100)) 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 <= 4.3e-19) || (!(y <= 23.0) && (y <= 2.8e+100))) {
		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 <= 4.3e-19) or (not (y <= 23.0) and (y <= 2.8e+100)):
		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 <= 4.3e-19) || (!(y <= 23.0) && (y <= 2.8e+100)))
		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 <= 4.3e-19) || (~((y <= 23.0)) && (y <= 2.8e+100)))
		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[Or[LessEqual[y, 4.3e-19], And[N[Not[LessEqual[y, 23.0]], $MachinePrecision], LessEqual[y, 2.8e+100]]], 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 < 4.3e-19 or 23 < y < 2.7999999999999998e100

   1. Initial program 99.5%

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

   2. Taylor expanded in y around 0 73.6%

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

   if 4.3e-19 < y < 23 or 2.7999999999999998e100 < y

   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 0 94.2%

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

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4.3 \cdot 10^{-19} \lor \neg \left(y \leq 23\right) \land y \leq 2.8 \cdot 10^{+100}:\\ \;\;\;\;0.5 \cdot \frac{x - z}{t}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x + y}{t}\\ \end{array} \]

Alternative 4: 77.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 0.5 \cdot \frac{x - z}{t}\\ \mathbf{if}\;x \leq -1.1 \cdot 10^{+125}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -2.3 \cdot 10^{+102}:\\ \;\;\;\;0.5 \cdot \frac{x + y}{t}\\ \mathbf{elif}\;x \leq -3.9 \cdot 10^{-81}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y - z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* 0.5 (/ (- x z) t))))
   (if (<= x -1.1e+125)
     t_1
     (if (<= x -2.3e+102)
       (* 0.5 (/ (+ x y) t))
       (if (<= x -3.9e-81) t_1 (* 0.5 (/ (- y z) t)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = 0.5 * ((x - z) / t);
	double tmp;
	if (x <= -1.1e+125) {
		tmp = t_1;
	} else if (x <= -2.3e+102) {
		tmp = 0.5 * ((x + y) / t);
	} else if (x <= -3.9e-81) {
		tmp = t_1;
	} else {
		tmp = 0.5 * ((y - z) / 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) :: tmp
    t_1 = 0.5d0 * ((x - z) / t)
    if (x <= (-1.1d+125)) then
        tmp = t_1
    else if (x <= (-2.3d+102)) then
        tmp = 0.5d0 * ((x + y) / t)
    else if (x <= (-3.9d-81)) then
        tmp = t_1
    else
        tmp = 0.5d0 * ((y - z) / 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 - z) / t);
	double tmp;
	if (x <= -1.1e+125) {
		tmp = t_1;
	} else if (x <= -2.3e+102) {
		tmp = 0.5 * ((x + y) / t);
	} else if (x <= -3.9e-81) {
		tmp = t_1;
	} else {
		tmp = 0.5 * ((y - z) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = 0.5 * ((x - z) / t)
	tmp = 0
	if x <= -1.1e+125:
		tmp = t_1
	elif x <= -2.3e+102:
		tmp = 0.5 * ((x + y) / t)
	elif x <= -3.9e-81:
		tmp = t_1
	else:
		tmp = 0.5 * ((y - z) / t)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(0.5 * Float64(Float64(x - z) / t))
	tmp = 0.0
	if (x <= -1.1e+125)
		tmp = t_1;
	elseif (x <= -2.3e+102)
		tmp = Float64(0.5 * Float64(Float64(x + y) / t));
	elseif (x <= -3.9e-81)
		tmp = t_1;
	else
		tmp = Float64(0.5 * Float64(Float64(y - z) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = 0.5 * ((x - z) / t);
	tmp = 0.0;
	if (x <= -1.1e+125)
		tmp = t_1;
	elseif (x <= -2.3e+102)
		tmp = 0.5 * ((x + y) / t);
	elseif (x <= -3.9e-81)
		tmp = t_1;
	else
		tmp = 0.5 * ((y - z) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(0.5 * N[(N[(x - z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.1e+125], t$95$1, If[LessEqual[x, -2.3e+102], N[(0.5 * N[(N[(x + y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.9e-81], t$95$1, N[(0.5 * N[(N[(y - z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.09999999999999995e125 or -2.2999999999999999e102 < x < -3.89999999999999985e-81

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0 82.6%

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

   if -1.09999999999999995e125 < x < -2.2999999999999999e102

   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.8%

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

      8. *-commutative 99.8%

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

      9. associate-/r* 99.8%

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

      10. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in z around 0 100.0%

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

   if -3.89999999999999985e-81 < x

   1. Initial program 99.4%

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

   2. Taylor expanded in x around 0 81.1%

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

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.1 \cdot 10^{+125}:\\ \;\;\;\;0.5 \cdot \frac{x - z}{t}\\ \mathbf{elif}\;x \leq -2.3 \cdot 10^{+102}:\\ \;\;\;\;0.5 \cdot \frac{x + y}{t}\\ \mathbf{elif}\;x \leq -3.9 \cdot 10^{-81}:\\ \;\;\;\;0.5 \cdot \frac{x - z}{t}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y - z}{t}\\ \end{array} \]

Alternative 5: 82.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.2 \cdot 10^{+148} \lor \neg \left(z \leq 3.1 \cdot 10^{+135}\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 -5.2e+148) (not (<= z 3.1e+135)))
   (/ z (/ t -0.5))
   (* 0.5 (/ (+ x y) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -5.2e+148) || !(z <= 3.1e+135)) {
		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 <= (-5.2d+148)) .or. (.not. (z <= 3.1d+135))) 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 <= -5.2e+148) || !(z <= 3.1e+135)) {
		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 <= -5.2e+148) or not (z <= 3.1e+135):
		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 <= -5.2e+148) || !(z <= 3.1e+135))
		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 <= -5.2e+148) || ~((z <= 3.1e+135)))
		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, -5.2e+148], N[Not[LessEqual[z, 3.1e+135]], $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 < -5.2e148 or 3.10000000000000022e135 < 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 75.5%

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

      1. *-commutative 75.5%

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

      2. associate-/r/ 75.5%

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

   6. Simplified 75.5%

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

   if -5.2e148 < z < 3.10000000000000022e135

   1. Initial program 99.5%

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

      1. sub-neg 99.5%

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

      2. +-commutative 99.5%

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

      3. neg-sub0 99.5%

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

      4. associate-+l- 99.5%

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

      5. sub0-neg 99.5%

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

      6. neg-mul-1 99.5%

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

      7. associate-*l/ 99.1%

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

      8. *-commutative 99.1%

         \[\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 86.6%

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

4. Final simplification 83.7%

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

Alternative 6: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. sub-neg 99.6%

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

   2. +-commutative 99.6%

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

   3. neg-sub0 99.6%

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

   4. associate-+l- 99.6%

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

   5. sub0-neg 99.6%

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

   6. neg-mul-1 99.6%

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

   7. associate-*l/ 99.3%

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

   8. *-commutative 99.3%

      \[\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. Final simplification 99.6%

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

Alternative 7: 45.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.6 \cdot 10^{-82}:\\ \;\;\;\;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 (<= x -4.6e-82) (* 0.5 (/ x t)) (* 0.5 (/ y t))))

C

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

Python

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -4.6e-82)
		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 (x <= -4.6e-82)
		tmp = 0.5 * (x / t);
	else
		tmp = 0.5 * (y / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -4.6e-82], 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 x < -4.59999999999999994e-82

   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 54.0%

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

   if -4.59999999999999994e-82 < x

   1. Initial program 99.4%

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

      1. sub-neg 99.4%

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

      2. +-commutative 99.4%

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

      3. neg-sub0 99.4%

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

      4. associate-+l- 99.4%

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

      5. sub0-neg 99.4%

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

      6. neg-mul-1 99.4%

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

      7. associate-*l/ 99.1%

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

      8. *-commutative 99.1%

         \[\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 50.2%

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

4. Final simplification 51.5%

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

Alternative 8: 37.6% 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 99.6%

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

   1. sub-neg 99.6%

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

   2. +-commutative 99.6%

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

   3. neg-sub0 99.6%

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

   4. associate-+l- 99.6%

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

   5. sub0-neg 99.6%

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

   6. neg-mul-1 99.6%

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

   7. associate-*l/ 99.3%

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

   8. *-commutative 99.3%

      \[\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 34.7%

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

5. Final simplification 34.7%

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

Reproduce

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