%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n012.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:09:54 AM UTC 2026 % Result : Theorem 0.03s 0.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.02 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.03/0.30 % Computer : n012.cluster.edu % 0.03/0.30 % Model : x86_64 x86_64 % 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.03/0.30 % Memory : 8046.5625MB % 0.03/0.30 % OS : Linux 6.8.0-71-generic % 0.03/0.30 % CPULimit : 300 % 0.03/0.30 % WCLimit : 300 % 0.03/0.30 % DateTime : Mon Sep 7 13:59:26 UTC 2026 % 0.03/0.30 % CPUTime : % 0.03/0.31 # No SInE strategy applied % 0.03/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.03/0.31 # and selection function SelectUnlessUniqMax. % 0.03/0.31 # % 0.03/0.31 # Presaturation interreduction done % 0.03/0.31 # Number of axioms: 72 Number of unprocessed: 71 % 0.03/0.31 # Tableaux proof search. % 0.03/0.31 # APR header successfully linked. % 0.03/0.31 # Hello from C++ % 0.03/0.31 # The folding up rule is enabled... % 0.03/0.31 # Local unification is enabled... % 0.03/0.31 # Any saturation attempts will use folding labels... % 0.03/0.31 # 71 beginning clauses after preprocessing and clausification % 0.03/0.31 # Creating start rules for all 1 conjectures. % 0.03/0.31 # There are 1 start rule candidates: % 0.03/0.31 # Found 24 unit axioms. % 0.03/0.31 # 1 start rule tableaux created. % 0.03/0.31 # 47 extension rule candidate clauses % 0.03/0.31 # 24 unit axiom clauses % 0.03/0.31 % 0.03/0.31 # Requested 8, 32 cores available to the main process. % 0.03/0.31 # There are not enough tableaux to fork, creating more from the initial 1 % 0.03/0.31 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.03/0.31 # There were 0 total branch saturation attempts. % 0.03/0.31 # There were 0 of these attempts blocked. % 0.03/0.31 # There were 0 deferred branch saturation attempts. % 0.03/0.31 # There were 0 free duplicated saturations. % 0.03/0.31 # There were 0 total successful branch saturations. % 0.03/0.31 # There were 0 successful branch saturations in interreduction. % 0.03/0.31 # There were 0 successful branch saturations on the branch. % 0.03/0.31 # There were 0 successful branch saturations after the branch. % 0.03/0.31 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.03/0.31 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.03/0.31 # Begin clausification derivation % 0.03/0.31 % 0.03/0.31 # End clausification derivation % 0.03/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.03/0.31 cnf(i_0_33, plain, (is_verdict(conflict))). % 0.03/0.31 cnf(i_0_47, plain, (is_ep_type(o))). % 0.03/0.31 cnf(i_0_34, plain, (is_verdict(compatible))). % 0.03/0.31 cnf(i_0_35, plain, (is_verdict(unknown))). % 0.03/0.31 cnf(i_0_46, plain, (is_ep_type(c))). % 0.03/0.31 cnf(i_0_71, plain, (val(v5))). % 0.03/0.31 cnf(i_0_65, plain, (lower_tag(gt,o))). % 0.03/0.31 cnf(i_0_69, plain, (upper_tag(lt,o))). % 0.03/0.31 cnf(i_0_61, plain, (lower_tag(eq,c))). % 0.03/0.31 cnf(i_0_62, plain, (lower_tag(lteq,c))). % 0.03/0.31 cnf(i_0_63, plain, (lower_tag(gteq,c))). % 0.03/0.31 cnf(i_0_4, plain, (leq(X1,X1))). % 0.03/0.31 cnf(i_0_64, plain, (lower_tag(lt,c))). % 0.03/0.31 cnf(i_0_66, plain, (upper_tag(eq,c))). % 0.03/0.31 cnf(i_0_67, plain, (upper_tag(lteq,c))). % 0.03/0.31 cnf(i_0_68, plain, (upper_tag(gteq,c))). % 0.03/0.31 cnf(i_0_70, plain, (upper_tag(gt,c))). % 0.03/0.31 cnf(i_0_42, plain, (box_verdict(compatible,compatible)=compatible)). % 0.03/0.31 cnf(i_0_48, plain, (o!=c)). % 0.03/0.31 cnf(i_0_72, negated_conjecture, (~prec(v5,v5,o,o))). % 0.03/0.31 cnf(i_0_36, plain, (compatible!=conflict)). % 0.03/0.31 cnf(i_0_37, plain, (unknown!=conflict)). % 0.03/0.31 cnf(i_0_38, plain, (compatible!=unknown)). % 0.03/0.31 cnf(i_0_1, plain, (~less(X1,X1))). % 0.03/0.31 cnf(i_0_49, plain, (X1=o|X1=c|~is_ep_type(X1))). % 0.03/0.31 cnf(i_0_5, plain, (leq(X1,X2)|~less(X1,X2))). % 0.03/0.31 cnf(i_0_39, plain, (X1=unknown|X1=compatible|X1=conflict|~is_verdict(X1))). % 0.03/0.31 cnf(i_0_56, plain, (prec(X1,X2,o,o)|~leq(X1,X2))). % 0.03/0.31 cnf(i_0_17, plain, (less(X1,X2)|~in_lopen(X2,X1,X3))). % 0.03/0.31 cnf(i_0_19, plain, (less(X1,X2)|~in_ropen(X1,X3,X2))). % 0.03/0.31 cnf(i_0_23, plain, (less(X1,X2)|~in_open(X2,X1,X3))). % 0.03/0.31 cnf(i_0_22, plain, (less(X1,X2)|~in_open(X1,X3,X2))). % 0.03/0.31 cnf(i_0_57, plain, (leq(X1,X2)|~prec(X1,X2,o,o))). % 0.03/0.31 cnf(i_0_55, plain, (leq(X1,X2)|~prec(X1,X2,c,o))). % 0.03/0.31 cnf(i_0_53, plain, (leq(X1,X2)|~prec(X1,X2,o,c))). % 0.03/0.31 cnf(i_0_54, plain, (prec(X1,X2,c,o)|~leq(X1,X2))). % 0.03/0.31 cnf(i_0_52, plain, (prec(X1,X2,o,c)|~leq(X1,X2))). % 0.03/0.31 cnf(i_0_3, plain, (X1=X2|less(X1,X2)|less(X2,X1))). % 0.03/0.31 cnf(i_0_14, plain, (leq(X1,X2)|~in_closed(X2,X1,X3))). % 0.03/0.31 cnf(i_0_13, plain, (leq(X1,X2)|~in_closed(X1,X3,X2))). % 0.03/0.31 cnf(i_0_16, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2))). % 0.03/0.31 cnf(i_0_20, plain, (leq(X1,X2)|~in_ropen(X2,X1,X3))). % 0.03/0.31 cnf(i_0_7, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). % 0.03/0.31 cnf(i_0_6, plain, (X1=X2|less(X1,X2)|~leq(X1,X2))). % 0.03/0.31 cnf(i_0_51, plain, (less(X1,X2)|~prec(X1,X2,c,c))). % 0.03/0.31 cnf(i_0_50, plain, (prec(X1,X2,c,c)|~less(X1,X2))). % 0.03/0.31 cnf(i_0_40, plain, (box_verdict(X1,conflict)=conflict|~is_verdict(X1))). % 0.03/0.31 cnf(i_0_41, plain, (box_verdict(conflict,X1)=conflict|~is_verdict(X1))). % 0.03/0.31 cnf(i_0_12, plain, (in_closed(X1,X2,X3)|~leq(X1,X3)|~leq(X2,X1))). % 0.03/0.31 cnf(i_0_15, plain, (in_lopen(X1,X2,X3)|~leq(X1,X3)|~less(X2,X1))). % 0.03/0.31 cnf(i_0_18, plain, (in_ropen(X1,X2,X3)|~leq(X2,X1)|~less(X1,X3))). % 0.03/0.31 cnf(i_0_21, plain, (in_open(X1,X2,X3)|~less(X1,X3)|~less(X2,X1))). % 0.03/0.31 cnf(i_0_2, plain, (less(X1,X2)|~less(X3,X2)|~less(X1,X3))). % 0.03/0.31 cnf(i_0_9, plain, (less(X1,X2)|~leq(X1,X3)|~less(X3,X2))). % 0.03/0.31 cnf(i_0_10, plain, (less(X1,X2)|~leq(X3,X2)|~less(X1,X3))). % 0.03/0.31 cnf(i_0_43, plain, (box_verdict(X1,unknown)=unknown|X1=conflict|~is_verdict(X1))). % 0.03/0.31 cnf(i_0_11, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))). % 0.03/0.31 cnf(i_0_26, plain, (~axis_conflict(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.03/0.31 cnf(i_0_30, plain, (axis_subsumes(X1,X2,X3,X4)|~in_closed(esk3_4(X1,X2,X3,X4),X3,X4))). % 0.03/0.31 cnf(i_0_32, plain, (in_closed(X1,X2,X3)|~axis_subsumes(X4,X5,X2,X3)|~in_closed(X1,X4,X5))). % 0.03/0.31 cnf(i_0_44, plain, (box_verdict(unknown,X1)=unknown|X1=conflict|~is_verdict(X1))). % 0.03/0.31 cnf(i_0_28, plain, (in_closed(esk2_4(X1,X2,X3,X4),X3,X4)|~axis_compatible(X1,X2,X3,X4))). % 0.03/0.31 cnf(i_0_29, plain, (in_closed(esk2_4(X1,X2,X3,X4),X1,X2)|~axis_compatible(X1,X2,X3,X4))). % 0.03/0.31 cnf(i_0_45, plain, (box_verdict(X1,X2)=unknown|box_verdict(X1,X2)=compatible|box_verdict(X1,X2)=conflict|~is_verdict(X2)|~is_verdict(X1))). % 0.03/0.31 cnf(i_0_27, plain, (axis_compatible(X1,X2,X3,X4)|~in_closed(X5,X3,X4)|~in_closed(X5,X1,X2))). % 0.03/0.31 cnf(i_0_24, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X3,X4))). % 0.03/0.31 cnf(i_0_59, plain, (disjoint(X1,X2,X3,X4,X5,X6,X7,X8)|~prec(X2,X5,X4,X7))). % 0.03/0.31 cnf(i_0_58, plain, (disjoint(X1,X2,X3,X4,X5,X6,X7,X8)|~prec(X6,X1,X8,X3))). % 0.03/0.31 cnf(i_0_60, plain, (prec(X1,X2,X3,X4)|prec(X5,X6,X7,X8)|~disjoint(X6,X1,X8,X3,X2,X5,X4,X7))). % 0.03/0.31 cnf(i_0_25, plain, (axis_conflict(X1,X2,X3,X4)|in_closed(esk1_4(X1,X2,X3,X4),X1,X2))). % 0.03/0.31 cnf(i_0_31, plain, (axis_subsumes(X1,X2,X3,X4)|in_closed(esk3_4(X1,X2,X3,X4),X1,X2))). % 0.03/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.03/0.31 # Begin printing tableau % 0.03/0.31 # Found 3 steps % 0.03/0.31 cnf(i_0_72, negated_conjecture, (~prec(v5,v5,o,o)), inference(start_rule)). % 0.03/0.31 cnf(i_0_80, plain, (~prec(v5,v5,o,o)), inference(extension_rule, [i_0_56])). % 0.03/0.31 cnf(i_0_91, plain, (~leq(v5,v5)), inference(closure_rule, [i_0_4])). % 0.03/0.31 # End printing tableau % 0.03/0.31 # SZS output end % 0.03/0.31 # Branches closed with saturation will be marked with an "s" % 0.03/0.31 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.03/0.31 # We now have 1 tableaux to operate on % 0.03/0.31 # Found closed tableau during pool population. % 0.03/0.31 # Proof search is over... % 0.03/0.31 # Freeing feature tree %------------------------------------------------------------------------------