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

Percentage Accurate: 100.0% → 100.0%

Time: 10.8s

Alternatives: 11

Speedup: 1.0×

• 26.6% 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. Add Preprocessing
3. Add Preprocessing

Alternative 2: 48.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -1e21

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   if -1e21 < (+.f64 x y) < 3.99999999999999969e-65

   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. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 77.7

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

   5. Applied rewrites 77.7%

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

   if 3.99999999999999969e-65 < (+.f64 x y)

   1. Initial program 99.9%

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

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

      2. associate-*l/ N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 42.6

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

   5. Applied rewrites 42.6%

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

4. Final simplification 48.8%

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

Alternative 3: 48.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -1e21

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   if -1e21 < (+.f64 x y) < 3.99999999999999969e-65

   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. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 77.7

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

   5. Applied rewrites 77.7%

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

   7. Applied rewrites 77.4%

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

   if 3.99999999999999969e-65 < (+.f64 x y)

   1. Initial program 99.9%

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

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

      2. associate-*l/ N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 42.6

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

   5. Applied rewrites 42.6%

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

4. Final simplification 48.7%

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

Alternative 4: 81.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* z -0.5) t)))
   (if (<= z -6e+38) t_1 (if (<= z 3.6e+76) (* (/ 0.5 t) (+ x y)) t_1))))

C

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

Python

def code(x, y, z, t):
	t_1 = (z * -0.5) / t
	tmp = 0
	if z <= -6e+38:
		tmp = t_1
	elif z <= 3.6e+76:
		tmp = (0.5 / t) * (x + y)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * -0.5) / t)
	tmp = 0.0
	if (z <= -6e+38)
		tmp = t_1;
	elseif (z <= 3.6e+76)
		tmp = Float64(Float64(0.5 / t) * Float64(x + y));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * -0.5) / t;
	tmp = 0.0;
	if (z <= -6e+38)
		tmp = t_1;
	elseif (z <= 3.6e+76)
		tmp = (0.5 / t) * (x + y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -6.0000000000000002e38 or 3.6000000000000003e76 < z

   1. Initial program 99.9%

      \[\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. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 71.2

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

   5. Applied rewrites 71.2%

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

   if -6.0000000000000002e38 < z < 3.6000000000000003e76

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

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

      11. lift-+.f64 N/A

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

      12. associate--l+ N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-+.f64 91.0

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

   7. Applied rewrites 91.0%

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

Alternative 5: 68.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 67.7

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

   5. Applied rewrites 67.7%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower--.f64 66.8

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

   5. Applied rewrites 66.8%

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

Alternative 6: 73.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 3.99999999999999969e-65

   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 71.0

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

   5. Applied rewrites 71.0%

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

   if 3.99999999999999969e-65 < (+.f64 x y)

   1. Initial program 99.9%

      \[\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 79.6

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

   5. Applied rewrites 79.6%

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

4. Final simplification 75.0%

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

Alternative 7: 73.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 3.99999999999999969e-65

   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 71.0

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

   5. Applied rewrites 71.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lift-/.f64 N/A

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

      9. lower-*.f64 70.8

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

   7. Applied rewrites 70.8%

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

   if 3.99999999999999969e-65 < (+.f64 x y)

   1. Initial program 99.9%

      \[\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 79.6

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

   5. Applied rewrites 79.6%

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

4. Final simplification 74.8%

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

Alternative 8: 73.3% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 3.99999999999999969e-65

   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 71.0

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

   5. Applied rewrites 71.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lift-/.f64 N/A

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

      9. lower-*.f64 70.8

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

   7. Applied rewrites 70.8%

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

   if 3.99999999999999969e-65 < (+.f64 x y)

   1. Initial program 99.9%

      \[\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.8

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

      11. lift-+.f64 N/A

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

      12. associate--l+ N/A

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

      13. lower-+.f64 N/A

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

      14. lower--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-+.f64 79.5

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

   7. Applied rewrites 79.5%

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

Alternative 9: 43.0% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -1e21

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 40.7

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

   5. Applied rewrites 40.7%

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

   if -1e21 < (+.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. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 41.1

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

   5. Applied rewrites 41.1%

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

   7. Applied rewrites 41.0%

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

4. Final simplification 40.9%

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

Alternative 10: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(0.5 / t), $MachinePrecision] * N[(x + N[(y - z), $MachinePrecision]), $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 \color{blue}{\left(\left(x + y\right) - z\right)} \]

   11. lift-+.f64 N/A

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

   12. associate--l+ N/A

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

   13. lower-+.f64 N/A

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

   14. lower--.f64 99.7

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

4. Applied rewrites 99.7%

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

Alternative 11: 37.6% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in z around inf

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

   1. associate-*r/ N/A

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

   2. lower-/.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 35.6

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

5. Applied rewrites 35.6%

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

7. Applied rewrites 35.5%

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

8. Final simplification 35.5%

   \[\leadsto z \cdot \frac{-0.5}{t} \]
9. Add Preprocessing

Reproduce

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