tan-example (used to crash)

Percentage Accurate: 79.8% → 99.7%

Time: 26.4s

Alternatives: 12

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.8% 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(\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.7%

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

   1. tan-sum N/A

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

   2. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\left(\tan y + \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(\color{blue}{a}\right)\right)\right) \]

   3. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\tan y, \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   4. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   5. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   6. --lowering--.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   7. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\tan y, \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   8. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   9. tan-lowering-tan.f64 99.6%

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

4. Applied egg-rr 99.6%

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

Alternative 2: 89.7% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double a) {
	double t_0 = tan(y) + tan(z);
	double t_1 = x + (t_0 - tan(a));
	double tmp;
	if (tan(a) <= -0.002) {
		tmp = t_1;
	} else if (tan(a) <= 2e-5) {
		tmp = x + ((t_0 / (1.0 - (tan(y) * tan(z)))) - a);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = tan(y) + tan(z)
    t_1 = x + (t_0 - tan(a))
    if (tan(a) <= (-0.002d0)) then
        tmp = t_1
    else if (tan(a) <= 2d-5) then
        tmp = x + ((t_0 / (1.0d0 - (tan(y) * tan(z)))) - a)
    else
        tmp = t_1
    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 t_1 = x + (t_0 - Math.tan(a));
	double tmp;
	if (Math.tan(a) <= -0.002) {
		tmp = t_1;
	} else if (Math.tan(a) <= 2e-5) {
		tmp = x + ((t_0 / (1.0 - (Math.tan(y) * Math.tan(z)))) - a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, a)
	t_0 = tan(y) + tan(z);
	t_1 = x + (t_0 - tan(a));
	tmp = 0.0;
	if (tan(a) <= -0.002)
		tmp = t_1;
	elseif (tan(a) <= 2e-5)
		tmp = x + ((t_0 / (1.0 - (tan(y) * tan(z)))) - a);
	else
		tmp = t_1;
	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]}, Block[{t$95$1 = N[(x + N[(t$95$0 - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Tan[a], $MachinePrecision], -0.002], t$95$1, If[LessEqual[N[Tan[a], $MachinePrecision], 2e-5], 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], t$95$1]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 81.7%

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

      1. tan-sum N/A

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

      2. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\left(\tan y + \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(\color{blue}{a}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\tan y, \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      4. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      5. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      7. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\tan y, \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      8. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      9. tan-lowering-tan.f64 99.5%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   4. Applied egg-rr 99.5%

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

      1. tan-quot N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \frac{\sin z}{\cos z}\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      2. clear-num N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \frac{1}{\frac{\cos z}{\sin z}}\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      3. un-div-inv N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\frac{\tan y}{\frac{\cos z}{\sin z}}\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\tan y, \left(\frac{\cos z}{\sin z}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      5. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \left(\frac{\cos z}{\sin z}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      6. clear-num N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \left(\frac{1}{\frac{\sin z}{\cos z}}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      7. tan-quot N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \left(\frac{1}{\tan z}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      8. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{/.f64}\left(1, \tan z\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

      9. tan-lowering-tan.f64 99.4%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{/.f64}\left(1, \mathsf{tan.f64}\left(z\right)\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   6. Applied egg-rr 99.4%

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

   7. Taylor expanded in y around 0

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \color{blue}{1}\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]
   8. Step-by-step derivation

   9. Simplified 82.4%

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

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

   1. Initial program 79.7%

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

   3. Taylor expanded in a around 0

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

   5. Simplified 79.7%

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

      1. tan-sum N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\left(\frac{\tan y + \tan z}{1 - \tan y \cdot \tan z}\right), a\right)\right) \]

      2. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\left(\tan y + \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), a\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\tan y, \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), a\right)\right) \]

      4. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), a\right)\right) \]

      5. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \left(1 - \tan y \cdot \tan z\right)\right), a\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \tan z\right)\right)\right), a\right)\right) \]

      7. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\tan y, \tan z\right)\right)\right), a\right)\right) \]

      8. tan-lowering-tan.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right)\right)\right), a\right)\right) \]

      9. tan-lowering-tan.f64 99.8%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right)\right)\right), a\right)\right) \]

   7. Applied egg-rr 99.8%

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

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

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

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

   1. tan-sum N/A

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

   2. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\left(\tan y + \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(\color{blue}{a}\right)\right)\right) \]

   3. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\tan y, \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   4. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   5. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \left(1 - \tan y \cdot \tan z\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   6. --lowering--.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   7. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\tan y, \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   8. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \tan z\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   9. tan-lowering-tan.f64 99.6%

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{*.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

4. Applied egg-rr 99.6%

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

   1. tan-quot N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \frac{\sin z}{\cos z}\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   2. clear-num N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\tan y \cdot \frac{1}{\frac{\cos z}{\sin z}}\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   3. un-div-inv N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \left(\frac{\tan y}{\frac{\cos z}{\sin z}}\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   4. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\tan y, \left(\frac{\cos z}{\sin z}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   5. tan-lowering-tan.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \left(\frac{\cos z}{\sin z}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   6. clear-num N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \left(\frac{1}{\frac{\sin z}{\cos z}}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   7. tan-quot N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \left(\frac{1}{\tan z}\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   8. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{/.f64}\left(1, \tan z\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

   9. tan-lowering-tan.f64 99.6%

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{/.f64}\left(1, \mathsf{tan.f64}\left(z\right)\right)\right)\right)\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]

6. Applied egg-rr 99.6%

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

7. Taylor expanded in y around 0

   \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{/.f64}\left(\mathsf{+.f64}\left(\mathsf{tan.f64}\left(y\right), \mathsf{tan.f64}\left(z\right)\right), \color{blue}{1}\right), \mathsf{tan.f64}\left(a\right)\right)\right) \]
8. Step-by-step derivation

9. Simplified 81.4%

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

10. Final simplification 81.4%

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

Alternative 4: 70.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \left(\tan y - \tan a\right)\\ \mathbf{if}\;a \leq -0.0116:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 0.0026:\\ \;\;\;\;x + \left(\tan \left(y + z\right) + a \cdot \left(-1 - a \cdot \left(a \cdot 0.3333333333333333\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (let* ((t_0 (+ x (- (tan y) (tan a)))))
   (if (<= a -0.0116)
     t_0
     (if (<= a 0.0026)
       (+ x (+ (tan (+ y z)) (* a (- -1.0 (* a (* a 0.3333333333333333))))))
       t_0))))

C

double code(double x, double y, double z, double a) {
	double t_0 = x + (tan(y) - tan(a));
	double tmp;
	if (a <= -0.0116) {
		tmp = t_0;
	} else if (a <= 0.0026) {
		tmp = x + (tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))));
	} else {
		tmp = t_0;
	}
	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 = x + (tan(y) - tan(a))
    if (a <= (-0.0116d0)) then
        tmp = t_0
    else if (a <= 0.0026d0) then
        tmp = x + (tan((y + z)) + (a * ((-1.0d0) - (a * (a * 0.3333333333333333d0)))))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double a) {
	double t_0 = x + (Math.tan(y) - Math.tan(a));
	double tmp;
	if (a <= -0.0116) {
		tmp = t_0;
	} else if (a <= 0.0026) {
		tmp = x + (Math.tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z, a):
	t_0 = x + (math.tan(y) - math.tan(a))
	tmp = 0
	if a <= -0.0116:
		tmp = t_0
	elif a <= 0.0026:
		tmp = x + (math.tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z, a)
	t_0 = Float64(x + Float64(tan(y) - tan(a)))
	tmp = 0.0
	if (a <= -0.0116)
		tmp = t_0;
	elseif (a <= 0.0026)
		tmp = Float64(x + Float64(tan(Float64(y + z)) + Float64(a * Float64(-1.0 - Float64(a * Float64(a * 0.3333333333333333))))));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	t_0 = x + (tan(y) - tan(a));
	tmp = 0.0;
	if (a <= -0.0116)
		tmp = t_0;
	elseif (a <= 0.0026)
		tmp = x + (tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := Block[{t$95$0 = N[(x + N[(N[Tan[y], $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -0.0116], t$95$0, If[LessEqual[a, 0.0026], N[(x + N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] + N[(a * N[(-1.0 - N[(a * N[(a * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -0.0116 or 0.0025999999999999999 < a

   1. Initial program 81.7%

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

   3. Taylor expanded in y around inf

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

   5. Simplified 58.1%

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

   if -0.0116 < a < 0.0025999999999999999

   1. Initial program 79.7%

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

   3. Taylor expanded in a around 0

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \color{blue}{\left(a \cdot \left(1 + \frac{1}{3} \cdot {a}^{2}\right)\right)}\right)\right) \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \color{blue}{\left(1 + \frac{1}{3} \cdot {a}^{2}\right)}\right)\right)\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \color{blue}{\left(\frac{1}{3} \cdot {a}^{2}\right)}\right)\right)\right)\right) \]

      3. *-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \left({a}^{2} \cdot \color{blue}{\frac{1}{3}}\right)\right)\right)\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \left(\left(a \cdot a\right) \cdot \frac{1}{3}\right)\right)\right)\right)\right) \]

      5. associate-*l* N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \left(a \cdot \color{blue}{\left(a \cdot \frac{1}{3}\right)}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(a, \color{blue}{\left(a \cdot \frac{1}{3}\right)}\right)\right)\right)\right)\right) \]

      7. *-lowering-*.f64 79.7%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(a, \mathsf{*.f64}\left(a, \color{blue}{\frac{1}{3}}\right)\right)\right)\right)\right)\right) \]

   5. Simplified 79.7%

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

