Rosa's DopplerBench

Percentage Accurate: 73.1% → 98.0%

Time: 11.5s

Alternatives: 9

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \end{array} \]

FPCore

(FPCore (u v t1) :precision binary64 (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))

C

double code(double u, double v, double t1) {
	return (-t1 * v) / ((t1 + u) * (t1 + u));
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = (-t1 * v) / ((t1 + u) * (t1 + u))
end function

Java

public static double code(double u, double v, double t1) {
	return (-t1 * v) / ((t1 + u) * (t1 + u));
}

Python

def code(u, v, t1):
	return (-t1 * v) / ((t1 + u) * (t1 + u))

Julia

function code(u, v, t1)
	return Float64(Float64(Float64(-t1) * v) / Float64(Float64(t1 + u) * Float64(t1 + u)))
end

MATLAB

function tmp = code(u, v, t1)
	tmp = (-t1 * v) / ((t1 + u) * (t1 + u));
end

Wolfram

code[u_, v_, t1_] := N[(N[((-t1) * v), $MachinePrecision] / N[(N[(t1 + u), $MachinePrecision] * N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 73.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \end{array} \]

FPCore

(FPCore (u v t1) :precision binary64 (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))

C

double code(double u, double v, double t1) {
	return (-t1 * v) / ((t1 + u) * (t1 + u));
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = (-t1 * v) / ((t1 + u) * (t1 + u))
end function

Java

public static double code(double u, double v, double t1) {
	return (-t1 * v) / ((t1 + u) * (t1 + u));
}

Python

def code(u, v, t1):
	return (-t1 * v) / ((t1 + u) * (t1 + u))

Julia

function code(u, v, t1)
	return Float64(Float64(Float64(-t1) * v) / Float64(Float64(t1 + u) * Float64(t1 + u)))
end

MATLAB

function tmp = code(u, v, t1)
	tmp = (-t1 * v) / ((t1 + u) * (t1 + u));
end

Wolfram

code[u_, v_, t1_] := N[(N[((-t1) * v), $MachinePrecision] / N[(N[(t1 + u), $MachinePrecision] * N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u} \end{array} \]

FPCore

(FPCore (u v t1) :precision binary64 (* (/ (- t1) (+ t1 u)) (/ v (+ t1 u))))

C

double code(double u, double v, double t1) {
	return (-t1 / (t1 + u)) * (v / (t1 + u));
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = (-t1 / (t1 + u)) * (v / (t1 + u))
end function

Java

public static double code(double u, double v, double t1) {
	return (-t1 / (t1 + u)) * (v / (t1 + u));
}

Python

def code(u, v, t1):
	return (-t1 / (t1 + u)) * (v / (t1 + u))

Julia

function code(u, v, t1)
	return Float64(Float64(Float64(-t1) / Float64(t1 + u)) * Float64(v / Float64(t1 + u)))
end

MATLAB

function tmp = code(u, v, t1)
	tmp = (-t1 / (t1 + u)) * (v / (t1 + u));
end

Wolfram

code[u_, v_, t1_] := N[(N[((-t1) / N[(t1 + u), $MachinePrecision]), $MachinePrecision] * N[(v / N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.5%

   \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
2. Step-by-step derivation

   1. times-frac 99.8%

      \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

   2. distribute-frac-neg 99.8%

      \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

   3. distribute-neg-frac2 99.8%

      \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

   4. +-commutative 99.8%

      \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

   5. distribute-neg-in 99.8%

      \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

   6. unsub-neg 99.8%

      \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto \frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u} \]
6. Add Preprocessing

Alternative 2: 89.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t1 \leq -5.6 \cdot 10^{+140} \lor \neg \left(t1 \leq 3.9 \cdot 10^{+80}\right):\\ \;\;\;\;\frac{v}{\left(-t1\right) - u \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t1 \cdot \frac{\frac{-v}{t1 + u}}{t1 + u}\\ \end{array} \end{array} \]

FPCore

(FPCore (u v t1)
 :precision binary64
 (if (or (<= t1 -5.6e+140) (not (<= t1 3.9e+80)))
   (/ v (- (- t1) (* u 2.0)))
   (* t1 (/ (/ (- v) (+ t1 u)) (+ t1 u)))))

C

double code(double u, double v, double t1) {
	double tmp;
	if ((t1 <= -5.6e+140) || !(t1 <= 3.9e+80)) {
		tmp = v / (-t1 - (u * 2.0));
	} else {
		tmp = t1 * ((-v / (t1 + u)) / (t1 + u));
	}
	return tmp;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    real(8) :: tmp
    if ((t1 <= (-5.6d+140)) .or. (.not. (t1 <= 3.9d+80))) then
        tmp = v / (-t1 - (u * 2.0d0))
    else
        tmp = t1 * ((-v / (t1 + u)) / (t1 + u))
    end if
    code = tmp
end function

Java

public static double code(double u, double v, double t1) {
	double tmp;
	if ((t1 <= -5.6e+140) || !(t1 <= 3.9e+80)) {
		tmp = v / (-t1 - (u * 2.0));
	} else {
		tmp = t1 * ((-v / (t1 + u)) / (t1 + u));
	}
	return tmp;
}

Python

def code(u, v, t1):
	tmp = 0
	if (t1 <= -5.6e+140) or not (t1 <= 3.9e+80):
		tmp = v / (-t1 - (u * 2.0))
	else:
		tmp = t1 * ((-v / (t1 + u)) / (t1 + u))
	return tmp

Julia

function code(u, v, t1)
	tmp = 0.0
	if ((t1 <= -5.6e+140) || !(t1 <= 3.9e+80))
		tmp = Float64(v / Float64(Float64(-t1) - Float64(u * 2.0)));
	else
		tmp = Float64(t1 * Float64(Float64(Float64(-v) / Float64(t1 + u)) / Float64(t1 + u)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v, t1)
	tmp = 0.0;
	if ((t1 <= -5.6e+140) || ~((t1 <= 3.9e+80)))
		tmp = v / (-t1 - (u * 2.0));
	else
		tmp = t1 * ((-v / (t1 + u)) / (t1 + u));
	end
	tmp_2 = tmp;
end

Wolfram

code[u_, v_, t1_] := If[Or[LessEqual[t1, -5.6e+140], N[Not[LessEqual[t1, 3.9e+80]], $MachinePrecision]], N[(v / N[((-t1) - N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t1 * N[(N[((-v) / N[(t1 + u), $MachinePrecision]), $MachinePrecision] / N[(t1 + u), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t1 < -5.59999999999999966e140 or 3.89999999999999999e80 < t1

   1. Initial program 53.1%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 55.2%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 55.2%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 55.2%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 70.2%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 70.2%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 70.2%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-*r/ 99.9%

         \[\leadsto \color{blue}{\frac{t1 \cdot \frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

      2. +-commutative 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{-\color{blue}{\left(u + t1\right)}} \]

      3. distribute-neg-in 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \]

      4. sub-neg 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{\color{blue}{\left(-u\right) - t1}} \]

      5. associate-*l/ 99.9%

         \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]

      6. clear-num 99.9%

         \[\leadsto \color{blue}{\frac{1}{\frac{\left(-u\right) - t1}{t1}}} \cdot \frac{v}{t1 + u} \]

      7. frac-2neg 99.9%

         \[\leadsto \frac{1}{\frac{\left(-u\right) - t1}{t1}} \cdot \color{blue}{\frac{-v}{-\left(t1 + u\right)}} \]

      8. frac-times 95.9%

         \[\leadsto \color{blue}{\frac{1 \cdot \left(-v\right)}{\frac{\left(-u\right) - t1}{t1} \cdot \left(-\left(t1 + u\right)\right)}} \]

      9. *-un-lft-identity 95.9%

         \[\leadsto \frac{\color{blue}{-v}}{\frac{\left(-u\right) - t1}{t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      10. frac-2neg 95.9%

          \[\leadsto \frac{-v}{\color{blue}{\frac{-\left(\left(-u\right) - t1\right)}{-t1}} \cdot \left(-\left(t1 + u\right)\right)} \]

      11. sub-neg 95.9%

          \[\leadsto \frac{-v}{\frac{-\color{blue}{\left(\left(-u\right) + \left(-t1\right)\right)}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      12. distribute-neg-in 95.9%

          \[\leadsto \frac{-v}{\frac{-\color{blue}{\left(-\left(u + t1\right)\right)}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      13. +-commutative 95.9%

          \[\leadsto \frac{-v}{\frac{-\left(-\color{blue}{\left(t1 + u\right)}\right)}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      14. remove-double-neg 95.9%

          \[\leadsto \frac{-v}{\frac{\color{blue}{t1 + u}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      15. add-sqr-sqrt 42.3%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{-t1} \cdot \sqrt{-t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      16. sqrt-unprod 7.5%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{\left(-t1\right) \cdot \left(-t1\right)}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      17. sqr-neg 7.5%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\sqrt{\color{blue}{t1 \cdot t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      18. sqrt-unprod 20.5%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{t1} \cdot \sqrt{t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      19. add-sqr-sqrt 42.9%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{t1}} \cdot \left(-\left(t1 + u\right)\right)} \]

      20. add-sqr-sqrt 21.0%

          \[\leadsto \frac{-v}{\frac{t1 + u}{t1} \cdot \color{blue}{\left(\sqrt{-\left(t1 + u\right)} \cdot \sqrt{-\left(t1 + u\right)}\right)}} \]

      21. sqrt-unprod 55.9%

          \[\leadsto \frac{-v}{\frac{t1 + u}{t1} \cdot \color{blue}{\sqrt{\left(-\left(t1 + u\right)\right) \cdot \left(-\left(t1 + u\right)\right)}}} \]

   6. Applied egg-rr 95.9%

      \[\leadsto \color{blue}{\frac{-v}{\frac{t1 + u}{t1} \cdot \left(t1 + u\right)}} \]

   7. Taylor expanded in u around 0 93.5%

      \[\leadsto \frac{-v}{\color{blue}{t1 + 2 \cdot u}} \]
   8. Step-by-step derivation

      1. *-commutative 93.5%

         \[\leadsto \frac{-v}{t1 + \color{blue}{u \cdot 2}} \]

   9. Simplified 93.5%

      \[\leadsto \frac{-v}{\color{blue}{t1 + u \cdot 2}} \]

   if -5.59999999999999966e140 < t1 < 3.89999999999999999e80

   1. Initial program 84.1%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 86.9%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 86.9%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 86.9%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 91.9%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 91.9%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 91.9%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t1 \leq -5.6 \cdot 10^{+140} \lor \neg \left(t1 \leq 3.9 \cdot 10^{+80}\right):\\ \;\;\;\;\frac{v}{\left(-t1\right) - u \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t1 \cdot \frac{\frac{-v}{t1 + u}}{t1 + u}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t1 \leq -5.6 \cdot 10^{-104} \lor \neg \left(t1 \leq 6 \cdot 10^{-55}\right):\\ \;\;\;\;\frac{-v}{t1 + u}\\ \mathbf{else}:\\ \;\;\;\;\frac{t1}{-u} \cdot \frac{v}{u}\\ \end{array} \end{array} \]

FPCore

(FPCore (u v t1)
 :precision binary64
 (if (or (<= t1 -5.6e-104) (not (<= t1 6e-55)))
   (/ (- v) (+ t1 u))
   (* (/ t1 (- u)) (/ v u))))

C

double code(double u, double v, double t1) {
	double tmp;
	if ((t1 <= -5.6e-104) || !(t1 <= 6e-55)) {
		tmp = -v / (t1 + u);
	} else {
		tmp = (t1 / -u) * (v / u);
	}
	return tmp;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    real(8) :: tmp
    if ((t1 <= (-5.6d-104)) .or. (.not. (t1 <= 6d-55))) then
        tmp = -v / (t1 + u)
    else
        tmp = (t1 / -u) * (v / u)
    end if
    code = tmp
end function

Java

public static double code(double u, double v, double t1) {
	double tmp;
	if ((t1 <= -5.6e-104) || !(t1 <= 6e-55)) {
		tmp = -v / (t1 + u);
	} else {
		tmp = (t1 / -u) * (v / u);
	}
	return tmp;
}

Python

def code(u, v, t1):
	tmp = 0
	if (t1 <= -5.6e-104) or not (t1 <= 6e-55):
		tmp = -v / (t1 + u)
	else:
		tmp = (t1 / -u) * (v / u)
	return tmp

Julia

function code(u, v, t1)
	tmp = 0.0
	if ((t1 <= -5.6e-104) || !(t1 <= 6e-55))
		tmp = Float64(Float64(-v) / Float64(t1 + u));
	else
		tmp = Float64(Float64(t1 / Float64(-u)) * Float64(v / u));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v, t1)
	tmp = 0.0;
	if ((t1 <= -5.6e-104) || ~((t1 <= 6e-55)))
		tmp = -v / (t1 + u);
	else
		tmp = (t1 / -u) * (v / u);
	end
	tmp_2 = tmp;
end

Wolfram

code[u_, v_, t1_] := If[Or[LessEqual[t1, -5.6e-104], N[Not[LessEqual[t1, 6e-55]], $MachinePrecision]], N[((-v) / N[(t1 + u), $MachinePrecision]), $MachinePrecision], N[(N[(t1 / (-u)), $MachinePrecision] * N[(v / u), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t1 < -5.6e-104 or 6.00000000000000033e-55 < t1

   1. Initial program 73.7%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. times-frac 99.9%

         \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

      2. distribute-frac-neg 99.9%

         \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

      3. distribute-neg-frac2 99.9%

         \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

      4. +-commutative 99.9%

         \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

      5. distribute-neg-in 99.9%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

      6. unsub-neg 99.9%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around inf 81.7%

      \[\leadsto \color{blue}{-1} \cdot \frac{v}{t1 + u} \]

   if -5.6e-104 < t1 < 6.00000000000000033e-55

   1. Initial program 78.4%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. times-frac 99.7%

         \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

      2. distribute-frac-neg 99.7%

         \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

      3. distribute-neg-frac2 99.7%

         \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

      4. +-commutative 99.7%

         \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

      5. distribute-neg-in 99.7%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

      6. unsub-neg 99.7%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around 0 83.9%

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{t1}{u}\right)} \cdot \frac{v}{t1 + u} \]
   6. Step-by-step derivation

      1. associate-*r/ 83.9%

         \[\leadsto \color{blue}{\frac{-1 \cdot t1}{u}} \cdot \frac{v}{t1 + u} \]

      2. mul-1-neg 83.9%

         \[\leadsto \frac{\color{blue}{-t1}}{u} \cdot \frac{v}{t1 + u} \]

   7. Simplified 83.9%

      \[\leadsto \color{blue}{\frac{-t1}{u}} \cdot \frac{v}{t1 + u} \]

   8. Taylor expanded in t1 around 0 85.2%

      \[\leadsto \frac{-t1}{u} \cdot \color{blue}{\frac{v}{u}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t1 \leq -5.6 \cdot 10^{-104} \lor \neg \left(t1 \leq 6 \cdot 10^{-55}\right):\\ \;\;\;\;\frac{-v}{t1 + u}\\ \mathbf{else}:\\ \;\;\;\;\frac{t1}{-u} \cdot \frac{v}{u}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 79.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t1 \leq -6.5 \cdot 10^{-103} \lor \neg \left(t1 \leq 1.8 \cdot 10^{-58}\right):\\ \;\;\;\;\frac{v}{\left(-t1\right) - u \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{t1}{-u} \cdot \frac{v}{u}\\ \end{array} \end{array} \]

FPCore

(FPCore (u v t1)
 :precision binary64
 (if (or (<= t1 -6.5e-103) (not (<= t1 1.8e-58)))
   (/ v (- (- t1) (* u 2.0)))
   (* (/ t1 (- u)) (/ v u))))

C

double code(double u, double v, double t1) {
	double tmp;
	if ((t1 <= -6.5e-103) || !(t1 <= 1.8e-58)) {
		tmp = v / (-t1 - (u * 2.0));
	} else {
		tmp = (t1 / -u) * (v / u);
	}
	return tmp;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    real(8) :: tmp
    if ((t1 <= (-6.5d-103)) .or. (.not. (t1 <= 1.8d-58))) then
        tmp = v / (-t1 - (u * 2.0d0))
    else
        tmp = (t1 / -u) * (v / u)
    end if
    code = tmp
end function

Java

public static double code(double u, double v, double t1) {
	double tmp;
	if ((t1 <= -6.5e-103) || !(t1 <= 1.8e-58)) {
		tmp = v / (-t1 - (u * 2.0));
	} else {
		tmp = (t1 / -u) * (v / u);
	}
	return tmp;
}

Python

def code(u, v, t1):
	tmp = 0
	if (t1 <= -6.5e-103) or not (t1 <= 1.8e-58):
		tmp = v / (-t1 - (u * 2.0))
	else:
		tmp = (t1 / -u) * (v / u)
	return tmp

Julia

function code(u, v, t1)
	tmp = 0.0
	if ((t1 <= -6.5e-103) || !(t1 <= 1.8e-58))
		tmp = Float64(v / Float64(Float64(-t1) - Float64(u * 2.0)));
	else
		tmp = Float64(Float64(t1 / Float64(-u)) * Float64(v / u));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v, t1)
	tmp = 0.0;
	if ((t1 <= -6.5e-103) || ~((t1 <= 1.8e-58)))
		tmp = v / (-t1 - (u * 2.0));
	else
		tmp = (t1 / -u) * (v / u);
	end
	tmp_2 = tmp;
end

Wolfram

code[u_, v_, t1_] := If[Or[LessEqual[t1, -6.5e-103], N[Not[LessEqual[t1, 1.8e-58]], $MachinePrecision]], N[(v / N[((-t1) - N[(u * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t1 / (-u)), $MachinePrecision] * N[(v / u), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t1 < -6.49999999999999966e-103 or 1.80000000000000005e-58 < t1

   1. Initial program 73.7%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 74.9%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 74.9%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 74.9%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 84.3%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 84.3%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 84.3%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-*r/ 99.9%

         \[\leadsto \color{blue}{\frac{t1 \cdot \frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

      2. +-commutative 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{-\color{blue}{\left(u + t1\right)}} \]

      3. distribute-neg-in 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \]

      4. sub-neg 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{\color{blue}{\left(-u\right) - t1}} \]

      5. associate-*l/ 99.9%

         \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]

      6. clear-num 99.9%

         \[\leadsto \color{blue}{\frac{1}{\frac{\left(-u\right) - t1}{t1}}} \cdot \frac{v}{t1 + u} \]

      7. frac-2neg 99.9%

         \[\leadsto \frac{1}{\frac{\left(-u\right) - t1}{t1}} \cdot \color{blue}{\frac{-v}{-\left(t1 + u\right)}} \]

      8. frac-times 95.1%

         \[\leadsto \color{blue}{\frac{1 \cdot \left(-v\right)}{\frac{\left(-u\right) - t1}{t1} \cdot \left(-\left(t1 + u\right)\right)}} \]

      9. *-un-lft-identity 95.1%

         \[\leadsto \frac{\color{blue}{-v}}{\frac{\left(-u\right) - t1}{t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      10. frac-2neg 95.1%

          \[\leadsto \frac{-v}{\color{blue}{\frac{-\left(\left(-u\right) - t1\right)}{-t1}} \cdot \left(-\left(t1 + u\right)\right)} \]

      11. sub-neg 95.1%

          \[\leadsto \frac{-v}{\frac{-\color{blue}{\left(\left(-u\right) + \left(-t1\right)\right)}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      12. distribute-neg-in 95.1%

          \[\leadsto \frac{-v}{\frac{-\color{blue}{\left(-\left(u + t1\right)\right)}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      13. +-commutative 95.1%

          \[\leadsto \frac{-v}{\frac{-\left(-\color{blue}{\left(t1 + u\right)}\right)}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      14. remove-double-neg 95.1%

          \[\leadsto \frac{-v}{\frac{\color{blue}{t1 + u}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      15. add-sqr-sqrt 52.2%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{-t1} \cdot \sqrt{-t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      16. sqrt-unprod 40.7%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{\left(-t1\right) \cdot \left(-t1\right)}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      17. sqr-neg 40.7%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\sqrt{\color{blue}{t1 \cdot t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      18. sqrt-unprod 13.4%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{t1} \cdot \sqrt{t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      19. add-sqr-sqrt 33.7%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{t1}} \cdot \left(-\left(t1 + u\right)\right)} \]

      20. add-sqr-sqrt 17.8%

          \[\leadsto \frac{-v}{\frac{t1 + u}{t1} \cdot \color{blue}{\left(\sqrt{-\left(t1 + u\right)} \cdot \sqrt{-\left(t1 + u\right)}\right)}} \]

      21. sqrt-unprod 55.9%

          \[\leadsto \frac{-v}{\frac{t1 + u}{t1} \cdot \color{blue}{\sqrt{\left(-\left(t1 + u\right)\right) \cdot \left(-\left(t1 + u\right)\right)}}} \]

   6. Applied egg-rr 95.1%

      \[\leadsto \color{blue}{\frac{-v}{\frac{t1 + u}{t1} \cdot \left(t1 + u\right)}} \]

   7. Taylor expanded in u around 0 81.8%

      \[\leadsto \frac{-v}{\color{blue}{t1 + 2 \cdot u}} \]
   8. Step-by-step derivation

      1. *-commutative 81.8%

         \[\leadsto \frac{-v}{t1 + \color{blue}{u \cdot 2}} \]

   9. Simplified 81.8%

      \[\leadsto \frac{-v}{\color{blue}{t1 + u \cdot 2}} \]

   if -6.49999999999999966e-103 < t1 < 1.80000000000000005e-58

   1. Initial program 78.4%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. times-frac 99.7%

         \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

      2. distribute-frac-neg 99.7%

         \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

      3. distribute-neg-frac2 99.7%

         \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

      4. +-commutative 99.7%

         \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

      5. distribute-neg-in 99.7%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

      6. unsub-neg 99.7%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around 0 83.9%

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{t1}{u}\right)} \cdot \frac{v}{t1 + u} \]
   6. Step-by-step derivation

      1. associate-*r/ 83.9%

         \[\leadsto \color{blue}{\frac{-1 \cdot t1}{u}} \cdot \frac{v}{t1 + u} \]

      2. mul-1-neg 83.9%

         \[\leadsto \frac{\color{blue}{-t1}}{u} \cdot \frac{v}{t1 + u} \]

   7. Simplified 83.9%

      \[\leadsto \color{blue}{\frac{-t1}{u}} \cdot \frac{v}{t1 + u} \]

   8. Taylor expanded in t1 around 0 85.2%

      \[\leadsto \frac{-t1}{u} \cdot \color{blue}{\frac{v}{u}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t1 \leq -6.5 \cdot 10^{-103} \lor \neg \left(t1 \leq 1.8 \cdot 10^{-58}\right):\\ \;\;\;\;\frac{v}{\left(-t1\right) - u \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{t1}{-u} \cdot \frac{v}{u}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 67.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;u \leq -2.2 \cdot 10^{+125} \lor \neg \left(u \leq 7.2 \cdot 10^{+22}\right):\\ \;\;\;\;\frac{t1}{u \cdot \frac{u}{v}}\\ \mathbf{else}:\\ \;\;\;\;\frac{v}{-t1}\\ \end{array} \end{array} \]

FPCore

(FPCore (u v t1)
 :precision binary64
 (if (or (<= u -2.2e+125) (not (<= u 7.2e+22)))
   (/ t1 (* u (/ u v)))
   (/ v (- t1))))

C

double code(double u, double v, double t1) {
	double tmp;
	if ((u <= -2.2e+125) || !(u <= 7.2e+22)) {
		tmp = t1 / (u * (u / v));
	} else {
		tmp = v / -t1;
	}
	return tmp;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    real(8) :: tmp
    if ((u <= (-2.2d+125)) .or. (.not. (u <= 7.2d+22))) then
        tmp = t1 / (u * (u / v))
    else
        tmp = v / -t1
    end if
    code = tmp
end function

Java

public static double code(double u, double v, double t1) {
	double tmp;
	if ((u <= -2.2e+125) || !(u <= 7.2e+22)) {
		tmp = t1 / (u * (u / v));
	} else {
		tmp = v / -t1;
	}
	return tmp;
}

Python

def code(u, v, t1):
	tmp = 0
	if (u <= -2.2e+125) or not (u <= 7.2e+22):
		tmp = t1 / (u * (u / v))
	else:
		tmp = v / -t1
	return tmp

Julia

function code(u, v, t1)
	tmp = 0.0
	if ((u <= -2.2e+125) || !(u <= 7.2e+22))
		tmp = Float64(t1 / Float64(u * Float64(u / v)));
	else
		tmp = Float64(v / Float64(-t1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v, t1)
	tmp = 0.0;
	if ((u <= -2.2e+125) || ~((u <= 7.2e+22)))
		tmp = t1 / (u * (u / v));
	else
		tmp = v / -t1;
	end
	tmp_2 = tmp;
end

Wolfram

code[u_, v_, t1_] := If[Or[LessEqual[u, -2.2e+125], N[Not[LessEqual[u, 7.2e+22]], $MachinePrecision]], N[(t1 / N[(u * N[(u / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(v / (-t1)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if u < -2.19999999999999991e125 or 7.2e22 < u

   1. Initial program 86.3%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. times-frac 99.9%

         \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

      2. distribute-frac-neg 99.9%

         \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

      3. distribute-neg-frac2 99.9%

         \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

      4. +-commutative 99.9%

         \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

      5. distribute-neg-in 99.9%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

      6. unsub-neg 99.9%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around 0 95.0%

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{t1}{u}\right)} \cdot \frac{v}{t1 + u} \]
   6. Step-by-step derivation

      1. associate-*r/ 95.0%

         \[\leadsto \color{blue}{\frac{-1 \cdot t1}{u}} \cdot \frac{v}{t1 + u} \]

      2. mul-1-neg 95.0%

         \[\leadsto \frac{\color{blue}{-t1}}{u} \cdot \frac{v}{t1 + u} \]

   7. Simplified 95.0%

      \[\leadsto \color{blue}{\frac{-t1}{u}} \cdot \frac{v}{t1 + u} \]

   8. Taylor expanded in t1 around 0 91.9%

      \[\leadsto \frac{-t1}{u} \cdot \color{blue}{\frac{v}{u}} \]
   9. Step-by-step derivation

      1. *-commutative 91.9%

         \[\leadsto \color{blue}{\frac{v}{u} \cdot \frac{-t1}{u}} \]

      2. clear-num 92.9%

         \[\leadsto \color{blue}{\frac{1}{\frac{u}{v}}} \cdot \frac{-t1}{u} \]

      3. frac-times 89.0%

         \[\leadsto \color{blue}{\frac{1 \cdot \left(-t1\right)}{\frac{u}{v} \cdot u}} \]

      4. *-un-lft-identity 89.0%

         \[\leadsto \frac{\color{blue}{-t1}}{\frac{u}{v} \cdot u} \]

      5. add-sqr-sqrt 44.6%

         \[\leadsto \frac{\color{blue}{\sqrt{-t1} \cdot \sqrt{-t1}}}{\frac{u}{v} \cdot u} \]

      6. sqrt-unprod 65.5%

         \[\leadsto \frac{\color{blue}{\sqrt{\left(-t1\right) \cdot \left(-t1\right)}}}{\frac{u}{v} \cdot u} \]

      7. sqr-neg 65.5%

         \[\leadsto \frac{\sqrt{\color{blue}{t1 \cdot t1}}}{\frac{u}{v} \cdot u} \]

      8. sqrt-unprod 35.0%

         \[\leadsto \frac{\color{blue}{\sqrt{t1} \cdot \sqrt{t1}}}{\frac{u}{v} \cdot u} \]

      9. add-sqr-sqrt 72.3%

         \[\leadsto \frac{\color{blue}{t1}}{\frac{u}{v} \cdot u} \]

   10. Applied egg-rr 72.3%

       \[\leadsto \color{blue}{\frac{t1}{\frac{u}{v} \cdot u}} \]

   if -2.19999999999999991e125 < u < 7.2e22

   1. Initial program 69.4%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 73.7%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 73.7%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 73.7%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 82.5%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 82.5%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 82.5%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around inf 75.4%

      \[\leadsto \color{blue}{-1 \cdot \frac{v}{t1}} \]
   6. Step-by-step derivation

      1. associate-*r/ 75.4%

         \[\leadsto \color{blue}{\frac{-1 \cdot v}{t1}} \]

      2. neg-mul-1 75.4%

         \[\leadsto \frac{\color{blue}{-v}}{t1} \]

   7. Simplified 75.4%

      \[\leadsto \color{blue}{\frac{-v}{t1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 74.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;u \leq -2.2 \cdot 10^{+125} \lor \neg \left(u \leq 7.2 \cdot 10^{+22}\right):\\ \;\;\;\;\frac{t1}{u \cdot \frac{u}{v}}\\ \mathbf{else}:\\ \;\;\;\;\frac{v}{-t1}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 58.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;u \leq -2.8 \cdot 10^{+155} \lor \neg \left(u \leq 2.3 \cdot 10^{+83}\right):\\ \;\;\;\;\frac{v \cdot -0.5}{u}\\ \mathbf{else}:\\ \;\;\;\;\frac{v}{-t1}\\ \end{array} \end{array} \]

FPCore

(FPCore (u v t1)
 :precision binary64
 (if (or (<= u -2.8e+155) (not (<= u 2.3e+83))) (/ (* v -0.5) u) (/ v (- t1))))

C

double code(double u, double v, double t1) {
	double tmp;
	if ((u <= -2.8e+155) || !(u <= 2.3e+83)) {
		tmp = (v * -0.5) / u;
	} else {
		tmp = v / -t1;
	}
	return tmp;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    real(8) :: tmp
    if ((u <= (-2.8d+155)) .or. (.not. (u <= 2.3d+83))) then
        tmp = (v * (-0.5d0)) / u
    else
        tmp = v / -t1
    end if
    code = tmp
end function

Java

public static double code(double u, double v, double t1) {
	double tmp;
	if ((u <= -2.8e+155) || !(u <= 2.3e+83)) {
		tmp = (v * -0.5) / u;
	} else {
		tmp = v / -t1;
	}
	return tmp;
}

Python

def code(u, v, t1):
	tmp = 0
	if (u <= -2.8e+155) or not (u <= 2.3e+83):
		tmp = (v * -0.5) / u
	else:
		tmp = v / -t1
	return tmp

Julia

function code(u, v, t1)
	tmp = 0.0
	if ((u <= -2.8e+155) || !(u <= 2.3e+83))
		tmp = Float64(Float64(v * -0.5) / u);
	else
		tmp = Float64(v / Float64(-t1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v, t1)
	tmp = 0.0;
	if ((u <= -2.8e+155) || ~((u <= 2.3e+83)))
		tmp = (v * -0.5) / u;
	else
		tmp = v / -t1;
	end
	tmp_2 = tmp;
end

Wolfram

code[u_, v_, t1_] := If[Or[LessEqual[u, -2.8e+155], N[Not[LessEqual[u, 2.3e+83]], $MachinePrecision]], N[(N[(v * -0.5), $MachinePrecision] / u), $MachinePrecision], N[(v / (-t1)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if u < -2.80000000000000016e155 or 2.29999999999999995e83 < u

   1. Initial program 85.5%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 85.8%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 85.8%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 85.8%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 92.2%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 92.2%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 92.2%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-*r/ 99.9%

         \[\leadsto \color{blue}{\frac{t1 \cdot \frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

      2. +-commutative 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{-\color{blue}{\left(u + t1\right)}} \]

      3. distribute-neg-in 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \]

      4. sub-neg 99.9%

         \[\leadsto \frac{t1 \cdot \frac{v}{t1 + u}}{\color{blue}{\left(-u\right) - t1}} \]

      5. associate-*l/ 99.9%

         \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]

      6. clear-num 99.9%

         \[\leadsto \color{blue}{\frac{1}{\frac{\left(-u\right) - t1}{t1}}} \cdot \frac{v}{t1 + u} \]

      7. frac-2neg 99.9%

         \[\leadsto \frac{1}{\frac{\left(-u\right) - t1}{t1}} \cdot \color{blue}{\frac{-v}{-\left(t1 + u\right)}} \]

      8. frac-times 89.7%

         \[\leadsto \color{blue}{\frac{1 \cdot \left(-v\right)}{\frac{\left(-u\right) - t1}{t1} \cdot \left(-\left(t1 + u\right)\right)}} \]

      9. *-un-lft-identity 89.7%

         \[\leadsto \frac{\color{blue}{-v}}{\frac{\left(-u\right) - t1}{t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      10. frac-2neg 89.7%

          \[\leadsto \frac{-v}{\color{blue}{\frac{-\left(\left(-u\right) - t1\right)}{-t1}} \cdot \left(-\left(t1 + u\right)\right)} \]

      11. sub-neg 89.7%

          \[\leadsto \frac{-v}{\frac{-\color{blue}{\left(\left(-u\right) + \left(-t1\right)\right)}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      12. distribute-neg-in 89.7%

          \[\leadsto \frac{-v}{\frac{-\color{blue}{\left(-\left(u + t1\right)\right)}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      13. +-commutative 89.7%

          \[\leadsto \frac{-v}{\frac{-\left(-\color{blue}{\left(t1 + u\right)}\right)}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      14. remove-double-neg 89.7%

          \[\leadsto \frac{-v}{\frac{\color{blue}{t1 + u}}{-t1} \cdot \left(-\left(t1 + u\right)\right)} \]

      15. add-sqr-sqrt 39.4%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{-t1} \cdot \sqrt{-t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      16. sqrt-unprod 70.0%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{\left(-t1\right) \cdot \left(-t1\right)}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      17. sqr-neg 70.0%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\sqrt{\color{blue}{t1 \cdot t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      18. sqrt-unprod 43.9%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{\sqrt{t1} \cdot \sqrt{t1}}} \cdot \left(-\left(t1 + u\right)\right)} \]

      19. add-sqr-sqrt 79.4%

          \[\leadsto \frac{-v}{\frac{t1 + u}{\color{blue}{t1}} \cdot \left(-\left(t1 + u\right)\right)} \]

      20. add-sqr-sqrt 43.7%

          \[\leadsto \frac{-v}{\frac{t1 + u}{t1} \cdot \color{blue}{\left(\sqrt{-\left(t1 + u\right)} \cdot \sqrt{-\left(t1 + u\right)}\right)}} \]

      21. sqrt-unprod 85.9%

          \[\leadsto \frac{-v}{\frac{t1 + u}{t1} \cdot \color{blue}{\sqrt{\left(-\left(t1 + u\right)\right) \cdot \left(-\left(t1 + u\right)\right)}}} \]

   6. Applied egg-rr 89.7%

      \[\leadsto \color{blue}{\frac{-v}{\frac{t1 + u}{t1} \cdot \left(t1 + u\right)}} \]

   7. Taylor expanded in u around 0 46.6%

      \[\leadsto \frac{-v}{\color{blue}{t1 + 2 \cdot u}} \]
   8. Step-by-step derivation

      1. *-commutative 46.6%

         \[\leadsto \frac{-v}{t1 + \color{blue}{u \cdot 2}} \]

   9. Simplified 46.6%

      \[\leadsto \frac{-v}{\color{blue}{t1 + u \cdot 2}} \]

   10. Taylor expanded in t1 around 0 44.0%

       \[\leadsto \color{blue}{-0.5 \cdot \frac{v}{u}} \]
   11. Step-by-step derivation

       1. associate-*r/ 44.0%

          \[\leadsto \color{blue}{\frac{-0.5 \cdot v}{u}} \]

       2. *-commutative 44.0%

          \[\leadsto \frac{\color{blue}{v \cdot -0.5}}{u} \]

   12. Simplified 44.0%

       \[\leadsto \color{blue}{\frac{v \cdot -0.5}{u}} \]

   if -2.80000000000000016e155 < u < 2.29999999999999995e83

   1. Initial program 71.5%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 74.9%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 74.9%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 74.9%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 83.3%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 83.3%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 83.3%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around inf 70.7%

      \[\leadsto \color{blue}{-1 \cdot \frac{v}{t1}} \]
   6. Step-by-step derivation

      1. associate-*r/ 70.7%

         \[\leadsto \color{blue}{\frac{-1 \cdot v}{t1}} \]

      2. neg-mul-1 70.7%

         \[\leadsto \frac{\color{blue}{-v}}{t1} \]

   7. Simplified 70.7%

      \[\leadsto \color{blue}{\frac{-v}{t1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 63.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;u \leq -2.8 \cdot 10^{+155} \lor \neg \left(u \leq 2.3 \cdot 10^{+83}\right):\\ \;\;\;\;\frac{v \cdot -0.5}{u}\\ \mathbf{else}:\\ \;\;\;\;\frac{v}{-t1}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 58.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;u \leq -1.02 \cdot 10^{+157} \lor \neg \left(u \leq 4.8 \cdot 10^{+83}\right):\\ \;\;\;\;\frac{v}{-u}\\ \mathbf{else}:\\ \;\;\;\;\frac{v}{-t1}\\ \end{array} \end{array} \]

FPCore

(FPCore (u v t1)
 :precision binary64
 (if (or (<= u -1.02e+157) (not (<= u 4.8e+83))) (/ v (- u)) (/ v (- t1))))

C

double code(double u, double v, double t1) {
	double tmp;
	if ((u <= -1.02e+157) || !(u <= 4.8e+83)) {
		tmp = v / -u;
	} else {
		tmp = v / -t1;
	}
	return tmp;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    real(8) :: tmp
    if ((u <= (-1.02d+157)) .or. (.not. (u <= 4.8d+83))) then
        tmp = v / -u
    else
        tmp = v / -t1
    end if
    code = tmp
end function

Java

public static double code(double u, double v, double t1) {
	double tmp;
	if ((u <= -1.02e+157) || !(u <= 4.8e+83)) {
		tmp = v / -u;
	} else {
		tmp = v / -t1;
	}
	return tmp;
}

Python

def code(u, v, t1):
	tmp = 0
	if (u <= -1.02e+157) or not (u <= 4.8e+83):
		tmp = v / -u
	else:
		tmp = v / -t1
	return tmp

Julia

function code(u, v, t1)
	tmp = 0.0
	if ((u <= -1.02e+157) || !(u <= 4.8e+83))
		tmp = Float64(v / Float64(-u));
	else
		tmp = Float64(v / Float64(-t1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(u, v, t1)
	tmp = 0.0;
	if ((u <= -1.02e+157) || ~((u <= 4.8e+83)))
		tmp = v / -u;
	else
		tmp = v / -t1;
	end
	tmp_2 = tmp;
end

Wolfram

code[u_, v_, t1_] := If[Or[LessEqual[u, -1.02e+157], N[Not[LessEqual[u, 4.8e+83]], $MachinePrecision]], N[(v / (-u)), $MachinePrecision], N[(v / (-t1)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if u < -1.02000000000000003e157 or 4.79999999999999982e83 < u

   1. Initial program 85.5%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. times-frac 99.9%

         \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

      2. distribute-frac-neg 99.9%

         \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

      3. distribute-neg-frac2 99.9%

         \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

      4. +-commutative 99.9%

         \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

      5. distribute-neg-in 99.9%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

      6. unsub-neg 99.9%

         \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around 0 97.6%

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{t1}{u}\right)} \cdot \frac{v}{t1 + u} \]
   6. Step-by-step derivation

      1. associate-*r/ 97.6%

         \[\leadsto \color{blue}{\frac{-1 \cdot t1}{u}} \cdot \frac{v}{t1 + u} \]

      2. mul-1-neg 97.6%

         \[\leadsto \frac{\color{blue}{-t1}}{u} \cdot \frac{v}{t1 + u} \]

   7. Simplified 97.6%

      \[\leadsto \color{blue}{\frac{-t1}{u}} \cdot \frac{v}{t1 + u} \]

   8. Taylor expanded in t1 around inf 44.0%

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

      1. associate-*r/ 44.0%

         \[\leadsto \color{blue}{\frac{-1 \cdot v}{u}} \]

      2. mul-1-neg 44.0%

         \[\leadsto \frac{\color{blue}{-v}}{u} \]

   10. Simplified 44.0%

       \[\leadsto \color{blue}{\frac{-v}{u}} \]

   if -1.02000000000000003e157 < u < 4.79999999999999982e83

   1. Initial program 71.5%

      \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
   2. Step-by-step derivation

      1. associate-/l* 74.9%

         \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      2. distribute-lft-neg-out 74.9%

         \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

      3. distribute-rgt-neg-in 74.9%

         \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

      4. associate-/r* 83.3%

         \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

      5. distribute-neg-frac2 83.3%

         \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

   3. Simplified 83.3%

      \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t1 around inf 70.7%

      \[\leadsto \color{blue}{-1 \cdot \frac{v}{t1}} \]
   6. Step-by-step derivation

      1. associate-*r/ 70.7%

         \[\leadsto \color{blue}{\frac{-1 \cdot v}{t1}} \]

      2. neg-mul-1 70.7%

         \[\leadsto \frac{\color{blue}{-v}}{t1} \]

   7. Simplified 70.7%

      \[\leadsto \color{blue}{\frac{-v}{t1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 63.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;u \leq -1.02 \cdot 10^{+157} \lor \neg \left(u \leq 4.8 \cdot 10^{+83}\right):\\ \;\;\;\;\frac{v}{-u}\\ \mathbf{else}:\\ \;\;\;\;\frac{v}{-t1}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 61.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \frac{-v}{t1 + u} \end{array} \]

FPCore

(FPCore (u v t1) :precision binary64 (/ (- v) (+ t1 u)))

C

double code(double u, double v, double t1) {
	return -v / (t1 + u);
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = -v / (t1 + u)
end function

Java

public static double code(double u, double v, double t1) {
	return -v / (t1 + u);
}

Python

def code(u, v, t1):
	return -v / (t1 + u)

Julia

function code(u, v, t1)
	return Float64(Float64(-v) / Float64(t1 + u))
end

MATLAB

function tmp = code(u, v, t1)
	tmp = -v / (t1 + u);
end

Wolfram

code[u_, v_, t1_] := N[((-v) / N[(t1 + u), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 75.5%

   \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
2. Step-by-step derivation

   1. times-frac 99.8%

      \[\leadsto \color{blue}{\frac{-t1}{t1 + u} \cdot \frac{v}{t1 + u}} \]

   2. distribute-frac-neg 99.8%

      \[\leadsto \color{blue}{\left(-\frac{t1}{t1 + u}\right)} \cdot \frac{v}{t1 + u} \]

   3. distribute-neg-frac2 99.8%

      \[\leadsto \color{blue}{\frac{t1}{-\left(t1 + u\right)}} \cdot \frac{v}{t1 + u} \]

   4. +-commutative 99.8%

      \[\leadsto \frac{t1}{-\color{blue}{\left(u + t1\right)}} \cdot \frac{v}{t1 + u} \]

   5. distribute-neg-in 99.8%

      \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) + \left(-t1\right)}} \cdot \frac{v}{t1 + u} \]

   6. unsub-neg 99.8%

      \[\leadsto \frac{t1}{\color{blue}{\left(-u\right) - t1}} \cdot \frac{v}{t1 + u} \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\frac{t1}{\left(-u\right) - t1} \cdot \frac{v}{t1 + u}} \]
4. Add Preprocessing

5. Taylor expanded in t1 around inf 63.9%

   \[\leadsto \color{blue}{-1} \cdot \frac{v}{t1 + u} \]

6. Final simplification 63.9%

   \[\leadsto \frac{-v}{t1 + u} \]
7. Add Preprocessing

Alternative 9: 54.8% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \frac{v}{-t1} \end{array} \]

FPCore

(FPCore (u v t1) :precision binary64 (/ v (- t1)))

C

double code(double u, double v, double t1) {
	return v / -t1;
}

Fortran

real(8) function code(u, v, t1)
    real(8), intent (in) :: u
    real(8), intent (in) :: v
    real(8), intent (in) :: t1
    code = v / -t1
end function

Java

public static double code(double u, double v, double t1) {
	return v / -t1;
}

Python

def code(u, v, t1):
	return v / -t1

Julia

function code(u, v, t1)
	return Float64(v / Float64(-t1))
end

MATLAB

function tmp = code(u, v, t1)
	tmp = v / -t1;
end

Wolfram

code[u_, v_, t1_] := N[(v / (-t1)), $MachinePrecision]

Derivation

1. Initial program 75.5%

   \[\frac{\left(-t1\right) \cdot v}{\left(t1 + u\right) \cdot \left(t1 + u\right)} \]
2. Step-by-step derivation

   1. associate-/l* 78.1%

      \[\leadsto \color{blue}{\left(-t1\right) \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

   2. distribute-lft-neg-out 78.1%

      \[\leadsto \color{blue}{-t1 \cdot \frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}} \]

   3. distribute-rgt-neg-in 78.1%

      \[\leadsto \color{blue}{t1 \cdot \left(-\frac{v}{\left(t1 + u\right) \cdot \left(t1 + u\right)}\right)} \]

   4. associate-/r* 85.9%

      \[\leadsto t1 \cdot \left(-\color{blue}{\frac{\frac{v}{t1 + u}}{t1 + u}}\right) \]

   5. distribute-neg-frac2 85.9%

      \[\leadsto t1 \cdot \color{blue}{\frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]

3. Simplified 85.9%

   \[\leadsto \color{blue}{t1 \cdot \frac{\frac{v}{t1 + u}}{-\left(t1 + u\right)}} \]
4. Add Preprocessing

5. Taylor expanded in t1 around inf 55.0%

   \[\leadsto \color{blue}{-1 \cdot \frac{v}{t1}} \]
6. Step-by-step derivation

   1. associate-*r/ 55.0%

      \[\leadsto \color{blue}{\frac{-1 \cdot v}{t1}} \]

   2. neg-mul-1 55.0%

      \[\leadsto \frac{\color{blue}{-v}}{t1} \]

7. Simplified 55.0%

   \[\leadsto \color{blue}{\frac{-v}{t1}} \]

8. Final simplification 55.0%

   \[\leadsto \frac{v}{-t1} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024055 
(FPCore (u v t1)
  :name "Rosa's DopplerBench"
  :precision binary64
  (/ (* (- t1) v) (* (+ t1 u) (+ t1 u))))