TSTP Solution File: MGT042+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT042+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 : n021.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:37 EDT 2022
% Result : Theorem 17.51s 2.57s
% Output : CNFRefutation 17.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT042+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 12:12:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 40 Number of unprocessed: 29
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 29 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 8 conjectures.
% 0.13/0.37 # There are 8 start rule candidates:
% 0.13/0.37 # Found 9 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 8 start rule tableaux created.
% 0.13/0.37 # 20 extension rule candidate clauses
% 0.13/0.37 # 9 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 17.51/2.57 # There were 4 total branch saturation attempts.
% 17.51/2.57 # There were 0 of these attempts blocked.
% 17.51/2.57 # There were 0 deferred branch saturation attempts.
% 17.51/2.57 # There were 0 free duplicated saturations.
% 17.51/2.57 # There were 4 total successful branch saturations.
% 17.51/2.57 # There were 0 successful branch saturations in interreduction.
% 17.51/2.57 # There were 0 successful branch saturations on the branch.
% 17.51/2.57 # There were 4 successful branch saturations after the branch.
% 17.51/2.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.51/2.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.51/2.57 # Begin clausification derivation
% 17.51/2.57
% 17.51/2.57 # End clausification derivation
% 17.51/2.57 # Begin listing active clauses obtained from FOF to CNF conversion
% 17.51/2.57 cnf(i_0_34, negated_conjecture, (organization(esk1_0))).
% 17.51/2.57 cnf(i_0_26, negated_conjecture, (smaller_or_equal(internal_friction(esk1_0,esk3_0),internal_friction(esk1_0,esk2_0)))).
% 17.51/2.57 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 17.51/2.57 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 17.51/2.57 cnf(i_0_31, negated_conjecture, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)))).
% 17.51/2.57 cnf(i_0_21, negated_conjecture, (greater_or_equal(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0)))).
% 17.51/2.57 cnf(i_0_33, negated_conjecture, (~has_immunity(esk1_0,esk2_0))).
% 17.51/2.57 cnf(i_0_32, negated_conjecture, (~has_immunity(esk1_0,esk3_0))).
% 17.51/2.57 cnf(i_0_16, negated_conjecture, (~smaller(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))).
% 17.51/2.57 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 17.51/2.57 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 17.51/2.57 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 17.51/2.57 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 17.51/2.57 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 17.51/2.57 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 17.51/2.57 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 17.51/2.57 cnf(i_0_13, plain, (epred2_3(X1,X2,X3)|~organization(X3))).
% 17.51/2.57 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 17.51/2.57 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 17.51/2.57 cnf(i_0_12, plain, (epred1_3(X1,X2,X3)|has_immunity(X3,X1)|has_immunity(X3,X2)|~organization(X3))).
% 17.51/2.57 cnf(i_0_14, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))).
% 17.51/2.57 cnf(i_0_15, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))).
% 17.51/2.57 cnf(i_0_29, negated_conjecture, (greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)))).
% 17.51/2.57 cnf(i_0_38, plain, (capability(X1,X2)=capability(X1,X3)|stock_of_knowledge(X1,X2)!=stock_of_knowledge(X1,X3)|internal_friction(X1,X2)!=internal_friction(X1,X3)|~epred2_3(X3,X2,X1))).
% 17.51/2.57 cnf(i_0_35, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|capability(X1,X2)!=capability(X1,X3)|position(X1,X2)!=position(X1,X3)|~epred1_3(X3,X2,X1))).
% 17.51/2.57 cnf(i_0_36, plain, (smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~epred1_3(X3,X2,X1)|~greater(position(X1,X2),position(X1,X3))|~greater_or_equal(capability(X1,X2),capability(X1,X3)))).
% 17.51/2.57 cnf(i_0_37, plain, (smaller(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))|~epred1_3(X3,X2,X1)|~greater(capability(X1,X2),capability(X1,X3))|~greater_or_equal(position(X1,X2),position(X1,X3)))).
% 17.51/2.57 cnf(i_0_39, plain, (smaller(capability(X1,X2),capability(X1,X3))|~epred2_3(X3,X2,X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))).
% 17.51/2.57 cnf(i_0_40, plain, (greater(capability(X1,X2),capability(X1,X3))|~epred2_3(X3,X2,X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))).
% 17.51/2.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 17.51/2.57 # Begin printing tableau
% 17.51/2.57 # Found 7 steps
% 17.51/2.57 cnf(i_0_31, negated_conjecture, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(start_rule)).
% 17.51/2.57 cnf(i_0_49, plain, (greater_or_equal(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(extension_rule, [i_0_6])).
% 17.51/2.57 cnf(i_0_65, plain, (stock_of_knowledge(esk1_0,esk3_0)=stock_of_knowledge(esk1_0,esk2_0)), inference(extension_rule, [i_0_38])).
% 17.51/2.57 cnf(i_0_66, plain, (greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_66, ...])).
% 17.51/2.57 cnf(i_0_99, plain, (capability(esk1_0,esk2_0)=capability(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_99, ...])).
% 17.51/2.57 cnf(i_0_101, plain, (internal_friction(esk1_0,esk2_0)!=internal_friction(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_101, ...])).
% 17.51/2.57 cnf(i_0_102, plain, (~epred2_3(esk2_0,esk3_0,esk1_0)), inference(etableau_closure_rule, [i_0_102, ...])).
% 17.51/2.57 # End printing tableau
% 17.51/2.57 # SZS output end
% 17.51/2.57 # Branches closed with saturation will be marked with an "s"
% 17.51/2.58 # Child (15147) has found a proof.
% 17.51/2.58
% 17.51/2.58 # Proof search is over...
% 17.51/2.58 # Freeing feature tree
%------------------------------------------------------------------------------