%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT062+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 : n019.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 : Theorem 0.14s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT062+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % 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 : n019.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:37:37 UTC 2026 % 0.10/0.36 % 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: 43 Number of unprocessed: 42 % 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 # 42 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 9 conjectures. % 0.14/0.37 # There are 9 start rule candidates: % 0.14/0.37 # Found 11 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 9 start rule tableaux created. % 0.14/0.37 # 31 extension rule candidate clauses % 0.14/0.37 # 11 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_33, negated_conjecture, (sigma=tau)). % 0.14/0.38 cnf(i_0_39, negated_conjecture, (organization(esk3_0))). % 0.14/0.38 cnf(i_0_38, negated_conjecture, (robust_position(esk3_0))). % 0.14/0.38 cnf(i_0_36, negated_conjecture, (age(esk3_0,esk4_0)=zero)). % 0.14/0.38 cnf(i_0_35, negated_conjecture, (greater(tau,zero))). % 0.14/0.38 cnf(i_0_29, plain, (greater(mod2,mod1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (smaller_or_equal(age(esk3_0,esk5_0),tau))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (greater(age(esk3_0,esk6_0),tau))). % 0.14/0.39 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~has_endowment(esk3_0))). % 0.14/0.39 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_17, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.14/0.39 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (hazard_of_mortality(esk3_0,esk4_0)!=hazard_of_mortality(esk3_0,esk5_0)|~smaller(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)))). % 0.14/0.39 cnf(i_0_16, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.14/0.39 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.14/0.39 cnf(i_0_26, plain, (~positional_advantage(X1,X2)|~robust_position(X1)|~smaller_or_equal(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_12, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_28, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_27, plain, (epred1_2(X1,X2)|has_immunity(X2,X1)|~organization(X2))). % 0.14/0.39 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_18, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 0.14/0.39 cnf(i_0_25, plain, (positional_advantage(X1,X2)|~robust_position(X1)|~greater(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_15, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.14/0.39 cnf(i_0_21, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_19, plain, (greater(age(X1,X2),tau)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_23, plain, (robust_position(X1)|smaller_or_equal(age(X1,esk1_1(X1)),tau)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_24, plain, (robust_position(X1)|greater(age(X1,esk2_1(X1)),tau)|smaller_or_equal(age(X1,esk1_1(X1)),tau))). % 0.14/0.39 cnf(i_0_20, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),tau))). % 0.14/0.39 cnf(i_0_40, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X2,X1))). % 0.14/0.39 cnf(i_0_22, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|greater(age(X1,esk2_1(X1)),tau))). % 0.14/0.39 cnf(i_0_43, plain, (hazard_of_mortality(X1,X2)=low|~epred1_2(X2,X1)|~positional_advantage(X1,X2)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_42, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|~epred1_2(X2,X1)|~positional_advantage(X1,X2))). % 0.14/0.39 cnf(i_0_41, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|~epred1_2(X2,X1)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 cnf(i_0_14, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 4 steps % 0.14/0.39 cnf(i_0_31, negated_conjecture, (greater(age(esk3_0,esk6_0),tau)), inference(start_rule)). % 0.14/0.39 cnf(i_0_49, plain, (greater(age(esk3_0,esk6_0),tau)), inference(extension_rule, [i_0_9])). % 0.14/0.39 cnf(i_0_57, plain, (~greater(tau,age(esk3_0,esk6_0))), inference(extension_rule, [i_0_8])). % 0.14/0.39 cnf(i_0_63, plain, (~smaller(age(esk3_0,esk6_0),tau)), inference(etableau_closure_rule, [i_0_63, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_33, negated_conjecture, (sigma=tau)). % 0.14/0.39 cnf(i_0_39, negated_conjecture, (organization(esk3_0))). % 0.14/0.39 cnf(i_0_38, negated_conjecture, (robust_position(esk3_0))). % 0.14/0.39 cnf(i_0_36, negated_conjecture, (age(esk3_0,esk4_0)=zero)). % 0.14/0.39 cnf(i_0_35, negated_conjecture, (greater(tau,zero))). % 0.14/0.39 cnf(i_0_29, plain, (greater(mod2,mod1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (smaller_or_equal(age(esk3_0,esk5_0),tau))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (greater(age(esk3_0,esk6_0),tau))). % 0.14/0.39 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~has_endowment(esk3_0))). % 0.14/0.39 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_17, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.14/0.39 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (hazard_of_mortality(esk3_0,esk4_0)!=hazard_of_mortality(esk3_0,esk5_0)|~smaller(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)))). % 0.14/0.39 cnf(i_0_16, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.14/0.39 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.14/0.39 cnf(i_0_26, plain, (~positional_advantage(X1,X2)|~robust_position(X1)|~smaller_or_equal(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_12, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_28, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_27, plain, (epred1_2(X1,X2)|has_immunity(X2,X1)|~organization(X2))). % 0.14/0.39 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_18, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 0.14/0.39 cnf(i_0_25, plain, (positional_advantage(X1,X2)|~robust_position(X1)|~greater(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_15, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.14/0.39 cnf(i_0_21, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_19, plain, (greater(age(X1,X2),tau)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_23, plain, (robust_position(X1)|smaller_or_equal(age(X1,esk1_1(X1)),tau)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_24, plain, (robust_position(X1)|greater(age(X1,esk2_1(X1)),tau)|smaller_or_equal(age(X1,esk1_1(X1)),tau))). % 0.14/0.39 cnf(i_0_20, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),tau))). % 0.14/0.39 cnf(i_0_40, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X2,X1))). % 0.14/0.39 cnf(i_0_22, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|greater(age(X1,esk2_1(X1)),tau))). % 0.14/0.39 cnf(i_0_43, plain, (hazard_of_mortality(X1,X2)=low|~epred1_2(X2,X1)|~positional_advantage(X1,X2)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_42, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|~epred1_2(X2,X1)|~positional_advantage(X1,X2))). % 0.14/0.39 cnf(i_0_41, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|~epred1_2(X2,X1)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 cnf(i_0_14, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 4 steps % 0.14/0.39 cnf(i_0_35, negated_conjecture, (greater(tau,zero)), inference(start_rule)). % 0.14/0.39 cnf(i_0_51, plain, (greater(tau,zero)), inference(extension_rule, [i_0_9])). % 0.14/0.39 cnf(i_0_57, plain, (~greater(zero,tau)), inference(extension_rule, [i_0_8])). % 0.14/0.39 cnf(i_0_63, plain, (~smaller(tau,zero)), inference(etableau_closure_rule, [i_0_63, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_33, negated_conjecture, (sigma=tau)). % 0.14/0.39 cnf(i_0_39, negated_conjecture, (organization(esk3_0))). % 0.14/0.39 cnf(i_0_38, negated_conjecture, (robust_position(esk3_0))). % 0.14/0.39 cnf(i_0_36, negated_conjecture, (age(esk3_0,esk4_0)=zero)). % 0.14/0.39 cnf(i_0_35, negated_conjecture, (greater(tau,zero))). % 0.14/0.39 cnf(i_0_29, plain, (greater(mod2,mod1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (smaller_or_equal(age(esk3_0,esk5_0),tau))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (greater(age(esk3_0,esk6_0),tau))). % 0.14/0.39 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~has_endowment(esk3_0))). % 0.14/0.39 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_17, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.14/0.39 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (hazard_of_mortality(esk3_0,esk4_0)!=hazard_of_mortality(esk3_0,esk5_0)|~smaller(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)))). % 0.14/0.39 cnf(i_0_16, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.14/0.39 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.14/0.39 cnf(i_0_26, plain, (~positional_advantage(X1,X2)|~robust_position(X1)|~smaller_or_equal(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_12, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_28, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_27, plain, (epred1_2(X1,X2)|has_immunity(X2,X1)|~organization(X2))). % 0.14/0.39 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_18, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 0.14/0.39 cnf(i_0_25, plain, (positional_advantage(X1,X2)|~robust_position(X1)|~greater(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_15, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.14/0.39 cnf(i_0_21, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_19, plain, (greater(age(X1,X2),tau)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_23, plain, (robust_position(X1)|smaller_or_equal(age(X1,esk1_1(X1)),tau)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_24, plain, (robust_position(X1)|greater(age(X1,esk2_1(X1)),tau)|smaller_or_equal(age(X1,esk1_1(X1)),tau))). % 0.14/0.39 cnf(i_0_20, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),tau))). % 0.14/0.39 cnf(i_0_40, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X2,X1))). % 0.14/0.39 cnf(i_0_22, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|greater(age(X1,esk2_1(X1)),tau))). % 0.14/0.39 cnf(i_0_43, plain, (hazard_of_mortality(X1,X2)=low|~epred1_2(X2,X1)|~positional_advantage(X1,X2)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_42, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|~epred1_2(X2,X1)|~positional_advantage(X1,X2))). % 0.14/0.39 cnf(i_0_41, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|~epred1_2(X2,X1)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 cnf(i_0_14, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 6 steps % 0.14/0.39 cnf(i_0_36, negated_conjecture, (age(esk3_0,esk4_0)=zero), inference(start_rule)). % 0.14/0.39 cnf(i_0_52, plain, (age(esk3_0,esk4_0)=zero), inference(extension_rule, [i_0_18])). % 0.14/0.39 cnf(i_0_94, plain, (~organization(esk3_0)), inference(closure_rule, [i_0_39])). % 0.14/0.39 cnf(i_0_92, plain, (is_aligned(esk3_0,esk4_0)), inference(extension_rule, [i_0_16])). % 0.14/0.39 cnf(i_0_104, plain, (~is_aligned(esk3_0,esk4_0)), inference(closure_rule, [i_0_92])). % 0.14/0.39 cnf(i_0_105, plain, (~dissimilar(esk3_0,esk4_0,esk4_0)), inference(etableau_closure_rule, [i_0_105, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Creating equality axioms % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # There were 3 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 3 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 3 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_33, negated_conjecture, (sigma=tau)). % 0.14/0.39 cnf(i_0_39, negated_conjecture, (organization(esk3_0))). % 0.14/0.39 cnf(i_0_38, negated_conjecture, (robust_position(esk3_0))). % 0.14/0.39 cnf(i_0_36, negated_conjecture, (age(esk3_0,esk4_0)=zero)). % 0.14/0.39 cnf(i_0_35, negated_conjecture, (greater(tau,zero))). % 0.14/0.39 cnf(i_0_29, plain, (greater(mod2,mod1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (smaller_or_equal(age(esk3_0,esk5_0),tau))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (greater(age(esk3_0,esk6_0),tau))). % 0.14/0.39 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_4, plain, (greater_or_equal(X1,X1))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~has_endowment(esk3_0))). % 0.14/0.39 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_17, plain, (organization(X1)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))). % 0.14/0.39 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (hazard_of_mortality(esk3_0,esk4_0)!=hazard_of_mortality(esk3_0,esk5_0)|~smaller(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)))). % 0.14/0.39 cnf(i_0_16, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))). % 0.14/0.39 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.14/0.39 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))). % 0.14/0.39 cnf(i_0_26, plain, (~positional_advantage(X1,X2)|~robust_position(X1)|~smaller_or_equal(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_12, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_28, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))). % 0.14/0.39 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_27, plain, (epred1_2(X1,X2)|has_immunity(X2,X1)|~organization(X2))). % 0.14/0.39 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.14/0.39 cnf(i_0_18, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))). % 0.14/0.39 cnf(i_0_25, plain, (positional_advantage(X1,X2)|~robust_position(X1)|~greater(age(X1,X2),tau))). % 0.14/0.39 cnf(i_0_15, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))). % 0.14/0.39 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.14/0.39 cnf(i_0_21, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_19, plain, (greater(age(X1,X2),tau)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))). % 0.14/0.39 cnf(i_0_23, plain, (robust_position(X1)|smaller_or_equal(age(X1,esk1_1(X1)),tau)|~positional_advantage(X1,esk2_1(X1)))). % 0.14/0.39 cnf(i_0_24, plain, (robust_position(X1)|greater(age(X1,esk2_1(X1)),tau)|smaller_or_equal(age(X1,esk1_1(X1)),tau))). % 0.14/0.39 cnf(i_0_20, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),tau))). % 0.14/0.39 cnf(i_0_40, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X2,X1))). % 0.14/0.39 cnf(i_0_22, plain, (positional_advantage(X1,esk1_1(X1))|robust_position(X1)|greater(age(X1,esk2_1(X1)),tau))). % 0.14/0.39 cnf(i_0_43, plain, (hazard_of_mortality(X1,X2)=low|~epred1_2(X2,X1)|~positional_advantage(X1,X2)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_42, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|~epred1_2(X2,X1)|~positional_advantage(X1,X2))). % 0.14/0.39 cnf(i_0_41, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|~epred1_2(X2,X1)|~is_aligned(X1,X2))). % 0.14/0.39 cnf(i_0_13, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 cnf(i_0_14, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 7 steps % 0.14/0.39 cnf(i_0_38, negated_conjecture, (robust_position(esk3_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_53, plain, (robust_position(esk3_0)), inference(extension_rule, [i_0_26])). % 0.14/0.39 cnf(i_0_76, plain, (~smaller_or_equal(age(esk3_0,esk5_0),tau)), inference(closure_rule, [i_0_32])). % 0.14/0.39 cnf(i_0_74, plain, (~positional_advantage(esk3_0,esk5_0)), inference(extension_rule, [i_0_40])). % 0.14/0.39 cnf(i_0_138, plain, (hazard_of_mortality(esk3_0,esk5_0)=high), inference(etableau_closure_rule, [i_0_138, ...])). % 0.14/0.39 cnf(i_0_140, plain, (is_aligned(esk3_0,esk5_0)), inference(etableau_closure_rule, [i_0_140, ...])). % 0.14/0.39 cnf(i_0_141, plain, (~epred1_2(esk5_0,esk3_0)), inference(etableau_closure_rule, [i_0_141, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (2866339) has found a proof. % 0.14/0.39 % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------