Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, A

Percentage Accurate: 89.6% → 96.2%

Time: 4.2s

Alternatives: 12

Speedup: 0.5×

• 53.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}

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, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = 2.0d0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}

Python

def code(x, y, z, t, a, b, c, i):
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(Float64(a + Float64(b * c)) * c) * i)))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 89.6% accurate, 1.0× speedup

Math

\[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}

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, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = 2.0d0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}

Python

def code(x, y, z, t, a, b, c, i):
	return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(Float64(a + Float64(b * c)) * c) * i)))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \mathbf{if}\;2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \leq \infty:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \mathsf{fma}\left(t, z, y \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \left(c \cdot \mathsf{fma}\left(i \cdot b, c, i \cdot a\right)\right)\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (if (<= (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))) INFINITY)
   (* 2.0 (fma (fma c b a) (* (- c) i) (fma t z (* y x))))
   (* -2.0 (* c (fma (* i b) c (* i a))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double tmp;
	if ((2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))) <= ((double) INFINITY)) {
		tmp = 2.0 * fma(fma(c, b, a), (-c * i), fma(t, z, (y * x)));
	} else {
		tmp = -2.0 * (c * fma((i * b), c, (i * a)));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	tmp = 0.0
	if (Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(Float64(a + Float64(b * c)) * c) * i))) <= Inf)
		tmp = Float64(2.0 * fma(fma(c, b, a), Float64(Float64(-c) * i), fma(t, z, Float64(y * x))));
	else
		tmp = Float64(-2.0 * Float64(c * fma(Float64(i * b), c, Float64(i * a))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(2.0 * N[(N[(c * b + a), $MachinePrecision] * N[((-c) * i), $MachinePrecision] + N[(t * z + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(c * N[(N[(i * b), $MachinePrecision] * c + N[(i * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 2 binary64) (-.f64 (+.f64 (*.f64 x y) (*.f64 z t)) (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i))) < +inf.0

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \color{blue}{\left(\left(a + b \cdot c\right) \cdot c\right) \cdot i}\right) \]

      3. fp-cancel-sub-sign-inv N/A

         \[\leadsto 2 \cdot \color{blue}{\left(\left(x \cdot y + z \cdot t\right) + \left(\mathsf{neg}\left(\left(a + b \cdot c\right) \cdot c\right)\right) \cdot i\right)} \]

      4. +-commutative N/A

         \[\leadsto 2 \cdot \color{blue}{\left(\left(\mathsf{neg}\left(\left(a + b \cdot c\right) \cdot c\right)\right) \cdot i + \left(x \cdot y + z \cdot t\right)\right)} \]

      5. distribute-lft-neg-out N/A

         \[\leadsto 2 \cdot \left(\color{blue}{\left(\mathsf{neg}\left(\left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right)\right)} + \left(x \cdot y + z \cdot t\right)\right) \]

      6. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(\left(\mathsf{neg}\left(\color{blue}{\left(\left(a + b \cdot c\right) \cdot c\right)} \cdot i\right)\right) + \left(x \cdot y + z \cdot t\right)\right) \]

      7. associate-*l* N/A

         \[\leadsto 2 \cdot \left(\left(\mathsf{neg}\left(\color{blue}{\left(a + b \cdot c\right) \cdot \left(c \cdot i\right)}\right)\right) + \left(x \cdot y + z \cdot t\right)\right) \]

      8. distribute-rgt-neg-in N/A

         \[\leadsto 2 \cdot \left(\color{blue}{\left(a + b \cdot c\right) \cdot \left(\mathsf{neg}\left(c \cdot i\right)\right)} + \left(x \cdot y + z \cdot t\right)\right) \]

      9. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\mathsf{fma}\left(a + b \cdot c, \mathsf{neg}\left(c \cdot i\right), x \cdot y + z \cdot t\right)} \]

      10. lift-+.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\color{blue}{a + b \cdot c}, \mathsf{neg}\left(c \cdot i\right), x \cdot y + z \cdot t\right) \]

      11. +-commutative N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\color{blue}{b \cdot c + a}, \mathsf{neg}\left(c \cdot i\right), x \cdot y + z \cdot t\right) \]

      12. lift-*.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\color{blue}{b \cdot c} + a, \mathsf{neg}\left(c \cdot i\right), x \cdot y + z \cdot t\right) \]

      13. *-commutative N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\color{blue}{c \cdot b} + a, \mathsf{neg}\left(c \cdot i\right), x \cdot y + z \cdot t\right) \]

      14. lower-fma.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(c, b, a\right)}, \mathsf{neg}\left(c \cdot i\right), x \cdot y + z \cdot t\right) \]

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

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \color{blue}{\left(\mathsf{neg}\left(c\right)\right) \cdot i}, x \cdot y + z \cdot t\right) \]

      16. lower-*.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \color{blue}{\left(\mathsf{neg}\left(c\right)\right) \cdot i}, x \cdot y + z \cdot t\right) \]

      17. lower-neg.f64 94.7%

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \color{blue}{\left(-c\right)} \cdot i, x \cdot y + z \cdot t\right) \]

      18. lift-+.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \color{blue}{x \cdot y + z \cdot t}\right) \]

      19. +-commutative N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \color{blue}{z \cdot t + x \cdot y}\right) \]

      20. lift-*.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \color{blue}{z \cdot t} + x \cdot y\right) \]

      21. *-commutative N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \color{blue}{t \cdot z} + x \cdot y\right) \]

      22. lower-fma.f64 95.2%

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \color{blue}{\mathsf{fma}\left(t, z, x \cdot y\right)}\right) \]

      23. lift-*.f64 N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \mathsf{fma}\left(t, z, \color{blue}{x \cdot y}\right)\right) \]

      24. *-commutative N/A

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \mathsf{fma}\left(t, z, \color{blue}{y \cdot x}\right)\right) \]

      25. lower-*.f64 95.2%

          \[\leadsto 2 \cdot \mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \mathsf{fma}\left(t, z, \color{blue}{y \cdot x}\right)\right) \]

   3. Applied rewrites 95.2%

      \[\leadsto 2 \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(c, b, a\right), \left(-c\right) \cdot i, \mathsf{fma}\left(t, z, y \cdot x\right)\right)} \]

   if +inf.0 < (*.f64 #s(literal 2 binary64) (-.f64 (+.f64 (*.f64 x y) (*.f64 z t)) (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)))

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      2. lift-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      3. distribute-lft-in N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot a + \color{blue}{i \cdot \left(b \cdot c\right)}\right)\right) \]

      4. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot a + \color{blue}{i} \cdot \left(b \cdot c\right)\right)\right) \]

      5. +-commutative N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(b \cdot c\right) + \color{blue}{i \cdot a}\right)\right) \]

      6. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(b \cdot c\right) + i \cdot a\right)\right) \]

      7. associate-*r* N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(\left(i \cdot b\right) \cdot c + \color{blue}{i} \cdot a\right)\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \mathsf{fma}\left(i \cdot b, \color{blue}{c}, i \cdot a\right)\right) \]

      9. lower-*.f64 45.2%

         \[\leadsto -2 \cdot \left(c \cdot \mathsf{fma}\left(i \cdot b, c, i \cdot a\right)\right) \]

   6. Applied rewrites 45.2%

      \[\leadsto -2 \cdot \left(c \cdot \mathsf{fma}\left(i \cdot b, \color{blue}{c}, i \cdot a\right)\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 89.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} t_1 := \left(z \cdot t - \left(i \cdot c\right) \cdot \mathsf{fma}\left(b, c, a\right)\right) \cdot 2\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{+81}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+144}:\\ \;\;\;\;2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (- (* z t) (* (* i c) (fma b c a))) 2.0))
        (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -1e+81)
     t_1
     (if (<= t_2 2e+144) (* 2.0 (- (fma t z (* x y)) (* a (* c i)))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = ((z * t) - ((i * c) * fma(b, c, a))) * 2.0;
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -1e+81) {
		tmp = t_1;
	} else if (t_2 <= 2e+144) {
		tmp = 2.0 * (fma(t, z, (x * y)) - (a * (c * i)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(Float64(z * t) - Float64(Float64(i * c) * fma(b, c, a))) * 2.0)
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -1e+81)
		tmp = t_1;
	elseif (t_2 <= 2e+144)
		tmp = Float64(2.0 * Float64(fma(t, z, Float64(x * y)) - Float64(a * Float64(c * i))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(z * t), $MachinePrecision] - N[(N[(i * c), $MachinePrecision] * N[(b * c + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+81], t$95$1, If[LessEqual[t$95$2, 2e+144], N[(2.0 * N[(N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision] - N[(a * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -9.9999999999999992e80 or 2e144 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c} \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      5. lower-+.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      6. lower-*.f64 70.3%

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 70.3%

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \cdot 2} \]

      3. lower-*.f64 70.3%

         \[\leadsto \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \cdot 2} \]

   6. Applied rewrites 72.9%

      \[\leadsto \color{blue}{\left(z \cdot t - \left(i \cdot c\right) \cdot \mathsf{fma}\left(b, c, a\right)\right) \cdot 2} \]

   if -9.9999999999999992e80 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 2e144

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c} \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      5. lower-+.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      6. lower-*.f64 70.3%

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 70.3%

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

   5. Taylor expanded in b around 0

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

      1. lower--.f64 N/A

         \[\leadsto 2 \cdot \left(\left(t \cdot z + x \cdot y\right) - \color{blue}{a \cdot \left(c \cdot i\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - \color{blue}{a} \cdot \left(c \cdot i\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot i\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \color{blue}{\left(c \cdot i\right)}\right) \]

      5. lower-*.f64 73.2%

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot \color{blue}{i}\right)\right) \]

   7. Applied rewrites 73.2%

      \[\leadsto 2 \cdot \color{blue}{\left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot i\right)\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 88.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} t_1 := \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right)\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+256}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+286}:\\ \;\;\;\;2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (* (fma c b a) i) (* -2.0 c))) (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -5e+256)
     t_1
     (if (<= t_2 5e+286) (* 2.0 (- (fma t z (* x y)) (* a (* c i)))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (fma(c, b, a) * i) * (-2.0 * c);
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -5e+256) {
		tmp = t_1;
	} else if (t_2 <= 5e+286) {
		tmp = 2.0 * (fma(t, z, (x * y)) - (a * (c * i)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(fma(c, b, a) * i) * Float64(-2.0 * c))
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -5e+256)
		tmp = t_1;
	elseif (t_2 <= 5e+286)
		tmp = Float64(2.0 * Float64(fma(t, z, Float64(x * y)) - Float64(a * Float64(c * i))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(c * b + a), $MachinePrecision] * i), $MachinePrecision] * N[(-2.0 * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+256], t$95$1, If[LessEqual[t$95$2, 5e+286], N[(2.0 * N[(N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision] - N[(a * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -5.0000000000000002e256 or 5.0000000000000004e286 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

      6. lift-*.f64 N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      7. *-commutative N/A

         \[\leadsto \left(\left(a + b \cdot c\right) \cdot i\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      8. lift-+.f64 N/A

         \[\leadsto \left(\left(a + b \cdot c\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      9. +-commutative N/A

         \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      10. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      11. lift-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot i\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      13. lift-fma.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      14. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      15. add-flip N/A

          \[\leadsto \left(\left(b \cdot c - \left(\mathsf{neg}\left(a\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      16. sub-flip N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      17. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      18. *-commutative N/A

          \[\leadsto \left(\left(c \cdot b + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      19. remove-double-neg N/A

          \[\leadsto \left(\left(c \cdot b + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      20. lower-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      21. lower-*.f64 47.9%

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot \color{blue}{c}\right) \]

   6. Applied rewrites 47.9%

      \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

   if -5.0000000000000002e256 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 5.0000000000000004e286

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c} \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      5. lower-+.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      6. lower-*.f64 70.3%

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 70.3%

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

   5. Taylor expanded in b around 0

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

      1. lower--.f64 N/A

         \[\leadsto 2 \cdot \left(\left(t \cdot z + x \cdot y\right) - \color{blue}{a \cdot \left(c \cdot i\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - \color{blue}{a} \cdot \left(c \cdot i\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot i\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \color{blue}{\left(c \cdot i\right)}\right) \]

      5. lower-*.f64 73.2%

         \[\leadsto 2 \cdot \left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot \color{blue}{i}\right)\right) \]

   7. Applied rewrites 73.2%

      \[\leadsto 2 \cdot \color{blue}{\left(\mathsf{fma}\left(t, z, x \cdot y\right) - a \cdot \left(c \cdot i\right)\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 84.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} t_1 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ t_2 := 2 \cdot \left(t \cdot z - \left(\mathsf{fma}\left(b, c, a\right) \cdot c\right) \cdot i\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+277}:\\ \;\;\;\;\left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right)\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+81}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-38}:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (* (+ a (* b c)) c) i))
        (t_2 (* 2.0 (- (* t z) (* (* (fma b c a) c) i)))))
   (if (<= t_1 -1e+277)
     (* (* (fma c b a) i) (* -2.0 c))
     (if (<= t_1 -1e+81)
       t_2
       (if (<= t_1 4e-38) (* 2.0 (fma t z (* x y))) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = ((a + (b * c)) * c) * i;
	double t_2 = 2.0 * ((t * z) - ((fma(b, c, a) * c) * i));
	double tmp;
	if (t_1 <= -1e+277) {
		tmp = (fma(c, b, a) * i) * (-2.0 * c);
	} else if (t_1 <= -1e+81) {
		tmp = t_2;
	} else if (t_1 <= 4e-38) {
		tmp = 2.0 * fma(t, z, (x * y));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	t_2 = Float64(2.0 * Float64(Float64(t * z) - Float64(Float64(fma(b, c, a) * c) * i)))
	tmp = 0.0
	if (t_1 <= -1e+277)
		tmp = Float64(Float64(fma(c, b, a) * i) * Float64(-2.0 * c));
	elseif (t_1 <= -1e+81)
		tmp = t_2;
	elseif (t_1 <= 4e-38)
		tmp = Float64(2.0 * fma(t, z, Float64(x * y)));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(N[(t * z), $MachinePrecision] - N[(N[(N[(b * c + a), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+277], N[(N[(N[(c * b + a), $MachinePrecision] * i), $MachinePrecision] * N[(-2.0 * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e+81], t$95$2, If[LessEqual[t$95$1, 4e-38], N[(2.0 * N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -1e277

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

      6. lift-*.f64 N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      7. *-commutative N/A

         \[\leadsto \left(\left(a + b \cdot c\right) \cdot i\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      8. lift-+.f64 N/A

         \[\leadsto \left(\left(a + b \cdot c\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      9. +-commutative N/A

         \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      10. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      11. lift-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot i\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      13. lift-fma.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      14. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      15. add-flip N/A

          \[\leadsto \left(\left(b \cdot c - \left(\mathsf{neg}\left(a\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      16. sub-flip N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      17. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      18. *-commutative N/A

          \[\leadsto \left(\left(c \cdot b + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      19. remove-double-neg N/A

          \[\leadsto \left(\left(c \cdot b + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      20. lower-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      21. lower-*.f64 47.9%

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot \color{blue}{c}\right) \]

   6. Applied rewrites 47.9%

      \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

   if -1e277 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -9.9999999999999992e80 or 3.9999999999999998e-38 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \color{blue}{c} \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      5. lower-+.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      6. lower-*.f64 70.3%

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 70.3%

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z - c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      2. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      3. *-commutative N/A

         \[\leadsto 2 \cdot \left(t \cdot z - c \cdot \left(\left(a + b \cdot c\right) \cdot \color{blue}{i}\right)\right) \]

      4. associate-*l* N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \left(c \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{i}\right) \]

      5. *-commutative N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      6. lift-+.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      7. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      8. lower-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot \color{blue}{i}\right) \]

      9. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      10. lift-+.f64 N/A

          \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      11. lower-*.f64 69.6%

          \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      12. lift-+.f64 N/A

          \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

      13. +-commutative N/A

          \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(b \cdot c + a\right) \cdot c\right) \cdot i\right) \]

      14. lift-*.f64 N/A

          \[\leadsto 2 \cdot \left(t \cdot z - \left(\left(b \cdot c + a\right) \cdot c\right) \cdot i\right) \]

      15. lower-fma.f64 69.6%

          \[\leadsto 2 \cdot \left(t \cdot z - \left(\mathsf{fma}\left(b, c, a\right) \cdot c\right) \cdot i\right) \]

   6. Applied rewrites 69.6%

      \[\leadsto 2 \cdot \left(t \cdot z - \left(\mathsf{fma}\left(b, c, a\right) \cdot c\right) \cdot \color{blue}{i}\right) \]

   if -9.9999999999999992e80 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 3.9999999999999998e-38

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z + x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, \color{blue}{z}, x \cdot y\right) \]

      3. lower-*.f64 54.4%

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right) \]

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 83.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \mathsf{fma}\left(c, b, a\right) \cdot \left(\left(-2 \cdot i\right) \cdot c\right)\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+72}:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (fma c b a) (* (* -2.0 i) c))) (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -5e+151)
     t_1
     (if (<= t_2 5e+72) (* 2.0 (fma t z (* x y))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = fma(c, b, a) * ((-2.0 * i) * c);
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -5e+151) {
		tmp = t_1;
	} else if (t_2 <= 5e+72) {
		tmp = 2.0 * fma(t, z, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(fma(c, b, a) * Float64(Float64(-2.0 * i) * c))
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -5e+151)
		tmp = t_1;
	elseif (t_2 <= 5e+72)
		tmp = Float64(2.0 * fma(t, z, Float64(x * y)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(c * b + a), $MachinePrecision] * N[(N[(-2.0 * i), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+151], t$95$1, If[LessEqual[t$95$2, 5e+72], N[(2.0 * N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -5.0000000000000002e151 or 4.9999999999999999e72 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right) \]

      5. lift-+.f64 N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right) \]

      6. +-commutative N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \left(i \cdot \left(b \cdot c + \color{blue}{a}\right)\right) \]

      7. lift-*.f64 N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \left(i \cdot \left(b \cdot c + a\right)\right) \]

      8. lift-fma.f64 N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \left(i \cdot \mathsf{fma}\left(b, \color{blue}{c}, a\right)\right) \]

      9. associate-*r* N/A

         \[\leadsto \left(\left(-2 \cdot c\right) \cdot i\right) \cdot \color{blue}{\mathsf{fma}\left(b, c, a\right)} \]

      10. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(b, c, a\right) \cdot \color{blue}{\left(\left(-2 \cdot c\right) \cdot i\right)} \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(b, c, a\right) \cdot \color{blue}{\left(\left(-2 \cdot c\right) \cdot i\right)} \]

      12. lift-fma.f64 N/A

          \[\leadsto \left(b \cdot c + a\right) \cdot \left(\color{blue}{\left(-2 \cdot c\right)} \cdot i\right) \]

      13. lift-*.f64 N/A

          \[\leadsto \left(b \cdot c + a\right) \cdot \left(\left(\color{blue}{-2} \cdot c\right) \cdot i\right) \]

      14. add-flip N/A

          \[\leadsto \left(b \cdot c - \left(\mathsf{neg}\left(a\right)\right)\right) \cdot \left(\color{blue}{\left(-2 \cdot c\right)} \cdot i\right) \]

      15. sub-flip N/A

          \[\leadsto \left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot \left(\color{blue}{\left(-2 \cdot c\right)} \cdot i\right) \]

      16. lift-*.f64 N/A

          \[\leadsto \left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot \left(\left(\color{blue}{-2} \cdot c\right) \cdot i\right) \]

      17. *-commutative N/A

          \[\leadsto \left(c \cdot b + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot \left(\left(\color{blue}{-2} \cdot c\right) \cdot i\right) \]

      18. remove-double-neg N/A

          \[\leadsto \left(c \cdot b + a\right) \cdot \left(\left(-2 \cdot \color{blue}{c}\right) \cdot i\right) \]

      19. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \left(\color{blue}{\left(-2 \cdot c\right)} \cdot i\right) \]

      20. associate-*l* N/A

          \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \left(-2 \cdot \color{blue}{\left(c \cdot i\right)}\right) \]

      21. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \left(-2 \cdot \left(i \cdot \color{blue}{c}\right)\right) \]

      22. associate-*r* N/A

          \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \left(\left(-2 \cdot i\right) \cdot \color{blue}{c}\right) \]

      23. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \left(\left(-2 \cdot i\right) \cdot \color{blue}{c}\right) \]

      24. lower-*.f64 49.6%

          \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \left(\left(-2 \cdot i\right) \cdot c\right) \]

   6. Applied rewrites 49.6%

      \[\leadsto \mathsf{fma}\left(c, b, a\right) \cdot \color{blue}{\left(\left(-2 \cdot i\right) \cdot c\right)} \]

   if -5.0000000000000002e151 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 4.9999999999999999e72

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z + x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, \color{blue}{z}, x \cdot y\right) \]

      3. lower-*.f64 54.4%

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right) \]

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 81.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right)\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+192}:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (* (fma c b a) i) (* -2.0 c))) (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -5e+151)
     t_1
     (if (<= t_2 5e+192) (* 2.0 (fma t z (* x y))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (fma(c, b, a) * i) * (-2.0 * c);
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -5e+151) {
		tmp = t_1;
	} else if (t_2 <= 5e+192) {
		tmp = 2.0 * fma(t, z, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(fma(c, b, a) * i) * Float64(-2.0 * c))
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -5e+151)
		tmp = t_1;
	elseif (t_2 <= 5e+192)
		tmp = Float64(2.0 * fma(t, z, Float64(x * y)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(c * b + a), $MachinePrecision] * i), $MachinePrecision] * N[(-2.0 * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+151], t$95$1, If[LessEqual[t$95$2, 5e+192], N[(2.0 * N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -5.0000000000000002e151 or 5.0000000000000003e192 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(-2 \cdot c\right) \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)} \]

      4. *-commutative N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

      6. lift-*.f64 N/A

         \[\leadsto \left(i \cdot \left(a + b \cdot c\right)\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      7. *-commutative N/A

         \[\leadsto \left(\left(a + b \cdot c\right) \cdot i\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      8. lift-+.f64 N/A

         \[\leadsto \left(\left(a + b \cdot c\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      9. +-commutative N/A

         \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      10. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      11. lift-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot i\right) \cdot \left(\color{blue}{-2} \cdot c\right) \]

      13. lift-fma.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      14. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      15. add-flip N/A

          \[\leadsto \left(\left(b \cdot c - \left(\mathsf{neg}\left(a\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      16. sub-flip N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      17. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      18. *-commutative N/A

          \[\leadsto \left(\left(c \cdot b + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      19. remove-double-neg N/A

          \[\leadsto \left(\left(c \cdot b + a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      20. lower-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot c\right) \]

      21. lower-*.f64 47.9%

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \left(-2 \cdot \color{blue}{c}\right) \]

   6. Applied rewrites 47.9%

      \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot i\right) \cdot \color{blue}{\left(-2 \cdot c\right)} \]

   if -5.0000000000000002e151 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 5.0000000000000003e192

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z + x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, \color{blue}{z}, x \cdot y\right) \]

      3. lower-*.f64 54.4%

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right) \]

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 80.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \left(\mathsf{fma}\left(c, b, a\right) \cdot c\right) \cdot \left(-2 \cdot i\right)\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+72}:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (* (fma c b a) c) (* -2.0 i))) (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -5e+151)
     t_1
     (if (<= t_2 5e+72) (* 2.0 (fma t z (* x y))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (fma(c, b, a) * c) * (-2.0 * i);
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -5e+151) {
		tmp = t_1;
	} else if (t_2 <= 5e+72) {
		tmp = 2.0 * fma(t, z, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(fma(c, b, a) * c) * Float64(-2.0 * i))
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -5e+151)
		tmp = t_1;
	elseif (t_2 <= 5e+72)
		tmp = Float64(2.0 * fma(t, z, Float64(x * y)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(N[(c * b + a), $MachinePrecision] * c), $MachinePrecision] * N[(-2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+151], t$95$1, If[LessEqual[t$95$2, 5e+72], N[(2.0 * N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -5.0000000000000002e151 or 4.9999999999999999e72 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto -2 \cdot \left(\left(i \cdot \left(a + b \cdot c\right)\right) \cdot \color{blue}{c}\right) \]

      4. associate-*r* N/A

         \[\leadsto \left(-2 \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \cdot \color{blue}{c} \]

      5. lift-*.f64 N/A

         \[\leadsto \left(-2 \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \cdot c \]

      6. lift-+.f64 N/A

         \[\leadsto \left(-2 \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right) \cdot c \]

      7. +-commutative N/A

         \[\leadsto \left(-2 \cdot \left(i \cdot \left(b \cdot c + a\right)\right)\right) \cdot c \]

      8. lift-*.f64 N/A

         \[\leadsto \left(-2 \cdot \left(i \cdot \left(b \cdot c + a\right)\right)\right) \cdot c \]

      9. lift-fma.f64 N/A

         \[\leadsto \left(-2 \cdot \left(i \cdot \mathsf{fma}\left(b, c, a\right)\right)\right) \cdot c \]

      10. associate-*r* N/A

          \[\leadsto \left(\left(-2 \cdot i\right) \cdot \mathsf{fma}\left(b, c, a\right)\right) \cdot c \]

      11. associate-*r* N/A

          \[\leadsto \left(-2 \cdot i\right) \cdot \color{blue}{\left(\mathsf{fma}\left(b, c, a\right) \cdot c\right)} \]

      12. lift-*.f64 N/A

          \[\leadsto \left(-2 \cdot i\right) \cdot \left(\mathsf{fma}\left(b, c, a\right) \cdot \color{blue}{c}\right) \]

      13. *-commutative N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot c\right) \cdot \color{blue}{\left(-2 \cdot i\right)} \]

      14. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(b, c, a\right) \cdot c\right) \cdot \color{blue}{\left(-2 \cdot i\right)} \]

      15. lift-fma.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      16. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + a\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      17. add-flip N/A

          \[\leadsto \left(\left(b \cdot c - \left(\mathsf{neg}\left(a\right)\right)\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      18. sub-flip N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      19. lift-*.f64 N/A

          \[\leadsto \left(\left(b \cdot c + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      20. *-commutative N/A

          \[\leadsto \left(\left(c \cdot b + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)\right)\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      21. remove-double-neg N/A

          \[\leadsto \left(\left(c \cdot b + a\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      22. lower-fma.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot c\right) \cdot \left(-2 \cdot i\right) \]

      23. lower-*.f64 47.4%

          \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot c\right) \cdot \left(-2 \cdot \color{blue}{i}\right) \]

   6. Applied rewrites 47.4%

      \[\leadsto \left(\mathsf{fma}\left(c, b, a\right) \cdot c\right) \cdot \color{blue}{\left(-2 \cdot i\right)} \]

   if -5.0000000000000002e151 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 4.9999999999999999e72

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z + x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, \color{blue}{z}, x \cdot y\right) \]

      3. lower-*.f64 54.4%

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right) \]

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 74.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := -2 \cdot \left(c \cdot \left(b \cdot \left(c \cdot i\right)\right)\right)\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+278}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+286}:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* -2.0 (* c (* b (* c i))))) (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -5e+278)
     t_1
     (if (<= t_2 5e+286) (* 2.0 (fma t z (* x y))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -2.0 * (c * (b * (c * i)));
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -5e+278) {
		tmp = t_1;
	} else if (t_2 <= 5e+286) {
		tmp = 2.0 * fma(t, z, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(-2.0 * Float64(c * Float64(b * Float64(c * i))))
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -5e+278)
		tmp = t_1;
	elseif (t_2 <= 5e+286)
		tmp = Float64(2.0 * fma(t, z, Float64(x * y)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(-2.0 * N[(c * N[(b * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+278], t$95$1, If[LessEqual[t$95$2, 5e+286], N[(2.0 * N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -5.0000000000000003e278 or 5.0000000000000004e286 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in i around inf

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \color{blue}{\left(i \cdot \left(a + b \cdot c\right)\right)}\right) \]

      3. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \color{blue}{\left(a + b \cdot c\right)}\right)\right) \]

      4. lower-+.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + \color{blue}{b \cdot c}\right)\right)\right) \]

      5. lower-*.f64 47.9%

         \[\leadsto -2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot \color{blue}{c}\right)\right)\right) \]

   4. Applied rewrites 47.9%

      \[\leadsto \color{blue}{-2 \cdot \left(c \cdot \left(i \cdot \left(a + b \cdot c\right)\right)\right)} \]

   5. Taylor expanded in a around 0

      \[\leadsto -2 \cdot \left(c \cdot \left(b \cdot \color{blue}{\left(c \cdot i\right)}\right)\right) \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(c \cdot \left(b \cdot \left(c \cdot \color{blue}{i}\right)\right)\right) \]

      2. lower-*.f64 34.6%

         \[\leadsto -2 \cdot \left(c \cdot \left(b \cdot \left(c \cdot i\right)\right)\right) \]

   7. Applied rewrites 34.6%

      \[\leadsto -2 \cdot \left(c \cdot \left(b \cdot \color{blue}{\left(c \cdot i\right)}\right)\right) \]

   if -5.0000000000000003e278 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 5.0000000000000004e286

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z + x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, \color{blue}{z}, x \cdot y\right) \]

      3. lower-*.f64 54.4%

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right) \]

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 62.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := -2 \cdot \left(a \cdot \left(c \cdot i\right)\right)\\ t_2 := \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+286}:\\ \;\;\;\;2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* -2.0 (* a (* c i)))) (t_2 (* (* (+ a (* b c)) c) i)))
   (if (<= t_2 -5e+151)
     t_1
     (if (<= t_2 5e+286) (* 2.0 (fma t z (* x y))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = -2.0 * (a * (c * i));
	double t_2 = ((a + (b * c)) * c) * i;
	double tmp;
	if (t_2 <= -5e+151) {
		tmp = t_1;
	} else if (t_2 <= 5e+286) {
		tmp = 2.0 * fma(t, z, (x * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(-2.0 * Float64(a * Float64(c * i)))
	t_2 = Float64(Float64(Float64(a + Float64(b * c)) * c) * i)
	tmp = 0.0
	if (t_2 <= -5e+151)
		tmp = t_1;
	elseif (t_2 <= 5e+286)
		tmp = Float64(2.0 * fma(t, z, Float64(x * y)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(-2.0 * N[(a * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+151], t$95$1, If[LessEqual[t$95$2, 5e+286], N[(2.0 * N[(t * z + N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -5.0000000000000002e151 or 5.0000000000000004e286 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in a around inf

      \[\leadsto \color{blue}{-2 \cdot \left(a \cdot \left(c \cdot i\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(a \cdot \left(c \cdot i\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(a \cdot \color{blue}{\left(c \cdot i\right)}\right) \]

      3. lower-*.f64 25.2%

         \[\leadsto -2 \cdot \left(a \cdot \left(c \cdot \color{blue}{i}\right)\right) \]

   4. Applied rewrites 25.2%

      \[\leadsto \color{blue}{-2 \cdot \left(a \cdot \left(c \cdot i\right)\right)} \]

   if -5.0000000000000002e151 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 5.0000000000000004e286

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in c around 0

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z + x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, \color{blue}{z}, x \cdot y\right) \]

      3. lower-*.f64 54.4%

         \[\leadsto 2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right) \]

   4. Applied rewrites 54.4%

      \[\leadsto \color{blue}{2 \cdot \mathsf{fma}\left(t, z, x \cdot y\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 43.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} t_1 := \left(t + t\right) \cdot z\\ \mathbf{if}\;z \cdot t \leq -0.0002:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{-16}:\\ \;\;\;\;2 \cdot \left(x \cdot y\right)\\ \mathbf{elif}\;z \cdot t \leq 5 \cdot 10^{+126}:\\ \;\;\;\;-2 \cdot \left(a \cdot \left(c \cdot i\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* (+ t t) z)))
   (if (<= (* z t) -0.0002)
     t_1
     (if (<= (* z t) 2e-16)
       (* 2.0 (* x y))
       (if (<= (* z t) 5e+126) (* -2.0 (* a (* c i))) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (t + t) * z;
	double tmp;
	if ((z * t) <= -0.0002) {
		tmp = t_1;
	} else if ((z * t) <= 2e-16) {
		tmp = 2.0 * (x * y);
	} else if ((z * t) <= 5e+126) {
		tmp = -2.0 * (a * (c * i));
	} else {
		tmp = t_1;
	}
	return tmp;
}

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, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t + t) * z
    if ((z * t) <= (-0.0002d0)) then
        tmp = t_1
    else if ((z * t) <= 2d-16) then
        tmp = 2.0d0 * (x * y)
    else if ((z * t) <= 5d+126) then
        tmp = (-2.0d0) * (a * (c * i))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = (t + t) * z;
	double tmp;
	if ((z * t) <= -0.0002) {
		tmp = t_1;
	} else if ((z * t) <= 2e-16) {
		tmp = 2.0 * (x * y);
	} else if ((z * t) <= 5e+126) {
		tmp = -2.0 * (a * (c * i));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = (t + t) * z
	tmp = 0
	if (z * t) <= -0.0002:
		tmp = t_1
	elif (z * t) <= 2e-16:
		tmp = 2.0 * (x * y)
	elif (z * t) <= 5e+126:
		tmp = -2.0 * (a * (c * i))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(Float64(t + t) * z)
	tmp = 0.0
	if (Float64(z * t) <= -0.0002)
		tmp = t_1;
	elseif (Float64(z * t) <= 2e-16)
		tmp = Float64(2.0 * Float64(x * y));
	elseif (Float64(z * t) <= 5e+126)
		tmp = Float64(-2.0 * Float64(a * Float64(c * i)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = (t + t) * z;
	tmp = 0.0;
	if ((z * t) <= -0.0002)
		tmp = t_1;
	elseif ((z * t) <= 2e-16)
		tmp = 2.0 * (x * y);
	elseif ((z * t) <= 5e+126)
		tmp = -2.0 * (a * (c * i));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(t + t), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[N[(z * t), $MachinePrecision], -0.0002], t$95$1, If[LessEqual[N[(z * t), $MachinePrecision], 2e-16], N[(2.0 * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z * t), $MachinePrecision], 5e+126], N[(-2.0 * N[(a * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -2.0000000000000001e-4 or 4.9999999999999998e126 < (*.f64 z t)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z\right)} \]

      2. lower-*.f64 29.3%

         \[\leadsto 2 \cdot \left(t \cdot \color{blue}{z}\right) \]

   4. Applied rewrites 29.3%

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot \color{blue}{z}\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(2 \cdot t\right) \cdot \color{blue}{z} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot t\right) \cdot \color{blue}{z} \]

      5. count-2-rev N/A

         \[\leadsto \left(t + t\right) \cdot z \]

      6. lower-+.f64 29.2%

         \[\leadsto \left(t + t\right) \cdot z \]

   6. Applied rewrites 29.2%

      \[\leadsto \left(t + t\right) \cdot \color{blue}{z} \]

   if -2.0000000000000001e-4 < (*.f64 z t) < 2e-16

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(x \cdot y\right)} \]

      2. lower-*.f64 28.2%

         \[\leadsto 2 \cdot \left(x \cdot \color{blue}{y}\right) \]

   4. Applied rewrites 28.2%

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right)} \]

   if 2e-16 < (*.f64 z t) < 4.9999999999999998e126

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in a around inf

      \[\leadsto \color{blue}{-2 \cdot \left(a \cdot \left(c \cdot i\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\left(a \cdot \left(c \cdot i\right)\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto -2 \cdot \left(a \cdot \color{blue}{\left(c \cdot i\right)}\right) \]

      3. lower-*.f64 25.2%

         \[\leadsto -2 \cdot \left(a \cdot \left(c \cdot \color{blue}{i}\right)\right) \]

   4. Applied rewrites 25.2%

      \[\leadsto \color{blue}{-2 \cdot \left(a \cdot \left(c \cdot i\right)\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 43.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} t_1 := 2 \cdot \left(x \cdot y\right)\\ \mathbf{if}\;x \cdot y \leq -2.2 \cdot 10^{+92}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq 4.1 \cdot 10^{-35}:\\ \;\;\;\;\left(t + t\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t a b c i)
 :precision binary64
 (let* ((t_1 (* 2.0 (* x y))))
   (if (<= (* x y) -2.2e+92) t_1 (if (<= (* x y) 4.1e-35) (* (+ t t) z) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = 2.0 * (x * y);
	double tmp;
	if ((x * y) <= -2.2e+92) {
		tmp = t_1;
	} else if ((x * y) <= 4.1e-35) {
		tmp = (t + t) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

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, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 * (x * y)
    if ((x * y) <= (-2.2d+92)) then
        tmp = t_1
    else if ((x * y) <= 4.1d-35) then
        tmp = (t + t) * z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	double t_1 = 2.0 * (x * y);
	double tmp;
	if ((x * y) <= -2.2e+92) {
		tmp = t_1;
	} else if ((x * y) <= 4.1e-35) {
		tmp = (t + t) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i):
	t_1 = 2.0 * (x * y)
	tmp = 0
	if (x * y) <= -2.2e+92:
		tmp = t_1
	elif (x * y) <= 4.1e-35:
		tmp = (t + t) * z
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i)
	t_1 = Float64(2.0 * Float64(x * y))
	tmp = 0.0
	if (Float64(x * y) <= -2.2e+92)
		tmp = t_1;
	elseif (Float64(x * y) <= 4.1e-35)
		tmp = Float64(Float64(t + t) * z);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i)
	t_1 = 2.0 * (x * y);
	tmp = 0.0;
	if ((x * y) <= -2.2e+92)
		tmp = t_1;
	elseif ((x * y) <= 4.1e-35)
		tmp = (t + t) * z;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(2.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -2.2e+92], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 4.1e-35], N[(N[(t + t), $MachinePrecision] * z), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -2.1999999999999999e92 or 4.1000000000000003e-35 < (*.f64 x y)

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(x \cdot y\right)} \]

      2. lower-*.f64 28.2%

         \[\leadsto 2 \cdot \left(x \cdot \color{blue}{y}\right) \]

   4. Applied rewrites 28.2%

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right)} \]

   if -2.1999999999999999e92 < (*.f64 x y) < 4.1000000000000003e-35

   1. Initial program 89.6%

      \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z\right)} \]

      2. lower-*.f64 29.3%

         \[\leadsto 2 \cdot \left(t \cdot \color{blue}{z}\right) \]

   4. Applied rewrites 29.3%

      \[\leadsto \color{blue}{2 \cdot \left(t \cdot z\right)} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto 2 \cdot \left(t \cdot \color{blue}{z}\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(2 \cdot t\right) \cdot \color{blue}{z} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(2 \cdot t\right) \cdot \color{blue}{z} \]

      5. count-2-rev N/A

         \[\leadsto \left(t + t\right) \cdot z \]

      6. lower-+.f64 29.2%

         \[\leadsto \left(t + t\right) \cdot z \]

   6. Applied rewrites 29.2%

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

Alternative 12: 29.2% accurate, 4.1× speedup

Math

\[\left(t + t\right) \cdot z \]

FPCore

(FPCore (x y z t a b c i) :precision binary64 (* (+ t t) z))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return (t + t) * z;
}

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, a, b, c, i)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    code = (t + t) * z
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
	return (t + t) * z;
}

Python

def code(x, y, z, t, a, b, c, i):
	return (t + t) * z

Julia

function code(x, y, z, t, a, b, c, i)
	return Float64(Float64(t + t) * z)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i)
	tmp = (t + t) * z;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(t + t), $MachinePrecision] * z), $MachinePrecision]

Derivation

1. Initial program 89.6%

   \[2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right) \]

2. Taylor expanded in z around inf

   \[\leadsto \color{blue}{2 \cdot \left(t \cdot z\right)} \]
3. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z\right)} \]

   2. lower-*.f64 29.3%

      \[\leadsto 2 \cdot \left(t \cdot \color{blue}{z}\right) \]

4. Applied rewrites 29.3%

   \[\leadsto \color{blue}{2 \cdot \left(t \cdot z\right)} \]
5. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto 2 \cdot \color{blue}{\left(t \cdot z\right)} \]

   2. lift-*.f64 N/A

      \[\leadsto 2 \cdot \left(t \cdot \color{blue}{z}\right) \]

   3. associate-*r* N/A

      \[\leadsto \left(2 \cdot t\right) \cdot \color{blue}{z} \]

   4. lower-*.f64 N/A

      \[\leadsto \left(2 \cdot t\right) \cdot \color{blue}{z} \]

   5. count-2-rev N/A

      \[\leadsto \left(t + t\right) \cdot z \]

   6. lower-+.f64 29.2%

      \[\leadsto \left(t + t\right) \cdot z \]

6. Applied rewrites 29.2%

   \[\leadsto \left(t + t\right) \cdot \color{blue}{z} \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2025204 
(FPCore (x y z t a b c i)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, A"
  :precision binary64
  (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))