TSTP Solution File: MGT050+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT050+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 : n026.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:40 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : MGT050+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 11:06:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 29 Number of unprocessed: 29
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 29 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 4 conjectures.
% 0.21/0.38 # There are 4 start rule candidates:
% 0.21/0.38 # Found 6 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 4 start rule tableaux created.
% 0.21/0.38 # 23 extension rule candidate clauses
% 0.21/0.38 # 6 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 4
% 0.21/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 13 tableaux to operate on
% 0.21/0.40 # There were 1 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 1 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 1 successful branch saturations after the branch.
% 0.21/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_23, negated_conjecture, (organization(esk1_0))).
% 0.21/0.40 cnf(i_0_21, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))).
% 0.21/0.40 cnf(i_0_1, plain, (smaller_or_equal(X1,X1))).
% 0.21/0.40 cnf(i_0_4, plain, (greater_or_equal(X1,X1))).
% 0.21/0.40 cnf(i_0_22, negated_conjecture, (~has_endowment(esk1_0))).
% 0.21/0.40 cnf(i_0_20, negated_conjecture, (~greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))).
% 0.21/0.40 cnf(i_0_9, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 0.21/0.40 cnf(i_0_8, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 0.21/0.40 cnf(i_0_2, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 0.21/0.40 cnf(i_0_7, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 0.21/0.40 cnf(i_0_12, plain, (has_endowment(X1)|~has_immunity(X1,X2)|~organization(X1))).
% 0.21/0.40 cnf(i_0_5, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 0.21/0.40 cnf(i_0_14, plain, (epred2_3(X1,X2,X3)|~organization(X3))).
% 0.21/0.40 cnf(i_0_6, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 0.21/0.40 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 0.21/0.40 cnf(i_0_3, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 0.21/0.40 cnf(i_0_10, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 0.21/0.40 cnf(i_0_17, plain, (stock_of_knowledge(X1,X2)=stock_of_knowledge(X1,X3)|~organization(X1))).
% 0.21/0.40 cnf(i_0_18, plain, (external_ties(X1,X2)=external_ties(X1,X3)|~organization(X1))).
% 0.21/0.40 cnf(i_0_15, plain, (position(X1,X2)=position(X1,X3)|~organization(X1))).
% 0.21/0.40 cnf(i_0_19, plain, (greater(internal_friction(X1,X2),internal_friction(X1,X3))|~organization(X1)|~greater(age(X1,X2),age(X1,X3)))).
% 0.21/0.40 cnf(i_0_16, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))).
% 0.21/0.40 cnf(i_0_13, plain, (epred1_3(X1,X2,X3)|has_immunity(X3,X1)|has_immunity(X3,X2)|~organization(X3))).
% 0.21/0.40 cnf(i_0_24, 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))).
% 0.21/0.40 cnf(i_0_27, 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))).
% 0.21/0.40 cnf(i_0_28, 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)))).
% 0.21/0.40 cnf(i_0_25, 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)))).
% 0.21/0.40 cnf(i_0_29, 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)))).
% 0.21/0.40 cnf(i_0_26, 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)))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 6 steps
% 0.21/0.40 cnf(i_0_21, negated_conjecture, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(start_rule)).
% 0.21/0.40 cnf(i_0_34, plain, (greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(extension_rule, [i_0_10])).
% 0.21/0.40 cnf(i_0_194, plain, (greater(age(esk1_0,esk2_0),age(esk1_0,esk2_0))), inference(extension_rule, [i_0_9])).
% 0.21/0.40 cnf(i_0_238, plain, (~greater(age(esk1_0,esk2_0),age(esk1_0,esk2_0))), inference(closure_rule, [i_0_194])).
% 0.21/0.40 cnf(i_0_196, plain, (~greater(age(esk1_0,esk2_0),age(esk1_0,esk3_0))), inference(extension_rule, [i_0_8])).
% 0.21/0.40 cnf(i_0_240, plain, (~smaller(age(esk1_0,esk3_0),age(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_240, ...])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.40 # Child (10269) has found a proof.
% 0.21/0.40
% 0.21/0.40 # Proof search is over...
% 0.21/0.40 # Freeing feature tree
%------------------------------------------------------------------------------