Graphics.Rendering.Chart.SparkLine:renderSparkLine from Chart-1.5.3

Percentage Accurate: 97.0% → 99.6%

Time: 12.5s

Alternatives: 12

Speedup: 1.0×

• could not determine a ground truth

  1. x = -4.36628989714928e-250
  2. y = -4.998914540625253e+98
  3. z = 1.0305407970263973e+288
  4. t = 7.092582999186509e-182
  5. a = 1.7021125252713047e-250

Specification

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (- x (/ (- y z) (/ (+ (- t z) 1.0) a))))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t, a):
	return x - ((y - z) / (((t - z) + 1.0) / a))

Julia

function code(x, y, z, t, a)
	return Float64(x - Float64(Float64(y - z) / Float64(Float64(Float64(t - z) + 1.0) / a)))
end

MATLAB

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

Wolfram

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

Initial Program: 97.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (- x (/ (- y z) (/ (+ (- t z) 1.0) a))))

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t, a):
	return x - ((y - z) / (((t - z) + 1.0) / a))

Julia

function code(x, y, z, t, a)
	return Float64(x - Float64(Float64(y - z) / Float64(Float64(Float64(t - z) + 1.0) / a)))
end

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.3%

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

   1. associate-/r/ 99.9%

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

3. Simplified 99.9%

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

5. Final simplification 99.9%

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

