%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT052+1 : TPTP v9.3.0. Released v2.4.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 : n003.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:51 AM UTC 2026 % Result : Theorem 0.09s 0.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT052+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.41 % Computer : n003.cluster.edu % 0.09/0.41 % Model : x86_64 x86_64 % 0.09/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.41 % Memory : 8046.5625MB % 0.09/0.41 % OS : Linux 6.8.0-71-generic % 0.09/0.42 % CPULimit : 300 % 0.09/0.42 % WCLimit : 300 % 0.09/0.42 % DateTime : Mon Sep 7 13:22:54 UTC 2026 % 0.09/0.42 % CPUTime : % 0.09/0.45 # No SInE strategy applied % 0.09/0.45 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA % 0.09/0.45 # and selection function SelectNewComplexAHP. % 0.09/0.45 # % 0.09/0.45 # Presaturation interreduction done % 0.09/0.45 # Number of axioms: 17 Number of unprocessed: 17 % 0.09/0.45 # Tableaux proof search. % 0.09/0.45 # APR header successfully linked. % 0.09/0.45 # Hello from C++ % 0.09/0.45 # The folding up rule is enabled... % 0.09/0.45 # Local unification is enabled... % 0.09/0.45 # Any saturation attempts will use folding labels... % 0.09/0.45 # 17 beginning clauses after preprocessing and clausification % 0.09/0.45 # Creating start rules for all 1 conjectures. % 0.09/0.45 # There are 1 start rule candidates: % 0.09/0.45 # Found 3 unit axioms. % 0.09/0.45 # 1 start rule tableaux created. % 0.09/0.45 # 14 extension rule candidate clauses % 0.09/0.45 # 3 unit axiom clauses % 0.09/0.45 % 0.09/0.45 # Requested 8, 32 cores available to the main process. % 0.09/0.45 # There are not enough tableaux to fork, creating more from the initial 1 % 0.09/0.45 # Closed tableau found in foldup close cycle with 1 folds and 3 closures done. % 0.09/0.45 # Closed tableau found in foldup close cycle with 1 folds and 3 closures done. % 0.09/0.45 # There were 0 total branch saturation attempts. % 0.09/0.45 # There were 0 of these attempts blocked. % 0.09/0.45 # There were 0 deferred branch saturation attempts. % 0.09/0.45 # There were 0 free duplicated saturations. % 0.09/0.45 # There were 0 total successful branch saturations. % 0.09/0.45 # There were 0 successful branch saturations in interreduction. % 0.09/0.45 # There were 0 successful branch saturations on the branch. % 0.09/0.45 # There were 0 successful branch saturations after the branch. % 0.09/0.45 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.45 # Begin clausification derivation % 0.09/0.45 % 0.09/0.45 # End clausification derivation % 0.09/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.45 cnf(i_0_17, negated_conjecture, (dissimilar(esk1_0,esk2_0,esk2_0))). % 0.09/0.45 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.09/0.45 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.09/0.45 cnf(i_0_16, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 0.09/0.45 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.09/0.45 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.09/0.45 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.09/0.45 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.09/0.45 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.09/0.45 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.09/0.45 cnf(i_0_15, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 0.09/0.45 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.09/0.45 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.09/0.45 cnf(i_0_14, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 0.09/0.45 cnf(i_0_12, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 0.09/0.45 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 0.09/0.45 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.09/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.45 # Begin printing tableau % 0.09/0.45 # Found 6 steps % 0.09/0.45 cnf(i_0_17, negated_conjecture, (dissimilar(esk1_0,esk2_0,esk2_0)), inference(start_rule)). % 0.09/0.45 cnf(i_0_20, plain, (dissimilar(esk1_0,esk2_0,esk2_0)), inference(extension_rule, [i_0_14])). % 0.09/0.45 cnf(i_0_45, plain, (is_aligned(esk1_0,esk2_0)), inference(extension_rule, [i_0_15])). % 0.09/0.45 cnf(i_0_74, plain, (~is_aligned(esk1_0,esk2_0)), inference(closure_rule, [i_0_45])). % 0.09/0.45 cnf(i_0_76, plain, (~dissimilar(esk1_0,esk2_0,esk2_0)), inference(closure_rule, [i_0_17])). % 0.09/0.45 cnf(i_0_46, plain, (is_aligned(esk1_0,esk2_0)), inference(closure_rule, [i_0_45])). % 0.09/0.45 # End printing tableau % 0.09/0.45 # SZS output end % 0.09/0.45 # Branches closed with saturation will be marked with an "s" % 0.09/0.45 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.09/0.45 # We now have 4 tableaux to operate on % 0.09/0.45 # Found closed tableau during pool population. % 0.09/0.45 # Proof search is over... % 0.09/0.45 # Freeing feature tree %------------------------------------------------------------------------------