Rosa's FloatVsDoubleBenchmark

Percentage Accurate: 70.7% → 99.2%

Time: 9.0s

Alternatives: 17

Speedup: 5.6×

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

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (+
    x1
    (+
     (+
      (+
       (+
        (*
         (+
          (* (* (* 2.0 x1) t_2) (- t_2 3.0))
          (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
         t_1)
        (* t_0 t_2))
       (* (* x1 x1) x1))
      x1)
     (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = (3.0d0 * x1) * x1
    t_1 = (x1 * x1) + 1.0d0
    t_2 = ((t_0 + (2.0d0 * x2)) - x1) / t_1
    code = x1 + (((((((((2.0d0 * x1) * t_2) * (t_2 - 3.0d0)) + ((x1 * x1) * ((4.0d0 * t_2) - 6.0d0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0d0 * (((t_0 - (2.0d0 * x2)) - x1) / t_1)))
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	return Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
end

MATLAB

function tmp = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	tmp = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Initial Program: 70.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (+
    x1
    (+
     (+
      (+
       (+
        (*
         (+
          (* (* (* 2.0 x1) t_2) (- t_2 3.0))
          (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
         t_1)
        (* t_0 t_2))
       (* (* x1 x1) x1))
      x1)
     (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = (3.0d0 * x1) * x1
    t_1 = (x1 * x1) + 1.0d0
    t_2 = ((t_0 + (2.0d0 * x2)) - x1) / t_1
    code = x1 + (((((((((2.0d0 * x1) * t_2) * (t_2 - 3.0d0)) + ((x1 * x1) * ((4.0d0 * t_2) - 6.0d0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0d0 * (((t_0 - (2.0d0 * x2)) - x1) / t_1)))
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	return Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
end

MATLAB

function tmp = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	tmp = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Alternative 1: 99.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot x1\\ t_1 := 1 + x1 \cdot x1\\ t_2 := x2 \cdot t\_1\\ t_3 := x1 \cdot x1 + 1\\ t_4 := \left(3 \cdot x1\right) \cdot x1\\ t_5 := \frac{\left(t\_4 + 2 \cdot x2\right) - x1}{t\_3}\\ t_6 := t\_4 \cdot t\_5\\ t_7 := \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_5 - 6\right)\\ t_8 := \left(2 \cdot x1\right) \cdot t\_5\\ t_9 := 3 \cdot \frac{\left(t\_4 - 2 \cdot x2\right) - x1}{t\_3}\\ \mathbf{if}\;x1 + \left(\left(\left(\left(\left(t\_8 \cdot \left(t\_5 - 3\right) + t\_7\right) \cdot t\_3 + t\_6\right) + t\_0\right) + x1\right) + t\_9\right) \leq \infty:\\ \;\;\;\;x1 + \left(\left(\left(\left(\left(t\_8 \cdot \left(x2 \cdot \left(\mathsf{fma}\left(3, \frac{x1 \cdot x1}{t\_2}, 2 \cdot {t\_1}^{-1}\right) - \frac{x1}{t\_2}\right) - 3\right) + t\_7\right) \cdot t\_3 + t\_6\right) + t\_0\right) + x1\right) + t\_9\right)\\ \mathbf{else}:\\ \;\;\;\;6 \cdot {x1}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) x1))
        (t_1 (+ 1.0 (* x1 x1)))
        (t_2 (* x2 t_1))
        (t_3 (+ (* x1 x1) 1.0))
        (t_4 (* (* 3.0 x1) x1))
        (t_5 (/ (- (+ t_4 (* 2.0 x2)) x1) t_3))
        (t_6 (* t_4 t_5))
        (t_7 (* (* x1 x1) (- (* 4.0 t_5) 6.0)))
        (t_8 (* (* 2.0 x1) t_5))
        (t_9 (* 3.0 (/ (- (- t_4 (* 2.0 x2)) x1) t_3))))
   (if (<=
        (+
         x1
         (+ (+ (+ (+ (* (+ (* t_8 (- t_5 3.0)) t_7) t_3) t_6) t_0) x1) t_9))
        INFINITY)
     (+
      x1
      (+
       (+
        (+
         (+
          (*
           (+
            (*
             t_8
             (-
              (*
               x2
               (-
                (fma 3.0 (/ (* x1 x1) t_2) (* 2.0 (pow t_1 -1.0)))
                (/ x1 t_2)))
              3.0))
            t_7)
           t_3)
          t_6)
         t_0)
        x1)
       t_9))
     (* 6.0 (pow x1 4.0)))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = 1.0 + (x1 * x1);
	double t_2 = x2 * t_1;
	double t_3 = (x1 * x1) + 1.0;
	double t_4 = (3.0 * x1) * x1;
	double t_5 = ((t_4 + (2.0 * x2)) - x1) / t_3;
	double t_6 = t_4 * t_5;
	double t_7 = (x1 * x1) * ((4.0 * t_5) - 6.0);
	double t_8 = (2.0 * x1) * t_5;
	double t_9 = 3.0 * (((t_4 - (2.0 * x2)) - x1) / t_3);
	double tmp;
	if ((x1 + (((((((t_8 * (t_5 - 3.0)) + t_7) * t_3) + t_6) + t_0) + x1) + t_9)) <= ((double) INFINITY)) {
		tmp = x1 + (((((((t_8 * ((x2 * (fma(3.0, ((x1 * x1) / t_2), (2.0 * pow(t_1, -1.0))) - (x1 / t_2))) - 3.0)) + t_7) * t_3) + t_6) + t_0) + x1) + t_9);
	} else {
		tmp = 6.0 * pow(x1, 4.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * x1)
	t_1 = Float64(1.0 + Float64(x1 * x1))
	t_2 = Float64(x2 * t_1)
	t_3 = Float64(Float64(x1 * x1) + 1.0)
	t_4 = Float64(Float64(3.0 * x1) * x1)
	t_5 = Float64(Float64(Float64(t_4 + Float64(2.0 * x2)) - x1) / t_3)
	t_6 = Float64(t_4 * t_5)
	t_7 = Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_5) - 6.0))
	t_8 = Float64(Float64(2.0 * x1) * t_5)
	t_9 = Float64(3.0 * Float64(Float64(Float64(t_4 - Float64(2.0 * x2)) - x1) / t_3))
	tmp = 0.0
	if (Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(t_8 * Float64(t_5 - 3.0)) + t_7) * t_3) + t_6) + t_0) + x1) + t_9)) <= Inf)
		tmp = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(t_8 * Float64(Float64(x2 * Float64(fma(3.0, Float64(Float64(x1 * x1) / t_2), Float64(2.0 * (t_1 ^ -1.0))) - Float64(x1 / t_2))) - 3.0)) + t_7) * t_3) + t_6) + t_0) + x1) + t_9));
	else
		tmp = Float64(6.0 * (x1 ^ 4.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(x1 * x1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x2 * t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(t$95$4 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$3), $MachinePrecision]}, Block[{t$95$6 = N[(t$95$4 * t$95$5), $MachinePrecision]}, Block[{t$95$7 = N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$5), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$8 = N[(N[(2.0 * x1), $MachinePrecision] * t$95$5), $MachinePrecision]}, Block[{t$95$9 = N[(3.0 * N[(N[(N[(t$95$4 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$3), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x1 + N[(N[(N[(N[(N[(N[(N[(t$95$8 * N[(t$95$5 - 3.0), $MachinePrecision]), $MachinePrecision] + t$95$7), $MachinePrecision] * t$95$3), $MachinePrecision] + t$95$6), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$9), $MachinePrecision]), $MachinePrecision], Infinity], N[(x1 + N[(N[(N[(N[(N[(N[(N[(t$95$8 * N[(N[(x2 * N[(N[(3.0 * N[(N[(x1 * x1), $MachinePrecision] / t$95$2), $MachinePrecision] + N[(2.0 * N[Power[t$95$1, -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x1 / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] + t$95$7), $MachinePrecision] * t$95$3), $MachinePrecision] + t$95$6), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$9), $MachinePrecision]), $MachinePrecision], N[(6.0 * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x2 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\color{blue}{x2 \cdot \left(\left(3 \cdot \frac{{x1}^{2}}{x2 \cdot \left(1 + {x1}^{2}\right)} + 2 \cdot \frac{1}{1 + {x1}^{2}}\right) - \frac{x1}{x2 \cdot \left(1 + {x1}^{2}\right)}\right)} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(x2 \cdot \color{blue}{\left(\left(3 \cdot \frac{{x1}^{2}}{x2 \cdot \left(1 + {x1}^{2}\right)} + 2 \cdot \frac{1}{1 + {x1}^{2}}\right) - \frac{x1}{x2 \cdot \left(1 + {x1}^{2}\right)}\right)} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(x2 \cdot \left(\left(3 \cdot \frac{{x1}^{2}}{x2 \cdot \left(1 + {x1}^{2}\right)} + 2 \cdot \frac{1}{1 + {x1}^{2}}\right) - \color{blue}{\frac{x1}{x2 \cdot \left(1 + {x1}^{2}\right)}}\right) - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   5. Applied rewrites 99.3%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\color{blue}{x2 \cdot \left(\mathsf{fma}\left(3, \frac{x1 \cdot x1}{x2 \cdot \left(1 + x1 \cdot x1\right)}, 2 \cdot {\left(1 + x1 \cdot x1\right)}^{-1}\right) - \frac{x1}{x2 \cdot \left(1 + x1 \cdot x1\right)}\right)} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 6 \cdot \color{blue}{{x1}^{4}} \]

      2. lower-pow.f64 100.0

         \[\leadsto 6 \cdot {x1}^{\color{blue}{4}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 80.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right)\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+56}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+83}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right)\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (fma -6.0 x2 (* x2 (* (* x2 x1) 8.0)))))
   (if (<= t_3 -1e+56)
     t_4
     (if (<= t_3 5e+83)
       (fma -6.0 x2 (* x1 (- (fma 9.0 x1 (* x2 (- (* 12.0 x1) 12.0))) 1.0)))
       (if (<= t_3 INFINITY) t_4 (* x1 (- (* 9.0 x1) 1.0)))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = fma(-6.0, x2, (x2 * ((x2 * x1) * 8.0)));
	double tmp;
	if (t_3 <= -1e+56) {
		tmp = t_4;
	} else if (t_3 <= 5e+83) {
		tmp = fma(-6.0, x2, (x1 * (fma(9.0, x1, (x2 * ((12.0 * x1) - 12.0))) - 1.0)));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = fma(-6.0, x2, Float64(x2 * Float64(Float64(x2 * x1) * 8.0)))
	tmp = 0.0
	if (t_3 <= -1e+56)
		tmp = t_4;
	elseif (t_3 <= 5e+83)
		tmp = fma(-6.0, x2, Float64(x1 * Float64(fma(9.0, x1, Float64(x2 * Float64(Float64(12.0 * x1) - 12.0))) - 1.0)));
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(-6.0 * x2 + N[(x2 * N[(N[(x2 * x1), $MachinePrecision] * 8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+56], t$95$4, If[LessEqual[t$95$3, 5e+83], N[(-6.0 * x2 + N[(x1 * N[(N[(9.0 * x1 + N[(x2 * N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000009e56 or 5.00000000000000029e83 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 48.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto \mathsf{fma}\left(-6, x2, {x2}^{2} \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, {x2}^{2} \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      5. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      8. lower-*.f64 51.0

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

   8. Applied rewrites 51.0%

      \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

   9. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]
   10. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       2. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       3. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       4. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       5. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       6. lift-*.f64 69.5

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

   11. Applied rewrites 69.5%

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

   12. Taylor expanded in x2 around inf

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right)\right)\right) \]
   13. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x1 \cdot x2\right) \cdot 8\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x1 \cdot x2\right) \cdot 8\right)\right) \]

       3. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

       4. lower-*.f64 70.7

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

   14. Applied rewrites 70.7%

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

   if -1.00000000000000009e56 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 5.00000000000000029e83

   1. Initial program 99.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 92.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(9 \cdot x1 + x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right) \]

      4. lower-*.f64 92.3

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right) \]

   8. Applied rewrites 92.3%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(12 \cdot x1 - 12\right)\right) - 1\right)\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 93.7

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 93.7%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 80.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right)\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+56}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+83}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(12, x2, 9\right) \cdot x1 - 1\right)\right)\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (fma -6.0 x2 (* x2 (* (* x2 x1) 8.0)))))
   (if (<= t_3 -1e+56)
     t_4
     (if (<= t_3 5e+83)
       (fma -6.0 x2 (* x1 (- (* (fma 12.0 x2 9.0) x1) 1.0)))
       (if (<= t_3 INFINITY) t_4 (* x1 (- (* 9.0 x1) 1.0)))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = fma(-6.0, x2, (x2 * ((x2 * x1) * 8.0)));
	double tmp;
	if (t_3 <= -1e+56) {
		tmp = t_4;
	} else if (t_3 <= 5e+83) {
		tmp = fma(-6.0, x2, (x1 * ((fma(12.0, x2, 9.0) * x1) - 1.0)));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = fma(-6.0, x2, Float64(x2 * Float64(Float64(x2 * x1) * 8.0)))
	tmp = 0.0
	if (t_3 <= -1e+56)
		tmp = t_4;
	elseif (t_3 <= 5e+83)
		tmp = fma(-6.0, x2, Float64(x1 * Float64(Float64(fma(12.0, x2, 9.0) * x1) - 1.0)));
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(-6.0 * x2 + N[(x2 * N[(N[(x2 * x1), $MachinePrecision] * 8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+56], t$95$4, If[LessEqual[t$95$3, 5e+83], N[(-6.0 * x2 + N[(x1 * N[(N[(N[(12.0 * x2 + 9.0), $MachinePrecision] * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000009e56 or 5.00000000000000029e83 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 48.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto \mathsf{fma}\left(-6, x2, {x2}^{2} \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, {x2}^{2} \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      5. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      8. lower-*.f64 51.0

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

   8. Applied rewrites 51.0%

      \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

   9. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]
   10. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       2. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       3. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       4. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       5. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       6. lift-*.f64 69.5

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

   11. Applied rewrites 69.5%

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

   12. Taylor expanded in x2 around inf

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right)\right)\right) \]
   13. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x1 \cdot x2\right) \cdot 8\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x1 \cdot x2\right) \cdot 8\right)\right) \]

       3. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

       4. lower-*.f64 70.7

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

   14. Applied rewrites 70.7%

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

   if -1.00000000000000009e56 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 5.00000000000000029e83

   1. Initial program 99.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 92.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(9 \cdot x1 + x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\mathsf{fma}\left(8, x2, 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      5. lower-*.f64 92.0

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\mathsf{fma}\left(8, x2, 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

   8. Applied rewrites 92.0%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\mathsf{fma}\left(8, x2, 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

   9. Taylor expanded in x1 around inf

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(x1 \cdot \left(9 + 12 \cdot x2\right) - 1\right)\right) \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(9 + 12 \cdot x2\right) \cdot x1 - 1\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(9 + 12 \cdot x2\right) \cdot x1 - 1\right)\right) \]

       3. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(12 \cdot x2 + 9\right) \cdot x1 - 1\right)\right) \]

       4. lower-fma.f64 92.3

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(12, x2, 9\right) \cdot x1 - 1\right)\right) \]

   11. Applied rewrites 92.3%

       \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(12, x2, 9\right) \cdot x1 - 1\right)\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 93.7

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 93.7%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 80.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x1 \cdot \left(9 \cdot x1 - 1\right)\\ t_1 := \left(3 \cdot x1\right) \cdot x1\\ t_2 := x1 \cdot x1 + 1\\ t_3 := \frac{\left(t\_1 + 2 \cdot x2\right) - x1}{t\_2}\\ t_4 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_2 + t\_1 \cdot t\_3\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_1 - 2 \cdot x2\right) - x1}{t\_2}\right)\\ t_5 := \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right)\\ \mathbf{if}\;t\_4 \leq -1 \cdot 10^{+40}:\\ \;\;\;\;t\_5\\ \mathbf{elif}\;t\_4 \leq 5 \cdot 10^{+83}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, t\_0\right)\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_5\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* x1 (- (* 9.0 x1) 1.0)))
        (t_1 (* (* 3.0 x1) x1))
        (t_2 (+ (* x1 x1) 1.0))
        (t_3 (/ (- (+ t_1 (* 2.0 x2)) x1) t_2))
        (t_4
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_3) (- t_3 3.0))
                (* (* x1 x1) (- (* 4.0 t_3) 6.0)))
               t_2)
              (* t_1 t_3))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_1 (* 2.0 x2)) x1) t_2)))))
        (t_5 (fma -6.0 x2 (* x2 (* (* x2 x1) 8.0)))))
   (if (<= t_4 -1e+40)
     t_5
     (if (<= t_4 5e+83) (fma -6.0 x2 t_0) (if (<= t_4 INFINITY) t_5 t_0)))))

C

double code(double x1, double x2) {
	double t_0 = x1 * ((9.0 * x1) - 1.0);
	double t_1 = (3.0 * x1) * x1;
	double t_2 = (x1 * x1) + 1.0;
	double t_3 = ((t_1 + (2.0 * x2)) - x1) / t_2;
	double t_4 = x1 + (((((((((2.0 * x1) * t_3) * (t_3 - 3.0)) + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_2) + (t_1 * t_3)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_1 - (2.0 * x2)) - x1) / t_2)));
	double t_5 = fma(-6.0, x2, (x2 * ((x2 * x1) * 8.0)));
	double tmp;
	if (t_4 <= -1e+40) {
		tmp = t_5;
	} else if (t_4 <= 5e+83) {
		tmp = fma(-6.0, x2, t_0);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0))
	t_1 = Float64(Float64(3.0 * x1) * x1)
	t_2 = Float64(Float64(x1 * x1) + 1.0)
	t_3 = Float64(Float64(Float64(t_1 + Float64(2.0 * x2)) - x1) / t_2)
	t_4 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_2) + Float64(t_1 * t_3)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_1 - Float64(2.0 * x2)) - x1) / t_2))))
	t_5 = fma(-6.0, x2, Float64(x2 * Float64(Float64(x2 * x1) * 8.0)))
	tmp = 0.0
	if (t_4 <= -1e+40)
		tmp = t_5;
	elseif (t_4 <= 5e+83)
		tmp = fma(-6.0, x2, t_0);
	elseif (t_4 <= Inf)
		tmp = t_5;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$1 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision] + N[(t$95$1 * t$95$3), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$1 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(-6.0 * x2 + N[(x2 * N[(N[(x2 * x1), $MachinePrecision] * 8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -1e+40], t$95$5, If[LessEqual[t$95$4, 5e+83], N[(-6.0 * x2 + t$95$0), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$5, t$95$0]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000003e40 or 5.00000000000000029e83 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 50.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto \mathsf{fma}\left(-6, x2, {x2}^{2} \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, {x2}^{2} \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \left(8 \cdot x1 + \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      5. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

      8. lower-*.f64 52.6

         \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

   8. Applied rewrites 52.6%

      \[\leadsto \mathsf{fma}\left(-6, x2, \left(x2 \cdot x2\right) \cdot \mathsf{fma}\left(8, x1, \frac{x1 \cdot \left(12 \cdot x1 - 12\right)}{x2}\right)\right) \]

   9. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]
   10. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       2. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       3. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       4. lift-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       5. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

       6. lift-*.f64 70.1

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

   11. Applied rewrites 70.1%

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]

   12. Taylor expanded in x2 around inf

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right)\right)\right) \]
   13. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x1 \cdot x2\right) \cdot 8\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x1 \cdot x2\right) \cdot 8\right)\right) \]

       3. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

       4. lower-*.f64 71.2

          \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

   14. Applied rewrites 71.2%

       \[\leadsto \mathsf{fma}\left(-6, x2, x2 \cdot \left(\left(x2 \cdot x1\right) \cdot 8\right)\right) \]

   if -1.00000000000000003e40 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 5.00000000000000029e83

   1. Initial program 99.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 92.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 92.8

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right)\right) \]

   8. Applied rewrites 92.8%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right)\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 93.7

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 93.7%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 73.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x1 \cdot \left(9 \cdot x1 - 1\right)\\ t_1 := \left(3 \cdot x1\right) \cdot x1\\ t_2 := x1 \cdot x1 + 1\\ t_3 := \frac{\left(t\_1 + 2 \cdot x2\right) - x1}{t\_2}\\ t_4 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_2 + t\_1 \cdot t\_3\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_1 - 2 \cdot x2\right) - x1}{t\_2}\right)\\ t_5 := 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right)\\ \mathbf{if}\;t\_4 \leq -2 \cdot 10^{+168}:\\ \;\;\;\;t\_5\\ \mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+279}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, t\_0\right)\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_5\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* x1 (- (* 9.0 x1) 1.0)))
        (t_1 (* (* 3.0 x1) x1))
        (t_2 (+ (* x1 x1) 1.0))
        (t_3 (/ (- (+ t_1 (* 2.0 x2)) x1) t_2))
        (t_4
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_3) (- t_3 3.0))
                (* (* x1 x1) (- (* 4.0 t_3) 6.0)))
               t_2)
              (* t_1 t_3))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_1 (* 2.0 x2)) x1) t_2)))))
        (t_5 (* 8.0 (* x1 (* x2 x2)))))
   (if (<= t_4 -2e+168)
     t_5
     (if (<= t_4 2e+279) (fma -6.0 x2 t_0) (if (<= t_4 INFINITY) t_5 t_0)))))

