tan-example (used to crash)

Percentage Accurate: 79.5% → 99.7%

Time: 50.4s

Alternatives: 11

Speedup: 1.0×

Specification

\[\left(\left(\left(x = 0 \lor 0.5884142 \leq x \land x \leq 505.5909\right) \land \left(-1.796658 \cdot 10^{+308} \leq y \land y \leq -9.425585 \cdot 10^{-310} \lor 1.284938 \cdot 10^{-309} \leq y \land y \leq 1.751224 \cdot 10^{+308}\right)\right) \land \left(-1.776707 \cdot 10^{+308} \leq z \land z \leq -8.599796 \cdot 10^{-310} \lor 3.293145 \cdot 10^{-311} \leq z \land z \leq 1.725154 \cdot 10^{+308}\right)\right) \land \left(-1.796658 \cdot 10^{+308} \leq a \land a \leq -9.425585 \cdot 10^{-310} \lor 1.284938 \cdot 10^{-309} \leq a \land a \leq 1.751224 \cdot 10^{+308}\right)\]

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z, double a) {
	return x + (Math.tan((y + z)) - Math.tan(a));
}

Python

def code(x, y, z, a):
	return x + (math.tan((y + z)) - math.tan(a))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 79.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z, double a) {
	return x + (Math.tan((y + z)) - Math.tan(a));
}

Python

def code(x, y, z, a):
	return x + (math.tan((y + z)) - math.tan(a))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.8%

   \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. tan-sum 99.8%

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

   2. div-inv 99.8%

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

