%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT043+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:50 AM UTC 2026 % Result : Theorem 0.13s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT043+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.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:05:00 UTC 2026 % 0.08/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 28 Number of unprocessed: 28 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 28 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 7 conjectures. % 0.13/0.39 # There are 7 start rule candidates: % 0.13/0.39 # Found 9 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 7 start rule tableaux created. % 0.13/0.39 # 19 extension rule candidate clauses % 0.13/0.39 # 9 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 7 % 0.13/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 12 tableaux to operate on % 0.13/0.41 # There were 1 total branch saturation attempts. % 0.13/0.41 # There were 0 of these attempts blocked. % 0.13/0.41 # There were 0 deferred branch saturation attempts. % 0.13/0.41 # There were 0 free duplicated saturations. % 0.13/0.41 # There were 1 total successful branch saturations. % 0.13/0.41 # There were 0 successful branch saturations in interreduction. % 0.13/0.41 # There were 0 successful branch saturations on the branch. % 0.13/0.41 # There were 1 successful branch saturations after the branch. % 0.13/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # Begin clausification derivation % 0.13/0.41 % 0.13/0.41 # End clausification derivation % 0.13/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.41 cnf(i_0_22, negated_conjecture, (organization(esk1_0))). % 0.13/0.41 cnf(i_0_19, negated_conjecture, (stock_of_knowledge(esk1_0,esk2_0)=stock_of_knowledge(esk1_0,esk3_0))). % 0.13/0.41 cnf(i_0_17, negated_conjecture, (external_ties(esk1_0,esk2_0)=external_ties(esk1_0,esk3_0))). % 0.13/0.41 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.13/0.41 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.13/0.41 cnf(i_0_18, negated_conjecture, (greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)))). % 0.13/0.41 cnf(i_0_21, negated_conjecture, (~has_immunity(esk1_0,esk2_0))). % 0.13/0.41 cnf(i_0_20, negated_conjecture, (~has_immunity(esk1_0,esk3_0))). % 0.13/0.41 cnf(i_0_16, negated_conjecture, (~greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))). % 0.13/0.41 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.13/0.41 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.13/0.41 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.13/0.41 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.13/0.41 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.13/0.41 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.13/0.41 cnf(i_0_13, plain, (epred2_3(X1,X2,X3)|~organization(X3))). % 0.13/0.41 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.13/0.41 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.13/0.41 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.13/0.41 cnf(i_0_12, plain, (epred1_3(X1,X2,X3)|has_immunity(X3,X1)|has_immunity(X3,X2)|~organization(X3))). % 0.13/0.41 cnf(i_0_14, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))). % 0.13/0.41 cnf(i_0_15, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))). % 0.13/0.41 cnf(i_0_26, 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))). % 0.13/0.41 cnf(i_0_23, 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))). % 0.13/0.41 cnf(i_0_28, 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)))). % 0.13/0.41 cnf(i_0_27, 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)))). % 0.13/0.41 cnf(i_0_24, 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)))). % 0.13/0.41 cnf(i_0_25, 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)))). % 0.13/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.41 # Begin printing tableau % 0.13/0.41 # Found 4 steps % 0.13/0.41 cnf(i_0_18, negated_conjecture, (greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))), inference(start_rule)). % 0.13/0.41 cnf(i_0_34, plain, (greater(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))), inference(extension_rule, [i_0_9])). % 0.13/0.41 cnf(i_0_213, plain, (~greater(internal_friction(esk1_0,esk2_0),internal_friction(esk1_0,esk3_0))), inference(extension_rule, [i_0_8])). % 0.13/0.41 cnf(i_0_215, plain, (~smaller(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_215, ...])). % 0.13/0.41 # End printing tableau % 0.13/0.41 # SZS output end % 0.13/0.41 # Branches closed with saturation will be marked with an "s" % 0.13/0.41 # Child (1703420) has found a proof. % 0.13/0.41 % 0.13/0.41 # Proof search is over... % 0.13/0.41 # Freeing feature tree %------------------------------------------------------------------------------