TSTP Solution File: MGT063+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT063+1 : TPTP v8.1.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 : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:10:45 EDT 2022
% Result : Theorem 8.21s 1.39s
% Output : CNFRefutation 8.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : MGT063+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 9 09:31:12 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.19/0.35 # No SInE strategy applied
% 0.19/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.19/0.35 # and selection function SelectCQArNTNpEqFirst.
% 0.19/0.35 #
% 0.19/0.35 # Presaturation interreduction done
% 0.19/0.35 # Number of axioms: 57 Number of unprocessed: 54
% 0.19/0.35 # Tableaux proof search.
% 0.19/0.35 # APR header successfully linked.
% 0.19/0.35 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 54 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 12 conjectures.
% 0.19/0.36 # There are 12 start rule candidates:
% 0.19/0.36 # Found 19 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 12 start rule tableaux created.
% 0.19/0.36 # 35 extension rule candidate clauses
% 0.19/0.36 # 19 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 8.21/1.39 # There were 3 total branch saturation attempts.
% 8.21/1.39 # There were 0 of these attempts blocked.
% 8.21/1.39 # There were 0 deferred branch saturation attempts.
% 8.21/1.39 # There were 0 free duplicated saturations.
% 8.21/1.39 # There were 3 total successful branch saturations.
% 8.21/1.39 # There were 0 successful branch saturations in interreduction.
% 8.21/1.39 # There were 0 successful branch saturations on the branch.
% 8.21/1.39 # There were 3 successful branch saturations after the branch.
% 8.21/1.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.21/1.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.21/1.39 # Begin clausification derivation
% 8.21/1.39
% 8.21/1.39 # End clausification derivation
% 8.21/1.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.21/1.39 cnf(i_0_53, negated_conjecture, (organization(esk5_0))).
% 8.21/1.39 cnf(i_0_52, negated_conjecture, (robust_position(esk5_0))).
% 8.21/1.39 cnf(i_0_50, negated_conjecture, (age(esk5_0,esk6_0)=zero)).
% 8.21/1.39 cnf(i_0_47, negated_conjecture, (smaller(sigma,tau))).
% 8.21/1.39 cnf(i_0_49, negated_conjecture, (greater(sigma,zero))).
% 8.21/1.39 cnf(i_0_48, negated_conjecture, (greater(tau,zero))).
% 8.21/1.39 cnf(i_0_38, plain, (greater(low,very_low))).
% 8.21/1.39 cnf(i_0_46, negated_conjecture, (smaller_or_equal(age(esk5_0,esk7_0),sigma))).
% 8.21/1.39 cnf(i_0_44, negated_conjecture, (smaller_or_equal(age(esk5_0,esk8_0),tau))).
% 8.21/1.39 cnf(i_0_45, negated_conjecture, (greater(age(esk5_0,esk8_0),sigma))).
% 8.21/1.39 cnf(i_0_43, negated_conjecture, (greater(age(esk5_0,esk9_0),tau))).
% 8.21/1.39 cnf(i_0_37, plain, (greater(mod1,low))).
% 8.21/1.39 cnf(i_0_40, plain, (greater(mod2,low))).
% 8.21/1.39 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 8.21/1.39 cnf(i_0_41, plain, (greater(mod2,mod1))).
% 8.21/1.39 cnf(i_0_36, plain, (greater(high,mod1))).
% 8.21/1.39 cnf(i_0_39, plain, (greater(high,mod2))).
% 8.21/1.39 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 8.21/1.39 cnf(i_0_51, negated_conjecture, (~has_endowment(esk5_0))).
% 8.21/1.39 cnf(i_0_18, plain, (organization(X1)|~has_endowment(X1))).
% 8.21/1.39 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 8.21/1.39 cnf(i_0_24, plain, (organization(X1)|~dissimilar(X1,X2,X3))).
% 8.21/1.39 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 8.21/1.39 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 8.21/1.39 cnf(i_0_19, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))).
% 8.21/1.39 cnf(i_0_42, negated_conjecture, (hazard_of_mortality(esk5_0,esk6_0)!=hazard_of_mortality(esk5_0,esk7_0)|~smaller(hazard_of_mortality(esk5_0,esk7_0),hazard_of_mortality(esk5_0,esk8_0))|~smaller(hazard_of_mortality(esk5_0,esk9_0),hazard_of_mortality(esk5_0,esk7_0)))).
% 8.21/1.39 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 8.21/1.39 cnf(i_0_23, plain, (~is_aligned(X1,X2)|~is_aligned(X1,X3)|~dissimilar(X1,X3,X2))).
% 8.21/1.39 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 8.21/1.39 cnf(i_0_16, plain, (~has_immunity(X1,X2)|~has_endowment(X1)|~greater(age(X1,X2),eta))).
% 8.21/1.39 cnf(i_0_33, plain, (~positional_advantage(X1,X2)|~robust_position(X1)|~smaller_or_equal(age(X1,X2),tau))).
% 8.21/1.39 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 8.21/1.39 cnf(i_0_35, plain, (hazard_of_mortality(X1,X2)=very_low|~has_immunity(X1,X2)|~organization(X1))).
% 8.21/1.39 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 8.21/1.39 cnf(i_0_25, plain, (is_aligned(X1,X2)|age(X1,X2)!=zero|~organization(X1))).
% 8.21/1.39 cnf(i_0_17, plain, (has_immunity(X1,X2)|~has_endowment(X1)|~smaller_or_equal(age(X1,X2),eta))).
% 8.21/1.39 cnf(i_0_34, plain, (epred1_2(X1,X2)|has_immunity(X2,X1)|~organization(X2))).
% 8.21/1.39 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 8.21/1.39 cnf(i_0_32, plain, (positional_advantage(X1,X2)|~robust_position(X1)|~greater(age(X1,X2),tau))).
% 8.21/1.39 cnf(i_0_22, plain, (is_aligned(X1,X2)|is_aligned(X1,X3)|~dissimilar(X1,X2,X3))).
% 8.21/1.39 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 8.21/1.39 cnf(i_0_57, plain, (hazard_of_mortality(X1,X2)=low|~epred1_2(X2,X1)|~positional_advantage(X1,X2)|~is_aligned(X1,X2))).
% 8.21/1.39 cnf(i_0_28, plain, (positional_advantage(X1,esk3_1(X1))|robust_position(X1)|~positional_advantage(X1,esk4_1(X1)))).
% 8.21/1.39 cnf(i_0_26, plain, (greater(age(X1,X2),sigma)|age(X1,X3)!=zero|~dissimilar(X1,X3,X2))).
% 8.21/1.39 cnf(i_0_30, plain, (robust_position(X1)|smaller_or_equal(age(X1,esk3_1(X1)),tau)|~positional_advantage(X1,esk4_1(X1)))).
% 8.21/1.39 cnf(i_0_31, plain, (robust_position(X1)|greater(age(X1,esk4_1(X1)),tau)|smaller_or_equal(age(X1,esk3_1(X1)),tau))).
% 8.21/1.39 cnf(i_0_27, plain, (dissimilar(X1,X2,X3)|age(X1,X2)!=zero|~organization(X1)|~greater(age(X1,X3),sigma))).
% 8.21/1.39 cnf(i_0_29, plain, (positional_advantage(X1,esk3_1(X1))|robust_position(X1)|greater(age(X1,esk4_1(X1)),tau))).
% 8.21/1.39 cnf(i_0_56, plain, (hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|~epred1_2(X2,X1)|~positional_advantage(X1,X2))).
% 8.21/1.39 cnf(i_0_55, plain, (hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|~epred1_2(X2,X1)|~is_aligned(X1,X2))).
% 8.21/1.39 cnf(i_0_20, plain, (is_aligned(X1,X2)|dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~organization(X1))).
% 8.21/1.39 cnf(i_0_21, plain, (is_aligned(X1,X2)|dissimilar(X1,X3,X2)|~is_aligned(X1,X3)|~organization(X1))).
% 8.21/1.39 cnf(i_0_54, plain, (hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X2,X1))).
% 8.21/1.39 cnf(i_0_14, plain, (has_endowment(X1)|smaller_or_equal(age(X1,esk1_1(X1)),eta)|~organization(X1))).
% 8.21/1.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.21/1.39 # Begin printing tableau
% 8.21/1.39 # Found 7 steps
% 8.21/1.39 cnf(i_0_44, negated_conjecture, (smaller_or_equal(age(esk5_0,esk8_0),tau)), inference(start_rule)).
% 8.21/1.39 cnf(i_0_66, plain, (smaller_or_equal(age(esk5_0,esk8_0),tau)), inference(extension_rule, [i_0_33])).
% 8.21/1.39 cnf(i_0_98, plain, (~robust_position(esk5_0)), inference(closure_rule, [i_0_52])).
% 8.21/1.39 cnf(i_0_97, plain, (~positional_advantage(esk5_0,esk8_0)), inference(extension_rule, [i_0_55])).
% 8.21/1.39 cnf(i_0_180, plain, (hazard_of_mortality(esk5_0,esk8_0)=mod2), inference(etableau_closure_rule, [i_0_180, ...])).
% 8.21/1.39 cnf(i_0_182, plain, (~epred1_2(esk8_0,esk5_0)), inference(etableau_closure_rule, [i_0_182, ...])).
% 8.21/1.39 cnf(i_0_183, plain, (~is_aligned(esk5_0,esk8_0)), inference(etableau_closure_rule, [i_0_183, ...])).
% 8.21/1.39 # End printing tableau
% 8.21/1.39 # SZS output end
% 8.21/1.39 # Branches closed with saturation will be marked with an "s"
% 8.21/1.39 # Child (29542) has found a proof.
% 8.21/1.39
% 8.21/1.39 # Proof search is over...
% 8.21/1.39 # Freeing feature tree
%------------------------------------------------------------------------------