4. Final simplification 69.3%

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

Alternative 5: 70.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.002:\\ \;\;\;\;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 -0.002) (+ 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 <= -0.002) {
		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 <= (-0.002d0)) 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 <= -0.002) {
		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 <= -0.002:
		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 <= -0.002)
		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 <= -0.002)
		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, -0.002], 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 < -2e-3

   1. Initial program 55.7%

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

   3. Taylor expanded in y around inf

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

   5. Simplified 56.3%

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

   if -2e-3 < y

   1. Initial program 88.5%

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

   3. Taylor expanded in y around 0

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

   5. Simplified 76.9%

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

Alternative 6: 79.8% 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.7%

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

Alternative 7: 50.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.65:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.6:\\ \;\;\;\;x + \left(\tan \left(y + z\right) + a \cdot \left(-1 - \left(a \cdot a\right) \cdot \left(0.3333333333333333 + \left(a \cdot a\right) \cdot 0.13333333333333333\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= a -1.65)
   x
   (if (<= a 1.6)
     (+
      x
      (+
       (tan (+ y z))
       (*
        a
        (-
         -1.0
         (* (* a a) (+ 0.3333333333333333 (* (* a a) 0.13333333333333333)))))))
     x)))

C

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

Python

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

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (a <= -1.65)
		tmp = x;
	elseif (a <= 1.6)
		tmp = Float64(x + Float64(tan(Float64(y + z)) + Float64(a * Float64(-1.0 - Float64(Float64(a * a) * Float64(0.3333333333333333 + Float64(Float64(a * a) * 0.13333333333333333)))))));
	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.6)
		tmp = x + (tan((y + z)) + (a * (-1.0 - ((a * a) * (0.3333333333333333 + ((a * a) * 0.13333333333333333))))));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.6499999999999999 or 1.6000000000000001 < a

   1. Initial program 81.5%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 21.7%

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

   if -1.6499999999999999 < a < 1.6000000000000001

   1. Initial program 79.9%

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

   3. Taylor expanded in a around 0

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \color{blue}{\left(a \cdot \left(1 + {a}^{2} \cdot \left(\frac{1}{3} + \frac{2}{15} \cdot {a}^{2}\right)\right)\right)}\right)\right) \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \color{blue}{\left(1 + {a}^{2} \cdot \left(\frac{1}{3} + \frac{2}{15} \cdot {a}^{2}\right)\right)}\right)\right)\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \color{blue}{\left({a}^{2} \cdot \left(\frac{1}{3} + \frac{2}{15} \cdot {a}^{2}\right)\right)}\right)\right)\right)\right) \]

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\left({a}^{2}\right), \color{blue}{\left(\frac{1}{3} + \frac{2}{15} \cdot {a}^{2}\right)}\right)\right)\right)\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\left(a \cdot a\right), \left(\color{blue}{\frac{1}{3}} + \frac{2}{15} \cdot {a}^{2}\right)\right)\right)\right)\right)\right) \]

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \left(\color{blue}{\frac{1}{3}} + \frac{2}{15} \cdot {a}^{2}\right)\right)\right)\right)\right)\right) \]

      6. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \mathsf{+.f64}\left(\frac{1}{3}, \color{blue}{\left(\frac{2}{15} \cdot {a}^{2}\right)}\right)\right)\right)\right)\right)\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \mathsf{+.f64}\left(\frac{1}{3}, \left({a}^{2} \cdot \color{blue}{\frac{2}{15}}\right)\right)\right)\right)\right)\right)\right) \]

      8. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \mathsf{+.f64}\left(\frac{1}{3}, \mathsf{*.f64}\left(\left({a}^{2}\right), \color{blue}{\frac{2}{15}}\right)\right)\right)\right)\right)\right)\right) \]

      9. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \mathsf{+.f64}\left(\frac{1}{3}, \mathsf{*.f64}\left(\left(a \cdot a\right), \frac{2}{15}\right)\right)\right)\right)\right)\right)\right) \]

      10. *-lowering-*.f64 79.9%

          \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \mathsf{+.f64}\left(\frac{1}{3}, \mathsf{*.f64}\left(\mathsf{*.f64}\left(a, a\right), \frac{2}{15}\right)\right)\right)\right)\right)\right)\right) \]

   5. Simplified 79.9%

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

