%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT061-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:52 AM UTC 2026 % Result : Unsatisfiable 0.12s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT061-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 : n015.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.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 13:38:45 UTC 2026 % 0.12/0.36 % CPUTime : % 0.12/0.39 # No SInE strategy applied % 0.12/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.12/0.39 # and selection function SelectCQArNTNpEqFirst. % 0.12/0.39 # % 0.12/0.39 # Presaturation interreduction done % 0.12/0.39 # Number of axioms: 43 Number of unprocessed: 43 % 0.12/0.39 # Tableaux proof search. % 0.12/0.39 # APR header successfully linked. % 0.12/0.39 # Hello from C++ % 0.12/0.39 # The folding up rule is enabled... % 0.12/0.39 # Local unification is enabled... % 0.12/0.39 # Any saturation attempts will use folding labels... % 0.12/0.39 # 43 beginning clauses after preprocessing and clausification % 0.12/0.39 # Creating start rules for all 8 conjectures. % 0.12/0.39 # There are 8 start rule candidates: % 0.12/0.39 # Found 14 unit axioms. % 0.12/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.39 # 8 start rule tableaux created. % 0.12/0.39 # 29 extension rule candidate clauses % 0.12/0.39 # 14 unit axiom clauses % 0.12/0.39 % 0.12/0.39 # Requested 8, 32 cores available to the main process. % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 1 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 1 successful branch saturations after the branch. % 0.12/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_85, negated_conjecture, (organization(sk2))). % 0.12/0.40 cnf(i_0_86, negated_conjecture, (fragile_position(sk2))). % 0.12/0.40 cnf(i_0_88, negated_conjecture, (age(sk2,sk3)=zero)). % 0.12/0.40 cnf(i_0_89, negated_conjecture, (greater(sigma,zero))). % 0.12/0.40 cnf(i_0_82, plain, (greater(low,very_low))). % 0.12/0.40 cnf(i_0_81, plain, (greater(mod1,low))). % 0.12/0.40 cnf(i_0_84, plain, (greater(mod2,low))). % 0.12/0.40 cnf(i_0_90, negated_conjecture, (smaller_or_equal(age(sk2,sk4),sigma))). % 0.12/0.40 cnf(i_0_91, negated_conjecture, (greater(age(sk2,sk5),sigma))). % 0.12/0.40 cnf(i_0_80, plain, (greater(high,mod1))). % 0.12/0.40 cnf(i_0_83, plain, (greater(high,mod2))). % 0.12/0.40 cnf(i_0_49, plain, (smaller_or_equal(X1,X1))). % 0.12/0.40 cnf(i_0_52, plain, (greater_or_equal(X1,X1))). % 0.12/0.40 cnf(i_0_87, negated_conjecture, (~has_endowment(sk2))). % 0.12/0.40 cnf(i_0_55, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.12/0.40 cnf(i_0_59, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 0.12/0.40 cnf(i_0_48, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.12/0.40 cnf(i_0_53, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.12/0.40 cnf(i_0_92, negated_conjecture, (hazard_of_mortality(sk2,sk3)!=hazard_of_mortality(sk2,sk4)|~greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)))). % 0.12/0.40 cnf(i_0_61, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 0.12/0.40 cnf(i_0_54, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.12/0.40 cnf(i_0_58, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))). % 0.12/0.40 cnf(i_0_70, plain, (~positional_advantage(X1,X2)|~fragile_position(X1)|~greater(age(X1,X2),sigma))). % 0.12/0.40 cnf(i_0_51, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.12/0.40 cnf(i_0_69, plain, (positional_advantage(X1,X2)|~fragile_position(X1)|~smaller_or_equal(age(X1,X2),sigma))). % 0.12/0.40 cnf(i_0_57, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.12/0.40 cnf(i_0_66, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 0.12/0.40 cnf(i_0_50, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.40 cnf(i_0_75, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))). % 0.12/0.40 cnf(i_0_47, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.12/0.40 cnf(i_0_60, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 0.12/0.40 cnf(i_0_56, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.40 cnf(i_0_73, plain, (fragile_position(X1)|greater(age(X1,sk1(X1)),sigma)|~positional_advantage(X1,sk1(X1)))). % 0.12/0.40 cnf(i_0_68, plain, (greater(age(X1,X2),sigma)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 0.12/0.40 cnf(i_0_71, plain, (fragile_position(X1)|greater(age(X1,sk1(X1)),sigma)|smaller_or_equal(age(X1,sk1(X1)),sigma))). % 0.12/0.40 cnf(i_0_67, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),sigma))). % 0.12/0.40 cnf(i_0_79, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|has_immunity(X1,X2)|~organization(X1))). % 0.12/0.40 cnf(i_0_72, plain, (positional_advantage(X1,sk1(X1))|fragile_position(X1)|smaller_or_equal(age(X1,sk1(X1)),sigma))). % 0.12/0.40 cnf(i_0_64, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 0.12/0.40 cnf(i_0_63, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 0.12/0.40 cnf(i_0_76, plain, (hazard_of_mortality(X1,X2)=low|has_immunity(X1,X2)|~positional_advantage(X1,X2)|~is_aligned(X1,X2)|~organization(X1))). % 0.12/0.40 cnf(i_0_77, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|has_immunity(X1,X2)|~positional_advantage(X1,X2)|~organization(X1))). % 0.12/0.40 cnf(i_0_78, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|has_immunity(X1,X2)|~is_aligned(X1,X2)|~organization(X1))). % 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 6 steps % 0.12/0.40 cnf(i_0_88, negated_conjecture, (age(sk2,sk3)=zero), inference(start_rule)). % 0.12/0.40 cnf(i_0_101, plain, (age(sk2,sk3)=zero), inference(extension_rule, [i_0_66])). % 0.12/0.40 cnf(i_0_133, plain, (~organization(sk2)), inference(closure_rule, [i_0_85])). % 0.12/0.40 cnf(i_0_131, plain, (is_aligned(sk2,sk3)), inference(extension_rule, [i_0_61])). % 0.12/0.40 cnf(i_0_143, plain, (~is_aligned(sk2,sk3)), inference(closure_rule, [i_0_131])). % 0.12/0.40 cnf(i_0_144, plain, (~dissimilar(sk2,sk3,sk3)), inference(etableau_closure_rule, [i_0_144, ...])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.40 # Child (1287762) has found a proof. % 0.12/0.40 % 0.12/0.40 # Proof search is over... % 0.12/0.40 # Freeing feature tree %------------------------------------------------------------------------------