Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, B

Percentage Accurate: 81.0% → 99.7%

Time: 5.7s

Alternatives: 4

Speedup: N/A×

Specification

Math

\[\begin{array}{l} \\ x \cdot \frac{\frac{y}{z} \cdot t}{t} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* x (/ (* (/ y z) t) t)))

C

double code(double x, double y, double z, double t) {
	return x * (((y / z) * t) / t);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x * (((y / z) * t) / t)
end function

Java

public static double code(double x, double y, double z, double t) {
	return x * (((y / z) * t) / t);
}

Python

def code(x, y, z, t):
	return x * (((y / z) * t) / t)

Julia

function code(x, y, z, t)
	return Float64(x * Float64(Float64(Float64(y / z) * t) / t))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = x * (((y / z) * t) / t);
end

Wolfram

code[x_, y_, z_, t_] := N[(x * N[(N[(N[(y / z), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]

Initial Program: 81.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \frac{\frac{y}{z} \cdot t}{t} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* x (/ (* (/ y z) t) t)))

C

double code(double x, double y, double z, double t) {
	return x * (((y / z) * t) / t);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x * (((y / z) * t) / t)
end function

Java

public static double code(double x, double y, double z, double t) {
	return x * (((y / z) * t) / t);
}

Python

def code(x, y, z, t):
	return x * (((y / z) * t) / t)

Julia

function code(x, y, z, t)
	return Float64(x * Float64(Float64(Float64(y / z) * t) / t))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = x * (((y / z) * t) / t);
end

Wolfram

code[x_, y_, z_, t_] := N[(x * N[(N[(N[(y / z), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.7% accurate, N/A× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 2.2 \cdot 10^{-33}:\\ \;\;\;\;\frac{x\_m}{z\_m} \cdot y\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{z\_m} \cdot x\_m\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (* x_s (if (<= z_m 2.2e-33) (* (/ x_m z_m) y_m) (* (/ y_m z_m) x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if (z_m <= 2.2e-33) {
		tmp = (x_m / z_m) * y_m;
	} else {
		tmp = (y_m / z_m) * x_m;
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z_m <= 2.2d-33) then
        tmp = (x_m / z_m) * y_m
    else
        tmp = (y_m / z_m) * x_m
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if (z_m <= 2.2e-33) {
		tmp = (x_m / z_m) * y_m;
	} else {
		tmp = (y_m / z_m) * x_m;
	}
	return z_s * (y_s * (x_s * tmp));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	tmp = 0
	if z_m <= 2.2e-33:
		tmp = (x_m / z_m) * y_m
	else:
		tmp = (y_m / z_m) * x_m
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0
	if (z_m <= 2.2e-33)
		tmp = Float64(Float64(x_m / z_m) * y_m);
	else
		tmp = Float64(Float64(y_m / z_m) * x_m);
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0;
	if (z_m <= 2.2e-33)
		tmp = (x_m / z_m) * y_m;
	else
		tmp = (y_m / z_m) * x_m;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 2.2e-33], N[(N[(x$95$m / z$95$m), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(y$95$m / z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 2.20000000000000005e-33

   1. Initial program 76.9%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto x \cdot \color{blue}{\frac{\frac{y}{z} \cdot t}{t}} \]

      2. lift-*.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z} \cdot t}}{t} \]

      3. lift-/.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z}} \cdot t}{t} \]

      4. associate-/l* N/A

         \[\leadsto x \cdot \color{blue}{\left(\frac{y}{z} \cdot \frac{t}{t}\right)} \]

      5. *-inverses N/A

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

      6. *-rgt-identity N/A

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]

      8. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{z} \cdot x} \]

      9. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(y\right)}{\mathsf{neg}\left(z\right)}} \cdot x \]

      10. associate-*l/ N/A

          \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(y\right)\right) \cdot x}{\mathsf{neg}\left(z\right)}} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot \frac{x}{\mathsf{neg}\left(z\right)}} \]

      12. *-commutative N/A

          \[\leadsto \color{blue}{\frac{x}{\mathsf{neg}\left(z\right)} \cdot \left(\mathsf{neg}\left(y\right)\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{\frac{x}{\mathsf{neg}\left(z\right)} \cdot \left(\mathsf{neg}\left(y\right)\right)} \]

      14. frac-2neg-rev N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(x\right)}{\mathsf{neg}\left(\left(\mathsf{neg}\left(z\right)\right)\right)}} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      15. remove-double-neg N/A

          \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z}} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      16. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(x\right)}{z}} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      17. lower-neg.f64 N/A

          \[\leadsto \frac{\color{blue}{-x}}{z} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      18. lower-neg.f64 89.7

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

   4. Applied rewrites 89.7%

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

   if 2.20000000000000005e-33 < z

   1. Initial program 75.6%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto x \cdot \color{blue}{\frac{\frac{y}{z} \cdot t}{t}} \]

      2. lift-*.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z} \cdot t}}{t} \]

      3. lift-/.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z}} \cdot t}{t} \]

      4. associate-/l* N/A

         \[\leadsto x \cdot \color{blue}{\left(\frac{y}{z} \cdot \frac{t}{t}\right)} \]

      5. *-inverses N/A

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

      6. *-rgt-identity N/A

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]

      8. frac-2neg N/A

         \[\leadsto x \cdot \color{blue}{\frac{\mathsf{neg}\left(y\right)}{\mathsf{neg}\left(z\right)}} \]

      9. distribute-frac-neg2 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{\mathsf{neg}\left(y\right)}{z}\right)\right)} \]

      10. distribute-rgt-neg-out N/A

          \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \frac{\mathsf{neg}\left(y\right)}{z}\right)} \]

      11. distribute-lft-neg-in N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x\right)\right) \cdot \frac{\mathsf{neg}\left(y\right)}{z}} \]

      12. *-commutative N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(y\right)}{z} \cdot \left(\mathsf{neg}\left(x\right)\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(y\right)}{z} \cdot \left(\mathsf{neg}\left(x\right)\right)} \]

      14. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(y\right)}{z}} \cdot \left(\mathsf{neg}\left(x\right)\right) \]

      15. lower-neg.f64 N/A

          \[\leadsto \frac{\color{blue}{-y}}{z} \cdot \left(\mathsf{neg}\left(x\right)\right) \]

      16. lower-neg.f64 93.8

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

   4. Applied rewrites 93.8%

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