Alternative 2: 74.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + a \cdot \left(z - y\right)\\ t_2 := x - a \cdot \frac{y}{t}\\ \mathbf{if}\;z \leq -1.05 \cdot 10^{+21}:\\ \;\;\;\;x - a\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-31}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq 3.9 \cdot 10^{-260}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{-225}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq 1.02 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x - a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* a (- z y)))) (t_2 (- x (* a (/ y t)))))
   (if (<= z -1.05e+21)
     (- x a)
     (if (<= z -7.2e-31)
       t_2
       (if (<= z 3.9e-260)
         t_1
         (if (<= z 1.7e-225) t_2 (if (<= z 1.02e-7) t_1 (- x a))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (a * (z - y));
	double t_2 = x - (a * (y / t));
	double tmp;
	if (z <= -1.05e+21) {
		tmp = x - a;
	} else if (z <= -7.2e-31) {
		tmp = t_2;
	} else if (z <= 3.9e-260) {
		tmp = t_1;
	} else if (z <= 1.7e-225) {
		tmp = t_2;
	} else if (z <= 1.02e-7) {
		tmp = t_1;
	} else {
		tmp = x - a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = x + (a * (z - y))
    t_2 = x - (a * (y / t))
    if (z <= (-1.05d+21)) then
        tmp = x - a
    else if (z <= (-7.2d-31)) then
        tmp = t_2
    else if (z <= 3.9d-260) then
        tmp = t_1
    else if (z <= 1.7d-225) then
        tmp = t_2
    else if (z <= 1.02d-7) then
        tmp = t_1
    else
        tmp = x - a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (a * (z - y));
	double t_2 = x - (a * (y / t));
	double tmp;
	if (z <= -1.05e+21) {
		tmp = x - a;
	} else if (z <= -7.2e-31) {
		tmp = t_2;
	} else if (z <= 3.9e-260) {
		tmp = t_1;
	} else if (z <= 1.7e-225) {
		tmp = t_2;
	} else if (z <= 1.02e-7) {
		tmp = t_1;
	} else {
		tmp = x - a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (a * (z - y))
	t_2 = x - (a * (y / t))
	tmp = 0
	if z <= -1.05e+21:
		tmp = x - a
	elif z <= -7.2e-31:
		tmp = t_2
	elif z <= 3.9e-260:
		tmp = t_1
	elif z <= 1.7e-225:
		tmp = t_2
	elif z <= 1.02e-7:
		tmp = t_1
	else:
		tmp = x - a
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(a * Float64(z - y)))
	t_2 = Float64(x - Float64(a * Float64(y / t)))
	tmp = 0.0
	if (z <= -1.05e+21)
		tmp = Float64(x - a);
	elseif (z <= -7.2e-31)
		tmp = t_2;
	elseif (z <= 3.9e-260)
		tmp = t_1;
	elseif (z <= 1.7e-225)
		tmp = t_2;
	elseif (z <= 1.02e-7)
		tmp = t_1;
	else
		tmp = Float64(x - a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (a * (z - y));
	t_2 = x - (a * (y / t));
	tmp = 0.0;
	if (z <= -1.05e+21)
		tmp = x - a;
	elseif (z <= -7.2e-31)
		tmp = t_2;
	elseif (z <= 3.9e-260)
		tmp = t_1;
	elseif (z <= 1.7e-225)
		tmp = t_2;
	elseif (z <= 1.02e-7)
		tmp = t_1;
	else
		tmp = x - a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(a * N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x - N[(a * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.05e+21], N[(x - a), $MachinePrecision], If[LessEqual[z, -7.2e-31], t$95$2, If[LessEqual[z, 3.9e-260], t$95$1, If[LessEqual[z, 1.7e-225], t$95$2, If[LessEqual[z, 1.02e-7], t$95$1, N[(x - a), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.05e21 or 1.02e-7 < z

   1. Initial program 94.8%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 76.6%

      \[\leadsto x - \color{blue}{a} \]

   if -1.05e21 < z < -7.20000000000000007e-31 or 3.89999999999999972e-260 < z < 1.7e-225

   1. Initial program 99.8%

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

      1. associate-/r/ 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 93.8%

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

   6. Taylor expanded in y around inf 88.9%

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

   if -7.20000000000000007e-31 < z < 3.89999999999999972e-260 or 1.7e-225 < z < 1.02e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 99.2%

      \[\leadsto x - \frac{y - z}{\color{blue}{\frac{1 + t}{a}}} \]

   4. Taylor expanded in t around 0 77.1%

      \[\leadsto x - \color{blue}{a \cdot \left(y - z\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.05 \cdot 10^{+21}:\\ \;\;\;\;x - a\\ \mathbf{elif}\;z \leq -7.2 \cdot 10^{-31}:\\ \;\;\;\;x - a \cdot \frac{y}{t}\\ \mathbf{elif}\;z \leq 3.9 \cdot 10^{-260}:\\ \;\;\;\;x + a \cdot \left(z - y\right)\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{-225}:\\ \;\;\;\;x - a \cdot \frac{y}{t}\\ \mathbf{elif}\;z \leq 1.02 \cdot 10^{-7}:\\ \;\;\;\;x + a \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;x - a\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + a \cdot \left(z - y\right)\\ \mathbf{if}\;z \leq -9.8 \cdot 10^{+26}:\\ \;\;\;\;x - a\\ \mathbf{elif}\;z \leq -3 \cdot 10^{-26}:\\ \;\;\;\;x - \frac{y}{\frac{t}{a}}\\ \mathbf{elif}\;z \leq 3.1 \cdot 10^{-251}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.6 \cdot 10^{-225}:\\ \;\;\;\;x - a \cdot \frac{y}{t}\\ \mathbf{elif}\;z \leq 1.08 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x - a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* a (- z y)))))
   (if (<= z -9.8e+26)
     (- x a)
     (if (<= z -3e-26)
       (- x (/ y (/ t a)))
       (if (<= z 3.1e-251)
         t_1
         (if (<= z 2.6e-225)
           (- x (* a (/ y t)))
           (if (<= z 1.08e-7) t_1 (- x a))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (a * (z - y));
	double tmp;
	if (z <= -9.8e+26) {
		tmp = x - a;
	} else if (z <= -3e-26) {
		tmp = x - (y / (t / a));
	} else if (z <= 3.1e-251) {
		tmp = t_1;
	} else if (z <= 2.6e-225) {
		tmp = x - (a * (y / t));
	} else if (z <= 1.08e-7) {
		tmp = t_1;
	} else {
		tmp = x - a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x + (a * (z - y))
    if (z <= (-9.8d+26)) then
        tmp = x - a
    else if (z <= (-3d-26)) then
        tmp = x - (y / (t / a))
    else if (z <= 3.1d-251) then
        tmp = t_1
    else if (z <= 2.6d-225) then
        tmp = x - (a * (y / t))
    else if (z <= 1.08d-7) then
        tmp = t_1
    else
        tmp = x - a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (a * (z - y));
	double tmp;
	if (z <= -9.8e+26) {
		tmp = x - a;
	} else if (z <= -3e-26) {
		tmp = x - (y / (t / a));
	} else if (z <= 3.1e-251) {
		tmp = t_1;
	} else if (z <= 2.6e-225) {
		tmp = x - (a * (y / t));
	} else if (z <= 1.08e-7) {
		tmp = t_1;
	} else {
		tmp = x - a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (a * (z - y))
	tmp = 0
	if z <= -9.8e+26:
		tmp = x - a
	elif z <= -3e-26:
		tmp = x - (y / (t / a))
	elif z <= 3.1e-251:
		tmp = t_1
	elif z <= 2.6e-225:
		tmp = x - (a * (y / t))
	elif z <= 1.08e-7:
		tmp = t_1
	else:
		tmp = x - a
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(a * Float64(z - y)))
	tmp = 0.0
	if (z <= -9.8e+26)
		tmp = Float64(x - a);
	elseif (z <= -3e-26)
		tmp = Float64(x - Float64(y / Float64(t / a)));
	elseif (z <= 3.1e-251)
		tmp = t_1;
	elseif (z <= 2.6e-225)
		tmp = Float64(x - Float64(a * Float64(y / t)));
	elseif (z <= 1.08e-7)
		tmp = t_1;
	else
		tmp = Float64(x - a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (a * (z - y));
	tmp = 0.0;
	if (z <= -9.8e+26)
		tmp = x - a;
	elseif (z <= -3e-26)
		tmp = x - (y / (t / a));
	elseif (z <= 3.1e-251)
		tmp = t_1;
	elseif (z <= 2.6e-225)
		tmp = x - (a * (y / t));
	elseif (z <= 1.08e-7)
		tmp = t_1;
	else
		tmp = x - a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(a * N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -9.8e+26], N[(x - a), $MachinePrecision], If[LessEqual[z, -3e-26], N[(x - N[(y / N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.1e-251], t$95$1, If[LessEqual[z, 2.6e-225], N[(x - N[(a * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.08e-7], t$95$1, N[(x - a), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if z < -9.79999999999999947e26 or 1.08000000000000001e-7 < z

   1. Initial program 94.8%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 76.6%

      \[\leadsto x - \color{blue}{a} \]

   if -9.79999999999999947e26 < z < -3.00000000000000012e-26

   1. Initial program 99.7%

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

      1. associate-/r/ 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in t around inf 89.7%

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

   6. Taylor expanded in y around inf 81.5%

      \[\leadsto x - \color{blue}{\frac{y}{t}} \cdot a \]
   7. Step-by-step derivation

      1. associate-*l/ 73.9%

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

      2. associate-/l* 81.6%

         \[\leadsto x - \color{blue}{\frac{y}{\frac{t}{a}}} \]

   8. Applied egg-rr 81.6%

      \[\leadsto x - \color{blue}{\frac{y}{\frac{t}{a}}} \]

   if -3.00000000000000012e-26 < z < 3.10000000000000003e-251 or 2.60000000000000013e-225 < z < 1.08000000000000001e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 99.2%

      \[\leadsto x - \frac{y - z}{\color{blue}{\frac{1 + t}{a}}} \]

   4. Taylor expanded in t around 0 77.1%

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

   if 3.10000000000000003e-251 < z < 2.60000000000000013e-225

   1. Initial program 99.8%

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

      1. associate-/r/ 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in t around inf 100.0%

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

   6. Taylor expanded in y around inf 100.0%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9.8 \cdot 10^{+26}:\\ \;\;\;\;x - a\\ \mathbf{elif}\;z \leq -3 \cdot 10^{-26}:\\ \;\;\;\;x - \frac{y}{\frac{t}{a}}\\ \mathbf{elif}\;z \leq 3.1 \cdot 10^{-251}:\\ \;\;\;\;x + a \cdot \left(z - y\right)\\ \mathbf{elif}\;z \leq 2.6 \cdot 10^{-225}:\\ \;\;\;\;x - a \cdot \frac{y}{t}\\ \mathbf{elif}\;z \leq 1.08 \cdot 10^{-7}:\\ \;\;\;\;x + a \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;x - a\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 88.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.9 \cdot 10^{-61} \lor \neg \left(z \leq 1.05 \cdot 10^{-8}\right):\\ \;\;\;\;x + \frac{a}{\frac{\left(t - z\right) + 1}{z}}\\ \mathbf{else}:\\ \;\;\;\;x - a \cdot \frac{y}{t + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -5.9e-61) (not (<= z 1.05e-8)))
   (+ x (/ a (/ (+ (- t z) 1.0) z)))
   (- x (* a (/ y (+ t 1.0))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -5.9e-61) || !(z <= 1.05e-8)) {
		tmp = x + (a / (((t - z) + 1.0) / z));
	} else {
		tmp = x - (a * (y / (t + 1.0)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-5.9d-61)) .or. (.not. (z <= 1.05d-8))) then
        tmp = x + (a / (((t - z) + 1.0d0) / z))
    else
        tmp = x - (a * (y / (t + 1.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -5.9e-61) || !(z <= 1.05e-8)) {
		tmp = x + (a / (((t - z) + 1.0) / z));
	} else {
		tmp = x - (a * (y / (t + 1.0)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -5.9e-61) or not (z <= 1.05e-8):
		tmp = x + (a / (((t - z) + 1.0) / z))
	else:
		tmp = x - (a * (y / (t + 1.0)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -5.9e-61) || !(z <= 1.05e-8))
		tmp = Float64(x + Float64(a / Float64(Float64(Float64(t - z) + 1.0) / z)));
	else
		tmp = Float64(x - Float64(a * Float64(y / Float64(t + 1.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -5.9e-61) || ~((z <= 1.05e-8)))
		tmp = x + (a / (((t - z) + 1.0) / z));
	else
		tmp = x - (a * (y / (t + 1.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -5.9e-61], N[Not[LessEqual[z, 1.05e-8]], $MachinePrecision]], N[(x + N[(a / N[(N[(N[(t - z), $MachinePrecision] + 1.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(a * N[(y / N[(t + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -5.89999999999999972e-61 or 1.04999999999999997e-8 < z

   1. Initial program 95.5%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

      1. associate-/r/ 95.5%

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

      2. div-inv 95.4%

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

      3. associate-/r* 99.7%

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

   6. Applied egg-rr 99.7%

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

   7. Taylor expanded in y around 0 64.2%

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

      1. sub-neg 64.2%

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

      2. mul-1-neg 64.2%

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

      3. remove-double-neg 64.2%

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

      4. associate-/l* 84.2%

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

      5. associate--l+ 84.2%

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

   9. Simplified 84.2%

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

   if -5.89999999999999972e-61 < z < 1.04999999999999997e-8

   1. Initial program 99.9%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 94.1%

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

4. Final simplification 88.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.9 \cdot 10^{-61} \lor \neg \left(z \leq 1.05 \cdot 10^{-8}\right):\\ \;\;\;\;x + \frac{a}{\frac{\left(t - z\right) + 1}{z}}\\ \mathbf{else}:\\ \;\;\;\;x - a \cdot \frac{y}{t + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 91.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.5 \cdot 10^{+20} \lor \neg \left(z \leq 3.5 \cdot 10^{-8}\right):\\ \;\;\;\;x + \frac{a}{\frac{\left(t - z\right) + 1}{z}}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - y}{\frac{t + 1}{a}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -6.5e+20) (not (<= z 3.5e-8)))
   (+ x (/ a (/ (+ (- t z) 1.0) z)))
   (+ x (/ (- z y) (/ (+ t 1.0) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -6.5e+20) || !(z <= 3.5e-8)) {
		tmp = x + (a / (((t - z) + 1.0) / z));
	} else {
		tmp = x + ((z - y) / ((t + 1.0) / a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-6.5d+20)) .or. (.not. (z <= 3.5d-8))) then
        tmp = x + (a / (((t - z) + 1.0d0) / z))
    else
        tmp = x + ((z - y) / ((t + 1.0d0) / a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -6.5e+20) || !(z <= 3.5e-8)) {
		tmp = x + (a / (((t - z) + 1.0) / z));
	} else {
		tmp = x + ((z - y) / ((t + 1.0) / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -6.5e+20) or not (z <= 3.5e-8):
		tmp = x + (a / (((t - z) + 1.0) / z))
	else:
		tmp = x + ((z - y) / ((t + 1.0) / a))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -6.5e+20) || !(z <= 3.5e-8))
		tmp = Float64(x + Float64(a / Float64(Float64(Float64(t - z) + 1.0) / z)));
	else
		tmp = Float64(x + Float64(Float64(z - y) / Float64(Float64(t + 1.0) / a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -6.5e+20) || ~((z <= 3.5e-8)))
		tmp = x + (a / (((t - z) + 1.0) / z));
	else
		tmp = x + ((z - y) / ((t + 1.0) / a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -6.5e+20], N[Not[LessEqual[z, 3.5e-8]], $MachinePrecision]], N[(x + N[(a / N[(N[(N[(t - z), $MachinePrecision] + 1.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z - y), $MachinePrecision] / N[(N[(t + 1.0), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.5e20 or 3.50000000000000024e-8 < z

   1. Initial program 94.9%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

      1. associate-/r/ 94.9%

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

      2. div-inv 94.8%

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

      3. associate-/r* 99.8%

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

   6. Applied egg-rr 99.8%

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

   7. Taylor expanded in y around 0 62.7%

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

      1. sub-neg 62.7%

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

      2. mul-1-neg 62.7%

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

      3. remove-double-neg 62.7%

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

      4. associate-/l* 85.5%

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

      5. associate--l+ 85.5%

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

   9. Simplified 85.5%

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

   if -6.5e20 < z < 3.50000000000000024e-8

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 98.6%

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

4. Final simplification 91.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.5 \cdot 10^{+20} \lor \neg \left(z \leq 3.5 \cdot 10^{-8}\right):\\ \;\;\;\;x + \frac{a}{\frac{\left(t - z\right) + 1}{z}}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - y}{\frac{t + 1}{a}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 91.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.5 \cdot 10^{+20} \lor \neg \left(z \leq 3.5 \cdot 10^{-8}\right):\\ \;\;\;\;x + a \cdot \frac{z}{\left(t - z\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - y}{\frac{t + 1}{a}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -9.5e+20) (not (<= z 3.5e-8)))
   (+ x (* a (/ z (+ (- t z) 1.0))))
   (+ x (/ (- z y) (/ (+ t 1.0) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -9.5e+20) || !(z <= 3.5e-8)) {
		tmp = x + (a * (z / ((t - z) + 1.0)));
	} else {
		tmp = x + ((z - y) / ((t + 1.0) / a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-9.5d+20)) .or. (.not. (z <= 3.5d-8))) then
        tmp = x + (a * (z / ((t - z) + 1.0d0)))
    else
        tmp = x + ((z - y) / ((t + 1.0d0) / a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -9.5e+20) || !(z <= 3.5e-8)) {
		tmp = x + (a * (z / ((t - z) + 1.0)));
	} else {
		tmp = x + ((z - y) / ((t + 1.0) / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -9.5e+20) or not (z <= 3.5e-8):
		tmp = x + (a * (z / ((t - z) + 1.0)))
	else:
		tmp = x + ((z - y) / ((t + 1.0) / a))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -9.5e+20) || !(z <= 3.5e-8))
		tmp = Float64(x + Float64(a * Float64(z / Float64(Float64(t - z) + 1.0))));
	else
		tmp = Float64(x + Float64(Float64(z - y) / Float64(Float64(t + 1.0) / a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -9.5e+20) || ~((z <= 3.5e-8)))
		tmp = x + (a * (z / ((t - z) + 1.0)));
	else
		tmp = x + ((z - y) / ((t + 1.0) / a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -9.5e+20], N[Not[LessEqual[z, 3.5e-8]], $MachinePrecision]], N[(x + N[(a * N[(z / N[(N[(t - z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z - y), $MachinePrecision] / N[(N[(t + 1.0), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.5e20 or 3.50000000000000024e-8 < z

   1. Initial program 94.9%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around 0 85.6%

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

      1. associate-*r/ 85.6%

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

      2. neg-mul-1 85.6%

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

      3. associate--l+ 85.6%

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

   7. Simplified 85.6%

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

   if -9.5e20 < z < 3.50000000000000024e-8

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 98.6%

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

4. Final simplification 91.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9.5 \cdot 10^{+20} \lor \neg \left(z \leq 3.5 \cdot 10^{-8}\right):\\ \;\;\;\;x + a \cdot \frac{z}{\left(t - z\right) + 1}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - y}{\frac{t + 1}{a}}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 87.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.9 \cdot 10^{+22} \lor \neg \left(z \leq 1.75 \cdot 10^{+33}\right):\\ \;\;\;\;x + \frac{z - y}{\frac{-z}{a}}\\ \mathbf{else}:\\ \;\;\;\;x - a \cdot \frac{y}{t + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -2.9e+22) (not (<= z 1.75e+33)))
   (+ x (/ (- z y) (/ (- z) a)))
   (- x (* a (/ y (+ t 1.0))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2.9e+22) || !(z <= 1.75e+33)) {
		tmp = x + ((z - y) / (-z / a));
	} else {
		tmp = x - (a * (y / (t + 1.0)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-2.9d+22)) .or. (.not. (z <= 1.75d+33))) then
        tmp = x + ((z - y) / (-z / a))
    else
        tmp = x - (a * (y / (t + 1.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2.9e+22) || !(z <= 1.75e+33)) {
		tmp = x + ((z - y) / (-z / a));
	} else {
		tmp = x - (a * (y / (t + 1.0)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -2.9e+22) or not (z <= 1.75e+33):
		tmp = x + ((z - y) / (-z / a))
	else:
		tmp = x - (a * (y / (t + 1.0)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -2.9e+22) || !(z <= 1.75e+33))
		tmp = Float64(x + Float64(Float64(z - y) / Float64(Float64(-z) / a)));
	else
		tmp = Float64(x - Float64(a * Float64(y / Float64(t + 1.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -2.9e+22) || ~((z <= 1.75e+33)))
		tmp = x + ((z - y) / (-z / a));
	else
		tmp = x - (a * (y / (t + 1.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2.9e+22], N[Not[LessEqual[z, 1.75e+33]], $MachinePrecision]], N[(x + N[(N[(z - y), $MachinePrecision] / N[((-z) / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(a * N[(y / N[(t + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.9e22 or 1.75000000000000005e33 < z

   1. Initial program 94.6%

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

   3. Taylor expanded in z around inf 81.7%

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

      1. mul-1-neg 81.7%

         \[\leadsto x - \frac{y - z}{\color{blue}{-\frac{z}{a}}} \]

      2. distribute-neg-frac 81.7%

         \[\leadsto x - \frac{y - z}{\color{blue}{\frac{-z}{a}}} \]

   5. Simplified 81.7%

      \[\leadsto x - \frac{y - z}{\color{blue}{\frac{-z}{a}}} \]

   if -2.9e22 < z < 1.75000000000000005e33

   1. Initial program 99.9%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 88.7%

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

4. Final simplification 85.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.9 \cdot 10^{+22} \lor \neg \left(z \leq 1.75 \cdot 10^{+33}\right):\\ \;\;\;\;x + \frac{z - y}{\frac{-z}{a}}\\ \mathbf{else}:\\ \;\;\;\;x - a \cdot \frac{y}{t + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 84.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.2 \cdot 10^{+26} \lor \neg \left(z \leq 8 \cdot 10^{+114}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x - a \cdot \frac{y}{t + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -6.2e+26) (not (<= z 8e+114)))
   (- x a)
   (- x (* a (/ y (+ t 1.0))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -6.2e+26) || !(z <= 8e+114)) {
		tmp = x - a;
	} else {
		tmp = x - (a * (y / (t + 1.0)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-6.2d+26)) .or. (.not. (z <= 8d+114))) then
        tmp = x - a
    else
        tmp = x - (a * (y / (t + 1.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -6.2e+26) || !(z <= 8e+114)) {
		tmp = x - a;
	} else {
		tmp = x - (a * (y / (t + 1.0)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -6.2e+26) or not (z <= 8e+114):
		tmp = x - a
	else:
		tmp = x - (a * (y / (t + 1.0)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -6.2e+26) || !(z <= 8e+114))
		tmp = Float64(x - a);
	else
		tmp = Float64(x - Float64(a * Float64(y / Float64(t + 1.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -6.2e+26) || ~((z <= 8e+114)))
		tmp = x - a;
	else
		tmp = x - (a * (y / (t + 1.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -6.2e+26], N[Not[LessEqual[z, 8e+114]], $MachinePrecision]], N[(x - a), $MachinePrecision], N[(x - N[(a * N[(y / N[(t + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.1999999999999999e26 or 8e114 < z

   1. Initial program 93.6%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 82.6%

      \[\leadsto x - \color{blue}{a} \]

   if -6.1999999999999999e26 < z < 8e114

   1. Initial program 99.9%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 85.0%

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

4. Final simplification 84.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.2 \cdot 10^{+26} \lor \neg \left(z \leq 8 \cdot 10^{+114}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x - a \cdot \frac{y}{t + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 74.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{+25} \lor \neg \left(z \leq 1.08 \cdot 10^{-7}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x + a \cdot \left(z - y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.85e+25) (not (<= z 1.08e-7))) (- x a) (+ x (* a (- z y)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.85e+25) || !(z <= 1.08e-7)) {
		tmp = x - a;
	} else {
		tmp = x + (a * (z - y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-1.85d+25)) .or. (.not. (z <= 1.08d-7))) then
        tmp = x - a
    else
        tmp = x + (a * (z - y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.85e+25) || !(z <= 1.08e-7)) {
		tmp = x - a;
	} else {
		tmp = x + (a * (z - y));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -1.85e+25) or not (z <= 1.08e-7):
		tmp = x - a
	else:
		tmp = x + (a * (z - y))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.85e+25) || !(z <= 1.08e-7))
		tmp = Float64(x - a);
	else
		tmp = Float64(x + Float64(a * Float64(z - y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -1.85e+25) || ~((z <= 1.08e-7)))
		tmp = x - a;
	else
		tmp = x + (a * (z - y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.85e+25], N[Not[LessEqual[z, 1.08e-7]], $MachinePrecision]], N[(x - a), $MachinePrecision], N[(x + N[(a * N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.8499999999999999e25 or 1.08000000000000001e-7 < z

   1. Initial program 94.8%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 76.6%

      \[\leadsto x - \color{blue}{a} \]

   if -1.8499999999999999e25 < z < 1.08000000000000001e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 98.4%

      \[\leadsto x - \frac{y - z}{\color{blue}{\frac{1 + t}{a}}} \]

   4. Taylor expanded in t around 0 70.8%

      \[\leadsto x - \color{blue}{a \cdot \left(y - z\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{+25} \lor \neg \left(z \leq 1.08 \cdot 10^{-7}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x + a \cdot \left(z - y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 73.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.02 \cdot 10^{+21} \lor \neg \left(z \leq 1.08 \cdot 10^{-7}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.02e+21) (not (<= z 1.08e-7))) (- x a) (- x (* y a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.02e+21) || !(z <= 1.08e-7)) {
		tmp = x - a;
	} else {
		tmp = x - (y * a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-1.02d+21)) .or. (.not. (z <= 1.08d-7))) then
        tmp = x - a
    else
        tmp = x - (y * a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.02e+21) || !(z <= 1.08e-7)) {
		tmp = x - a;
	} else {
		tmp = x - (y * a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -1.02e+21) or not (z <= 1.08e-7):
		tmp = x - a
	else:
		tmp = x - (y * a)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.02e+21) || !(z <= 1.08e-7))
		tmp = Float64(x - a);
	else
		tmp = Float64(x - Float64(y * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -1.02e+21) || ~((z <= 1.08e-7)))
		tmp = x - a;
	else
		tmp = x - (y * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.02e+21], N[Not[LessEqual[z, 1.08e-7]], $MachinePrecision]], N[(x - a), $MachinePrecision], N[(x - N[(y * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.02e21 or 1.08000000000000001e-7 < z

   1. Initial program 94.8%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 76.6%

      \[\leadsto x - \color{blue}{a} \]

   if -1.02e21 < z < 1.08000000000000001e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in t around 0 72.1%

      \[\leadsto x - \frac{y - z}{\color{blue}{\frac{1 - z}{a}}} \]

   4. Taylor expanded in z around 0 67.5%

      \[\leadsto x - \color{blue}{a \cdot y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 72.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.02 \cdot 10^{+21} \lor \neg \left(z \leq 1.08 \cdot 10^{-7}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x - y \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 66.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.9 \cdot 10^{+28} \lor \neg \left(z \leq 9.5 \cdot 10^{-8}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -2.9e+28) (not (<= z 9.5e-8))) (- x a) x))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2.9e+28) || !(z <= 9.5e-8)) {
		tmp = x - a;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-2.9d+28)) .or. (.not. (z <= 9.5d-8))) then
        tmp = x - a
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2.9e+28) || !(z <= 9.5e-8)) {
		tmp = x - a;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -2.9e+28) or not (z <= 9.5e-8):
		tmp = x - a
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -2.9e+28) || !(z <= 9.5e-8))
		tmp = Float64(x - a);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -2.9e+28) || ~((z <= 9.5e-8)))
		tmp = x - a;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2.9e+28], N[Not[LessEqual[z, 9.5e-8]], $MachinePrecision]], N[(x - a), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -2.9000000000000001e28 or 9.50000000000000036e-8 < z

   1. Initial program 94.8%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 76.4%

      \[\leadsto x - \color{blue}{a} \]

   if -2.9000000000000001e28 < z < 9.50000000000000036e-8

   1. Initial program 99.9%

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

      1. associate-/r/ 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around inf 55.9%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.9 \cdot 10^{+28} \lor \neg \left(z \leq 9.5 \cdot 10^{-8}\right):\\ \;\;\;\;x - a\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 54.0% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 x)

C

double code(double x, double y, double z, double t, double a) {
	return x;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x;
}

Python

def code(x, y, z, t, a):
	return x

Julia

function code(x, y, z, t, a)
	return x
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x;
end

Wolfram

code[x_, y_, z_, t_, a_] := x

Derivation

1. Initial program 97.3%

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

   1. associate-/r/ 99.9%

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

3. Simplified 99.9%

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

5. Taylor expanded in x around inf 48.9%

   \[\leadsto \color{blue}{x} \]

6. Final simplification 48.9%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024031 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Chart.SparkLine:renderSparkLine from Chart-1.5.3"
  :precision binary64

  :herbie-target
  (- x (* (/ (- y z) (+ (- t z) 1.0)) a))

  (- x (/ (- y z) (/ (+ (- t z) 1.0) a))))