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 : n022.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 : Unsatisfiable 5.89s 1.04s
% Output : CNFRefutation 5.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : MGT042-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.06/0.26 % Computer : n022.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Thu Jun 9 10:06:34 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.06/0.27 # No SInE strategy applied
% 0.06/0.27 # Auto-Mode selected heuristic U_____100_C07_23_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.06/0.27 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.06/0.27 #
% 0.06/0.27 # Presaturation interreduction done
% 0.06/0.27 # Number of axioms: 38 Number of unprocessed: 27
% 0.06/0.27 # Tableaux proof search.
% 0.06/0.27 # APR header successfully linked.
% 0.06/0.27 # Hello from C++
% 0.06/0.27 # The folding up rule is enabled...
% 0.06/0.27 # Local unification is enabled...
% 0.06/0.27 # Any saturation attempts will use folding labels...
% 0.06/0.27 # 27 beginning clauses after preprocessing and clausification
% 0.06/0.27 # Creating start rules for all 8 conjectures.
% 0.06/0.27 # There are 8 start rule candidates:
% 0.06/0.27 # Found 9 unit axioms.
% 0.06/0.27 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.06/0.27 # 8 start rule tableaux created.
% 0.06/0.27 # 18 extension rule candidate clauses
% 0.06/0.27 # 9 unit axiom clauses
% 0.06/0.27
% 0.06/0.27 # Requested 8, 32 cores available to the main process.
% 5.89/1.04 # There were 2 total branch saturation attempts.
% 5.89/1.04 # There were 0 of these attempts blocked.
% 5.89/1.04 # There were 0 deferred branch saturation attempts.
% 5.89/1.04 # There were 0 free duplicated saturations.
% 5.89/1.04 # There were 2 total successful branch saturations.
% 5.89/1.04 # There were 0 successful branch saturations in interreduction.
% 5.89/1.04 # There were 0 successful branch saturations on the branch.
% 5.89/1.04 # There were 2 successful branch saturations after the branch.
% 5.89/1.04 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.89/1.04 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.89/1.04 # Begin clausification derivation
% 5.89/1.04
% 5.89/1.04 # End clausification derivation
% 5.89/1.04 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.89/1.04 cnf(i_0_58, negated_conjecture, (organization(sk1))).
% 5.89/1.04 cnf(i_0_66, negated_conjecture, (smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)))).
% 5.89/1.04 cnf(i_0_41, plain, (smaller_or_equal(X1,X1))).
% 5.89/1.04 cnf(i_0_44, plain, (greater_or_equal(X1,X1))).
% 5.89/1.04 cnf(i_0_61, negated_conjecture, (greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)))).
% 5.89/1.04 cnf(i_0_69, negated_conjecture, (greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2)))).
% 5.89/1.04 cnf(i_0_59, negated_conjecture, (~has_immunity(sk1,sk2))).
% 5.89/1.04 cnf(i_0_60, negated_conjecture, (~has_immunity(sk1,sk3))).
% 5.89/1.04 cnf(i_0_76, negated_conjecture, (~smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)))).
% 5.89/1.04 cnf(i_0_47, plain, (~greater(X1,X2)|~greater(X2,X1))).
% 5.89/1.04 cnf(i_0_45, plain, (greater(X1,X2)|~smaller(X2,X1))).
% 5.89/1.04 cnf(i_0_40, plain, (smaller_or_equal(X1,X2)|~smaller(X1,X2))).
% 5.89/1.04 cnf(i_0_46, plain, (smaller(X1,X2)|~greater(X2,X1))).
% 5.89/1.04 cnf(i_0_43, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))).
% 5.89/1.04 cnf(i_0_39, plain, (X1=X2|smaller(X1,X2)|~smaller_or_equal(X1,X2))).
% 5.89/1.04 cnf(i_0_42, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))).
% 5.89/1.04 cnf(i_0_49, plain, (X1=X2|greater(X1,X2)|smaller(X1,X2))).
% 5.89/1.04 cnf(i_0_48, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))).
% 5.89/1.04 cnf(i_0_56, plain, (greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3)))).
% 5.89/1.04 cnf(i_0_57, plain, (position(X1,X2)=position(X1,X3)|external_ties(X1,X2)!=external_ties(X1,X3)|~organization(X1))).
% 5.89/1.04 cnf(i_0_55, 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)|~organization(X1))).
% 5.89/1.04 cnf(i_0_63, negated_conjecture, (greater(external_ties(sk1,sk3),external_ties(sk1,sk2))|greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)))).
% 5.89/1.04 cnf(i_0_54, plain, (smaller(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(internal_friction(X1,X2),internal_friction(X1,X3))|~smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)))).
% 5.89/1.04 cnf(i_0_53, plain, (greater(capability(X1,X2),capability(X1,X3))|~organization(X1)|~greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))|~smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)))).
% 5.89/1.04 cnf(i_0_51, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~organization(X1)|~greater(position(X1,X3),position(X1,X2))|~greater_or_equal(capability(X1,X3),capability(X1,X2)))).
% 5.89/1.04 cnf(i_0_50, plain, (has_immunity(X1,X2)|has_immunity(X1,X3)|smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))|~organization(X1)|~greater(capability(X1,X3),capability(X1,X2))|~greater_or_equal(position(X1,X3),position(X1,X2)))).
% 5.89/1.04 cnf(i_0_52, plain, (hazard_of_mortality(X1,X2)=hazard_of_mortality(X1,X3)|has_immunity(X1,X2)|has_immunity(X1,X3)|capability(X1,X2)!=capability(X1,X3)|position(X1,X2)!=position(X1,X3)|~organization(X1))).
% 5.89/1.04 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.89/1.04 # Begin printing tableau
% 5.89/1.04 # Found 6 steps
% 5.89/1.04 cnf(i_0_69, negated_conjecture, (greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2))), inference(start_rule)).
% 5.89/1.04 cnf(i_0_84, plain, (greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2))), inference(extension_rule, [i_0_42])).
% 5.89/1.04 cnf(i_0_101, plain, (external_ties(sk1,sk3)=external_ties(sk1,sk2)), inference(extension_rule, [i_0_57])).
% 5.89/1.04 cnf(i_0_128, plain, (~organization(sk1)), inference(closure_rule, [i_0_58])).
% 5.89/1.04 cnf(i_0_102, plain, (greater(external_ties(sk1,sk3),external_ties(sk1,sk2))), inference(etableau_closure_rule, [i_0_102, ...])).
% 5.89/1.04 cnf(i_0_126, plain, (position(sk1,sk2)=position(sk1,sk3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 5.89/1.04 # End printing tableau
% 5.89/1.04 # SZS output end
% 5.89/1.04 # Branches closed with saturation will be marked with an "s"
% 5.89/1.04 # Child (31955) has found a proof.
% 5.89/1.04
% 5.89/1.04 # Proof search is over...
% 5.89/1.04 # Freeing feature tree
%------------------------------------------------------------------------------