%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT016+1 : TPTP v9.3.0. Released v2.0.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 : n027.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:44 AM UTC 2026 % Result : Theorem 0.02s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT016+1 : TPTP v9.3.0. Released v2.0.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.02/0.36 % Computer : n027.cluster.edu % 0.02/0.36 % Model : x86_64 x86_64 % 0.02/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.02/0.36 % Memory : 8046.5625MB % 0.02/0.36 % OS : Linux 6.8.0-71-generic % 0.02/0.36 % CPULimit : 300 % 0.02/0.36 % WCLimit : 300 % 0.02/0.36 % DateTime : Mon Sep 7 11:58:15 UTC 2026 % 0.02/0.36 % CPUTime : % 0.02/0.40 # No SInE strategy applied % 0.02/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.02/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.02/0.40 # % 0.02/0.40 # Presaturation interreduction done % 0.02/0.40 # Number of axioms: 16 Number of unprocessed: 16 % 0.02/0.40 # Tableaux proof search. % 0.02/0.40 # APR header successfully linked. % 0.02/0.40 # Hello from C++ % 0.02/0.40 # The folding up rule is enabled... % 0.02/0.40 # Local unification is enabled... % 0.02/0.40 # Any saturation attempts will use folding labels... % 0.02/0.40 # 16 beginning clauses after preprocessing and clausification % 0.02/0.40 # Creating start rules for all 13 conjectures. % 0.02/0.40 # There are 13 start rule candidates: % 0.02/0.40 # Found 13 unit axioms. % 0.02/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.02/0.40 # 13 start rule tableaux created. % 0.02/0.40 # 3 extension rule candidate clauses % 0.02/0.40 # 13 unit axiom clauses % 0.02/0.40 % 0.02/0.40 # Requested 8, 32 cores available to the main process. % 0.02/0.41 # Ran out of tableaux, making start rules for all clauses % 0.02/0.41 # Ran out of tableaux, making start rules for all clauses % 0.02/0.41 # There were 6 total branch saturation attempts. % 0.02/0.41 # There were 0 of these attempts blocked. % 0.02/0.41 # There were 0 deferred branch saturation attempts. % 0.02/0.41 # There were 1 free duplicated saturations. % 0.02/0.41 # There were 6 total successful branch saturations. % 0.02/0.41 # There were 0 successful branch saturations in interreduction. % 0.02/0.41 # There were 0 successful branch saturations on the branch. % 0.02/0.41 # There were 5 successful branch saturations after the branch. % 0.02/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.02/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.02/0.41 # Begin clausification derivation % 0.02/0.41 % 0.02/0.41 # End clausification derivation % 0.02/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.41 cnf(i_0_16, negated_conjecture, (organization(esk2_0,esk8_0))). % 0.02/0.41 cnf(i_0_15, negated_conjecture, (organization(esk3_0,esk8_0))). % 0.02/0.41 cnf(i_0_5, negated_conjecture, (greater(esk7_0,esk6_0))). % 0.02/0.41 cnf(i_0_13, negated_conjecture, (class(esk2_0,esk5_0,esk8_0))). % 0.02/0.41 cnf(i_0_12, negated_conjecture, (class(esk3_0,esk5_0,esk8_0))). % 0.02/0.41 cnf(i_0_7, negated_conjecture, (complexity(esk2_0,esk6_0,esk8_0))). % 0.02/0.41 cnf(i_0_6, negated_conjecture, (complexity(esk3_0,esk7_0,esk8_0))). % 0.02/0.41 cnf(i_0_11, negated_conjecture, (reorganization(esk2_0,esk8_0,esk9_0))). % 0.02/0.41 cnf(i_0_10, negated_conjecture, (reorganization(esk3_0,esk8_0,esk10_0))). % 0.02/0.41 cnf(i_0_9, negated_conjecture, (reorganization_type(esk2_0,esk4_0,esk8_0))). % 0.02/0.41 cnf(i_0_8, negated_conjecture, (reorganization_type(esk3_0,esk4_0,esk8_0))). % 0.02/0.41 cnf(i_0_14, negated_conjecture, (~organization(esk3_0,esk10_0))). % 0.02/0.41 cnf(i_0_4, negated_conjecture, (~greater(esk9_0,esk10_0))). % 0.02/0.41 cnf(i_0_1, plain, (inertia(X1,esk1_2(X1,X2),X2)|~organization(X1,X2))). % 0.02/0.41 cnf(i_0_2, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~complexity(X5,X3,X6)|~complexity(X7,X4,X8)|~class(X5,X9,X6)|~class(X7,X9,X8)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.02/0.41 cnf(i_0_3, hypothesis, (greater(X1,X2)|organization(X3,X2)|~reorganization_type(X3,X4,X5)|~reorganization_type(X6,X4,X5)|~reorganization(X3,X5,X2)|~reorganization(X6,X5,X1)|~greater(X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X5)|~inertia(X3,X7,X5)|~inertia(X6,X8,X5)|~organization(X3,X5)|~organization(X6,X5))). % 0.02/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.41 # Begin printing tableau % 0.02/0.41 # Found 23 steps % 0.02/0.41 cnf(i_0_10, negated_conjecture, (reorganization(esk3_0,esk8_0,esk10_0)), inference(start_rule)). % 0.02/0.41 cnf(i_0_21, plain, (reorganization(esk3_0,esk8_0,esk10_0)), inference(extension_rule, [i_0_3])). % 0.02/0.41 cnf(i_0_318, plain, (organization(esk3_0,esk10_0)), inference(closure_rule, [i_0_14])). % 0.02/0.41 cnf(i_0_319, plain, (~reorganization_type(esk3_0,esk4_0,esk8_0)), inference(closure_rule, [i_0_8])). % 0.02/0.41 cnf(i_0_320, plain, (~reorganization_type(esk3_0,esk4_0,esk8_0)), inference(closure_rule, [i_0_8])). % 0.02/0.41 cnf(i_0_321, plain, (~reorganization(esk3_0,esk8_0,esk10_0)), inference(closure_rule, [i_0_10])). % 0.02/0.41 cnf(i_0_323, plain, (~greater(esk7_0,esk6_0)), inference(closure_rule, [i_0_5])). % 0.02/0.41 cnf(i_0_324, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])). % 0.02/0.41 cnf(i_0_325, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])). % 0.02/0.41 cnf(i_0_328, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])). % 0.02/0.41 cnf(i_0_329, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])). % 0.02/0.41 cnf(i_0_317, plain, (greater(esk10_0,esk10_0)), inference(extension_rule, [i_0_2])). % 0.02/0.41 cnf(i_0_332, plain, (greater(esk9_0,esk10_0)), inference(closure_rule, [i_0_4])). % 0.02/0.41 cnf(i_0_336, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])). % 0.02/0.41 cnf(i_0_337, plain, (~class(esk3_0,esk5_0,esk8_0)), inference(closure_rule, [i_0_12])). % 0.02/0.41 cnf(i_0_340, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])). % 0.02/0.41 cnf(i_0_341, plain, (~organization(esk3_0,esk8_0)), inference(closure_rule, [i_0_15])). % 0.02/0.41 cnf(i_0_326, plain, (~inertia(esk3_0,esk7_0,esk8_0)), inference(etableau_closure_rule, [i_0_326, ...])). % 0.02/0.41 cnf(i_0_327, plain, (~inertia(esk3_0,esk6_0,esk8_0)), inference(etableau_closure_rule, [i_0_327, ...])). % 0.02/0.41 cnf(i_0_334, plain, (~complexity(esk3_0,esk10_0,esk8_0)), inference(etableau_closure_rule, [i_0_334, ...])). % 0.02/0.41 cnf(i_0_335, plain, (~complexity(esk3_0,esk10_0,esk8_0)), inference(etableau_closure_rule, [i_0_335, ...])). % 0.02/0.41 cnf(i_0_338, plain, (~inertia(esk3_0,esk9_0,esk8_0)), inference(etableau_closure_rule, [i_0_338, ...])). % 0.02/0.41 cnf(i_0_339, plain, (~inertia(esk3_0,esk10_0,esk8_0)), inference(etableau_closure_rule, [i_0_339, ...])). % 0.02/0.41 # End printing tableau % 0.02/0.41 # SZS output end % 0.02/0.41 # Branches closed with saturation will be marked with an "s" % 0.02/0.41 # Child (2918567) has found a proof. % 0.02/0.41 % 0.02/0.41 # Proof search is over... % 0.02/0.41 # Freeing feature tree %------------------------------------------------------------------------------