tan-example (used to crash)

Percentage Accurate: 79.0% → 99.7%

Time: 35.8s

Alternatives: 15

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.0% 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 + \left(1 + \left(-1 - \tan y \cdot \tan z\right)\right)} - \tan a\right) \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (+
  x
  (-
   (* (+ (tan y) (tan z)) (/ 1.0 (+ 1.0 (+ 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 + (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 + (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 + (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 + (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(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 + (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[(1.0 + N[(-1.0 - N[(N[Tan[y], $MachinePrecision] * N[Tan[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 83.1%

   \[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. Step-by-step derivation

   1. expm1-log1p-u 94.3%

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

   2. expm1-undefine 94.3%

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

   3. log1p-undefine 94.3%

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

   4. add-exp-log 99.8%

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

8. Applied egg-rr 99.8%

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

9. Final simplification 99.8%

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

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

   \[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. Add Preprocessing

Alternative 3: 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 83.1%

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

   1. +-commutative 83.1%

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

   2. sub-neg 83.1%

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

   3. associate-+l+ 83.1%

      \[\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 4: 89.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \tan y + \tan z\\ \mathbf{if}\;a \leq -0.0028 \lor \neg \left(a \leq 0.00024\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 (<= a -0.0028) (not (<= a 0.00024)))
     (+ 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 ((a <= -0.0028) || !(a <= 0.00024)) {
		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 ((a <= (-0.0028d0)) .or. (.not. (a <= 0.00024d0))) 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 ((a <= -0.0028) || !(a <= 0.00024)) {
		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 (a <= -0.0028) or not (a <= 0.00024):
		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 ((a <= -0.0028) || !(a <= 0.00024))
		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 ((a <= -0.0028) || ~((a <= 0.00024)))
		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[a, -0.0028], N[Not[LessEqual[a, 0.00024]], $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 a < -0.00279999999999999997 or 2.40000000000000006e-4 < a

   1. Initial program 85.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) \]

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

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

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

      1. expm1-log1p-u 94.8%

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

      2. expm1-undefine 94.8%

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

      3. log1p-undefine 94.8%

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

      4. add-exp-log 99.8%

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

   8. Applied egg-rr 99.8%

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

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. fma-define 99.8%

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

      4. metadata-eval 99.8%

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

   10. Applied egg-rr 99.8%

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

   11. Taylor expanded in y around 0 85.8%

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

   if -0.00279999999999999997 < a < 2.40000000000000006e-4

   1. Initial program 81.0%

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

   3. Taylor expanded in a around 0 81.0%

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

      1. tan-sum 99.6%

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

      2. div-inv 99.6%

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

   5. Applied egg-rr 99.6%

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

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

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

   7. Simplified 99.6%

      \[\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 93.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -0.0028 \lor \neg \left(a \leq 0.00024\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 5: 69.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\tan a \leq -2 \cdot 10^{-40} \lor \neg \left(\tan a \leq 5 \cdot 10^{-6}\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 (<= (tan a) -2e-40) (not (<= (tan a) 5e-6)))
   (+ x (- (tan y) (tan a)))
   (+ x (- (tan (+ y z)) a))))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if ((tan(a) <= -2e-40) || !(tan(a) <= 5e-6)) {
		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 ((tan(a) <= (-2d-40)) .or. (.not. (tan(a) <= 5d-6))) 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 ((Math.tan(a) <= -2e-40) || !(Math.tan(a) <= 5e-6)) {
		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 (math.tan(a) <= -2e-40) or not (math.tan(a) <= 5e-6):
		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 ((tan(a) <= -2e-40) || !(tan(a) <= 5e-6))
		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 ((tan(a) <= -2e-40) || ~((tan(a) <= 5e-6)))
		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[N[Tan[a], $MachinePrecision], -2e-40], N[Not[LessEqual[N[Tan[a], $MachinePrecision], 5e-6]], $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 (tan.f64 a) < -1.9999999999999999e-40 or 5.00000000000000041e-6 < (tan.f64 a)

   1. Initial program 84.8%

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

   3. Taylor expanded in y around inf 66.5%

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

   if -1.9999999999999999e-40 < (tan.f64 a) < 5.00000000000000041e-6

   1. Initial program 81.5%

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

   3. Taylor expanded in a around 0 81.5%

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

4. Final simplification 74.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\tan a \leq -2 \cdot 10^{-40} \lor \neg \left(\tan a \leq 5 \cdot 10^{-6}\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: 79.4% 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 83.1%

   \[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. Step-by-step derivation

   1. expm1-log1p-u 94.3%

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

   2. expm1-undefine 94.3%

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

   3. log1p-undefine 94.3%

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

   4. add-exp-log 99.8%

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

8. Applied egg-rr 99.8%

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

   1. sub-neg 99.8%

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

   2. +-commutative 99.8%

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

   3. fma-define 99.8%

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

   4. metadata-eval 99.8%

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

10. Applied egg-rr 99.8%

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

11. Taylor expanded in y around 0 83.4%

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

12. Final simplification 83.4%

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

Alternative 7: 60.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y + z \leq -2 \cdot 10^{-15}:\\ \;\;\;\;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 z) -2e-15) (+ 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 + z) <= -2e-15) {
		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 + z) <= (-2d-15)) 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 + z) <= -2e-15) {
		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 + z) <= -2e-15:
		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 (Float64(y + z) <= -2e-15)
		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 + z) <= -2e-15)
		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[N[(y + z), $MachinePrecision], -2e-15], 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 (+.f64 y z) < -2.0000000000000002e-15

   1. Initial program 73.0%

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

   3. Taylor expanded in y around inf 49.8%

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

   if -2.0000000000000002e-15 < (+.f64 y z)

   1. Initial program 89.0%

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

   3. Taylor expanded in y around 0 70.5%

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

Alternative 8: 49.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= a -5e-49) x (if (<= a 1.6) (- (+ x (tan (+ y z))) a) (exp (log x)))))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -5e-49) {
		tmp = x;
	} else if (a <= 1.6) {
		tmp = (x + tan((y + z))) - a;
	} else {
		tmp = exp(log(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 <= (-5d-49)) then
        tmp = x
    else if (a <= 1.6d0) then
        tmp = (x + tan((y + z))) - a
    else
        tmp = exp(log(x))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -4.9999999999999999e-49

   1. Initial program 77.0%

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

   3. Taylor expanded in x around inf 26.6%

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

   if -4.9999999999999999e-49 < a < 1.6000000000000001

   1. Initial program 82.0%

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

   3. Taylor expanded in a around 0 82.0%

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

      1. associate-+r- 82.0%

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

   5. Applied egg-rr 82.0%

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

   if 1.6000000000000001 < a

   1. Initial program 90.5%

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

   3. Taylor expanded in a around 0 1.7%

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

      1. add-exp-log 0.0%

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

      2. associate-+r- 0.0%

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

   5. Applied egg-rr 0.0%

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

   6. Taylor expanded in x around inf 21.7%

      \[\leadsto e^{\color{blue}{-1 \cdot \log \left(\frac{1}{x}\right)}} \]
   7. Step-by-step derivation

      1. mul-1-neg 21.7%

         \[\leadsto e^{\color{blue}{-\log \left(\frac{1}{x}\right)}} \]

      2. log-rec 21.7%

         \[\leadsto e^{-\color{blue}{\left(-\log x\right)}} \]

      3. remove-double-neg 21.7%

         \[\leadsto e^{\color{blue}{\log x}} \]

   8. Simplified 21.7%

      \[\leadsto e^{\color{blue}{\log x}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 79.0% 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 83.1%

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

Alternative 10: 49.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -5 \cdot 10^{-49}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.6:\\ \;\;\;\;\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 -5e-49) x (if (<= a 1.6) (- (+ x (tan (+ y z))) a) x)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -4.9999999999999999e-49 or 1.6000000000000001 < a

   1. Initial program 84.2%

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

   3. Taylor expanded in x around inf 24.0%

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

   if -4.9999999999999999e-49 < a < 1.6000000000000001

   1. Initial program 82.0%

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

   3. Taylor expanded in a around 0 82.0%

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

      1. associate-+r- 82.0%

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

   5. Applied egg-rr 82.0%

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

Alternative 11: 49.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -5 \cdot 10^{-49}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.6:\\ \;\;\;\;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 -5e-49) x (if (<= a 1.6) (+ x (- (tan (+ y z)) a)) x)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -4.9999999999999999e-49 or 1.6000000000000001 < a

   1. Initial program 84.2%

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

   3. Taylor expanded in x around inf 24.0%

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

   if -4.9999999999999999e-49 < a < 1.6000000000000001

   1. Initial program 82.0%

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

   3. Taylor expanded in a around 0 82.0%

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

Alternative 12: 41.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.75 or 0.54000000000000004 < a

   1. Initial program 85.4%

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

   3. Taylor expanded in x around inf 22.1%

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

   if -1.75 < a < 0.54000000000000004

   1. Initial program 81.0%

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

   3. Taylor expanded in a around 0 81.0%

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

   4. Taylor expanded in y around inf 57.8%

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

Alternative 13: 36.6% accurate, 1.9× speedup

Math

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

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (z <= 0.000205) {
		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 <= 0.000205d0) 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 <= 0.000205) {
		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 <= 0.000205:
		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 <= 0.000205)
		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 <= 0.000205)
		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, 0.000205], 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 < 2.05e-4

   1. Initial program 86.1%

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

   3. Taylor expanded in a around 0 45.3%

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

   4. Taylor expanded in y around inf 38.2%

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

   if 2.05e-4 < z

   1. Initial program 74.2%

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

   3. Taylor expanded in a around 0 41.0%

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

   4. Taylor expanded in y around 0 41.1%

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

Alternative 14: 31.8% 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 83.1%

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

3. Taylor expanded in x around inf 31.8%

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

Alternative 15: 3.5% accurate, 207.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 83.1%

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

3. Taylor expanded in a around 0 44.3%

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

4. Taylor expanded in a around inf 3.6%

   \[\leadsto \color{blue}{-1 \cdot a} \]
5. Step-by-step derivation

   1. neg-mul-1 3.6%

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

6. Simplified 3.6%

   \[\leadsto \color{blue}{-a} \]
7. Step-by-step derivation

   1. add-sqr-sqrt 2.6%

      \[\leadsto \color{blue}{\sqrt{-a} \cdot \sqrt{-a}} \]

   2. sqrt-unprod 4.6%

      \[\leadsto \color{blue}{\sqrt{\left(-a\right) \cdot \left(-a\right)}} \]

   3. sqr-neg 4.6%

      \[\leadsto \sqrt{\color{blue}{a \cdot a}} \]

   4. sqrt-unprod 2.3%

      \[\leadsto \color{blue}{\sqrt{a} \cdot \sqrt{a}} \]

   5. add-sqr-sqrt 3.3%

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

   6. *-un-lft-identity 3.3%

      \[\leadsto \color{blue}{1 \cdot a} \]

8. Applied egg-rr 3.3%

   \[\leadsto \color{blue}{1 \cdot a} \]
9. Step-by-step derivation

   1. *-lft-identity 3.3%

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

10. Simplified 3.3%

    \[\leadsto \color{blue}{a} \]
11. Add Preprocessing

Reproduce

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