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