4. Applied egg-rr 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 89.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \tan y + \tan z\\ \mathbf{if}\;\tan a \leq -4 \cdot 10^{-13} \lor \neg \left(\tan a \leq 2 \cdot 10^{-5}\right):\\ \;\;\;\;x + \left(t\_0 - \tan a\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(t\_0 \cdot \frac{1}{1 - \tan y \cdot \tan z} - a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (let* ((t_0 (+ (tan y) (tan z))))
   (if (or (<= (tan a) -4e-13) (not (<= (tan a) 2e-5)))
     (+ x (- t_0 (tan a)))
     (+ x (- (* t_0 (/ 1.0 (- 1.0 (* (tan y) (tan z))))) a)))))

C

double code(double x, double y, double z, double a) {
	double t_0 = tan(y) + tan(z);
	double tmp;
	if ((tan(a) <= -4e-13) || !(tan(a) <= 2e-5)) {
		tmp = x + (t_0 - tan(a));
	} else {
		tmp = x + ((t_0 * (1.0 / (1.0 - (tan(y) * tan(z))))) - a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: a
    real(8) :: t_0
    real(8) :: tmp
    t_0 = tan(y) + tan(z)
    if ((tan(a) <= (-4d-13)) .or. (.not. (tan(a) <= 2d-5))) then
        tmp = x + (t_0 - tan(a))
    else
        tmp = x + ((t_0 * (1.0d0 / (1.0d0 - (tan(y) * tan(z))))) - a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double t_0 = Math.tan(y) + Math.tan(z);
	double tmp;
	if ((Math.tan(a) <= -4e-13) || !(Math.tan(a) <= 2e-5)) {
		tmp = x + (t_0 - Math.tan(a));
	} else {
		tmp = x + ((t_0 * (1.0 / (1.0 - (Math.tan(y) * Math.tan(z))))) - a);
	}
	return tmp;
}

Python

def code(x, y, z, a):
	t_0 = math.tan(y) + math.tan(z)
	tmp = 0
	if (math.tan(a) <= -4e-13) or not (math.tan(a) <= 2e-5):
		tmp = x + (t_0 - math.tan(a))
	else:
		tmp = x + ((t_0 * (1.0 / (1.0 - (math.tan(y) * math.tan(z))))) - a)
	return tmp

Julia

function code(x, y, z, a)
	t_0 = Float64(tan(y) + tan(z))
	tmp = 0.0
	if ((tan(a) <= -4e-13) || !(tan(a) <= 2e-5))
		tmp = Float64(x + Float64(t_0 - tan(a)));
	else
		tmp = Float64(x + Float64(Float64(t_0 * Float64(1.0 / Float64(1.0 - Float64(tan(y) * tan(z))))) - a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	t_0 = tan(y) + tan(z);
	tmp = 0.0;
	if ((tan(a) <= -4e-13) || ~((tan(a) <= 2e-5)))
		tmp = x + (t_0 - tan(a));
	else
		tmp = x + ((t_0 * (1.0 / (1.0 - (tan(y) * tan(z))))) - a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := Block[{t$95$0 = N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[N[Tan[a], $MachinePrecision], -4e-13], N[Not[LessEqual[N[Tan[a], $MachinePrecision], 2e-5]], $MachinePrecision]], N[(x + N[(t$95$0 - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(t$95$0 * N[(1.0 / N[(1.0 - N[(N[Tan[y], $MachinePrecision] * N[Tan[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (tan.f64 a) < -4.0000000000000001e-13 or 2.00000000000000016e-5 < (tan.f64 a)

   1. Initial program 80.4%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. tan-sum 99.7%

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

      2. div-inv 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in y around 0 81.1%

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

   if -4.0000000000000001e-13 < (tan.f64 a) < 2.00000000000000016e-5

   1. Initial program 81.2%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 81.1%

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

      1. tan-sum 99.7%

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

      2. div-inv 99.8%

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

      3. fma-neg 99.8%

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

   5. Applied egg-rr 99.8%

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

      1. fma-undefine 99.8%

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

      2. unsub-neg 99.8%

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

   7. Simplified 99.8%

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

4. Final simplification 90.7%

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

Alternative 3: 89.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \tan y + \tan z\\ \mathbf{if}\;\tan a \leq -4 \cdot 10^{-13} \lor \neg \left(\tan a \leq 2 \cdot 10^{-5}\right):\\ \;\;\;\;x + \left(t\_0 - \tan a\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(\frac{t\_0}{1 - \tan y \cdot \tan z} - a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (let* ((t_0 (+ (tan y) (tan z))))
   (if (or (<= (tan a) -4e-13) (not (<= (tan a) 2e-5)))
     (+ x (- t_0 (tan a)))
     (+ x (- (/ t_0 (- 1.0 (* (tan y) (tan z)))) a)))))

C

double code(double x, double y, double z, double a) {
	double t_0 = tan(y) + tan(z);
	double tmp;
	if ((tan(a) <= -4e-13) || !(tan(a) <= 2e-5)) {
		tmp = x + (t_0 - tan(a));
	} else {
		tmp = x + ((t_0 / (1.0 - (tan(y) * tan(z)))) - a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: a
    real(8) :: t_0
    real(8) :: tmp
    t_0 = tan(y) + tan(z)
    if ((tan(a) <= (-4d-13)) .or. (.not. (tan(a) <= 2d-5))) then
        tmp = x + (t_0 - tan(a))
    else
        tmp = x + ((t_0 / (1.0d0 - (tan(y) * tan(z)))) - a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double t_0 = Math.tan(y) + Math.tan(z);
	double tmp;
	if ((Math.tan(a) <= -4e-13) || !(Math.tan(a) <= 2e-5)) {
		tmp = x + (t_0 - Math.tan(a));
	} else {
		tmp = x + ((t_0 / (1.0 - (Math.tan(y) * Math.tan(z)))) - a);
	}
	return tmp;
}

Python

def code(x, y, z, a):
	t_0 = math.tan(y) + math.tan(z)
	tmp = 0
	if (math.tan(a) <= -4e-13) or not (math.tan(a) <= 2e-5):
		tmp = x + (t_0 - math.tan(a))
	else:
		tmp = x + ((t_0 / (1.0 - (math.tan(y) * math.tan(z)))) - a)
	return tmp

Julia

function code(x, y, z, a)
	t_0 = Float64(tan(y) + tan(z))
	tmp = 0.0
	if ((tan(a) <= -4e-13) || !(tan(a) <= 2e-5))
		tmp = Float64(x + Float64(t_0 - tan(a)));
	else
		tmp = Float64(x + Float64(Float64(t_0 / Float64(1.0 - Float64(tan(y) * tan(z)))) - a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	t_0 = tan(y) + tan(z);
	tmp = 0.0;
	if ((tan(a) <= -4e-13) || ~((tan(a) <= 2e-5)))
		tmp = x + (t_0 - tan(a));
	else
		tmp = x + ((t_0 / (1.0 - (tan(y) * tan(z)))) - a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := Block[{t$95$0 = N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[N[Tan[a], $MachinePrecision], -4e-13], N[Not[LessEqual[N[Tan[a], $MachinePrecision], 2e-5]], $MachinePrecision]], N[(x + N[(t$95$0 - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(t$95$0 / N[(1.0 - N[(N[Tan[y], $MachinePrecision] * N[Tan[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (tan.f64 a) < -4.0000000000000001e-13 or 2.00000000000000016e-5 < (tan.f64 a)

   1. Initial program 80.4%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. tan-sum 99.7%

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

      2. div-inv 99.7%

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

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in y around 0 81.1%

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

   if -4.0000000000000001e-13 < (tan.f64 a) < 2.00000000000000016e-5

   1. Initial program 81.2%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 81.1%

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

      1. tan-sum 99.8%

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

      2. div-inv 99.8%

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

   5. Applied egg-rr 99.8%

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

      1. associate-*r/ 99.7%

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

      2. *-rgt-identity 99.7%

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

   7. Simplified 99.7%

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

4. Final simplification 90.7%

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

Alternative 4: 99.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.8%

   \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. tan-sum 99.8%

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

   2. div-inv 99.8%

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

4. Applied egg-rr 99.8%

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

   1. associate-*r/ 53.4%

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

   2. *-rgt-identity 53.4%

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

6. Simplified 99.8%

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

7. Final simplification 99.8%

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

Alternative 5: 50.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\tan a \leq -0.001:\\ \;\;\;\;{\left(\sqrt[3]{x}\right)}^{3}\\ \mathbf{elif}\;\tan a \leq 1.5 \cdot 10^{-5}:\\ \;\;\;\;\left(x + \tan \left(y + z\right)\right) - a\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= (tan a) -0.001)
   (pow (cbrt x) 3.0)
   (if (<= (tan a) 1.5e-5) (- (+ x (tan (+ y z))) a) x)))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (tan(a) <= -0.001) {
		tmp = pow(cbrt(x), 3.0);
	} else if (tan(a) <= 1.5e-5) {
		tmp = (x + tan((y + z))) - a;
	} else {
		tmp = x;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double a) {
	double tmp;
	if (Math.tan(a) <= -0.001) {
		tmp = Math.pow(Math.cbrt(x), 3.0);
	} else if (Math.tan(a) <= 1.5e-5) {
		tmp = (x + Math.tan((y + z))) - a;
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (tan(a) <= -0.001)
		tmp = cbrt(x) ^ 3.0;
	elseif (tan(a) <= 1.5e-5)
		tmp = Float64(Float64(x + tan(Float64(y + z))) - a);
	else
		tmp = x;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, a_] := If[LessEqual[N[Tan[a], $MachinePrecision], -0.001], N[Power[N[Power[x, 1/3], $MachinePrecision], 3.0], $MachinePrecision], If[LessEqual[N[Tan[a], $MachinePrecision], 1.5e-5], N[(N[(x + N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision], x]]

Derivation

1. Split input into 3 regimes

2. if (tan.f64 a) < -1e-3

   1. Initial program 84.8%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cube-cbrt 83.2%

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

      2. pow3 83.2%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{x + \left(\tan \left(y + z\right) - \tan a\right)}\right)}^{3}} \]

      3. +-commutative 83.2%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{\left(\tan \left(y + z\right) - \tan a\right) + x}}\right)}^{3} \]

      4. associate-+l- 83.1%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{\tan \left(y + z\right) - \left(\tan a - x\right)}}\right)}^{3} \]

   4. Applied egg-rr 83.1%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{\tan \left(y + z\right) - \left(\tan a - x\right)}\right)}^{3}} \]

   5. Taylor expanded in x around inf 23.1%

      \[\leadsto {\color{blue}{\left(\sqrt[3]{x}\right)}}^{3} \]

   if -1e-3 < (tan.f64 a) < 1.50000000000000004e-5

   1. Initial program 81.7%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 81.7%

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

      1. associate-+r- 81.7%

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

   5. Applied egg-rr 81.7%

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

      1. +-commutative 81.7%

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

   7. Simplified 81.7%

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

   if 1.50000000000000004e-5 < (tan.f64 a)

   1. Initial program 72.5%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 21.2%

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

4. Final simplification 52.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\tan a \leq -0.001:\\ \;\;\;\;{\left(\sqrt[3]{x}\right)}^{3}\\ \mathbf{elif}\;\tan a \leq 1.5 \cdot 10^{-5}:\\ \;\;\;\;\left(x + \tan \left(y + z\right)\right) - a\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 79.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z, double a) {
	return x + ((Math.tan(y) + Math.tan(z)) - Math.tan(a));
}

Python

def code(x, y, z, a):
	return x + ((math.tan(y) + math.tan(z)) - math.tan(a))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.8%

   \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. tan-sum 99.8%

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

   2. div-inv 99.8%

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

4. Applied egg-rr 99.8%

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

5. Taylor expanded in y around 0 81.1%

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

6. Final simplification 81.1%

   \[\leadsto x + \left(\left(\tan y + \tan z\right) - \tan a\right) \]
7. Add Preprocessing

Alternative 7: 49.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(\tan a + \tan \left(y + z\right)\right) \end{array} \]

FPCore

(FPCore (x y z a) :precision binary64 (+ x (+ (tan a) (tan (+ y z)))))

C

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

Fortran

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

Java

public static double code(double x, double y, double z, double a) {
	return x + (Math.tan(a) + Math.tan((y + z)));
}

Python

def code(x, y, z, a):
	return x + (math.tan(a) + math.tan((y + z)))

Julia

function code(x, y, z, a)
	return Float64(x + Float64(tan(a) + tan(Float64(y + z))))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.8%

   \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. sub-neg 80.8%

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

4. Applied egg-rr 80.8%

   \[\leadsto x + \color{blue}{\left(\tan \left(y + z\right) + \left(-\tan a\right)\right)} \]
5. Step-by-step derivation

   1. rem-square-sqrt 45.2%

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

   2. fabs-sqr 45.2%

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

   3. rem-square-sqrt 70.4%

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

   4. fabs-neg 70.4%

      \[\leadsto x + \left(\tan \left(y + z\right) + \color{blue}{\left|\tan a\right|}\right) \]

   5. rem-square-sqrt 25.1%

      \[\leadsto x + \left(\tan \left(y + z\right) + \left|\color{blue}{\sqrt{\tan a} \cdot \sqrt{\tan a}}\right|\right) \]

   6. fabs-sqr 25.1%

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

   7. rem-square-sqrt 51.6%

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

   8. +-commutative 51.6%

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

6. Simplified 51.6%

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

7. Final simplification 51.6%

   \[\leadsto x + \left(\tan a + \tan \left(y + z\right)\right) \]
8. Add Preprocessing

Alternative 8: 79.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z, double a) {
	return x + (Math.tan((y + z)) - Math.tan(a));
}

Python

def code(x, y, z, a):
	return x + (math.tan((y + z)) - math.tan(a))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.8%

   \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
2. Add Preprocessing

3. Final simplification 80.8%

   \[\leadsto x + \left(\tan \left(y + z\right) - \tan a\right) \]
4. Add Preprocessing

Alternative 9: 50.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.65:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.85 \cdot 10^{-5}:\\ \;\;\;\;x + \left(\tan \left(y + z\right) - a\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= a -1.65) x (if (<= a 1.85e-5) (+ x (- (tan (+ y z)) a)) x)))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -1.65) {
		tmp = x;
	} else if (a <= 1.85e-5) {
		tmp = x + (tan((y + z)) - a);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a <= (-1.65d0)) then
        tmp = x
    else if (a <= 1.85d-5) then
        tmp = x + (tan((y + z)) - a)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -1.65) {
		tmp = x;
	} else if (a <= 1.85e-5) {
		tmp = x + (Math.tan((y + z)) - a);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, a):
	tmp = 0
	if a <= -1.65:
		tmp = x
	elif a <= 1.85e-5:
		tmp = x + (math.tan((y + z)) - a)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (a <= -1.65)
		tmp = x;
	elseif (a <= 1.85e-5)
		tmp = Float64(x + Float64(tan(Float64(y + z)) - a));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if (a <= -1.65)
		tmp = x;
	elseif (a <= 1.85e-5)
		tmp = x + (tan((y + z)) - a);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := If[LessEqual[a, -1.65], x, If[LessEqual[a, 1.85e-5], N[(x + N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] - a), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if a < -1.6499999999999999 or 1.84999999999999991e-5 < a

   1. Initial program 79.8%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 22.3%

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

   if -1.6499999999999999 < a < 1.84999999999999991e-5

   1. Initial program 81.7%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 81.7%

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

4. Final simplification 52.9%

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

Alternative 10: 50.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.5:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.85 \cdot 10^{-5}:\\ \;\;\;\;\left(x + \tan \left(y + z\right)\right) - a\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= a -1.5) x (if (<= a 1.85e-5) (- (+ x (tan (+ y z))) a) x)))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -1.5) {
		tmp = x;
	} else if (a <= 1.85e-5) {
		tmp = (x + tan((y + z))) - a;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a <= (-1.5d0)) then
        tmp = x
    else if (a <= 1.85d-5) then
        tmp = (x + tan((y + z))) - a
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -1.5) {
		tmp = x;
	} else if (a <= 1.85e-5) {
		tmp = (x + Math.tan((y + z))) - a;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, a):
	tmp = 0
	if a <= -1.5:
		tmp = x
	elif a <= 1.85e-5:
		tmp = (x + math.tan((y + z))) - a
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (a <= -1.5)
		tmp = x;
	elseif (a <= 1.85e-5)
		tmp = Float64(Float64(x + tan(Float64(y + z))) - a);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if (a <= -1.5)
		tmp = x;
	elseif (a <= 1.85e-5)
		tmp = (x + tan((y + z))) - a;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := If[LessEqual[a, -1.5], x, If[LessEqual[a, 1.85e-5], N[(N[(x + N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if a < -1.5 or 1.84999999999999991e-5 < a

   1. Initial program 79.8%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 22.3%

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

   if -1.5 < a < 1.84999999999999991e-5

   1. Initial program 81.7%

      \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 81.7%

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

      1. associate-+r- 81.7%

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

   5. Applied egg-rr 81.7%

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

      1. +-commutative 81.7%

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

   7. Simplified 81.7%

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

4. Final simplification 52.9%

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

Alternative 11: 31.7% accurate, 207.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.8%

   \[x + \left(\tan \left(y + z\right) - \tan a\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf 32.4%

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

4. Final simplification 32.4%

   \[\leadsto x \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024084 
(FPCore (x y z a)
  :name "tan-example (used to crash)"
  :precision binary64
  :pre (and (and (and (or (== x 0.0) (and (<= 0.5884142 x) (<= x 505.5909))) (or (and (<= -1.796658e+308 y) (<= y -9.425585e-310)) (and (<= 1.284938e-309 y) (<= y 1.751224e+308)))) (or (and (<= -1.776707e+308 z) (<= z -8.599796e-310)) (and (<= 3.293145e-311 z) (<= z 1.725154e+308)))) (or (and (<= -1.796658e+308 a) (<= a -9.425585e-310)) (and (<= 1.284938e-309 a) (<= a 1.751224e+308))))
  (+ x (- (tan (+ y z)) (tan a))))