4. Final simplification 90.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 2.2 \cdot 10^{-33}:\\ \;\;\;\;\frac{x}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 98.7% accurate, N/A× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ \begin{array}{l} t_1 := x\_m \cdot \frac{\frac{y\_m}{z\_m} \cdot t}{t}\\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq 0 \lor \neg \left(t\_1 \leq 5000\right):\\ \;\;\;\;\frac{x\_m}{z\_m} \cdot y\_m\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array}\right)\right) \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (let* ((t_1 (* x_m (/ (* (/ y_m z_m) t) t))))
   (*
    z_s
    (*
     y_s
     (*
      x_s
      (if (or (<= t_1 0.0) (not (<= t_1 5000.0))) (* (/ x_m z_m) y_m) t_1))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double t_1 = x_m * (((y_m / z_m) * t) / t);
	double tmp;
	if ((t_1 <= 0.0) || !(t_1 <= 5000.0)) {
		tmp = (x_m / z_m) * y_m;
	} else {
		tmp = t_1;
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x_m * (((y_m / z_m) * t) / t)
    if ((t_1 <= 0.0d0) .or. (.not. (t_1 <= 5000.0d0))) then
        tmp = (x_m / z_m) * y_m
    else
        tmp = t_1
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double t_1 = x_m * (((y_m / z_m) * t) / t);
	double tmp;
	if ((t_1 <= 0.0) || !(t_1 <= 5000.0)) {
		tmp = (x_m / z_m) * y_m;
	} else {
		tmp = t_1;
	}
	return z_s * (y_s * (x_s * tmp));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	t_1 = x_m * (((y_m / z_m) * t) / t)
	tmp = 0
	if (t_1 <= 0.0) or not (t_1 <= 5000.0):
		tmp = (x_m / z_m) * y_m
	else:
		tmp = t_1
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	t_1 = Float64(x_m * Float64(Float64(Float64(y_m / z_m) * t) / t))
	tmp = 0.0
	if ((t_1 <= 0.0) || !(t_1 <= 5000.0))
		tmp = Float64(Float64(x_m / z_m) * y_m);
	else
		tmp = t_1;
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	t_1 = x_m * (((y_m / z_m) * t) / t);
	tmp = 0.0;
	if ((t_1 <= 0.0) || ~((t_1 <= 5000.0)))
		tmp = (x_m / z_m) * y_m;
	else
		tmp = t_1;
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := Block[{t$95$1 = N[(x$95$m * N[(N[(N[(y$95$m / z$95$m), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, N[(z$95$s * N[(y$95$s * N[(x$95$s * If[Or[LessEqual[t$95$1, 0.0], N[Not[LessEqual[t$95$1, 5000.0]], $MachinePrecision]], N[(N[(x$95$m / z$95$m), $MachinePrecision] * y$95$m), $MachinePrecision], t$95$1]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x (/.f64 (*.f64 (/.f64 y z) t) t)) < 0.0 or 5e3 < (*.f64 x (/.f64 (*.f64 (/.f64 y z) t) t))

   1. Initial program 73.3%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto x \cdot \color{blue}{\frac{\frac{y}{z} \cdot t}{t}} \]

      2. lift-*.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z} \cdot t}}{t} \]

      3. lift-/.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z}} \cdot t}{t} \]

      4. associate-/l* N/A

         \[\leadsto x \cdot \color{blue}{\left(\frac{y}{z} \cdot \frac{t}{t}\right)} \]

      5. *-inverses N/A

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

      6. *-rgt-identity N/A

         \[\leadsto x \cdot \color{blue}{\frac{y}{z}} \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]

      8. *-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{z} \cdot x} \]

      9. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(y\right)}{\mathsf{neg}\left(z\right)}} \cdot x \]

      10. associate-*l/ N/A

          \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(y\right)\right) \cdot x}{\mathsf{neg}\left(z\right)}} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot \frac{x}{\mathsf{neg}\left(z\right)}} \]

      12. *-commutative N/A

          \[\leadsto \color{blue}{\frac{x}{\mathsf{neg}\left(z\right)} \cdot \left(\mathsf{neg}\left(y\right)\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{\frac{x}{\mathsf{neg}\left(z\right)} \cdot \left(\mathsf{neg}\left(y\right)\right)} \]

      14. frac-2neg-rev N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(x\right)}{\mathsf{neg}\left(\left(\mathsf{neg}\left(z\right)\right)\right)}} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      15. remove-double-neg N/A

          \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{z}} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      16. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(x\right)}{z}} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      17. lower-neg.f64 N/A

          \[\leadsto \frac{\color{blue}{-x}}{z} \cdot \left(\mathsf{neg}\left(y\right)\right) \]

      18. lower-neg.f64 91.1

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

   4. Applied rewrites 91.1%

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

   if 0.0 < (*.f64 x (/.f64 (*.f64 (/.f64 y z) t) t)) < 5e3

   1. Initial program 99.5%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 92.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot \frac{\frac{y}{z} \cdot t}{t} \leq 0 \lor \neg \left(x \cdot \frac{\frac{y}{z} \cdot t}{t} \leq 5000\right):\\ \;\;\;\;\frac{x}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{\frac{y}{z} \cdot t}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 83.2% accurate, N/A× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{y\_m}{z\_m} \leq 5 \cdot 10^{+305}:\\ \;\;\;\;x\_m \cdot \frac{\frac{y\_m}{z\_m} \cdot t}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{t} \cdot \left(\frac{t}{z\_m} \cdot y\_m\right)\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= (/ y_m z_m) 5e+305)
      (* x_m (/ (* (/ y_m z_m) t) t))
      (* (/ x_m t) (* (/ t z_m) y_m)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if ((y_m / z_m) <= 5e+305) {
		tmp = x_m * (((y_m / z_m) * t) / t);
	} else {
		tmp = (x_m / t) * ((t / z_m) * y_m);
	}
	return z_s * (y_s * (x_s * tmp));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y_m / z_m) <= 5d+305) then
        tmp = x_m * (((y_m / z_m) * t) / t)
    else
        tmp = (x_m / t) * ((t / z_m) * y_m)
    end if
    code = z_s * (y_s * (x_s * tmp))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	double tmp;
	if ((y_m / z_m) <= 5e+305) {
		tmp = x_m * (((y_m / z_m) * t) / t);
	} else {
		tmp = (x_m / t) * ((t / z_m) * y_m);
	}
	return z_s * (y_s * (x_s * tmp));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	tmp = 0
	if (y_m / z_m) <= 5e+305:
		tmp = x_m * (((y_m / z_m) * t) / t)
	else:
		tmp = (x_m / t) * ((t / z_m) * y_m)
	return z_s * (y_s * (x_s * tmp))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0
	if (Float64(y_m / z_m) <= 5e+305)
		tmp = Float64(x_m * Float64(Float64(Float64(y_m / z_m) * t) / t));
	else
		tmp = Float64(Float64(x_m / t) * Float64(Float64(t / z_m) * y_m));
	end
	return Float64(z_s * Float64(y_s * Float64(x_s * tmp)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = 0.0;
	if ((y_m / z_m) <= 5e+305)
		tmp = x_m * (((y_m / z_m) * t) / t);
	else
		tmp = (x_m / t) * ((t / z_m) * y_m);
	end
	tmp_2 = z_s * (y_s * (x_s * tmp));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[N[(y$95$m / z$95$m), $MachinePrecision], 5e+305], N[(x$95$m * N[(N[(N[(y$95$m / z$95$m), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m / t), $MachinePrecision] * N[(N[(t / z$95$m), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 y z) < 5.00000000000000009e305

   1. Initial program 78.1%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Add Preprocessing

   if 5.00000000000000009e305 < (/.f64 y z)

   1. Initial program 56.2%

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \frac{\frac{y}{z} \cdot t}{t}} \]

      2. lift-/.f64 N/A

         \[\leadsto x \cdot \color{blue}{\frac{\frac{y}{z} \cdot t}{t}} \]

      3. lift-*.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z} \cdot t}}{t} \]

      4. lift-/.f64 N/A

         \[\leadsto x \cdot \frac{\color{blue}{\frac{y}{z}} \cdot t}{t} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{\frac{y}{z} \cdot t}{t} \cdot x} \]

      6. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(\frac{y}{z} \cdot t\right)}{\mathsf{neg}\left(t\right)}} \cdot x \]

      7. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right) \cdot x}{\mathsf{neg}\left(t\right)}} \]

      8. associate-/l* N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right) \cdot \frac{x}{\mathsf{neg}\left(t\right)}} \]

      9. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{\mathsf{neg}\left(t\right)} \cdot \left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \color{blue}{\frac{x}{\mathsf{neg}\left(t\right)} \cdot \left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right)} \]

      11. frac-2neg N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(x\right)}{\mathsf{neg}\left(\left(\mathsf{neg}\left(t\right)\right)\right)}} \cdot \left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right) \]

      12. remove-double-neg N/A

          \[\leadsto \frac{\mathsf{neg}\left(x\right)}{\color{blue}{t}} \cdot \left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right) \]

      13. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(x\right)}{t}} \cdot \left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right) \]

      14. lower-neg.f64 N/A

          \[\leadsto \frac{\color{blue}{-x}}{t} \cdot \left(\mathsf{neg}\left(\frac{y}{z} \cdot t\right)\right) \]

      15. *-commutative N/A

          \[\leadsto \frac{-x}{t} \cdot \left(\mathsf{neg}\left(\color{blue}{t \cdot \frac{y}{z}}\right)\right) \]

      16. associate-/l* N/A

          \[\leadsto \frac{-x}{t} \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{t \cdot y}{z}}\right)\right) \]

      17. frac-2neg N/A

          \[\leadsto \frac{-x}{t} \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{\mathsf{neg}\left(t \cdot y\right)}{\mathsf{neg}\left(z\right)}}\right)\right) \]

      18. distribute-neg-frac N/A

          \[\leadsto \frac{-x}{t} \cdot \color{blue}{\frac{\mathsf{neg}\left(\left(\mathsf{neg}\left(t \cdot y\right)\right)\right)}{\mathsf{neg}\left(z\right)}} \]

      19. remove-double-neg N/A

          \[\leadsto \frac{-x}{t} \cdot \frac{\color{blue}{t \cdot y}}{\mathsf{neg}\left(z\right)} \]

      20. *-commutative N/A

          \[\leadsto \frac{-x}{t} \cdot \frac{\color{blue}{y \cdot t}}{\mathsf{neg}\left(z\right)} \]

      21. associate-/l* N/A

          \[\leadsto \frac{-x}{t} \cdot \color{blue}{\left(y \cdot \frac{t}{\mathsf{neg}\left(z\right)}\right)} \]

      22. *-commutative N/A

          \[\leadsto \frac{-x}{t} \cdot \color{blue}{\left(\frac{t}{\mathsf{neg}\left(z\right)} \cdot y\right)} \]

      23. lower-*.f64 N/A

          \[\leadsto \frac{-x}{t} \cdot \color{blue}{\left(\frac{t}{\mathsf{neg}\left(z\right)} \cdot y\right)} \]

   4. Applied rewrites 73.7%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq 5 \cdot 10^{+305}:\\ \;\;\;\;x \cdot \frac{\frac{y}{z} \cdot t}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{t} \cdot \left(\frac{t}{z} \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.0% accurate, N/A× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ [x_m, y_m, z_m, t] = \mathsf{sort}([x_m, y_m, z_m, t])\\ \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(x\_m \cdot \frac{\frac{y\_m}{z\_m} \cdot t}{t}\right)\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t)
 :precision binary64
 (* z_s (* y_s (* x_s (* x_m (/ (* (/ y_m z_m) t) t))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	return z_s * (y_s * (x_s * (x_m * (((y_m / z_m) * t) / t))));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
z\_m =     private
z\_s =     private
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    code = z_s * (y_s * (x_s * (x_m * (((y_m / z_m) * t) / t))))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t) {
	return z_s * (y_s * (x_s * (x_m * (((y_m / z_m) * t) / t))));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
[x_m, y_m, z_m, t] = sort([x_m, y_m, z_m, t])
def code(z_s, y_s, x_s, x_m, y_m, z_m, t):
	return z_s * (y_s * (x_s * (x_m * (((y_m / z_m) * t) / t))))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
x_m, y_m, z_m, t = sort([x_m, y_m, z_m, t])
function code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	return Float64(z_s * Float64(y_s * Float64(x_s * Float64(x_m * Float64(Float64(Float64(y_m / z_m) * t) / t)))))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t = num2cell(sort([x_m, y_m, z_m, t])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t)
	tmp = z_s * (y_s * (x_s * (x_m * (((y_m / z_m) * t) / t))));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, and t should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(x$95$m * N[(N[(N[(y$95$m / z$95$m), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 76.5%

   \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
2. Add Preprocessing
3. Add Preprocessing

Reproduce

herbie shell --seed 2025057 
(FPCore (x y z t)
  :name "Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (/ (* (/ y z) t) t) -120672205123045000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) -2953761118466953/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* x (/ y z)) (if (< (/ (* (/ y z) t) t) 1131790884630683/20000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) 20087180502407133000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* x (/ y z)) (/ (* y x) z))))))

  (* x (/ (* (/ y z) t) t)))