%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT055+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 : n029.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:51 AM UTC 2026 % Result : Theorem 40.53s 5.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT055+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.36 % Computer : n029.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 13:27:56 UTC 2026 % 0.10/0.36 % CPUTime : % 0.14/0.40 # No SInE strategy applied % 0.14/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m % 0.14/0.40 # and selection function SelectCQArNTNpEqFirst. % 0.14/0.40 # % 0.14/0.40 # Presaturation interreduction done % 0.14/0.40 # Number of axioms: 40 Number of unprocessed: 40 % 0.14/0.40 # Tableaux proof search. % 0.14/0.40 # APR header successfully linked. % 0.14/0.40 # Hello from C++ % 0.14/0.40 # The folding up rule is enabled... % 0.14/0.40 # Local unification is enabled... % 0.14/0.40 # Any saturation attempts will use folding labels... % 0.14/0.40 # 40 beginning clauses after preprocessing and clausification % 0.14/0.40 # Creating start rules for all 10 conjectures. % 0.14/0.40 # There are 10 start rule candidates: % 0.14/0.40 # Found 11 unit axioms. % 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.40 # 10 start rule tableaux created. % 0.14/0.40 # 29 extension rule candidate clauses % 0.14/0.40 # 11 unit axiom clauses % 0.14/0.40 % 0.14/0.40 # Requested 8, 32 cores available to the main process. % 40.53/5.57 # There were 1 total branch saturation attempts. % 40.53/5.57 # There were 0 of these attempts blocked. % 40.53/5.57 # There were 0 deferred branch saturation attempts. % 40.53/5.57 # There were 0 free duplicated saturations. % 40.53/5.57 # There were 1 total successful branch saturations. % 40.53/5.57 # There were 0 successful branch saturations in interreduction. % 40.53/5.57 # There were 0 successful branch saturations on the branch. % 40.53/5.57 # There were 1 successful branch saturations after the branch. % 40.53/5.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 40.53/5.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 40.53/5.57 # Begin clausification derivation % 40.53/5.57 % 40.53/5.57 # End clausification derivation % 40.53/5.57 # Begin listing active clauses obtained from FOF to CNF conversion % 40.53/5.57 cnf(i_0_39, negated_conjecture, (has_endowment(esk3_0))). % 40.53/5.57 cnf(i_0_40, negated_conjecture, (organization(esk3_0))). % 40.53/5.57 cnf(i_0_38, negated_conjecture, (age(esk3_0,esk4_0)=zero)). % 40.53/5.57 cnf(i_0_32, negated_conjecture, (greater(eta,zero))). % 40.53/5.57 cnf(i_0_33, negated_conjecture, (greater(sigma,eta))). % 40.53/5.57 cnf(i_0_37, negated_conjecture, (smaller_or_equal(age(esk3_0,esk5_0),eta))). % 40.53/5.57 cnf(i_0_35, negated_conjecture, (smaller_or_equal(age(esk3_0,esk6_0),sigma))). % 40.53/5.57 cnf(i_0_36, negated_conjecture, (greater(age(esk3_0,esk6_0),eta))). % 40.53/5.57 cnf(i_0_34, negated_conjecture, (greater(age(esk3_0,esk7_0),sigma))). % 40.53/5.57 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 40.53/5.57 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 40.53/5.57 cnf(i_0_18, plain, (organization(X1)|~has_endowment(X1))). % 40.53/5.57 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 40.53/5.57 cnf(i_0_25, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 40.53/5.57 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 40.53/5.57 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 40.53/5.57 cnf(i_0_31, negated_conjecture, (hazard_of_mortality(esk3_0,esk4_0)!=hazard_of_mortality(esk3_0,esk5_0)|~greater(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0))|~greater(hazard_of_mortality(esk3_0,esk7_0),hazard_of_mortality(esk3_0,esk6_0)))). % 40.53/5.57 cnf(i_0_24, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 40.53/5.57 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 40.53/5.57 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 40.53/5.57 cnf(i_0_26, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 40.53/5.57 cnf(i_0_16, plain, (~has_immunity(X1,X2)|~has_endowment(X1)|~greater(age(X1,X2),eta))). % 40.53/5.57 cnf(i_0_17, plain, (has_immunity(X1,X2)|~has_endowment(X1)|~smaller_or_equal(age(X1,X2),eta))). % 40.53/5.57 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 40.53/5.57 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 40.53/5.57 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 40.53/5.57 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 40.53/5.57 cnf(i_0_23, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 40.53/5.57 cnf(i_0_12, plain, (has_immunity(X1,esk2_1(X1))|has_endowment(X1)|~has_immunity(X1,esk1_1(X1))|~organization(X1))). % 40.53/5.57 cnf(i_0_21, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 40.53/5.57 cnf(i_0_22, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 40.53/5.57 cnf(i_0_13, plain, (has_endowment(X1)|greater(age(X1,esk2_1(X1)),eta)|~has_immunity(X1,esk1_1(X1))|~organization(X1))). % 40.53/5.57 cnf(i_0_28, plain, (greater(age(X1,X2),sigma)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 40.53/5.57 cnf(i_0_29, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),sigma))). % 40.53/5.57 cnf(i_0_15, plain, (has_endowment(X1)|greater(age(X1,esk2_1(X1)),eta)|smaller_or_equal(age(X1,esk1_1(X1)),eta)|~organization(X1))). % 40.53/5.57 cnf(i_0_14, plain, (has_immunity(X1,esk2_1(X1))|has_endowment(X1)|smaller_or_equal(age(X1,esk1_1(X1)),eta)|~organization(X1))). % 40.53/5.57 cnf(i_0_19, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|~has_immunity(X1,X3)|~has_immunity(X1,X2)|~organization(X1))). % 40.53/5.57 cnf(i_0_20, plain, (has_immunity(X1,X2)|greater(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~has_immunity(X1,X3)|~organization(X1))). % 40.53/5.57 cnf(i_0_27, plain, (is_aligned(X1,X2)|greater(capability(X1,X3),capability(X1,X2))|~is_aligned(X1,X3)|~organization(X1))). % 40.53/5.57 cnf(i_0_30, plain, (has_immunity(X1,X2)|greater(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~organization(X1)|~greater(capability(X1,X3),capability(X1,X2)))). % 40.53/5.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 40.53/5.57 # Begin printing tableau % 40.53/5.57 # Found 7 steps % 40.53/5.57 cnf(i_0_37, negated_conjecture, (smaller_or_equal(age(esk3_0,esk5_0),eta)), inference(start_rule)). % 40.53/5.57 cnf(i_0_49, plain, (smaller_or_equal(age(esk3_0,esk5_0),eta)), inference(extension_rule, [i_0_17])). % 40.53/5.57 cnf(i_0_79, plain, (~has_endowment(esk3_0)), inference(closure_rule, [i_0_39])). % 40.53/5.57 cnf(i_0_78, plain, (has_immunity(esk3_0,esk5_0)), inference(extension_rule, [i_0_19])). % 40.53/5.57 cnf(i_0_152, plain, (~has_immunity(esk3_0,esk5_0)), inference(closure_rule, [i_0_78])). % 40.53/5.57 cnf(i_0_153, plain, (~organization(esk3_0)), inference(closure_rule, [i_0_40])). % 40.53/5.57 cnf(i_0_150, plain, (hazard_of_mortality(esk3_0,esk5_0)=hazard_of_mortality(esk3_0,esk5_0)), inference(etableau_closure_rule, [i_0_150, ...])). % 40.53/5.57 # End printing tableau % 40.53/5.57 # SZS output end % 40.53/5.57 # Branches closed with saturation will be marked with an "s" % 40.53/5.59 # Child (2678805) has found a proof. % 40.53/5.59 % 40.53/5.59 # Proof search is over... % 40.53/5.59 # Freeing feature tree %------------------------------------------------------------------------------