tan-example (used to crash)

Percentage Accurate: 79.3% → 99.7%

Time: 36.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.3% 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 82.9%

   \[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) \]

   3. fmm-def 99.8%

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

4. Applied egg-rr 99.8%

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

   1. fmm-undef 99.8%

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

6. Simplified 99.8%

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

7. 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) \]
8. Add Preprocessing

Alternative 2: 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 82.9%

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

   1. +-commutative 82.9%

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

   2. sub-neg 82.9%

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

   3. associate-+l+ 82.8%

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

   4. tan-sum 99.7%

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

   5. div-inv 99.7%

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

   6. fma-define 99.7%

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

   7. neg-mul-1 99.7%

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

   8. fma-define 99.7%

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

4. Applied egg-rr 99.7%

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

   1. fma-undefine 99.7%

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

   2. fma-undefine 99.7%

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

   3. neg-mul-1 99.7%

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

   4. associate-+r+ 99.8%

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

   5. sub-neg 99.8%

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

   6. associate-*r/ 99.8%

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

   7. *-rgt-identity 99.8%

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

6. Simplified 99.8%

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

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 3: 89.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\frac{\cos \left(y + z\right)}{\sin \left(y + z\right)}}\\ \mathbf{if}\;a \leq -9.8 \cdot 10^{-5}:\\ \;\;\;\;t\_0 + \left(x - \tan a\right)\\ \mathbf{elif}\;a \leq 2.1 \cdot 10^{-11}:\\ \;\;\;\;x + \left(\frac{\tan y + \tan z}{1 - \tan y \cdot \tan z} - a\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(t\_0 - \tan a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (let* ((t_0 (/ 1.0 (/ (cos (+ y z)) (sin (+ y z))))))
   (if (<= a -9.8e-5)
     (+ t_0 (- x (tan a)))
     (if (<= a 2.1e-11)
       (+ x (- (/ (+ (tan y) (tan z)) (- 1.0 (* (tan y) (tan z)))) a))
       (+ x (- t_0 (tan a)))))))

C

double code(double x, double y, double z, double a) {
	double t_0 = 1.0 / (cos((y + z)) / sin((y + z)));
	double tmp;
	if (a <= -9.8e-5) {
		tmp = t_0 + (x - tan(a));
	} else if (a <= 2.1e-11) {
		tmp = x + (((tan(y) + tan(z)) / (1.0 - (tan(y) * tan(z)))) - a);
	} else {
		tmp = x + (t_0 - tan(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 = 1.0d0 / (cos((y + z)) / sin((y + z)))
    if (a <= (-9.8d-5)) then
        tmp = t_0 + (x - tan(a))
    else if (a <= 2.1d-11) then
        tmp = x + (((tan(y) + tan(z)) / (1.0d0 - (tan(y) * tan(z)))) - a)
    else
        tmp = x + (t_0 - tan(a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double t_0 = 1.0 / (Math.cos((y + z)) / Math.sin((y + z)));
	double tmp;
	if (a <= -9.8e-5) {
		tmp = t_0 + (x - Math.tan(a));
	} else if (a <= 2.1e-11) {
		tmp = x + (((Math.tan(y) + Math.tan(z)) / (1.0 - (Math.tan(y) * Math.tan(z)))) - a);
	} else {
		tmp = x + (t_0 - Math.tan(a));
	}
	return tmp;
}

Python

def code(x, y, z, a):
	t_0 = 1.0 / (math.cos((y + z)) / math.sin((y + z)))
	tmp = 0
	if a <= -9.8e-5:
		tmp = t_0 + (x - math.tan(a))
	elif a <= 2.1e-11:
		tmp = x + (((math.tan(y) + math.tan(z)) / (1.0 - (math.tan(y) * math.tan(z)))) - a)
	else:
		tmp = x + (t_0 - math.tan(a))
	return tmp

Julia

function code(x, y, z, a)
	t_0 = Float64(1.0 / Float64(cos(Float64(y + z)) / sin(Float64(y + z))))
	tmp = 0.0
	if (a <= -9.8e-5)
		tmp = Float64(t_0 + Float64(x - tan(a)));
	elseif (a <= 2.1e-11)
		tmp = Float64(x + Float64(Float64(Float64(tan(y) + tan(z)) / Float64(1.0 - Float64(tan(y) * tan(z)))) - a));
	else
		tmp = Float64(x + Float64(t_0 - tan(a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	t_0 = 1.0 / (cos((y + z)) / sin((y + z)));
	tmp = 0.0;
	if (a <= -9.8e-5)
		tmp = t_0 + (x - tan(a));
	elseif (a <= 2.1e-11)
		tmp = x + (((tan(y) + tan(z)) / (1.0 - (tan(y) * tan(z)))) - a);
	else
		tmp = x + (t_0 - tan(a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := Block[{t$95$0 = N[(1.0 / N[(N[Cos[N[(y + z), $MachinePrecision]], $MachinePrecision] / N[Sin[N[(y + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -9.8e-5], N[(t$95$0 + N[(x - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.1e-11], 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] - a), $MachinePrecision]), $MachinePrecision], N[(x + N[(t$95$0 - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if a < -9.8e-5

   1. Initial program 82.3%

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

      1. +-commutative 82.3%

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

      2. sub-neg 82.3%

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

      3. associate-+l+ 82.3%

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

      4. tan-quot 82.3%

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

      5. div-inv 82.3%

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

      6. fma-define 82.3%

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

      7. neg-mul-1 82.3%

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

      8. fma-define 82.3%

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

   4. Applied egg-rr 82.3%

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

      1. fma-undefine 82.3%

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

      2. neg-mul-1 82.3%

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

      3. neg-sub0 82.3%

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

      4. associate-+l- 82.3%

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

      5. neg-sub0 82.3%

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

      6. fmm-undef 82.3%

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

      7. associate-*r/ 82.3%

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

      8. *-rgt-identity 82.3%

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

   6. Simplified 82.3%

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

      1. add-cbrt-cube 43.1%

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

      2. pow3 43.1%

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

   8. Applied egg-rr 43.1%

      \[\leadsto \frac{\sin \left(y + z\right)}{\cos \color{blue}{\left(\sqrt[3]{{\left(y + z\right)}^{3}}\right)}} - \left(\tan a - x\right) \]
   9. Step-by-step derivation

      1. clear-num 43.1%

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

      2. inv-pow 43.1%

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

      3. rem-cbrt-cube 82.3%

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

   10. Applied egg-rr 82.3%

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

       1. unpow-1 82.3%

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

   12. Simplified 82.3%

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

   if -9.8e-5 < a < 2.0999999999999999e-11

   1. Initial program 82.2%

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

   3. Taylor expanded in a around 0 82.2%

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

      1. tan-sum 99.9%

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

      2. div-inv 99.9%

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

      3. fmm-def 99.9%

         \[\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.9%

      \[\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. fmm-undef 99.9%

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

      2. associate-*r/ 99.9%

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

      3. *-rgt-identity 99.9%

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

   7. Simplified 99.9%

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

   if 2.0999999999999999e-11 < a

   1. Initial program 84.8%

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

      1. tan-quot 84.8%

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

      2. clear-num 84.8%

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

   4. Applied egg-rr 84.8%

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

4. Final simplification 92.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -9.8 \cdot 10^{-5}:\\ \;\;\;\;\frac{1}{\frac{\cos \left(y + z\right)}{\sin \left(y + z\right)}} + \left(x - \tan a\right)\\ \mathbf{elif}\;a \leq 2.1 \cdot 10^{-11}:\\ \;\;\;\;x + \left(\frac{\tan y + \tan z}{1 - \tan y \cdot \tan z} - a\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(\frac{1}{\frac{\cos \left(y + z\right)}{\sin \left(y + z\right)}} - \tan a\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 79.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double a) {
	return x + (tan((y + z)) - log(exp(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)) - log(exp(tan(a))))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 82.9%

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

   1. add-log-exp 82.9%

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

4. Applied egg-rr 82.9%

   \[\leadsto x + \left(\tan \left(y + z\right) - \color{blue}{\log \left(e^{\tan a}\right)}\right) \]
5. Add Preprocessing

Alternative 5: 69.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -0.005 \lor \neg \left(a \leq 0.00076\right):\\ \;\;\;\;x + \left(\tan y - \tan a\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(\tan \left(y + z\right) - a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (or (<= a -0.005) (not (<= a 0.00076)))
   (+ x (- (tan y) (tan a)))
   (+ x (- (tan (+ y z)) a))))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if ((a <= -0.005) || !(a <= 0.00076)) {
		tmp = x + (tan(y) - tan(a));
	} else {
		tmp = x + (tan((y + 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) :: tmp
    if ((a <= (-0.005d0)) .or. (.not. (a <= 0.00076d0))) then
        tmp = x + (tan(y) - tan(a))
    else
        tmp = x + (tan((y + z)) - a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double tmp;
	if ((a <= -0.005) || !(a <= 0.00076)) {
		tmp = x + (Math.tan(y) - Math.tan(a));
	} else {
		tmp = x + (Math.tan((y + z)) - a);
	}
	return tmp;
}

Python

def code(x, y, z, a):
	tmp = 0
	if (a <= -0.005) or not (a <= 0.00076):
		tmp = x + (math.tan(y) - math.tan(a))
	else:
		tmp = x + (math.tan((y + z)) - a)
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if ((a <= -0.005) || !(a <= 0.00076))
		tmp = Float64(x + Float64(tan(y) - tan(a)));
	else
		tmp = Float64(x + Float64(tan(Float64(y + z)) - a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if ((a <= -0.005) || ~((a <= 0.00076)))
		tmp = x + (tan(y) - tan(a));
	else
		tmp = x + (tan((y + z)) - a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := If[Or[LessEqual[a, -0.005], N[Not[LessEqual[a, 0.00076]], $MachinePrecision]], N[(x + N[(N[Tan[y], $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] - a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -0.0050000000000000001 or 7.6000000000000004e-4 < a

   1. Initial program 83.5%

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

   3. Taylor expanded in y around inf 63.5%

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

   if -0.0050000000000000001 < a < 7.6000000000000004e-4

   1. Initial program 82.4%

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

   3. Taylor expanded in a around 0 82.4%

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

4. Final simplification 73.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -0.005 \lor \neg \left(a \leq 0.00076\right):\\ \;\;\;\;x + \left(\tan y - \tan a\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(\tan \left(y + z\right) - a\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 69.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= y -5.5e-9) (+ x (- (tan y) (tan a))) (+ x (- (tan z) (tan a)))))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (y <= -5.5e-9) {
		tmp = x + (tan(y) - tan(a));
	} else {
		tmp = x + (tan(z) - tan(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) :: tmp
    if (y <= (-5.5d-9)) then
        tmp = x + (tan(y) - tan(a))
    else
        tmp = x + (tan(z) - tan(a))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, a):
	tmp = 0
	if y <= -5.5e-9:
		tmp = x + (math.tan(y) - math.tan(a))
	else:
		tmp = x + (math.tan(z) - math.tan(a))
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (y <= -5.5e-9)
		tmp = Float64(x + Float64(tan(y) - tan(a)));
	else
		tmp = Float64(x + Float64(tan(z) - tan(a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if (y <= -5.5e-9)
		tmp = x + (tan(y) - tan(a));
	else
		tmp = x + (tan(z) - tan(a));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -5.4999999999999996e-9

   1. Initial program 65.4%

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

   3. Taylor expanded in y around inf 65.4%

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

   if -5.4999999999999996e-9 < y

   1. Initial program 87.7%

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

   3. Taylor expanded in y around 0 74.7%

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

Alternative 7: 79.3% 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 82.9%

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

Alternative 8: 50.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -8:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.65:\\ \;\;\;\;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 -8.0) x (if (<= a 1.65) (+ x (- (tan (+ y z)) a)) x)))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -8.0) {
		tmp = x;
	} else if (a <= 1.65) {
		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 <= (-8.0d0)) then
        tmp = x
    else if (a <= 1.65d0) 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 <= -8.0) {
		tmp = x;
	} else if (a <= 1.65) {
		tmp = x + (Math.tan((y + z)) - a);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (a <= -8.0)
		tmp = x;
	elseif (a <= 1.65)
		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 <= -8.0)
		tmp = x;
	elseif (a <= 1.65)
		tmp = x + (tan((y + z)) - a);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -8 or 1.6499999999999999 < a

   1. Initial program 83.2%

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

   3. Taylor expanded in x around inf 23.0%

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

   if -8 < a < 1.6499999999999999

   1. Initial program 82.6%

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

   3. Taylor expanded in a around 0 82.2%

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

Alternative 9: 40.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -7.8:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.56:\\ \;\;\;\;x + \left(\tan y - a\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= a -7.8) x (if (<= a 1.56) (+ x (- (tan y) a)) x)))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -7.8) {
		tmp = x;
	} else if (a <= 1.56) {
		tmp = x + (tan(y) - 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 <= (-7.8d0)) then
        tmp = x
    else if (a <= 1.56d0) then
        tmp = x + (tan(y) - 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 <= -7.8) {
		tmp = x;
	} else if (a <= 1.56) {
		tmp = x + (Math.tan(y) - a);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, a):
	tmp = 0
	if a <= -7.8:
		tmp = x
	elif a <= 1.56:
		tmp = x + (math.tan(y) - a)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (a <= -7.8)
		tmp = x;
	elseif (a <= 1.56)
		tmp = Float64(x + Float64(tan(y) - a));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if (a <= -7.8)
		tmp = x;
	elseif (a <= 1.56)
		tmp = x + (tan(y) - a);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -7.79999999999999982 or 1.5600000000000001 < a

   1. Initial program 83.2%

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

   3. Taylor expanded in x around inf 23.0%

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

   if -7.79999999999999982 < a < 1.5600000000000001

   1. Initial program 82.6%

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

   3. Taylor expanded in a around 0 82.2%

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

   4. Taylor expanded in y around inf 61.4%

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

Alternative 10: 35.4% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= z 9.5e-13) (+ x (- (tan y) a)) (+ x (- (tan z) a))))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (z <= 9.5e-13) {
		tmp = x + (tan(y) - a);
	} else {
		tmp = x + (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) :: tmp
    if (z <= 9.5d-13) then
        tmp = x + (tan(y) - a)
    else
        tmp = x + (tan(z) - a)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, a):
	tmp = 0
	if z <= 9.5e-13:
		tmp = x + (math.tan(y) - a)
	else:
		tmp = x + (math.tan(z) - a)
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (z <= 9.5e-13)
		tmp = Float64(x + Float64(tan(y) - a));
	else
		tmp = Float64(x + Float64(tan(z) - a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if (z <= 9.5e-13)
		tmp = x + (tan(y) - a);
	else
		tmp = x + (tan(z) - a);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 9.49999999999999991e-13

   1. Initial program 87.1%

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

   3. Taylor expanded in a around 0 47.8%

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

   4. Taylor expanded in y around inf 40.9%

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

   if 9.49999999999999991e-13 < z

   1. Initial program 71.6%

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

   3. Taylor expanded in a around 0 37.6%

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

   4. Taylor expanded in y around 0 37.8%

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

Alternative 11: 31.4% 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 82.9%

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

3. Taylor expanded in x around inf 33.5%

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

Reproduce

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