%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT022+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:25:51 EDT 2022
% Result : Theorem 0.18s 0.54s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT022+2 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 11:50:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.34 ----- Otter 3.2, August 2001 -----
% 0.18/0.34 The process was started by sandbox on n017.cluster.edu,
% 0.18/0.34 Thu Jun 9 11:50:34 2022
% 0.18/0.34 The command was "./sos". The process ID is 7693.
% 0.18/0.34
% 0.18/0.34 set(prolog_style_variables).
% 0.18/0.34 set(auto).
% 0.18/0.34 dependent: set(auto1).
% 0.18/0.34 dependent: set(process_input).
% 0.18/0.34 dependent: clear(print_kept).
% 0.18/0.34 dependent: clear(print_new_demod).
% 0.18/0.34 dependent: clear(print_back_demod).
% 0.18/0.34 dependent: clear(print_back_sub).
% 0.18/0.34 dependent: set(control_memory).
% 0.18/0.34 dependent: assign(max_mem, 12000).
% 0.18/0.34 dependent: assign(pick_given_ratio, 4).
% 0.18/0.34 dependent: assign(stats_level, 1).
% 0.18/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.34 dependent: assign(sos_limit, 5000).
% 0.18/0.34 dependent: assign(max_weight, 60).
% 0.18/0.34 clear(print_given).
% 0.18/0.34
% 0.18/0.34 formula_list(usable).
% 0.18/0.34
% 0.18/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.18/0.34
% 0.18/0.34 This is a non-Horn set without equality. The strategy
% 0.18/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.18/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.18/0.34
% 0.18/0.34 dependent: set(hyper_res).
% 0.18/0.34 dependent: set(factor).
% 0.18/0.34 dependent: set(unit_deletion).
% 0.18/0.34
% 0.18/0.34 ------------> process usable:
% 0.18/0.34
% 0.18/0.34 ------------> process sos:
% 0.18/0.34
% 0.18/0.34 ======= end of input processing =======
% 0.18/0.54
% 0.18/0.54 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.54
% 0.18/0.54 Stopped by limit on number of solutions
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54 -------------- Softie stats --------------
% 0.18/0.54
% 0.18/0.54 UPDATE_STOP: 300
% 0.18/0.54 SFINDER_TIME_LIMIT: 2
% 0.18/0.54 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.54 number of clauses in intial UL: 5
% 0.18/0.54 number of clauses initially in problem: 10
% 0.18/0.54 percentage of clauses intially in UL: 50
% 0.18/0.54 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.54 percent of all initial clauses that are short: 90
% 0.18/0.54 absolute distinct symbol count: 14
% 0.18/0.54 distinct predicate count: 6
% 0.18/0.54 distinct function count: 4
% 0.18/0.54 distinct constant count: 4
% 0.18/0.54
% 0.18/0.54 ---------- no more Softie stats ----------
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54 =========== start of search ===========
% 0.18/0.54
% 0.18/0.54 -------- PROOF --------
% 0.18/0.54 % SZS status Theorem
% 0.18/0.54 % SZS output start Refutation
% 0.18/0.54
% 0.18/0.54 -----> EMPTY CLAUSE at 0.18 sec ----> 17 [hyper,16,1,15] {-} $F.
% 0.18/0.54
% 0.18/0.54 Length of proof is 4. Level of proof is 3.
% 0.18/0.54
% 0.18/0.54 ---------------- PROOF ----------------
% 0.18/0.54 % SZS status Theorem
% 0.18/0.54 % SZS output start Refutation
% 0.18/0.54
% 0.18/0.54 1 [] {+} -constant(A)| -decreases(A).
% 0.18/0.54 2 [] {+} -environment(A)| -subpopulations(B,C,A,D)| -greater(resilience(C),resilience(B))| -decreases(resources(A,D))|increases(difference(disbanding_rate(B,D),disbanding_rate(C,D))).
% 0.18/0.54 3 [] {+} -environment(A)| -subpopulations(B,C,A,D)| -greater(resilience(C),resilience(B))| -constant(resources(A,D))|constant(difference(disbanding_rate(B,D),disbanding_rate(C,D))).
% 0.18/0.54 4 [] {+} -increases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1)))|constant(resources($c2,$c1)).
% 0.18/0.54 6 [] {+} greater(resilience(efficient_producers),resilience(first_movers)).
% 0.18/0.54 7 [] {+} environment($c2).
% 0.18/0.54 8 [] {-} subpopulations(first_movers,efficient_producers,$c2,$c1).
% 0.18/0.54 9 [] {+} decreases(resources($c2,$c1))|constant(resources($c2,$c1)).
% 0.18/0.54 10 [] {+} decreases(resources($c2,$c1))|decreases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 0.18/0.54 11 [hyper,9,2,7,8,6] {+} constant(resources($c2,$c1))|increases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 0.18/0.54 14 [hyper,11,4,factor_simp] {+} constant(resources($c2,$c1)).
% 0.18/0.54 15 [hyper,14,3,7,8,6] {-} constant(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 0.18/0.54 16 [hyper,14,1,10] {+} decreases(difference(disbanding_rate(first_movers,$c1),disbanding_rate(efficient_producers,$c1))).
% 0.18/0.54 17 [hyper,16,1,15] {-} $F.
% 0.18/0.54
% 0.18/0.54 % SZS output end Refutation
% 0.18/0.54 ------------ end of proof -------------
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54 Search stopped by max_proofs option.
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54 Search stopped by max_proofs option.
% 0.18/0.54
% 0.18/0.54 ============ end of search ============
% 0.18/0.54
% 0.18/0.54 ----------- soft-scott stats ----------
% 0.18/0.54
% 0.18/0.54 true clauses given 7 (77.8%)
% 0.18/0.54 false clauses given 2
% 0.18/0.54
% 0.18/0.54 FALSE TRUE
% 0.18/0.54 tot: 0 0 (-nan% true)
% 0.18/0.54
% 0.18/0.54
% 0.18/0.54 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.54
% 0.18/0.54 That finishes the proof of the theorem.
% 0.18/0.54
% 0.18/0.54 Process 7693 finished Thu Jun 9 11:50:34 2022
%------------------------------------------------------------------------------