4. Final simplification 52.1%

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

Alternative 8: 50.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.55:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 1.6:\\ \;\;\;\;x + \left(\tan \left(y + z\right) + a \cdot \left(-1 - a \cdot \left(a \cdot 0.3333333333333333\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z a)
 :precision binary64
 (if (<= a -1.55)
   x
   (if (<= a 1.6)
     (+ x (+ (tan (+ y z)) (* a (- -1.0 (* a (* a 0.3333333333333333))))))
     x)))

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (a <= -1.55) {
		tmp = x;
	} else if (a <= 1.6) {
		tmp = x + (tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))));
	} 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.55d0)) then
        tmp = x
    else if (a <= 1.6d0) then
        tmp = x + (tan((y + z)) + (a * ((-1.0d0) - (a * (a * 0.3333333333333333d0)))))
    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.55) {
		tmp = x;
	} else if (a <= 1.6) {
		tmp = x + (Math.tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, a):
	tmp = 0
	if a <= -1.55:
		tmp = x
	elif a <= 1.6:
		tmp = x + (math.tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))))
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, a)
	tmp = 0.0
	if (a <= -1.55)
		tmp = x;
	elseif (a <= 1.6)
		tmp = Float64(x + Float64(tan(Float64(y + z)) + Float64(a * Float64(-1.0 - Float64(a * Float64(a * 0.3333333333333333))))));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, a)
	tmp = 0.0;
	if (a <= -1.55)
		tmp = x;
	elseif (a <= 1.6)
		tmp = x + (tan((y + z)) + (a * (-1.0 - (a * (a * 0.3333333333333333)))));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.55000000000000004 or 1.6000000000000001 < a

   1. Initial program 81.5%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 21.7%

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

   if -1.55000000000000004 < a < 1.6000000000000001

   1. Initial program 79.9%

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

   3. Taylor expanded in a around 0

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \color{blue}{\left(a \cdot \left(1 + \frac{1}{3} \cdot {a}^{2}\right)\right)}\right)\right) \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \color{blue}{\left(1 + \frac{1}{3} \cdot {a}^{2}\right)}\right)\right)\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \color{blue}{\left(\frac{1}{3} \cdot {a}^{2}\right)}\right)\right)\right)\right) \]

      3. *-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \left({a}^{2} \cdot \color{blue}{\frac{1}{3}}\right)\right)\right)\right)\right) \]

      4. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \left(\left(a \cdot a\right) \cdot \frac{1}{3}\right)\right)\right)\right)\right) \]

      5. associate-*l* N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \left(a \cdot \color{blue}{\left(a \cdot \frac{1}{3}\right)}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(a, \color{blue}{\left(a \cdot \frac{1}{3}\right)}\right)\right)\right)\right)\right) \]

      7. *-lowering-*.f64 79.8%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\mathsf{+.f64}\left(y, z\right)\right), \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(a, \mathsf{*.f64}\left(a, \color{blue}{\frac{1}{3}}\right)\right)\right)\right)\right)\right) \]

   5. Simplified 79.8%

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

