%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT047-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 : n015.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 1.00s 0.59s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT047-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.10/0.35 % Computer : n015.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Mon Sep 7 13:15:45 UTC 2026 % 0.10/0.35 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.14/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 37 Number of unprocessed: 37 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 37 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 7 conjectures. % 0.14/0.37 # There are 7 start rule candidates: % 0.14/0.37 # Found 8 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 7 start rule tableaux created. % 0.14/0.37 # 29 extension rule candidate clauses % 0.14/0.37 # 8 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 7 % 0.14/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 16 tableaux to operate on % 1.00/0.59 # Creating equality axioms % 1.00/0.59 # Ran out of tableaux, making start rules for all clauses % 1.00/0.59 # There were 1 total branch saturation attempts. % 1.00/0.59 # There were 0 of these attempts blocked. % 1.00/0.59 # There were 0 deferred branch saturation attempts. % 1.00/0.59 # There were 0 free duplicated saturations. % 1.00/0.59 # There were 1 total successful branch saturations. % 1.00/0.59 # There were 0 successful branch saturations in interreduction. % 1.00/0.59 # There were 0 successful branch saturations on the branch. % 1.00/0.59 # There were 1 successful branch saturations after the branch. % 1.00/0.59 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.00/0.59 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.00/0.59 # Begin clausification derivation % 1.00/0.59 % 1.00/0.59 # End clausification derivation % 1.00/0.59 # Begin listing active clauses obtained from FOF to CNF conversion % 1.00/0.59 cnf(i_0_71, negated_conjecture, (has_endowment(sk2))). % 1.00/0.59 cnf(i_0_70, negated_conjecture, (organization(sk2))). % 1.00/0.59 cnf(i_0_73, negated_conjecture, (smaller_or_equal(age(sk2,sk4),eta))). % 1.00/0.59 cnf(i_0_74, negated_conjecture, (greater(age(sk2,sk5),eta))). % 1.00/0.59 cnf(i_0_72, negated_conjecture, (smaller_or_equal(age(sk2,sk3),age(sk2,sk4)))). % 1.00/0.59 cnf(i_0_75, negated_conjecture, (greater(age(sk2,sk6),age(sk2,sk5)))). % 1.00/0.59 cnf(i_0_41, plain, (smaller_or_equal(X1,X1))). % 1.00/0.59 cnf(i_0_44, plain, (greater_or_equal(X1,X1))). % 1.00/0.59 cnf(i_0_50, plain, (organization(X1)|~has_endowment(X1))). % 1.00/0.59 cnf(i_0_47, plain, (~greater(X1,X2)|~greater(X2,X1))). % 1.00/0.59 cnf(i_0_40, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 1.00/0.59 cnf(i_0_45, plain, (greater(X1,X2)|~smaller(X2,X1))). % 1.00/0.59 cnf(i_0_76, negated_conjecture, (hazard_of_mortality(sk2,sk3)!=hazard_of_mortality(sk2,sk4)|~greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk6))|~greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk4)))). % 1.00/0.59 cnf(i_0_52, plain, (~has_immunity(X1,X2)|~has_endowment(X1)|~greater(age(X1,X2),eta))). % 1.00/0.59 cnf(i_0_49, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 1.00/0.59 cnf(i_0_46, plain, (smaller(X1,X2)|~greater(X2,X1))). % 1.00/0.59 cnf(i_0_43, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 1.00/0.59 cnf(i_0_42, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 1.00/0.59 cnf(i_0_51, plain, (has_immunity(X1,X2)|~has_endowment(X1)|~smaller_or_equal(age(X1,X2),eta))). % 1.00/0.59 cnf(i_0_39, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 1.00/0.59 cnf(i_0_69, plain, (internal_friction(X1,X2)=internal_friction(X1,X3)|~organization(X1))). % 1.00/0.59 cnf(i_0_48, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 1.00/0.59 cnf(i_0_55, plain, (has_endowment(X1)|greater(age(X1,sk1(X1)),eta)|~has_immunity(X1,sk1(X1))|~organization(X1))). % 1.00/0.59 cnf(i_0_53, plain, (has_endowment(X1)|greater(age(X1,sk1(X1)),eta)|smaller_or_equal(age(X1,sk1(X1)),eta)|~organization(X1))). % 1.00/0.59 cnf(i_0_54, plain, (has_immunity(X1,sk1(X1))|has_endowment(X1)|smaller_or_equal(age(X1,sk1(X1)),eta)|~organization(X1))). % 1.00/0.59 cnf(i_0_66, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))). % 1.00/0.59 cnf(i_0_58, plain, (has_immunity(X1,X2)|greater(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~has_immunity(X1,X3)|~organization(X1))). % 1.00/0.59 cnf(i_0_65, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))). % 1.00/0.59 cnf(i_0_57, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|~has_immunity(X1,X3)|~has_immunity(X1,X2)|~organization(X1))). % 1.00/0.59 cnf(i_0_67, plain, (greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 1.00/0.59 cnf(i_0_68, plain, (greater(external_ties(X1,X2),external_ties(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))). % 1.00/0.59 cnf(i_0_64, plain, (capability(X1,X2)=capability(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|~organization(X1))). % 1.00/0.59 cnf(i_0_62, 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)))). % 1.00/0.59 cnf(i_0_63, 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)))). % 1.00/0.59 cnf(i_0_61, 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))). % 1.00/0.59 cnf(i_0_60, 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)))). % 1.00/0.59 cnf(i_0_59, 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)))). % 1.00/0.59 cnf(i_0_595, plain, (X4=X4)). % 1.00/0.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.00/0.59 # Begin printing tableau % 1.00/0.59 # Found 7 steps % 1.00/0.59 cnf(i_0_595, plain, (external_ties(sk2,X9)=external_ties(sk2,X9)), inference(start_rule)). % 1.00/0.59 cnf(i_0_718, plain, (external_ties(sk2,X9)=external_ties(sk2,X9)), inference(extension_rule, [i_0_66])). % 1.00/0.59 cnf(i_0_762, plain, (~organization(sk2)), inference(closure_rule, [i_0_70])). % 1.00/0.59 cnf(i_0_760, plain, (position(sk2,X9)=position(sk2,X9)), inference(extension_rule, [i_0_599])). % 1.00/0.59 cnf(i_0_1639, plain, ($false), inference(closure_rule, [i_0_595])). % 1.00/0.59 cnf(i_0_1640, plain, (~smaller_or_equal(position(sk2,X9),position(sk2,X9))), inference(closure_rule, [i_0_41])). % 1.00/0.59 cnf(i_0_1637, plain, (smaller_or_equal(position(sk2,X9),position(sk2,X9))), inference(etableau_closure_rule, [i_0_1637, ...])). % 1.00/0.59 # End printing tableau % 1.00/0.59 # SZS output end % 1.00/0.59 # Branches closed with saturation will be marked with an "s" % 1.00/0.60 # Child (1255936) has found a proof. % 1.00/0.60 % 1.00/0.60 # Proof search is over... % 1.00/0.60 # Freeing feature tree %------------------------------------------------------------------------------