Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, A

Percentage Accurate: 85.0% → 98.5%

Time: 10.4s

Alternatives: 13

Speedup: 0.6×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{z - a}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+35}:\\ \;\;\;\;x + \left(z - t\right) \cdot \frac{y}{z - a}\\ \mathbf{elif}\;t\_1 \leq 10^{+248}:\\ \;\;\;\;x + t\_1\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z - t}{\frac{z - a}{y}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) (- z a))))
   (if (<= t_1 -5e+35)
     (+ x (* (- z t) (/ y (- z a))))
     (if (<= t_1 1e+248) (+ x t_1) (+ x (/ (- z t) (/ (- z a) y)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / (z - a);
	double tmp;
	if (t_1 <= -5e+35) {
		tmp = x + ((z - t) * (y / (z - a)));
	} else if (t_1 <= 1e+248) {
		tmp = x + t_1;
	} else {
		tmp = x + ((z - t) / ((z - a) / 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) :: t_1
    real(8) :: tmp
    t_1 = (y * (z - t)) / (z - a)
    if (t_1 <= (-5d+35)) then
        tmp = x + ((z - t) * (y / (z - a)))
    else if (t_1 <= 1d+248) then
        tmp = x + t_1
    else
        tmp = x + ((z - t) / ((z - a) / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / (z - a);
	double tmp;
	if (t_1 <= -5e+35) {
		tmp = x + ((z - t) * (y / (z - a)));
	} else if (t_1 <= 1e+248) {
		tmp = x + t_1;
	} else {
		tmp = x + ((z - t) / ((z - a) / y));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / (z - a)
	tmp = 0
	if t_1 <= -5e+35:
		tmp = x + ((z - t) * (y / (z - a)))
	elif t_1 <= 1e+248:
		tmp = x + t_1
	else:
		tmp = x + ((z - t) / ((z - a) / y))
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -5e+35)
		tmp = Float64(x + Float64(Float64(z - t) * Float64(y / Float64(z - a))));
	elseif (t_1 <= 1e+248)
		tmp = Float64(x + t_1);
	else
		tmp = Float64(x + Float64(Float64(z - t) / Float64(Float64(z - a) / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * (z - t)) / (z - a);
	tmp = 0.0;
	if (t_1 <= -5e+35)
		tmp = x + ((z - t) * (y / (z - a)));
	elseif (t_1 <= 1e+248)
		tmp = x + t_1;
	else
		tmp = x + ((z - t) / ((z - a) / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+35], N[(x + N[(N[(z - t), $MachinePrecision] * N[(y / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+248], N[(x + t$95$1), $MachinePrecision], N[(x + N[(N[(z - t), $MachinePrecision] / N[(N[(z - a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) (-.f64 z a)) < -5.00000000000000021e35

   1. Initial program 70.1%

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

      1. +-commutative 70.1%

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

      2. associate-/l* 98.3%

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

      3. fma-define 98.4%

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

   3. Simplified 98.4%

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

      1. fma-undefine 98.3%

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

      2. associate-/l* 70.1%

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

      3. div-inv 70.1%

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

      4. *-commutative 70.1%

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

      5. associate-*r* 99.8%

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

      6. div-inv 99.9%

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

   6. Applied egg-rr 99.9%

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

   if -5.00000000000000021e35 < (/.f64 (*.f64 y (-.f64 z t)) (-.f64 z a)) < 1.00000000000000005e248

   1. Initial program 99.9%

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

   if 1.00000000000000005e248 < (/.f64 (*.f64 y (-.f64 z t)) (-.f64 z a))

   1. Initial program 49.2%

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

      1. +-commutative 49.2%

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

      2. associate-/l* 99.9%

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

      3. fma-define 99.9%

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

   3. Simplified 99.9%

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

      1. fma-undefine 99.9%

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

      2. associate-/l* 49.2%

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

      3. div-inv 49.1%

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

      4. *-commutative 49.1%

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

      5. associate-*r* 99.5%

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

      6. div-inv 99.7%

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

   6. Applied egg-rr 99.7%

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

      1. clear-num 99.7%

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

      2. un-div-inv 99.9%

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

   8. Applied egg-rr 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 98.3% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 85.9%

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

   1. +-commutative 85.9%

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

   2. associate-/l* 98.5%

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

   3. fma-define 98.5%

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

3. Simplified 98.5%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{z - t}{z - a}, x\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 3: 98.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{z - a}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+35} \lor \neg \left(t\_1 \leq 10^{+248}\right):\\ \;\;\;\;x + \left(z - t\right) \cdot \frac{y}{z - a}\\ \mathbf{else}:\\ \;\;\;\;x + t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) (- z a))))
   (if (or (<= t_1 -5e+35) (not (<= t_1 1e+248)))
     (+ x (* (- z t) (/ y (- z a))))
     (+ x t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / (z - a);
	double tmp;
	if ((t_1 <= -5e+35) || !(t_1 <= 1e+248)) {
		tmp = x + ((z - t) * (y / (z - a)));
	} else {
		tmp = x + t_1;
	}
	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 = (y * (z - t)) / (z - a)
    if ((t_1 <= (-5d+35)) .or. (.not. (t_1 <= 1d+248))) then
        tmp = x + ((z - t) * (y / (z - a)))
    else
        tmp = x + t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / (z - a);
	double tmp;
	if ((t_1 <= -5e+35) || !(t_1 <= 1e+248)) {
		tmp = x + ((z - t) * (y / (z - a)));
	} else {
		tmp = x + t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / (z - a)
	tmp = 0
	if (t_1 <= -5e+35) or not (t_1 <= 1e+248):
		tmp = x + ((z - t) * (y / (z - a)))
	else:
		tmp = x + t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / Float64(z - a))
	tmp = 0.0
	if ((t_1 <= -5e+35) || !(t_1 <= 1e+248))
		tmp = Float64(x + Float64(Float64(z - t) * Float64(y / Float64(z - a))));
	else
		tmp = Float64(x + t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * (z - t)) / (z - a);
	tmp = 0.0;
	if ((t_1 <= -5e+35) || ~((t_1 <= 1e+248)))
		tmp = x + ((z - t) * (y / (z - a)));
	else
		tmp = x + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -5e+35], N[Not[LessEqual[t$95$1, 1e+248]], $MachinePrecision]], N[(x + N[(N[(z - t), $MachinePrecision] * N[(y / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) (-.f64 z a)) < -5.00000000000000021e35 or 1.00000000000000005e248 < (/.f64 (*.f64 y (-.f64 z t)) (-.f64 z a))

   1. Initial program 63.8%

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

      1. +-commutative 63.8%

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

      2. associate-/l* 98.8%

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

      3. fma-define 98.8%

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

   3. Simplified 98.8%

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

      1. fma-undefine 98.8%

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

      2. associate-/l* 63.8%

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

      3. div-inv 63.7%

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

      4. *-commutative 63.7%

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

      5. associate-*r* 99.7%

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

      6. div-inv 99.9%

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

   6. Applied egg-rr 99.9%

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

   if -5.00000000000000021e35 < (/.f64 (*.f64 y (-.f64 z t)) (-.f64 z a)) < 1.00000000000000005e248

   1. Initial program 99.9%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 4: 76.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{+91}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -9 \cdot 10^{-91}:\\ \;\;\;\;x - \frac{t}{\frac{z}{y}}\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{+29}:\\ \;\;\;\;x + \frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3.8e+91)
   (+ y x)
   (if (<= z -9e-91)
     (- x (/ t (/ z y)))
     (if (<= z 2.25e+29) (+ x (/ t (/ a y))) (+ y x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3.8e+91) {
		tmp = y + x;
	} else if (z <= -9e-91) {
		tmp = x - (t / (z / y));
	} else if (z <= 2.25e+29) {
		tmp = x + (t / (a / y));
	} else {
		tmp = y + 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 <= (-3.8d+91)) then
        tmp = y + x
    else if (z <= (-9d-91)) then
        tmp = x - (t / (z / y))
    else if (z <= 2.25d+29) then
        tmp = x + (t / (a / y))
    else
        tmp = y + 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 <= -3.8e+91) {
		tmp = y + x;
	} else if (z <= -9e-91) {
		tmp = x - (t / (z / y));
	} else if (z <= 2.25e+29) {
		tmp = x + (t / (a / y));
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -3.8e+91:
		tmp = y + x
	elif z <= -9e-91:
		tmp = x - (t / (z / y))
	elif z <= 2.25e+29:
		tmp = x + (t / (a / y))
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -3.8e+91)
		tmp = Float64(y + x);
	elseif (z <= -9e-91)
		tmp = Float64(x - Float64(t / Float64(z / y)));
	elseif (z <= 2.25e+29)
		tmp = Float64(x + Float64(t / Float64(a / y)));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -3.8e+91)
		tmp = y + x;
	elseif (z <= -9e-91)
		tmp = x - (t / (z / y));
	elseif (z <= 2.25e+29)
		tmp = x + (t / (a / y));
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -3.8e+91], N[(y + x), $MachinePrecision], If[LessEqual[z, -9e-91], N[(x - N[(t / N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.25e+29], N[(x + N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.7999999999999998e91 or 2.2500000000000001e29 < z

   1. Initial program 69.5%

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

   3. Taylor expanded in z around inf 77.9%

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative 77.9%

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

   5. Simplified 77.9%

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

   if -3.7999999999999998e91 < z < -8.99999999999999952e-91

   1. Initial program 97.2%

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

   3. Taylor expanded in t around inf 75.7%

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

      1. mul-1-neg 75.7%

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

      2. associate-/l* 78.4%

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

      3. distribute-rgt-neg-in 78.4%

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

      4. distribute-frac-neg2 78.4%

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

   5. Simplified 78.4%

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

   6. Taylor expanded in z around inf 67.0%

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

      1. mul-1-neg 67.0%

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

      2. unsub-neg 67.0%

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

      3. associate-/l* 69.6%

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

   8. Simplified 69.6%

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

      1. clear-num 69.6%

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

      2. un-div-inv 69.6%

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

   10. Applied egg-rr 69.6%

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

   if -8.99999999999999952e-91 < z < 2.2500000000000001e29

   1. Initial program 95.4%

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

   3. Taylor expanded in z around 0 79.2%

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

      1. +-commutative 79.2%

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

      2. associate-/l* 81.4%

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

   5. Simplified 81.4%

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

      1. clear-num 81.4%

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

      2. un-div-inv 81.5%

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

   7. Applied egg-rr 81.5%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{+91}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -9 \cdot 10^{-91}:\\ \;\;\;\;x - \frac{t}{\frac{z}{y}}\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{+29}:\\ \;\;\;\;x + \frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 76.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.7 \cdot 10^{+94}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{-91}:\\ \;\;\;\;x - t \cdot \frac{y}{z}\\ \mathbf{elif}\;z \leq 6.1 \cdot 10^{+29}:\\ \;\;\;\;x + \frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.7e+94)
   (+ y x)
   (if (<= z -8.5e-91)
     (- x (* t (/ y z)))
     (if (<= z 6.1e+29) (+ x (/ t (/ a y))) (+ y x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.7e+94) {
		tmp = y + x;
	} else if (z <= -8.5e-91) {
		tmp = x - (t * (y / z));
	} else if (z <= 6.1e+29) {
		tmp = x + (t / (a / y));
	} else {
		tmp = y + 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 <= (-1.7d+94)) then
        tmp = y + x
    else if (z <= (-8.5d-91)) then
        tmp = x - (t * (y / z))
    else if (z <= 6.1d+29) then
        tmp = x + (t / (a / y))
    else
        tmp = y + 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 <= -1.7e+94) {
		tmp = y + x;
	} else if (z <= -8.5e-91) {
		tmp = x - (t * (y / z));
	} else if (z <= 6.1e+29) {
		tmp = x + (t / (a / y));
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.7e+94:
		tmp = y + x
	elif z <= -8.5e-91:
		tmp = x - (t * (y / z))
	elif z <= 6.1e+29:
		tmp = x + (t / (a / y))
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.7e+94)
		tmp = Float64(y + x);
	elseif (z <= -8.5e-91)
		tmp = Float64(x - Float64(t * Float64(y / z)));
	elseif (z <= 6.1e+29)
		tmp = Float64(x + Float64(t / Float64(a / y)));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.7e+94)
		tmp = y + x;
	elseif (z <= -8.5e-91)
		tmp = x - (t * (y / z));
	elseif (z <= 6.1e+29)
		tmp = x + (t / (a / y));
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.7e+94], N[(y + x), $MachinePrecision], If[LessEqual[z, -8.5e-91], N[(x - N[(t * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.1e+29], N[(x + N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.7000000000000001e94 or 6.0999999999999998e29 < z

   1. Initial program 69.5%

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

   3. Taylor expanded in z around inf 77.9%

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative 77.9%

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

   5. Simplified 77.9%

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

   if -1.7000000000000001e94 < z < -8.49999999999999985e-91

   1. Initial program 97.2%

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

   3. Taylor expanded in t around inf 75.7%

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

      1. mul-1-neg 75.7%

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

      2. associate-/l* 78.4%

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

      3. distribute-rgt-neg-in 78.4%

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

      4. distribute-frac-neg2 78.4%

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

   5. Simplified 78.4%

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

   6. Taylor expanded in z around inf 67.0%

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

      1. mul-1-neg 67.0%

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

      2. unsub-neg 67.0%

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

      3. associate-/l* 69.6%

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

   8. Simplified 69.6%

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

   if -8.49999999999999985e-91 < z < 6.0999999999999998e29

   1. Initial program 95.4%

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

   3. Taylor expanded in z around 0 79.2%

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

      1. +-commutative 79.2%

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

      2. associate-/l* 81.4%

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

   5. Simplified 81.4%

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

      1. clear-num 81.4%

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

      2. un-div-inv 81.5%

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

   7. Applied egg-rr 81.5%

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

4. Final simplification 78.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.7 \cdot 10^{+94}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{-91}:\\ \;\;\;\;x - t \cdot \frac{y}{z}\\ \mathbf{elif}\;z \leq 6.1 \cdot 10^{+29}:\\ \;\;\;\;x + \frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 92.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.95 \cdot 10^{+94}:\\ \;\;\;\;x + \frac{y}{\frac{z - a}{z}}\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{+165}:\\ \;\;\;\;x + \frac{y \cdot \left(z - t\right)}{z - a}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \frac{t}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.95e+94)
   (+ x (/ y (/ (- z a) z)))
   (if (<= z 2.25e+165)
     (+ x (/ (* y (- z t)) (- z a)))
     (+ x (* y (- 1.0 (/ t z)))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.95e+94) {
		tmp = x + (y / ((z - a) / z));
	} else if (z <= 2.25e+165) {
		tmp = x + ((y * (z - t)) / (z - a));
	} else {
		tmp = x + (y * (1.0 - (t / z)));
	}
	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.95d+94)) then
        tmp = x + (y / ((z - a) / z))
    else if (z <= 2.25d+165) then
        tmp = x + ((y * (z - t)) / (z - a))
    else
        tmp = x + (y * (1.0d0 - (t / z)))
    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.95e+94) {
		tmp = x + (y / ((z - a) / z));
	} else if (z <= 2.25e+165) {
		tmp = x + ((y * (z - t)) / (z - a));
	} else {
		tmp = x + (y * (1.0 - (t / z)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.95e+94:
		tmp = x + (y / ((z - a) / z))
	elif z <= 2.25e+165:
		tmp = x + ((y * (z - t)) / (z - a))
	else:
		tmp = x + (y * (1.0 - (t / z)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.95e+94)
		tmp = Float64(x + Float64(y / Float64(Float64(z - a) / z)));
	elseif (z <= 2.25e+165)
		tmp = Float64(x + Float64(Float64(y * Float64(z - t)) / Float64(z - a)));
	else
		tmp = Float64(x + Float64(y * Float64(1.0 - Float64(t / z))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.95e+94)
		tmp = x + (y / ((z - a) / z));
	elseif (z <= 2.25e+165)
		tmp = x + ((y * (z - t)) / (z - a));
	else
		tmp = x + (y * (1.0 - (t / z)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.95e+94], N[(x + N[(y / N[(N[(z - a), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.25e+165], N[(x + N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(1.0 - N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.94999999999999993e94

   1. Initial program 61.8%

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

   3. Taylor expanded in t around 0 55.9%

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

      1. +-commutative 55.9%

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

      2. associate-/l* 91.6%

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

   5. Simplified 91.6%

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

      1. clear-num 91.7%

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

      2. un-div-inv 91.7%

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

   7. Applied egg-rr 91.7%

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

   if -1.94999999999999993e94 < z < 2.2499999999999998e165

   1. Initial program 95.9%

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

   if 2.2499999999999998e165 < z

   1. Initial program 48.5%

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

   3. Taylor expanded in a around 0 48.5%

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

      1. associate-/l* 99.8%

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

      2. div-sub 99.9%

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

      3. *-inverses 99.9%

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

   5. Simplified 99.9%

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

4. Final simplification 95.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.95 \cdot 10^{+94}:\\ \;\;\;\;x + \frac{y}{\frac{z - a}{z}}\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{+165}:\\ \;\;\;\;x + \frac{y \cdot \left(z - t\right)}{z - a}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \frac{t}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 82.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.8e-93) (not (<= z 1.65e-92)))
   (+ x (* y (- 1.0 (/ t z))))
   (+ x (/ t (/ a y)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.8e-93) || !(z <= 1.65e-92)) {
		tmp = x + (y * (1.0 - (t / z)));
	} else {
		tmp = x + (t / (a / 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.8d-93)) .or. (.not. (z <= 1.65d-92))) then
        tmp = x + (y * (1.0d0 - (t / z)))
    else
        tmp = x + (t / (a / 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.8e-93) || !(z <= 1.65e-92)) {
		tmp = x + (y * (1.0 - (t / z)));
	} else {
		tmp = x + (t / (a / y));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -1.8e-93) or not (z <= 1.65e-92):
		tmp = x + (y * (1.0 - (t / z)))
	else:
		tmp = x + (t / (a / y))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.8e-93) || !(z <= 1.65e-92))
		tmp = Float64(x + Float64(y * Float64(1.0 - Float64(t / z))));
	else
		tmp = Float64(x + Float64(t / Float64(a / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -1.8e-93) || ~((z <= 1.65e-92)))
		tmp = x + (y * (1.0 - (t / z)));
	else
		tmp = x + (t / (a / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.8e-93], N[Not[LessEqual[z, 1.65e-92]], $MachinePrecision]], N[(x + N[(y * N[(1.0 - N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.8000000000000001e-93 or 1.64999999999999999e-92 < z

   1. Initial program 80.3%

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

   3. Taylor expanded in a around 0 66.2%

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

      1. associate-/l* 84.0%

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

      2. div-sub 84.0%

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

      3. *-inverses 84.0%

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

   5. Simplified 84.0%

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

   if -1.8000000000000001e-93 < z < 1.64999999999999999e-92

   1. Initial program 95.0%

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

   3. Taylor expanded in z around 0 82.0%

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

      1. +-commutative 82.0%

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

      2. associate-/l* 84.9%

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

   5. Simplified 84.9%

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

      1. clear-num 84.9%

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

      2. un-div-inv 85.0%

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

   7. Applied egg-rr 85.0%

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

4. Final simplification 84.4%

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

Alternative 8: 87.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.9 \cdot 10^{+91}:\\ \;\;\;\;x + \frac{y}{\frac{z - a}{z}}\\ \mathbf{elif}\;z \leq 3.85 \cdot 10^{+28}:\\ \;\;\;\;x + t \cdot \frac{y}{a - z}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \frac{t}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -2.9e+91)
   (+ x (/ y (/ (- z a) z)))
   (if (<= z 3.85e+28) (+ x (* t (/ y (- a z)))) (+ x (* y (- 1.0 (/ t z)))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -2.9e+91) {
		tmp = x + (y / ((z - a) / z));
	} else if (z <= 3.85e+28) {
		tmp = x + (t * (y / (a - z)));
	} else {
		tmp = x + (y * (1.0 - (t / z)));
	}
	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+91)) then
        tmp = x + (y / ((z - a) / z))
    else if (z <= 3.85d+28) then
        tmp = x + (t * (y / (a - z)))
    else
        tmp = x + (y * (1.0d0 - (t / z)))
    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+91) {
		tmp = x + (y / ((z - a) / z));
	} else if (z <= 3.85e+28) {
		tmp = x + (t * (y / (a - z)));
	} else {
		tmp = x + (y * (1.0 - (t / z)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -2.9e+91:
		tmp = x + (y / ((z - a) / z))
	elif z <= 3.85e+28:
		tmp = x + (t * (y / (a - z)))
	else:
		tmp = x + (y * (1.0 - (t / z)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -2.9e+91)
		tmp = Float64(x + Float64(y / Float64(Float64(z - a) / z)));
	elseif (z <= 3.85e+28)
		tmp = Float64(x + Float64(t * Float64(y / Float64(a - z))));
	else
		tmp = Float64(x + Float64(y * Float64(1.0 - Float64(t / z))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -2.9e+91)
		tmp = x + (y / ((z - a) / z));
	elseif (z <= 3.85e+28)
		tmp = x + (t * (y / (a - z)));
	else
		tmp = x + (y * (1.0 - (t / z)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -2.9e+91], N[(x + N[(y / N[(N[(z - a), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.85e+28], N[(x + N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(1.0 - N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.90000000000000014e91

   1. Initial program 61.8%

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

   3. Taylor expanded in t around 0 55.9%

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

      1. +-commutative 55.9%

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

      2. associate-/l* 91.6%

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

   5. Simplified 91.6%

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

      1. clear-num 91.7%

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

      2. un-div-inv 91.7%

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

   7. Applied egg-rr 91.7%

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

   if -2.90000000000000014e91 < z < 3.8499999999999999e28

   1. Initial program 95.8%

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

   3. Taylor expanded in t around inf 86.3%

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

      1. mul-1-neg 86.3%

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

      2. associate-/l* 88.7%

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

      3. distribute-rgt-neg-in 88.7%

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

      4. distribute-frac-neg2 88.7%

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

   5. Simplified 88.7%

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

      1. *-commutative 88.7%

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

      2. add-sqr-sqrt 43.4%

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

      3. sqrt-unprod 69.5%

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

      4. sqr-neg 69.5%

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

      5. sqrt-unprod 30.3%

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

      6. add-sqr-sqrt 53.6%

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

      7. cancel-sign-sub 53.6%

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

      8. distribute-frac-neg2 53.6%

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

      9. *-commutative 53.6%

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

      10. add-sqr-sqrt 23.4%

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

      11. sqrt-unprod 63.8%

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

      12. sqr-neg 63.8%

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

      13. sqrt-unprod 45.1%

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

      14. add-sqr-sqrt 88.7%

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

   7. Applied egg-rr 88.7%

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

   if 3.8499999999999999e28 < z

   1. Initial program 76.9%

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

   3. Taylor expanded in a around 0 67.0%

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

      1. associate-/l* 88.0%

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

      2. div-sub 88.0%

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

      3. *-inverses 88.0%

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

   5. Simplified 88.0%

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

4. Final simplification 89.1%

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

Alternative 9: 76.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.5 \cdot 10^{+78} \lor \neg \left(z \leq 9 \cdot 10^{+28}\right):\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;x + \frac{t}{\frac{a}{y}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -2.5e+78) (not (<= z 9e+28))) (+ y x) (+ x (/ t (/ a y)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2.5e+78) || !(z <= 9e+28)) {
		tmp = y + x;
	} else {
		tmp = x + (t / (a / 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 <= (-2.5d+78)) .or. (.not. (z <= 9d+28))) then
        tmp = y + x
    else
        tmp = x + (t / (a / 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 <= -2.5e+78) || !(z <= 9e+28)) {
		tmp = y + x;
	} else {
		tmp = x + (t / (a / y));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -2.5e+78) or not (z <= 9e+28):
		tmp = y + x
	else:
		tmp = x + (t / (a / y))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -2.5e+78) || !(z <= 9e+28))
		tmp = Float64(y + x);
	else
		tmp = Float64(x + Float64(t / Float64(a / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -2.5e+78) || ~((z <= 9e+28)))
		tmp = y + x;
	else
		tmp = x + (t / (a / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2.5e+78], N[Not[LessEqual[z, 9e+28]], $MachinePrecision]], N[(y + x), $MachinePrecision], N[(x + N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.49999999999999992e78 or 8.9999999999999994e28 < z

   1. Initial program 70.8%

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

   3. Taylor expanded in z around inf 77.8%

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative 77.8%

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

   5. Simplified 77.8%

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

   if -2.49999999999999992e78 < z < 8.9999999999999994e28

   1. Initial program 95.6%

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

   3. Taylor expanded in z around 0 73.3%

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

      1. +-commutative 73.3%

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

      2. associate-/l* 75.1%

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

   5. Simplified 75.1%

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

      1. clear-num 75.1%

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

      2. un-div-inv 75.1%

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

   7. Applied egg-rr 75.1%

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

4. Final simplification 76.2%

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

Alternative 10: 76.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{+77} \lor \neg \left(z \leq 3.9 \cdot 10^{+29}\right):\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;x + t \cdot \frac{y}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -2e+77) (not (<= z 3.9e+29))) (+ y x) (+ x (* t (/ y a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -2e+77) || !(z <= 3.9e+29)) {
		tmp = y + x;
	} else {
		tmp = x + (t * (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 <= (-2d+77)) .or. (.not. (z <= 3.9d+29))) then
        tmp = y + x
    else
        tmp = x + (t * (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 <= -2e+77) || !(z <= 3.9e+29)) {
		tmp = y + x;
	} else {
		tmp = x + (t * (y / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -2e+77) or not (z <= 3.9e+29):
		tmp = y + x
	else:
		tmp = x + (t * (y / a))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -2e+77) || !(z <= 3.9e+29))
		tmp = Float64(y + x);
	else
		tmp = Float64(x + Float64(t * Float64(y / a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -2e+77) || ~((z <= 3.9e+29)))
		tmp = y + x;
	else
		tmp = x + (t * (y / a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -2e+77], N[Not[LessEqual[z, 3.9e+29]], $MachinePrecision]], N[(y + x), $MachinePrecision], N[(x + N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.99999999999999997e77 or 3.89999999999999968e29 < z

   1. Initial program 70.8%

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

   3. Taylor expanded in z around inf 77.8%

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative 77.8%

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

   5. Simplified 77.8%

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

   if -1.99999999999999997e77 < z < 3.89999999999999968e29

   1. Initial program 95.6%

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

   3. Taylor expanded in z around 0 73.3%

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

      1. +-commutative 73.3%

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

      2. associate-/l* 75.1%

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

   5. Simplified 75.1%

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

4. Final simplification 76.1%

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

Alternative 11: 75.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.3 \cdot 10^{+77} \lor \neg \left(z \leq 2.8 \cdot 10^{+28}\right):\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot t}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -3.3e+77) (not (<= z 2.8e+28))) (+ y x) (+ x (/ (* y t) a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -3.3e+77) || !(z <= 2.8e+28)) {
		tmp = y + x;
	} else {
		tmp = x + ((y * t) / 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 <= (-3.3d+77)) .or. (.not. (z <= 2.8d+28))) then
        tmp = y + x
    else
        tmp = x + ((y * t) / 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 <= -3.3e+77) || !(z <= 2.8e+28)) {
		tmp = y + x;
	} else {
		tmp = x + ((y * t) / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -3.3e+77) or not (z <= 2.8e+28):
		tmp = y + x
	else:
		tmp = x + ((y * t) / a)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -3.3e+77) || !(z <= 2.8e+28))
		tmp = Float64(y + x);
	else
		tmp = Float64(x + Float64(Float64(y * t) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -3.3e+77) || ~((z <= 2.8e+28)))
		tmp = y + x;
	else
		tmp = x + ((y * t) / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -3.3e+77], N[Not[LessEqual[z, 2.8e+28]], $MachinePrecision]], N[(y + x), $MachinePrecision], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.2999999999999998e77 or 2.8000000000000001e28 < z

   1. Initial program 70.8%

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

   3. Taylor expanded in z around inf 77.8%

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative 77.8%

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

   5. Simplified 77.8%

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

   if -3.2999999999999998e77 < z < 2.8000000000000001e28

   1. Initial program 95.6%

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

   3. Taylor expanded in z around 0 73.3%

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

4. Final simplification 75.0%

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

Alternative 12: 64.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.9 \cdot 10^{-71} \lor \neg \left(z \leq 0.0036\right):\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -4.9e-71) (not (<= z 0.0036))) (+ y x) x))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -4.9e-71) || !(z <= 0.0036)) {
		tmp = y + x;
	} 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 <= (-4.9d-71)) .or. (.not. (z <= 0.0036d0))) then
        tmp = y + x
    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 <= -4.9e-71) || !(z <= 0.0036)) {
		tmp = y + x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -4.9e-71) or not (z <= 0.0036):
		tmp = y + x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -4.9e-71) || !(z <= 0.0036))
		tmp = Float64(y + x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -4.9e-71) || ~((z <= 0.0036)))
		tmp = y + x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -4.9e-71], N[Not[LessEqual[z, 0.0036]], $MachinePrecision]], N[(y + x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -4.8999999999999997e-71 or 0.0035999999999999999 < z

   1. Initial program 76.9%

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

   3. Taylor expanded in z around inf 69.6%

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative 69.6%

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

   5. Simplified 69.6%

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

   if -4.8999999999999997e-71 < z < 0.0035999999999999999

   1. Initial program 96.0%

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

   3. Taylor expanded in x around inf 58.3%

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

4. Final simplification 64.2%

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

Alternative 13: 51.1% accurate, 11.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 85.9%

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

3. Taylor expanded in x around inf 51.6%

   \[\leadsto \color{blue}{x} \]
4. Add Preprocessing

Developer Target 1: 98.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y}{\frac{z - a}{z - t}} \end{array} \]

FPCore

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

C

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

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 - a) / (z - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024137 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, A"
  :precision binary64

  :alt
  (! :herbie-platform default (+ x (/ y (/ (- z a) (- z t)))))

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