%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT044+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 : n013.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:50 AM UTC 2026 % Result : Theorem 0.12s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT044+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.07/0.34 % Computer : n013.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 13:06:35 UTC 2026 % 0.07/0.34 % CPUTime : % 0.07/0.37 # No SInE strategy applied % 0.07/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.07/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.07/0.37 # % 0.07/0.37 # Presaturation interreduction done % 0.07/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 0.07/0.37 # Tableaux proof search. % 0.07/0.37 # APR header successfully linked. % 0.07/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 20 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 5 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 15 extension rule candidate clauses % 0.12/0.37 # 5 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 13 tableaux to operate on % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_17, negated_conjecture, (organization(esk1_0))). % 0.12/0.38 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))). % 0.12/0.38 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.12/0.38 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.12/0.38 cnf(i_0_15, negated_conjecture, (~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)))). % 0.12/0.38 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.12/0.38 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.12/0.38 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.12/0.38 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.12/0.38 cnf(i_0_12, plain, (epred1_3(X1,X2,X3)|~organization(X3))). % 0.12/0.38 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.12/0.38 cnf(i_0_14, plain, (internal_friction(X1,X2)=internal_friction(X1,X3)|~organization(X1))). % 0.12/0.38 cnf(i_0_13, plain, (greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.12/0.38 cnf(i_0_18, plain, (capability(X1,X2)=capability(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~epred1_3(X3,X2,X1))). % 0.12/0.38 cnf(i_0_19, plain, (smaller(capability(X1,X2),capability(X1,X3))|~epred1_3(X3,X2,X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.12/0.38 cnf(i_0_20, plain, (greater(capability(X1,X2),capability(X1,X3))|~epred1_3(X3,X2,X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 5 steps % 0.12/0.38 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(start_rule)). % 0.12/0.38 cnf(i_0_24, plain, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_94, plain, (~organization(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_93, plain, (greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(extension_rule, [i_0_9])). % 0.12/0.38 cnf(i_0_109, plain, (~greater(stock_of_knowledge(esk1_0,esk2_0),stock_of_knowledge(esk1_0,esk3_0))), inference(etableau_closure_rule, [i_0_109, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_17, negated_conjecture, (organization(esk1_0))). % 0.12/0.38 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))). % 0.12/0.38 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.12/0.38 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.12/0.38 cnf(i_0_15, negated_conjecture, (~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)))). % 0.12/0.38 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.12/0.38 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.12/0.38 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.12/0.38 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.12/0.38 cnf(i_0_12, plain, (epred1_3(X1,X2,X3)|~organization(X3))). % 0.12/0.38 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.12/0.38 cnf(i_0_14, plain, (internal_friction(X1,X2)=internal_friction(X1,X3)|~organization(X1))). % 0.12/0.38 cnf(i_0_13, plain, (greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.12/0.38 cnf(i_0_18, plain, (capability(X1,X2)=capability(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~epred1_3(X3,X2,X1))). % 0.12/0.38 cnf(i_0_19, plain, (smaller(capability(X1,X2),capability(X1,X3))|~epred1_3(X3,X2,X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.12/0.38 cnf(i_0_20, plain, (greater(capability(X1,X2),capability(X1,X3))|~epred1_3(X3,X2,X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(start_rule)). % 0.12/0.38 cnf(i_0_24, plain, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(extension_rule, [i_0_10])). % 0.12/0.38 cnf(i_0_82, plain, (greater(age(esk1_0,esk3_0),age(esk1_0,esk3_0))), inference(extension_rule, [i_0_9])). % 0.12/0.38 cnf(i_0_109, plain, (~greater(age(esk1_0,esk3_0),age(esk1_0,esk3_0))), inference(closure_rule, [i_0_82])). % 0.12/0.38 cnf(i_0_83, plain, (~greater(age(esk1_0,esk2_0),age(esk1_0,esk3_0))), inference(extension_rule, [i_0_8])). % 0.12/0.38 cnf(i_0_111, plain, (~smaller(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_111, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_17, negated_conjecture, (organization(esk1_0))). % 0.12/0.38 cnf(i_0_16, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))). % 0.12/0.38 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.12/0.38 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.12/0.38 cnf(i_0_15, negated_conjecture, (~greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)))). % 0.12/0.38 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.12/0.38 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.12/0.38 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.12/0.38 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.12/0.38 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.12/0.38 cnf(i_0_12, plain, (epred1_3(X1,X2,X3)|~organization(X3))). % 0.12/0.38 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.38 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.12/0.38 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.12/0.38 cnf(i_0_14, plain, (internal_friction(X1,X2)=internal_friction(X1,X3)|~organization(X1))). % 0.12/0.38 cnf(i_0_13, plain, (greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 0.12/0.38 cnf(i_0_18, plain, (capability(X1,X2)=capability(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~epred1_3(X3,X2,X1))). % 0.12/0.38 cnf(i_0_19, plain, (smaller(capability(X1,X2),capability(X1,X3))|~epred1_3(X3,X2,X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 0.12/0.38 cnf(i_0_20, plain, (greater(capability(X1,X2),capability(X1,X3))|~epred1_3(X3,X2,X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_17, negated_conjecture, (organization(esk1_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_25, plain, (organization(esk1_0)), inference(extension_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_118, plain, (epred1_3(esk2_0,esk3_0,esk1_0)), inference(extension_rule, [i_0_20])). % 0.12/0.38 cnf(i_0_434, plain, (greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))), inference(closure_rule, [i_0_15])). % 0.12/0.38 cnf(i_0_436, plain, (~greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_436, ...])). % 0.12/0.38 cnf(i_0_437, plain, (~smaller_or_equal(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_437, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (1824284) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------