C

double code(double x1, double x2) {
	double t_0 = x1 * ((9.0 * x1) - 1.0);
	double t_1 = (3.0 * x1) * x1;
	double t_2 = (x1 * x1) + 1.0;
	double t_3 = ((t_1 + (2.0 * x2)) - x1) / t_2;
	double t_4 = x1 + (((((((((2.0 * x1) * t_3) * (t_3 - 3.0)) + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_2) + (t_1 * t_3)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_1 - (2.0 * x2)) - x1) / t_2)));
	double t_5 = 8.0 * (x1 * (x2 * x2));
	double tmp;
	if (t_4 <= -2e+168) {
		tmp = t_5;
	} else if (t_4 <= 2e+279) {
		tmp = fma(-6.0, x2, t_0);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0))
	t_1 = Float64(Float64(3.0 * x1) * x1)
	t_2 = Float64(Float64(x1 * x1) + 1.0)
	t_3 = Float64(Float64(Float64(t_1 + Float64(2.0 * x2)) - x1) / t_2)
	t_4 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_2) + Float64(t_1 * t_3)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_1 - Float64(2.0 * x2)) - x1) / t_2))))
	t_5 = Float64(8.0 * Float64(x1 * Float64(x2 * x2)))
	tmp = 0.0
	if (t_4 <= -2e+168)
		tmp = t_5;
	elseif (t_4 <= 2e+279)
		tmp = fma(-6.0, x2, t_0);
	elseif (t_4 <= Inf)
		tmp = t_5;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$1 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision] + N[(t$95$1 * t$95$3), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$1 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(8.0 * N[(x1 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -2e+168], t$95$5, If[LessEqual[t$95$4, 2e+279], N[(-6.0 * x2 + t$95$0), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$5, t$95$0]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.9999999999999999e168 or 2.00000000000000012e279 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.7%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 44.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \color{blue}{{x2}^{2}}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot {x2}^{\color{blue}{2}}\right) \]

      3. unpow2 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

      4. lower-*.f64 50.0

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

   8. Applied rewrites 50.0%

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot \left(x2 \cdot x2\right)\right)} \]

   if -1.9999999999999999e168 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000012e279

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 80.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 80.3

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right)\right) \]

   8. Applied rewrites 80.3%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right)\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 93.7

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 93.7%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 61.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right)\\ \mathbf{if}\;t\_3 \leq -2 \cdot 10^{+168}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+279}:\\ \;\;\;\;-6 \cdot x2\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* 8.0 (* x1 (* x2 x2)))))
   (if (<= t_3 -2e+168)
     t_4
     (if (<= t_3 2e+279)
       (* -6.0 x2)
       (if (<= t_3 INFINITY) t_4 (* x1 (- (* 9.0 x1) 1.0)))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = 8.0 * (x1 * (x2 * x2));
	double tmp;
	if (t_3 <= -2e+168) {
		tmp = t_4;
	} else if (t_3 <= 2e+279) {
		tmp = -6.0 * x2;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = 8.0 * (x1 * (x2 * x2));
	double tmp;
	if (t_3 <= -2e+168) {
		tmp = t_4;
	} else if (t_3 <= 2e+279) {
		tmp = -6.0 * x2;
	} else if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = t_4;
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))
	t_4 = 8.0 * (x1 * (x2 * x2))
	tmp = 0
	if t_3 <= -2e+168:
		tmp = t_4
	elif t_3 <= 2e+279:
		tmp = -6.0 * x2
	elif t_3 <= math.inf:
		tmp = t_4
	else:
		tmp = x1 * ((9.0 * x1) - 1.0)
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(8.0 * Float64(x1 * Float64(x2 * x2)))
	tmp = 0.0
	if (t_3 <= -2e+168)
		tmp = t_4;
	elseif (t_3 <= 2e+279)
		tmp = Float64(-6.0 * x2);
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	t_4 = 8.0 * (x1 * (x2 * x2));
	tmp = 0.0;
	if (t_3 <= -2e+168)
		tmp = t_4;
	elseif (t_3 <= 2e+279)
		tmp = -6.0 * x2;
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = x1 * ((9.0 * x1) - 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(8.0 * N[(x1 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+168], t$95$4, If[LessEqual[t$95$3, 2e+279], N[(-6.0 * x2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.9999999999999999e168 or 2.00000000000000012e279 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.7%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 44.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \color{blue}{{x2}^{2}}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot {x2}^{\color{blue}{2}}\right) \]

      3. unpow2 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

      4. lower-*.f64 50.0

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

   8. Applied rewrites 50.0%

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot \left(x2 \cdot x2\right)\right)} \]

   if -1.9999999999999999e168 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2.00000000000000012e279

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

      1. lower-*.f64 54.1

         \[\leadsto -6 \cdot \color{blue}{x2} \]

   5. Applied rewrites 54.1%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 93.7

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 93.7%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ \mathbf{if}\;t\_3 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;6 \cdot {x1}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))
   (if (<= t_3 INFINITY) t_3 (* 6.0 (pow x1 4.0)))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = 6.0 * pow(x1, 4.0);
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = t_3;
	} else {
		tmp = 6.0 * Math.pow(x1, 4.0);
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))
	tmp = 0
	if t_3 <= math.inf:
		tmp = t_3
	else:
		tmp = 6.0 * math.pow(x1, 4.0)
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	tmp = 0.0
	if (t_3 <= Inf)
		tmp = t_3;
	else
		tmp = Float64(6.0 * (x1 ^ 4.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	tmp = 0.0;
	if (t_3 <= Inf)
		tmp = t_3;
	else
		tmp = 6.0 * (x1 ^ 4.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, Infinity], t$95$3, N[(6.0 * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 6 \cdot \color{blue}{{x1}^{4}} \]

      2. lower-pow.f64 100.0

         \[\leadsto 6 \cdot {x1}^{\color{blue}{4}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 96.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \left(3 \cdot x1\right) \cdot x1\\ t_3 := \frac{\left(t\_2 + 2 \cdot x2\right) - x1}{t\_1}\\ t_4 := t\_2 \cdot t\_3\\ t_5 := \left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right)\\ t_6 := 3 \cdot \frac{\left(t\_2 - 2 \cdot x2\right) - x1}{t\_1}\\ \mathbf{if}\;x1 + \left(\left(\left(\left(\left(t\_5 + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_1 + t\_4\right) + t\_0\right) + x1\right) + t\_6\right) \leq \infty:\\ \;\;\;\;x1 + \left(\left(\left(\left(\left(t\_5 + \left(x1 \cdot x1\right) \cdot 6\right) \cdot t\_1 + t\_4\right) + t\_0\right) + x1\right) + t\_6\right)\\ \mathbf{else}:\\ \;\;\;\;6 \cdot {x1}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (* (* 3.0 x1) x1))
        (t_3 (/ (- (+ t_2 (* 2.0 x2)) x1) t_1))
        (t_4 (* t_2 t_3))
        (t_5 (* (* (* 2.0 x1) t_3) (- t_3 3.0)))
        (t_6 (* 3.0 (/ (- (- t_2 (* 2.0 x2)) x1) t_1))))
   (if (<=
        (+
         x1
         (+
          (+
           (+ (+ (* (+ t_5 (* (* x1 x1) (- (* 4.0 t_3) 6.0))) t_1) t_4) t_0)
           x1)
          t_6))
        INFINITY)
     (+ x1 (+ (+ (+ (+ (* (+ t_5 (* (* x1 x1) 6.0)) t_1) t_4) t_0) x1) t_6))
     (* 6.0 (pow x1 4.0)))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = (3.0 * x1) * x1;
	double t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	double t_4 = t_2 * t_3;
	double t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	double t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	double tmp;
	if ((x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= ((double) INFINITY)) {
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6);
	} else {
		tmp = 6.0 * pow(x1, 4.0);
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = (3.0 * x1) * x1;
	double t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	double t_4 = t_2 * t_3;
	double t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	double t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	double tmp;
	if ((x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= Double.POSITIVE_INFINITY) {
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6);
	} else {
		tmp = 6.0 * Math.pow(x1, 4.0);
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (x1 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = (3.0 * x1) * x1
	t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1
	t_4 = t_2 * t_3
	t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0)
	t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1)
	tmp = 0
	if (x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= math.inf:
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6)
	else:
		tmp = 6.0 * math.pow(x1, 4.0)
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(3.0 * x1) * x1)
	t_3 = Float64(Float64(Float64(t_2 + Float64(2.0 * x2)) - x1) / t_1)
	t_4 = Float64(t_2 * t_3)
	t_5 = Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0))
	t_6 = Float64(3.0 * Float64(Float64(Float64(t_2 - Float64(2.0 * x2)) - x1) / t_1))
	tmp = 0.0
	if (Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(t_5 + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= Inf)
		tmp = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(t_5 + Float64(Float64(x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6));
	else
		tmp = Float64(6.0 * (x1 ^ 4.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (x1 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = (3.0 * x1) * x1;
	t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	t_4 = t_2 * t_3;
	t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	tmp = 0.0;
	if ((x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= Inf)
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6);
	else
		tmp = 6.0 * (x1 ^ 4.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(3.0 * N[(N[(N[(t$95$2 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x1 + N[(N[(N[(N[(N[(N[(t$95$5 + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$6), $MachinePrecision]), $MachinePrecision], Infinity], N[(x1 + N[(N[(N[(N[(N[(N[(t$95$5 + N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$6), $MachinePrecision]), $MachinePrecision], N[(6.0 * N[Power[x1, 4.0], $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 95.7%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 6 \cdot \color{blue}{{x1}^{4}} \]

      2. lower-pow.f64 100.0

         \[\leadsto 6 \cdot {x1}^{\color{blue}{4}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{6 \cdot {x1}^{4}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 95.8% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -17000:\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{elif}\;x1 \leq 50000:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;{x1}^{4} \cdot \left(6 + \frac{x2}{x1 \cdot x1} \cdot 8\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (<= x1 -17000.0)
   (* (+ (fma (- (* 6.0 x1) 3.0) x1 (* (- (* x2 2.0) 3.0) 4.0)) 9.0) (* x1 x1))
   (if (<= x1 50000.0)
     (fma
      -6.0
      x2
      (fma
       x1
       (- (* 9.0 x1) 1.0)
       (* x2 (fma 8.0 (* x1 x2) (* x1 (- (* 12.0 x1) 12.0))))))
     (* (pow x1 4.0) (+ 6.0 (* (/ x2 (* x1 x1)) 8.0))))))

C

double code(double x1, double x2) {
	double tmp;
	if (x1 <= -17000.0) {
		tmp = (fma(((6.0 * x1) - 3.0), x1, (((x2 * 2.0) - 3.0) * 4.0)) + 9.0) * (x1 * x1);
	} else if (x1 <= 50000.0) {
		tmp = fma(-6.0, x2, fma(x1, ((9.0 * x1) - 1.0), (x2 * fma(8.0, (x1 * x2), (x1 * ((12.0 * x1) - 12.0))))));
	} else {
		tmp = pow(x1, 4.0) * (6.0 + ((x2 / (x1 * x1)) * 8.0));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if (x1 <= -17000.0)
		tmp = Float64(Float64(fma(Float64(Float64(6.0 * x1) - 3.0), x1, Float64(Float64(Float64(x2 * 2.0) - 3.0) * 4.0)) + 9.0) * Float64(x1 * x1));
	elseif (x1 <= 50000.0)
		tmp = fma(-6.0, x2, fma(x1, Float64(Float64(9.0 * x1) - 1.0), Float64(x2 * fma(8.0, Float64(x1 * x2), Float64(x1 * Float64(Float64(12.0 * x1) - 12.0))))));
	else
		tmp = Float64((x1 ^ 4.0) * Float64(6.0 + Float64(Float64(x2 / Float64(x1 * x1)) * 8.0)));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[LessEqual[x1, -17000.0], N[(N[(N[(N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision] * x1 + N[(N[(N[(x2 * 2.0), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] + 9.0), $MachinePrecision] * N[(x1 * x1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x1, 50000.0], N[(-6.0 * x2 + N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] + N[(x2 * N[(8.0 * N[(x1 * x2), $MachinePrecision] + N[(x1 * N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[x1, 4.0], $MachinePrecision] * N[(6.0 + N[(N[(x2 / N[(x1 * x1), $MachinePrecision]), $MachinePrecision] * 8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -17000

   1. Initial program 23.7%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto {x1}^{4} \cdot \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

      2. lower-pow.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(\color{blue}{6} + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \color{blue}{-1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}}\right) \]

   5. Applied rewrites 97.3%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto {x1}^{2} \cdot \color{blue}{\left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

   8. Applied rewrites 97.3%

      \[\leadsto \left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \color{blue}{\left(x1 \cdot x1\right)} \]

   if -17000 < x1 < 5e4

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 86.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right) + x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      2. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      8. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      9. lower-*.f64 99.3

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

   8. Applied rewrites 99.3%

      \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

   if 5e4 < x1

   1. Initial program 39.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto {x1}^{4} \cdot \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

      2. lower-pow.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(\color{blue}{6} + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \color{blue}{-1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}}\right) \]

   5. Applied rewrites 95.9%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto {x1}^{4} \cdot \left(6 + 8 \cdot \color{blue}{\frac{x2}{{x1}^{2}}}\right) \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \frac{x2}{{x1}^{2}} \cdot 8\right) \]

      2. lower-*.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \frac{x2}{{x1}^{2}} \cdot 8\right) \]

      3. lower-/.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \frac{x2}{{x1}^{2}} \cdot 8\right) \]

      4. pow2 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \frac{x2}{x1 \cdot x1} \cdot 8\right) \]

      5. lower-*.f64 97.1

         \[\leadsto {x1}^{4} \cdot \left(6 + \frac{x2}{x1 \cdot x1} \cdot 8\right) \]

   8. Applied rewrites 97.1%

      \[\leadsto {x1}^{4} \cdot \left(6 + \frac{x2}{x1 \cdot x1} \cdot \color{blue}{8}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 95.9% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -17000 \lor \neg \left(x1 \leq 115\right):\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -17000.0) (not (<= x1 115.0)))
   (* (+ (fma (- (* 6.0 x1) 3.0) x1 (* (- (* x2 2.0) 3.0) 4.0)) 9.0) (* x1 x1))
   (fma
    -6.0
    x2
    (fma
     x1
     (- (* 9.0 x1) 1.0)
     (* x2 (fma 8.0 (* x1 x2) (* x1 (- (* 12.0 x1) 12.0))))))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -17000.0) || !(x1 <= 115.0)) {
		tmp = (fma(((6.0 * x1) - 3.0), x1, (((x2 * 2.0) - 3.0) * 4.0)) + 9.0) * (x1 * x1);
	} else {
		tmp = fma(-6.0, x2, fma(x1, ((9.0 * x1) - 1.0), (x2 * fma(8.0, (x1 * x2), (x1 * ((12.0 * x1) - 12.0))))));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -17000.0) || !(x1 <= 115.0))
		tmp = Float64(Float64(fma(Float64(Float64(6.0 * x1) - 3.0), x1, Float64(Float64(Float64(x2 * 2.0) - 3.0) * 4.0)) + 9.0) * Float64(x1 * x1));
	else
		tmp = fma(-6.0, x2, fma(x1, Float64(Float64(9.0 * x1) - 1.0), Float64(x2 * fma(8.0, Float64(x1 * x2), Float64(x1 * Float64(Float64(12.0 * x1) - 12.0))))));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -17000.0], N[Not[LessEqual[x1, 115.0]], $MachinePrecision]], N[(N[(N[(N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision] * x1 + N[(N[(N[(x2 * 2.0), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] + 9.0), $MachinePrecision] * N[(x1 * x1), $MachinePrecision]), $MachinePrecision], N[(-6.0 * x2 + N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] + N[(x2 * N[(8.0 * N[(x1 * x2), $MachinePrecision] + N[(x1 * N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -17000 or 115 < x1

   1. Initial program 30.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto {x1}^{4} \cdot \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

      2. lower-pow.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(\color{blue}{6} + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \color{blue}{-1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}}\right) \]

   5. Applied rewrites 96.7%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto {x1}^{2} \cdot \color{blue}{\left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

   8. Applied rewrites 96.7%

      \[\leadsto \left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \color{blue}{\left(x1 \cdot x1\right)} \]

   if -17000 < x1 < 115

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 86.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(9 \cdot x1 - 1\right) + x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right) \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      2. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      8. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

      9. lower-*.f64 99.3

         \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]

   8. Applied rewrites 99.3%

      \[\leadsto \mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -17000 \lor \neg \left(x1 \leq 115\right):\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 95.8% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -17000 \lor \neg \left(x1 \leq 115\right):\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -17000.0) (not (<= x1 115.0)))
   (* (+ (fma (- (* 6.0 x1) 3.0) x1 (* (- (* x2 2.0) 3.0) 4.0)) 9.0) (* x1 x1))
   (fma
    x1
    (- (* 9.0 x1) 1.0)
    (* x2 (- (fma 8.0 (* x1 x2) (* x1 (- (* 12.0 x1) 12.0))) 6.0)))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -17000.0) || !(x1 <= 115.0)) {
		tmp = (fma(((6.0 * x1) - 3.0), x1, (((x2 * 2.0) - 3.0) * 4.0)) + 9.0) * (x1 * x1);
	} else {
		tmp = fma(x1, ((9.0 * x1) - 1.0), (x2 * (fma(8.0, (x1 * x2), (x1 * ((12.0 * x1) - 12.0))) - 6.0)));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -17000.0) || !(x1 <= 115.0))
		tmp = Float64(Float64(fma(Float64(Float64(6.0 * x1) - 3.0), x1, Float64(Float64(Float64(x2 * 2.0) - 3.0) * 4.0)) + 9.0) * Float64(x1 * x1));
	else
		tmp = fma(x1, Float64(Float64(9.0 * x1) - 1.0), Float64(x2 * Float64(fma(8.0, Float64(x1 * x2), Float64(x1 * Float64(Float64(12.0 * x1) - 12.0))) - 6.0)));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -17000.0], N[Not[LessEqual[x1, 115.0]], $MachinePrecision]], N[(N[(N[(N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision] * x1 + N[(N[(N[(x2 * 2.0), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] + 9.0), $MachinePrecision] * N[(x1 * x1), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision] + N[(x2 * N[(N[(8.0 * N[(x1 * x2), $MachinePrecision] + N[(x1 * N[(N[(12.0 * x1), $MachinePrecision] - 12.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -17000 or 115 < x1

   1. Initial program 30.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto {x1}^{4} \cdot \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

      2. lower-pow.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(\color{blue}{6} + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \color{blue}{-1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}}\right) \]

   5. Applied rewrites 96.7%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto {x1}^{2} \cdot \color{blue}{\left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

   8. Applied rewrites 96.7%

      \[\leadsto \left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \color{blue}{\left(x1 \cdot x1\right)} \]

   if -17000 < x1 < 115

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 86.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) + \color{blue}{x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)} \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - \color{blue}{1}, x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      2. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\left(8 \cdot \left(x1 \cdot x2\right) + x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      9. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

      10. lower-*.f64 99.1

          \[\leadsto \mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]

   8. Applied rewrites 99.1%

      \[\leadsto \mathsf{fma}\left(x1, \color{blue}{9 \cdot x1 - 1}, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -17000 \lor \neg \left(x1 \leq 115\right):\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x1, 9 \cdot x1 - 1, x2 \cdot \left(\mathsf{fma}\left(8, x1 \cdot x2, x1 \cdot \left(12 \cdot x1 - 12\right)\right) - 6\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 89.8% accurate, 5.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -17000 \lor \neg \left(x1 \leq 115\right):\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -17000.0) (not (<= x1 115.0)))
   (* (+ (fma (- (* 6.0 x1) 3.0) x1 (* (- (* x2 2.0) 3.0) 4.0)) 9.0) (* x1 x1))
   (fma
    -6.0
    x2
    (* x1 (- (fma (fma 12.0 x2 9.0) x1 (* (- (* 8.0 x2) 12.0) x2)) 1.0)))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -17000.0) || !(x1 <= 115.0)) {
		tmp = (fma(((6.0 * x1) - 3.0), x1, (((x2 * 2.0) - 3.0) * 4.0)) + 9.0) * (x1 * x1);
	} else {
		tmp = fma(-6.0, x2, (x1 * (fma(fma(12.0, x2, 9.0), x1, (((8.0 * x2) - 12.0) * x2)) - 1.0)));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -17000.0) || !(x1 <= 115.0))
		tmp = Float64(Float64(fma(Float64(Float64(6.0 * x1) - 3.0), x1, Float64(Float64(Float64(x2 * 2.0) - 3.0) * 4.0)) + 9.0) * Float64(x1 * x1));
	else
		tmp = fma(-6.0, x2, Float64(x1 * Float64(fma(fma(12.0, x2, 9.0), x1, Float64(Float64(Float64(8.0 * x2) - 12.0) * x2)) - 1.0)));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -17000.0], N[Not[LessEqual[x1, 115.0]], $MachinePrecision]], N[(N[(N[(N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision] * x1 + N[(N[(N[(x2 * 2.0), $MachinePrecision] - 3.0), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] + 9.0), $MachinePrecision] * N[(x1 * x1), $MachinePrecision]), $MachinePrecision], N[(-6.0 * x2 + N[(x1 * N[(N[(N[(12.0 * x2 + 9.0), $MachinePrecision] * x1 + N[(N[(N[(8.0 * x2), $MachinePrecision] - 12.0), $MachinePrecision] * x2), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -17000 or 115 < x1

   1. Initial program 30.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto {x1}^{4} \cdot \color{blue}{\left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

      2. lower-pow.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(\color{blue}{6} + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto {x1}^{4} \cdot \left(6 + \color{blue}{-1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}}\right) \]

   5. Applied rewrites 96.7%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + 4 \cdot \left(2 \cdot x2 - 3\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto {x1}^{2} \cdot \color{blue}{\left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)} \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right) \cdot {x1}^{\color{blue}{2}} \]

   8. Applied rewrites 96.7%

      \[\leadsto \left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \color{blue}{\left(x1 \cdot x1\right)} \]

   if -17000 < x1 < 115

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 86.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(9 \cdot x1 + x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\left(8 \cdot x2 + 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\mathsf{fma}\left(8, x2, 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

      5. lower-*.f64 86.2

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\mathsf{fma}\left(8, x2, 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

   8. Applied rewrites 86.2%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9, x1, x2 \cdot \left(\mathsf{fma}\left(8, x2, 12 \cdot x1\right) - 12\right)\right) - 1\right)\right) \]

   9. Taylor expanded in x1 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(x1 \cdot \left(9 + 12 \cdot x2\right) + x2 \cdot \left(8 \cdot x2 - 12\right)\right) - 1\right)\right) \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\left(\left(9 + 12 \cdot x2\right) \cdot x1 + x2 \cdot \left(8 \cdot x2 - 12\right)\right) - 1\right)\right) \]

       2. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(9 + 12 \cdot x2, x1, x2 \cdot \left(8 \cdot x2 - 12\right)\right) - 1\right)\right) \]

       3. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(12 \cdot x2 + 9, x1, x2 \cdot \left(8 \cdot x2 - 12\right)\right) - 1\right)\right) \]

       4. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, x2 \cdot \left(8 \cdot x2 - 12\right)\right) - 1\right)\right) \]

       5. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right) \]

       6. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right) \]

       7. lower--.f64 N/A

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right) \]

       8. lower-*.f64 86.2

          \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right) \]

   11. Applied rewrites 86.2%

       \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -17000 \lor \neg \left(x1 \leq 115\right):\\ \;\;\;\;\left(\mathsf{fma}\left(6 \cdot x1 - 3, x1, \left(x2 \cdot 2 - 3\right) \cdot 4\right) + 9\right) \cdot \left(x1 \cdot x1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(12, x2, 9\right), x1, \left(8 \cdot x2 - 12\right) \cdot x2\right) - 1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 53.5% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot 9\\ \mathbf{if}\;x1 \leq -1.45 \cdot 10^{-19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x1 \leq -2.4 \cdot 10^{-110}:\\ \;\;\;\;-x1\\ \mathbf{elif}\;x1 \leq 1.85 \cdot 10^{-62}:\\ \;\;\;\;-6 \cdot x2\\ \mathbf{elif}\;x1 \leq 6.4 \cdot 10^{-15}:\\ \;\;\;\;-x1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) 9.0)))
   (if (<= x1 -1.45e-19)
     t_0
     (if (<= x1 -2.4e-110)
       (- x1)
       (if (<= x1 1.85e-62) (* -6.0 x2) (if (<= x1 6.4e-15) (- x1) t_0))))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * 9.0;
	double tmp;
	if (x1 <= -1.45e-19) {
		tmp = t_0;
	} else if (x1 <= -2.4e-110) {
		tmp = -x1;
	} else if (x1 <= 1.85e-62) {
		tmp = -6.0 * x2;
	} else if (x1 <= 6.4e-15) {
		tmp = -x1;
	} else {
		tmp = t_0;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x1 * x1) * 9.0d0
    if (x1 <= (-1.45d-19)) then
        tmp = t_0
    else if (x1 <= (-2.4d-110)) then
        tmp = -x1
    else if (x1 <= 1.85d-62) then
        tmp = (-6.0d0) * x2
    else if (x1 <= 6.4d-15) then
        tmp = -x1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (x1 * x1) * 9.0;
	double tmp;
	if (x1 <= -1.45e-19) {
		tmp = t_0;
	} else if (x1 <= -2.4e-110) {
		tmp = -x1;
	} else if (x1 <= 1.85e-62) {
		tmp = -6.0 * x2;
	} else if (x1 <= 6.4e-15) {
		tmp = -x1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (x1 * x1) * 9.0
	tmp = 0
	if x1 <= -1.45e-19:
		tmp = t_0
	elif x1 <= -2.4e-110:
		tmp = -x1
	elif x1 <= 1.85e-62:
		tmp = -6.0 * x2
	elif x1 <= 6.4e-15:
		tmp = -x1
	else:
		tmp = t_0
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * 9.0)
	tmp = 0.0
	if (x1 <= -1.45e-19)
		tmp = t_0;
	elseif (x1 <= -2.4e-110)
		tmp = Float64(-x1);
	elseif (x1 <= 1.85e-62)
		tmp = Float64(-6.0 * x2);
	elseif (x1 <= 6.4e-15)
		tmp = Float64(-x1);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (x1 * x1) * 9.0;
	tmp = 0.0;
	if (x1 <= -1.45e-19)
		tmp = t_0;
	elseif (x1 <= -2.4e-110)
		tmp = -x1;
	elseif (x1 <= 1.85e-62)
		tmp = -6.0 * x2;
	elseif (x1 <= 6.4e-15)
		tmp = -x1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * 9.0), $MachinePrecision]}, If[LessEqual[x1, -1.45e-19], t$95$0, If[LessEqual[x1, -2.4e-110], (-x1), If[LessEqual[x1, 1.85e-62], N[(-6.0 * x2), $MachinePrecision], If[LessEqual[x1, 6.4e-15], (-x1), t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -1.45e-19 or 6.3999999999999999e-15 < x1

   1. Initial program 34.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 51.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 63.3

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 63.3%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]

   9. Taylor expanded in x1 around inf

      \[\leadsto 9 \cdot {x1}^{\color{blue}{2}} \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto {x1}^{2} \cdot 9 \]

       2. lower-*.f64 N/A

          \[\leadsto {x1}^{2} \cdot 9 \]

       3. pow2 N/A

          \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]

       4. lower-*.f64 63.3

          \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]

   11. Applied rewrites 63.3%

       \[\leadsto \left(x1 \cdot x1\right) \cdot 9 \]

   if -1.45e-19 < x1 < -2.40000000000000006e-110 or 1.8499999999999999e-62 < x1 < 6.3999999999999999e-15

   1. Initial program 98.7%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 90.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 57.7

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 57.7%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]

   9. Taylor expanded in x1 around 0

      \[\leadsto -1 \cdot x1 \]
   10. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \mathsf{neg}\left(x1\right) \]

       2. lower-neg.f64 57.5

          \[\leadsto -x1 \]

   11. Applied rewrites 57.5%

       \[\leadsto -x1 \]

   if -2.40000000000000006e-110 < x1 < 1.8499999999999999e-62

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

      1. lower-*.f64 68.0

         \[\leadsto -6 \cdot \color{blue}{x2} \]

   5. Applied rewrites 68.0%

      \[\leadsto \color{blue}{-6 \cdot x2} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 14: 54.4% accurate, 11.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -2.4 \cdot 10^{-110} \lor \neg \left(x1 \leq 1.85 \cdot 10^{-62}\right):\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \mathbf{else}:\\ \;\;\;\;-6 \cdot x2\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -2.4e-110) (not (<= x1 1.85e-62)))
   (* x1 (- (* 9.0 x1) 1.0))
   (* -6.0 x2)))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -2.4e-110) || !(x1 <= 1.85e-62)) {
		tmp = x1 * ((9.0 * x1) - 1.0);
	} else {
		tmp = -6.0 * x2;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if ((x1 <= (-2.4d-110)) .or. (.not. (x1 <= 1.85d-62))) then
        tmp = x1 * ((9.0d0 * x1) - 1.0d0)
    else
        tmp = (-6.0d0) * x2
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -2.4e-110) || !(x1 <= 1.85e-62)) {
		tmp = x1 * ((9.0 * x1) - 1.0);
	} else {
		tmp = -6.0 * x2;
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if (x1 <= -2.4e-110) or not (x1 <= 1.85e-62):
		tmp = x1 * ((9.0 * x1) - 1.0)
	else:
		tmp = -6.0 * x2
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -2.4e-110) || !(x1 <= 1.85e-62))
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	else
		tmp = Float64(-6.0 * x2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if ((x1 <= -2.4e-110) || ~((x1 <= 1.85e-62)))
		tmp = x1 * ((9.0 * x1) - 1.0);
	else
		tmp = -6.0 * x2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -2.4e-110], N[Not[LessEqual[x1, 1.85e-62]], $MachinePrecision]], N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision], N[(-6.0 * x2), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -2.40000000000000006e-110 or 1.8499999999999999e-62 < x1

   1. Initial program 45.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 58.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 62.3

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 62.3%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]

   if -2.40000000000000006e-110 < x1 < 1.8499999999999999e-62

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

      1. lower-*.f64 68.0

         \[\leadsto -6 \cdot \color{blue}{x2} \]

   5. Applied rewrites 68.0%

      \[\leadsto \color{blue}{-6 \cdot x2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 64.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -2.4 \cdot 10^{-110} \lor \neg \left(x1 \leq 1.85 \cdot 10^{-62}\right):\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \mathbf{else}:\\ \;\;\;\;-6 \cdot x2\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 31.9% accurate, 16.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x2 \leq -1.26 \cdot 10^{-196} \lor \neg \left(x2 \leq 1.4 \cdot 10^{-187}\right):\\ \;\;\;\;-6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x2 -1.26e-196) (not (<= x2 1.4e-187))) (* -6.0 x2) (- x1)))

C

double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -1.26e-196) || !(x2 <= 1.4e-187)) {
		tmp = -6.0 * x2;
	} else {
		tmp = -x1;
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if ((x2 <= (-1.26d-196)) .or. (.not. (x2 <= 1.4d-187))) then
        tmp = (-6.0d0) * x2
    else
        tmp = -x1
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -1.26e-196) || !(x2 <= 1.4e-187)) {
		tmp = -6.0 * x2;
	} else {
		tmp = -x1;
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if (x2 <= -1.26e-196) or not (x2 <= 1.4e-187):
		tmp = -6.0 * x2
	else:
		tmp = -x1
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x2 <= -1.26e-196) || !(x2 <= 1.4e-187))
		tmp = Float64(-6.0 * x2);
	else
		tmp = Float64(-x1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if ((x2 <= -1.26e-196) || ~((x2 <= 1.4e-187)))
		tmp = -6.0 * x2;
	else
		tmp = -x1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x2, -1.26e-196], N[Not[LessEqual[x2, 1.4e-187]], $MachinePrecision]], N[(-6.0 * x2), $MachinePrecision], (-x1)]

Derivation

1. Split input into 2 regimes

2. if x2 < -1.2599999999999999e-196 or 1.4e-187 < x2

   1. Initial program 64.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

      1. lower-*.f64 31.1

         \[\leadsto -6 \cdot \color{blue}{x2} \]

   5. Applied rewrites 31.1%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if -1.2599999999999999e-196 < x2 < 1.4e-187

   1. Initial program 67.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 90.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 75.5

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 75.5%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]

   9. Taylor expanded in x1 around 0

      \[\leadsto -1 \cdot x1 \]
   10. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \mathsf{neg}\left(x1\right) \]

       2. lower-neg.f64 44.8

          \[\leadsto -x1 \]

   11. Applied rewrites 44.8%

       \[\leadsto -x1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 33.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x2 \leq -1.26 \cdot 10^{-196} \lor \neg \left(x2 \leq 1.4 \cdot 10^{-187}\right):\\ \;\;\;\;-6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 28.8% accurate, 19.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -1.9 \cdot 10^{-112}:\\ \;\;\;\;-x1\\ \mathbf{else}:\\ \;\;\;\;x1 + -6 \cdot x2\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (<= x1 -1.9e-112) (- x1) (+ x1 (* -6.0 x2))))

C

double code(double x1, double x2) {
	double tmp;
	if (x1 <= -1.9e-112) {
		tmp = -x1;
	} else {
		tmp = x1 + (-6.0 * x2);
	}
	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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if (x1 <= (-1.9d-112)) then
        tmp = -x1
    else
        tmp = x1 + ((-6.0d0) * x2)
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if (x1 <= -1.9e-112) {
		tmp = -x1;
	} else {
		tmp = x1 + (-6.0 * x2);
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if x1 <= -1.9e-112:
		tmp = -x1
	else:
		tmp = x1 + (-6.0 * x2)
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if (x1 <= -1.9e-112)
		tmp = Float64(-x1);
	else
		tmp = Float64(x1 + Float64(-6.0 * x2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if (x1 <= -1.9e-112)
		tmp = -x1;
	else
		tmp = x1 + (-6.0 * x2);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[LessEqual[x1, -1.9e-112], (-x1), N[(x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -1.89999999999999997e-112

   1. Initial program 42.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

   5. Applied rewrites 51.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 63.4

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 63.4%

      \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]

   9. Taylor expanded in x1 around 0

      \[\leadsto -1 \cdot x1 \]
   10. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \mathsf{neg}\left(x1\right) \]

       2. lower-neg.f64 16.1

          \[\leadsto -x1 \]

   11. Applied rewrites 16.1%

       \[\leadsto -x1 \]

   if -1.89999999999999997e-112 < x1

   1. Initial program 78.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto x1 + \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

      1. lower-*.f64 42.5

         \[\leadsto x1 + -6 \cdot \color{blue}{x2} \]

   5. Applied rewrites 42.5%

      \[\leadsto x1 + \color{blue}{-6 \cdot x2} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 14.2% accurate, 99.3× speedup

Math

\[\begin{array}{l} \\ -x1 \end{array} \]

FPCore

(FPCore (x1 x2) :precision binary64 (- x1))

C

double code(double x1, double x2) {
	return -x1;
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    code = -x1
end function

Java

public static double code(double x1, double x2) {
	return -x1;
}

Python

def code(x1, x2):
	return -x1

Julia

function code(x1, x2)
	return Float64(-x1)
end

MATLAB

function tmp = code(x1, x2)
	tmp = -x1;
end

Wolfram

code[x1_, x2_] := (-x1)

Derivation

1. Initial program 65.2%

   \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x1 around 0

   \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]
4. Step-by-step derivation

   1. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(-6, \color{blue}{x2}, x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right) \]

5. Applied rewrites 68.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, \mathsf{fma}\left(6, x2, 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)\right)} \]

6. Taylor expanded in x2 around 0

   \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]
7. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

   2. lower--.f64 N/A

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   3. lower-*.f64 45.8

      \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

8. Applied rewrites 45.8%

   \[\leadsto x1 \cdot \color{blue}{\left(9 \cdot x1 - 1\right)} \]

9. Taylor expanded in x1 around 0

   \[\leadsto -1 \cdot x1 \]
10. Step-by-step derivation

    1. mul-1-neg N/A

       \[\leadsto \mathsf{neg}\left(x1\right) \]

    2. lower-neg.f64 14.4

       \[\leadsto -x1 \]

11. Applied rewrites 14.4%

    \[\leadsto -x1 \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2025085 
(FPCore (x1 x2)
  :name "Rosa's FloatVsDoubleBenchmark"
  :precision binary64
  (+ x1 (+ (+ (+ (+ (* (+ (* (* (* 2.0 x1) (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))) (- (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0)) 3.0)) (* (* x1 x1) (- (* 4.0 (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))) 6.0))) (+ (* x1 x1) 1.0)) (* (* (* 3.0 x1) x1) (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0)))) (* (* x1 x1) x1)) x1) (* 3.0 (/ (- (- (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))))))