%------------------------------------------------------------------------------ % 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 : n004.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 : Unsatisfiable 8.06s 1.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % 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.09/0.36 % Computer : n004.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 13:04:15 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.38 # No SInE strategy applied % 0.09/0.38 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.38 # % 0.09/0.38 # Presaturation interreduction done % 0.09/0.38 # Number of axioms: 38 Number of unprocessed: 27 % 0.09/0.38 # Tableaux proof search. % 0.09/0.38 # APR header successfully linked. % 0.09/0.38 # Hello from C++ % 0.09/0.38 # The folding up rule is enabled... % 0.09/0.38 # Local unification is enabled... % 0.09/0.38 # Any saturation attempts will use folding labels... % 0.09/0.38 # 27 beginning clauses after preprocessing and clausification % 0.09/0.38 # Creating start rules for all 8 conjectures. % 0.09/0.38 # There are 8 start rule candidates: % 0.09/0.38 # Found 9 unit axioms. % 0.09/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.38 # 8 start rule tableaux created. % 0.09/0.38 # 18 extension rule candidate clauses % 0.09/0.38 # 9 unit axiom clauses % 0.09/0.38 % 0.09/0.38 # Requested 8, 32 cores available to the main process. % 8.06/1.41 # There were 1 total branch saturation attempts. % 8.06/1.41 # There were 0 of these attempts blocked. % 8.06/1.41 # There were 0 deferred branch saturation attempts. % 8.06/1.41 # There were 0 free duplicated saturations. % 8.06/1.41 # There were 1 total successful branch saturations. % 8.06/1.41 # There were 0 successful branch saturations in interreduction. % 8.06/1.41 # There were 0 successful branch saturations on the branch. % 8.06/1.41 # There were 1 successful branch saturations after the branch. % 8.06/1.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.06/1.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.06/1.41 # Begin clausification derivation % 8.06/1.41 % 8.06/1.41 # End clausification derivation % 8.06/1.41 # Begin listing active clauses obtained from FOF to CNF conversion % 8.06/1.41 cnf(i_0_58, negated_conjecture, (organization(sk1))). % 8.06/1.41 cnf(i_0_66, negated_conjecture, (smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)))). % 8.06/1.41 cnf(i_0_41, plain, (smaller_or_equal(X1,X1))). % 8.06/1.41 cnf(i_0_44, plain, (greater_or_equal(X1,X1))). % 8.06/1.41 cnf(i_0_61, negated_conjecture, (greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)))). % 8.06/1.41 cnf(i_0_69, negated_conjecture, (greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2)))). % 8.06/1.41 cnf(i_0_59, negated_conjecture, (~has_immunity(sk1,sk2))). % 8.06/1.41 cnf(i_0_60, negated_conjecture, (~has_immunity(sk1,sk3))). % 8.06/1.41 cnf(i_0_76, negated_conjecture, (~smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)))). % 8.06/1.41 cnf(i_0_47, plain, (~greater(X1,X2)|~greater(X2,X1))). % 8.06/1.41 cnf(i_0_45, plain, (greater(X1,X2)|~smaller(X2,X1))). % 8.06/1.41 cnf(i_0_40, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 8.06/1.41 cnf(i_0_46, plain, (smaller(X1,X2)|~greater(X2,X1))). % 8.06/1.41 cnf(i_0_43, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 8.06/1.41 cnf(i_0_39, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 8.06/1.41 cnf(i_0_42, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 8.06/1.41 cnf(i_0_49, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 8.06/1.41 cnf(i_0_48, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 8.06/1.41 cnf(i_0_56, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))). % 8.06/1.41 cnf(i_0_57, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))). % 8.06/1.41 cnf(i_0_55, 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)|~organization(X1))). % 8.06/1.41 cnf(i_0_63, negated_conjecture, (greater(external_ties(sk1,sk3),external_ties(sk1,sk2))|greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)))). % 8.06/1.41 cnf(i_0_54, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))). % 8.06/1.41 cnf(i_0_53, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))). % 8.06/1.41 cnf(i_0_51, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~organization(X1)|~greater(position(X1,X3),position(X1,X2))|~greater_or_equal(capability(X1,X3),capability(X1,X2)))). % 8.06/1.41 cnf(i_0_50, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~organization(X1)|~greater(capability(X1,X3),capability(X1,X2))|~greater_or_equal(position(X1,X3),position(X1,X2)))). % 8.06/1.41 cnf(i_0_52, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|has_immunity(X1,X2)|has_immunity(X1,X3)|capability(X1,X2)!=capability(X1,X3)|position(X1,X2)!=position(X1,X3)|~organization(X1))). % 8.06/1.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 8.06/1.41 # Begin printing tableau % 8.06/1.41 # Found 6 steps % 8.06/1.41 cnf(i_0_58, negated_conjecture, (organization(sk1)), inference(start_rule)). % 8.06/1.41 cnf(i_0_87, plain, (organization(sk1)), inference(extension_rule, [i_0_56])). % 8.06/1.41 cnf(i_0_110, plain, (greater(position(sk1,X6),position(sk1,X6))), inference(extension_rule, [i_0_47])). % 8.06/1.41 cnf(i_0_114, plain, (~greater(position(sk1,X6),position(sk1,X6))), inference(closure_rule, [i_0_110])). % 8.06/1.41 cnf(i_0_112, plain, (~greater(external_ties(sk1,X6),external_ties(sk1,X6))), inference(extension_rule, [i_0_45])). % 8.06/1.41 cnf(i_0_116, plain, (~smaller(external_ties(sk1,X6),external_ties(sk1,X6))), inference(etableau_closure_rule, [i_0_116, ...])). % 8.06/1.41 # End printing tableau % 8.06/1.41 # SZS output end % 8.06/1.41 # Branches closed with saturation will be marked with an "s" % 8.06/1.41 # Child (3436195) has found a proof. % 8.06/1.41 % 8.06/1.41 # Proof search is over... % 8.06/1.41 # Freeing feature tree %------------------------------------------------------------------------------