4. Final simplification 52.1%

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

Alternative 9: 50.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.82:\\ \;\;\;\;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 -1.82) 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 <= -1.82) {
		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 <= (-1.82d0)) 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 <= -1.82) {
		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 <= -1.82:
		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 <= -1.82)
		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 <= -1.82)
		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, -1.82], 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 < -1.82000000000000006 or 1.6499999999999999 < a

   1. Initial program 81.5%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 21.7%

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

   if -1.82000000000000006 < a < 1.6499999999999999

   1. Initial program 79.9%

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

   3. Taylor expanded in a around 0

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

   5. Simplified 79.6%

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

Alternative 10: 41.6% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.55000000000000004 or 1.6499999999999999 < a

   1. Initial program 81.5%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 21.7%

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

   if -1.55000000000000004 < a < 1.6499999999999999

   1. Initial program 79.9%

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

   3. Taylor expanded in a around 0

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

   5. Simplified 79.6%

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

   6. Taylor expanded in y around inf

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\color{blue}{y}\right), a\right)\right) \]
   7. Step-by-step derivation

   8. Simplified 62.8%

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

Alternative 11: 36.5% accurate, 1.9× speedup

Math

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

C

double code(double x, double y, double z, double a) {
	double tmp;
	if (y <= -0.002) {
		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 (y <= (-0.002d0)) 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 (y <= -0.002) {
		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 y <= -0.002:
		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 (y <= -0.002)
		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 (y <= -0.002)
		tmp = x + (tan(y) - a);
	else
		tmp = x + (tan(z) - a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, a_] := If[LessEqual[y, -0.002], 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 y < -2e-3

   1. Initial program 55.7%

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

   3. Taylor expanded in a around 0

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

   5. Simplified 27.8%

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

   6. Taylor expanded in y around inf

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\color{blue}{y}\right), a\right)\right) \]
   7. Step-by-step derivation

   8. Simplified 28.4%

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

   if -2e-3 < y

   1. Initial program 88.5%

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

   3. Taylor expanded in a around 0

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

   5. Simplified 48.1%

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

   6. Taylor expanded in y around 0

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(\mathsf{tan.f64}\left(\color{blue}{z}\right), a\right)\right) \]
   7. Step-by-step derivation

   8. Simplified 41.1%

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

Alternative 12: 32.3% 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.7%

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

3. Taylor expanded in x around inf

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

5. Simplified 34.0%

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

Reproduce

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