%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT046+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %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:26:00 EDT 2022
% Result : Theorem 0.41s 0.60s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : MGT046+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 12:06:02 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n026.cluster.edu,
% 0.14/0.36 Thu Jun 9 12:06:02 2022
% 0.14/0.36 The command was "./sos". The process ID is 31374.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} A=A.
% 0.14/0.36 30 back subsumes 26.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.56
% 0.20/0.56 Stopped by limit on insertions
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Failed to model usable list: disabling FINDER
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 -------------- Softie stats --------------
% 0.20/0.56
% 0.20/0.56 UPDATE_STOP: 300
% 0.20/0.56 SFINDER_TIME_LIMIT: 2
% 0.20/0.56 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.56 number of clauses in intial UL: 25
% 0.20/0.56 number of clauses initially in problem: 29
% 0.20/0.56 percentage of clauses intially in UL: 86
% 0.20/0.56 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.56 percent of all initial clauses that are short: 100
% 0.20/0.56 absolute distinct symbol count: 18
% 0.20/0.56 distinct predicate count: 8
% 0.20/0.56 distinct function count: 7
% 0.20/0.56 distinct constant count: 3
% 0.20/0.56
% 0.20/0.56 ---------- no more Softie stats ----------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 =========== start of search ===========
% 0.41/0.60
% 0.41/0.60 -------- PROOF --------
% 0.41/0.60 % SZS status Theorem
% 0.41/0.60 % SZS output start Refutation
% 0.41/0.60
% 0.41/0.60 ----> UNIT CONFLICT at 0.21 sec ----> 853 [binary,852.1,23.1] {-} $F.
% 0.41/0.60
% 0.41/0.60 Length of proof is 10. Level of proof is 6.
% 0.41/0.60
% 0.41/0.60 ---------------- PROOF ----------------
% 0.41/0.60 % SZS status Theorem
% 0.41/0.60 % SZS output start Refutation
% 0.41/0.60
% 0.41/0.60 3 [] {+} smaller_or_equal(A,B)|A!=B.
% 0.41/0.60 5 [] {+} greater_or_equal(A,B)| -greater(A,B).
% 0.41/0.60 11 [] {+} -organization(A)|has_endowment(A)| -has_immunity(A,B).
% 0.41/0.60 12 [] {+} -organization(A)|has_immunity(A,B)|has_immunity(A,C)| -greater(capability(A,C),capability(A,B))| -greater_or_equal(position(A,C),position(A,B))|smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)).
% 0.41/0.60 15 [] {+} -organization(A)| -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -smaller_or_equal(internal_friction(A,B),internal_friction(A,C))|greater(capability(A,B),capability(A,C)).
% 0.41/0.60 18 [] {+} -organization(A)| -greater(external_ties(A,B),external_ties(A,C))|greater(position(A,B),position(A,C)).
% 0.41/0.60 20 [] {+} -organization(A)| -greater(age(A,B),age(A,C))|greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)).
% 0.41/0.60 21 [] {+} -organization(A)| -greater(age(A,B),age(A,C))|greater(external_ties(A,B),external_ties(A,C)).
% 0.41/0.60 22 [] {+} -organization(A)|internal_friction(A,B)=internal_friction(A,C).
% 0.41/0.60 23 [] {+} -has_endowment($c3).
% 0.41/0.60 24 [] {+} -smaller(hazard_of_mortality($c3,$c1),hazard_of_mortality($c3,$c2)).
% 0.41/0.60 28 [] {-} organization($c3).
% 0.41/0.60 29 [] {-} greater(age($c3,$c1),age($c3,$c2)).
% 0.41/0.60 87 [hyper,28,22] {-} internal_friction($c3,A)=internal_friction($c3,B).
% 0.41/0.60 93 [hyper,29,21,28] {-} greater(external_ties($c3,$c1),external_ties($c3,$c2)).
% 0.41/0.60 94 [hyper,29,20,28] {-} greater(stock_of_knowledge($c3,$c1),stock_of_knowledge($c3,$c2)).
% 0.41/0.60 116 [hyper,87,3] {-} smaller_or_equal(internal_friction($c3,A),internal_friction($c3,B)).
% 0.41/0.60 127 [hyper,93,18,28] {-} greater(position($c3,$c1),position($c3,$c2)).
% 0.41/0.60 255 [hyper,116,15,28,94] {-} greater(capability($c3,$c1),capability($c3,$c2)).
% 0.41/0.60 269 [hyper,127,5] {-} greater_or_equal(position($c3,$c1),position($c3,$c2)).
% 0.41/0.60 763 [hyper,269,12,28,255,unit_del,24] {-} has_immunity($c3,$c2)|has_immunity($c3,$c1).
% 0.41/0.60 850 [hyper,763,11,28,unit_del,23] {-} has_immunity($c3,$c1).
% 0.41/0.60 852 [hyper,850,11,28] {-} has_endowment($c3).
% 0.41/0.60 853 [binary,852.1,23.1] {-} $F.
% 0.41/0.60
% 0.41/0.60 % SZS output end Refutation
% 0.41/0.60 ------------ end of proof -------------
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 Search stopped by max_proofs option.
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 Search stopped by max_proofs option.
% 0.41/0.60
% 0.41/0.60 ============ end of search ============
% 0.41/0.60
% 0.41/0.60 That finishes the proof of the theorem.
% 0.41/0.60
% 0.41/0.60 Process 31374 finished Thu Jun 9 12:06:03 2022
%------------------------------------------------------------------------------