Output from RUN_SOLUTION_BY_DISCRETIZATION on 05/08/2012 at 12:24:20. Version for the system is: March 13, 2009 Codelist file name is: immunG.CDL Box data file name is: immun.DT1 Initial box: [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ] Printing in overall algorithm: 0 Printing in LP: 0 EPS_LP_FIT: 1.00000000000000002E-002 ALLOW_EPSILON_APPROXIMATE: F USES_INTERMEDIATE_VARIABLES: F ------------------------------------------------ The independent minimal complete set is empty. The subspace dimension for the Kearfott / Hongthong 2005 analysis is zero. The problem is convex. MAX_SUBDIVISIONS: 1 Total number of sub-problems: 1 n_intermediate_bounds: 0 working indices: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 ------------------------------------------------ ------------------------------------------------ ------------------------------------------------ Completion of run_solution_by_discretization. Total CPU time: 6.40039999999999915E-002 MAX_SUBDIVISIONS: 1 BEST_ESTIMATE: 9489000000.0000248 FEASIBILITY_VERIFICATION_SUCCEEDED: F N_FEASIBILITY_VERIFICATION_FAILED: 1 EFFECTIVE_EPSILON: 2.22507385850720287E-308 EPSILON_PHI: 3840000000.0000420 LP_SOLUTION_FAILED: F Solution boxes: ------------------------------------------------ Solution box number: 1 with overall box index: 1 [ 0.00 , 0.223-307 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ -0.178-306, 0.100E+05 ], [ 0.00 , 19.1 ] [ 0.00 , 18.5 ], [ 0.00 , 17.1 ] [ 0.00 , 17.9 ], [ 0.00 , 17.8 ] [ 0.00 , 149. ], [ 0.00 , 147. ] [ 0.00 , 108. ], [ 0.00 , 0.223-307 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ] LP solution: 0.00 , 0.100E+05, 0.100E+05, 0.100E+05, 0.100E+05, 0.100E+05 0.527E+04, 14.1 , 0.00 , -0.171E-14, 0.00 , 0.00 -0.489E-13, 111. , 0.00 , 0.00 , 0.962E+04, 0.495E+04 0.00 , 0.00 , 0.519E+04 LP solution possibly adjusted with a point optimizer: 0.00 , 0.100E+05, 0.100E+05, 0.100E+05, 0.100E+05, 0.100E+05 0.527E+04, 14.1 , 0.00 , -0.171E-14, 0.00 , 0.00 -0.489E-13, 111. , 0.00 , 0.00 , 0.962E+04, 0.495E+04 0.00 , 0.00 , 0.519E+04 Objective bounds over the solution box: [ 0.565E+10, 0.949E+10 ] Equality constraint bounds over the box: [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ] Inequality constraint bounds over the box: [ -0.223-307, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.187E+06, -0.177E+06 ], [ -19.1 , 0.223-307 ] [ -18.5 , 0.223-307 ], [ -17.1 , 0.223-307 ] [ -17.9 , 0.223-307 ], [ -17.8 , 0.223-307 ] [ -149. , 0.223-307 ], [ -147. , 0.223-307 ] [ -108. , 0.223-307 ], [ -0.223-307, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ] ------------------------------------------------ No. dense interval residual evaluations -- gradient code list: 1 Number of solutions for a component in the expanded system: 1226 Total number of forward_substitutions: 4 Number point dense residual evaluations, gradient codelist: 20 Total number dense interval constraint evaluations: 112 Total number dense interval constraint gradient component evaluations: 588 Total number dense point constraint gradient component evaluations: 12348 Total time spent searching for "D" in the LP filter: 0.800E-02 Number of times SUBSIT decreased one or more coordinate widths: 3