%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT063-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 : n026.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:52 AM UTC 2026 % Result : Unsatisfiable 9.03s 1.70s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT063-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.34 % Computer : n026.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 13:43:57 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.12/0.38 # and selection function SelectCQArNTNpEqFirst. % 0.12/0.38 # % 0.12/0.38 # Presaturation interreduction done % 0.12/0.38 # Number of axioms: 54 Number of unprocessed: 52 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 52 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 12 conjectures. % 0.12/0.38 # There are 12 start rule candidates: % 0.12/0.38 # Found 19 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 12 start rule tableaux created. % 0.12/0.38 # 33 extension rule candidate clauses % 0.12/0.38 # 19 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 9.03/1.70 # There were 1 total branch saturation attempts. % 9.03/1.70 # There were 0 of these attempts blocked. % 9.03/1.70 # There were 0 deferred branch saturation attempts. % 9.03/1.70 # There were 0 free duplicated saturations. % 9.03/1.70 # There were 1 total successful branch saturations. % 9.03/1.70 # There were 0 successful branch saturations in interreduction. % 9.03/1.70 # There were 0 successful branch saturations on the branch. % 9.03/1.70 # There were 1 successful branch saturations after the branch. % 9.03/1.70 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.03/1.70 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.03/1.70 # Begin clausification derivation % 9.03/1.70 % 9.03/1.70 # End clausification derivation % 9.03/1.70 # Begin listing active clauses obtained from FOF to CNF conversion % 9.03/1.70 cnf(i_0_105, negated_conjecture, (organization(sk3))). % 9.03/1.70 cnf(i_0_106, negated_conjecture, (robust_position(sk3))). % 9.03/1.70 cnf(i_0_108, negated_conjecture, (age(sk3,sk4)=zero)). % 9.03/1.70 cnf(i_0_111, negated_conjecture, (smaller(sigma,tau))). % 9.03/1.70 cnf(i_0_109, negated_conjecture, (greater(sigma,zero))). % 9.03/1.70 cnf(i_0_110, negated_conjecture, (greater(tau,zero))). % 9.03/1.70 cnf(i_0_101, plain, (greater(low,very_low))). % 9.03/1.70 cnf(i_0_112, negated_conjecture, (smaller_or_equal(age(sk3,sk5),sigma))). % 9.03/1.70 cnf(i_0_114, negated_conjecture, (smaller_or_equal(age(sk3,sk6),tau))). % 9.03/1.70 cnf(i_0_113, negated_conjecture, (greater(age(sk3,sk6),sigma))). % 9.03/1.70 cnf(i_0_115, negated_conjecture, (greater(age(sk3,sk7),tau))). % 9.03/1.70 cnf(i_0_100, plain, (greater(mod1,low))). % 9.03/1.70 cnf(i_0_103, plain, (greater(mod2,low))). % 9.03/1.70 cnf(i_0_61, plain, (smaller_or_equal(X1,X1))). % 9.03/1.70 cnf(i_0_104, plain, (greater(mod2,mod1))). % 9.03/1.70 cnf(i_0_99, plain, (greater(high,mod1))). % 9.03/1.70 cnf(i_0_102, plain, (greater(high,mod2))). % 9.03/1.70 cnf(i_0_64, plain, (greater_or_equal(X1,X1))). % 9.03/1.70 cnf(i_0_107, negated_conjecture, (~has_endowment(sk3))). % 9.03/1.70 cnf(i_0_70, plain, (organization(X1)|~has_endowment(X1))). % 9.03/1.70 cnf(i_0_67, plain, (~greater(X1,X2)|~greater(X2,X1))). % 9.03/1.70 cnf(i_0_78, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 9.03/1.70 cnf(i_0_60, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 9.03/1.70 cnf(i_0_65, plain, (greater(X1,X2)|~smaller(X2,X1))). % 9.03/1.70 cnf(i_0_116, negated_conjecture, (hazard_of_mortality(sk3,sk4)!=hazard_of_mortality(sk3,sk5)|~smaller(hazard_of_mortality(sk3,sk5),hazard_of_mortality(sk3,sk6))|~smaller(hazard_of_mortality(sk3,sk7),hazard_of_mortality(sk3,sk5)))). % 9.03/1.70 cnf(i_0_69, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 9.03/1.70 cnf(i_0_66, plain, (smaller(X1,X2)|~greater(X2,X1))). % 9.03/1.70 cnf(i_0_80, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 9.03/1.70 cnf(i_0_63, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 9.03/1.70 cnf(i_0_77, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))). % 9.03/1.70 cnf(i_0_72, plain, (~has_immunity(X1,X2)|~has_endowment(X1)|~greater(age(X1,X2),eta))). % 9.03/1.70 cnf(i_0_59, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 9.03/1.70 cnf(i_0_88, plain, (~positional_advantage(X1,X2)|~robust_position(X1)|~smaller_or_equal(age(X1,X2),tau))). % 9.03/1.70 cnf(i_0_94, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))). % 9.03/1.70 cnf(i_0_85, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 9.03/1.70 cnf(i_0_71, plain, (has_immunity(X1,X2)|~has_endowment(X1)|~smaller_or_equal(age(X1,X2),eta))). % 9.03/1.70 cnf(i_0_62, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 9.03/1.70 cnf(i_0_89, plain, (positional_advantage(X1,X2)|~robust_position(X1)|~greater(age(X1,X2),tau))). % 9.03/1.70 cnf(i_0_79, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 9.03/1.70 cnf(i_0_68, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 9.03/1.70 cnf(i_0_83, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 9.03/1.70 cnf(i_0_82, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 9.03/1.70 cnf(i_0_92, plain, (positional_advantage(X1,sk2(X1))|robust_position(X1)|greater(age(X1,sk2(X1)),tau))). % 9.03/1.70 cnf(i_0_87, plain, (greater(age(X1,X2),sigma)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 9.03/1.70 cnf(i_0_91, plain, (robust_position(X1)|smaller_or_equal(age(X1,sk2(X1)),tau)|~positional_advantage(X1,sk2(X1)))). % 9.03/1.70 cnf(i_0_90, plain, (robust_position(X1)|greater(age(X1,sk2(X1)),tau)|smaller_or_equal(age(X1,sk2(X1)),tau))). % 9.03/1.70 cnf(i_0_86, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),sigma))). % 9.03/1.70 cnf(i_0_98, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|has_immunity(X1,X2)|~organization(X1))). % 9.03/1.70 cnf(i_0_95, plain, (hazard_of_mortality(X1,X2)=low|has_immunity(X1,X2)|~positional_advantage(X1,X2)|~is_aligned(X1,X2)|~organization(X1))). % 9.03/1.70 cnf(i_0_96, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|has_immunity(X1,X2)|~positional_advantage(X1,X2)|~organization(X1))). % 9.03/1.70 cnf(i_0_97, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|has_immunity(X1,X2)|~is_aligned(X1,X2)|~organization(X1))). % 9.03/1.70 cnf(i_0_74, plain, (has_endowment(X1)|smaller_or_equal(age(X1,sk1(X1)),eta)|~organization(X1))). % 9.03/1.70 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 9.03/1.70 # Begin printing tableau % 9.03/1.70 # Found 4 steps % 9.03/1.70 cnf(i_0_113, negated_conjecture, (greater(age(sk3,sk6),sigma)), inference(start_rule)). % 9.03/1.70 cnf(i_0_124, plain, (greater(age(sk3,sk6),sigma)), inference(extension_rule, [i_0_67])). % 9.03/1.70 cnf(i_0_136, plain, (~greater(sigma,age(sk3,sk6))), inference(extension_rule, [i_0_65])). % 9.03/1.70 cnf(i_0_144, plain, (~smaller(age(sk3,sk6),sigma)), inference(etableau_closure_rule, [i_0_144, ...])). % 9.03/1.70 # End printing tableau % 9.03/1.70 # SZS output end % 9.03/1.70 # Branches closed with saturation will be marked with an "s" % 9.03/1.70 # Child (2614332) has found a proof. % 9.03/1.70 % 9.03/1.70 # Proof search is over... % 9.03/1.70 # Freeing feature tree %------------------------------------------------------------------------------