%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT042+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 : n011.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:49 AM UTC 2026 % Result : Theorem 30.76s 4.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT042+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.08/0.35 % Computer : n011.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.36 % CPULimit : 300 % 0.08/0.36 % WCLimit : 300 % 0.08/0.36 % DateTime : Mon Sep 7 13:03:30 UTC 2026 % 0.08/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 40 Number of unprocessed: 29 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 29 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 8 conjectures. % 0.14/0.39 # There are 8 start rule candidates: % 0.14/0.39 # Found 9 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 8 start rule tableaux created. % 0.14/0.39 # 20 extension rule candidate clauses % 0.14/0.39 # 9 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 30.76/4.31 # There were 4 total branch saturation attempts. % 30.76/4.31 # There were 0 of these attempts blocked. % 30.76/4.31 # There were 0 deferred branch saturation attempts. % 30.76/4.31 # There were 0 free duplicated saturations. % 30.76/4.31 # There were 4 total successful branch saturations. % 30.76/4.31 # There were 0 successful branch saturations in interreduction. % 30.76/4.31 # There were 0 successful branch saturations on the branch. % 30.76/4.31 # There were 4 successful branch saturations after the branch. % 30.76/4.31 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 30.76/4.31 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 30.76/4.31 # Begin clausification derivation % 30.76/4.31 % 30.76/4.31 # End clausification derivation % 30.76/4.31 # Begin listing active clauses obtained from FOF to CNF conversion % 30.76/4.31 cnf(i_0_34, negated_conjecture, (organization(esk1_0))). % 30.76/4.31 cnf(i_0_26, negated_conjecture, (smaller_or_equal(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)))). % 30.76/4.31 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 30.76/4.31 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 30.76/4.31 cnf(i_0_31, negated_conjecture, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)))). % 30.76/4.31 cnf(i_0_21, negated_conjecture, (greater_or_equal(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0)))). % 30.76/4.31 cnf(i_0_33, negated_conjecture, (~has_immunity(esk1_0,esk2_0))). % 30.76/4.31 cnf(i_0_32, negated_conjecture, (~has_immunity(esk1_0,esk3_0))). % 30.76/4.31 cnf(i_0_16, negated_conjecture, (~smaller(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))). % 30.76/4.31 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 30.76/4.31 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 30.76/4.31 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 30.76/4.31 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 30.76/4.31 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 30.76/4.31 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 30.76/4.31 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 30.76/4.31 cnf(i_0_13, plain, (epred2_3(X1,X2,X3)|~organization(X3))). % 30.76/4.31 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 30.76/4.31 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 30.76/4.31 cnf(i_0_12, plain, (epred1_3(X1,X2,X3)|has_immunity(X3,X1)|has_immunity(X3,X2)|~organization(X3))). % 30.76/4.31 cnf(i_0_14, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))). % 30.76/4.31 cnf(i_0_15, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))). % 30.76/4.31 cnf(i_0_29, negated_conjecture, (greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)))). % 30.76/4.31 cnf(i_0_38, 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)|~epred2_3(X3,X2,X1))). % 30.76/4.31 cnf(i_0_35, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|capability(X1,X2)!=capability(X1,X3)|position(X1,X2)!=position(X1,X3)|~epred1_3(X3,X2,X1))). % 30.76/4.31 cnf(i_0_36, plain, (smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~epred1_3(X3,X2,X1)|~greater(position(X1,X2),position(X1,X3))|~greater_or_equal(capability(X1,X2),capability(X1,X3)))). % 30.76/4.31 cnf(i_0_37, plain, (smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~epred1_3(X3,X2,X1)|~greater(capability(X1,X2),capability(X1,X3))|~greater_or_equal(position(X1,X2),position(X1,X3)))). % 30.76/4.31 cnf(i_0_39, plain, (smaller(capability(X1,X2),capability(X1,X3))|~epred2_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)))). % 30.76/4.31 cnf(i_0_40, plain, (greater(capability(X1,X2),capability(X1,X3))|~epred2_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)))). % 30.76/4.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 30.76/4.31 # Begin printing tableau % 30.76/4.31 # Found 7 steps % 30.76/4.31 cnf(i_0_31, negated_conjecture, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(start_rule)). % 30.76/4.31 cnf(i_0_49, plain, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(extension_rule, [i_0_6])). % 30.76/4.31 cnf(i_0_65, plain, (stock_of_knowledge(esk1_0,esk3_0)=stock_of_knowledge(esk1_0,esk2_0)), inference(extension_rule, [i_0_38])). % 30.76/4.31 cnf(i_0_66, plain, (greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_66, ...])). % 30.76/4.31 cnf(i_0_99, plain, (capability(esk1_0,esk2_0)=capability(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_99, ...])). % 30.76/4.31 cnf(i_0_101, plain, (internal_friction(esk1_0,esk2_0)!=internal_friction(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_101, ...])). % 30.76/4.31 cnf(i_0_102, plain, (~epred2_3(esk2_0,esk3_0,esk1_0)), inference(etableau_closure_rule, [i_0_102, ...])). % 30.76/4.31 # End printing tableau % 30.76/4.31 # SZS output end % 30.76/4.31 # Branches closed with saturation will be marked with an "s" % 30.76/4.31 # Child (1699266) has found a proof. % 30.76/4.31 % 30.76/4.31 # Proof search is over... % 30.76/4.31 # Freeing feature tree %------------------------------------------------------------------------------