TSTP Solution File: MGT036+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %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:25:55 EDT 2022
% Result : Theorem 0.46s 0.63s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.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 09:48:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n022.cluster.edu,
% 0.12/0.34 Thu Jun 9 09:48:19 2022
% 0.12/0.34 The command was "./sos". The process ID is 10123.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 10
% 0.19/0.38 number of clauses initially in problem: 14
% 0.19/0.38 percentage of clauses intially in UL: 71
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 84
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 13
% 0.19/0.38 distinct predicate count: 6
% 0.19/0.38 distinct function count: 2
% 0.19/0.38 distinct constant count: 5
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.46/0.63
% 0.46/0.63 -------- PROOF --------
% 0.46/0.63 % SZS status Theorem
% 0.46/0.63 % SZS output start Refutation
% 0.46/0.63
% 0.46/0.63 Model 2 (0.00 seconds, 0 Inserts)
% 0.46/0.63
% 0.46/0.63 Stopped by limit on number of solutions
% 0.46/0.63
% 0.46/0.63 Stopped by limit on insertions
% 0.46/0.63
% 0.46/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.63
% 0.46/0.63 Stopped by limit on number of solutions
% 0.46/0.63
% 0.46/0.63 -----> EMPTY CLAUSE at 0.26 sec ----> 24 [hyper,19,5,20] {-} $F.
% 0.46/0.63
% 0.46/0.63 Length of proof is 5. Level of proof is 3.
% 0.46/0.63
% 0.46/0.63 ---------------- PROOF ----------------
% 0.46/0.63 % SZS status Theorem
% 0.46/0.63 % SZS output start Refutation
% 0.46/0.63
% 0.46/0.63 1 [] {+} -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)|subpopulations(efficient_producers,first_movers,A,B).
% 0.46/0.63 2 [] {+} -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)|in_environment(A,B).
% 0.46/0.63 5 [] {+} -greater_or_equal(growth_rate(A,B),zero)| -greater(zero,growth_rate(A,B)).
% 0.46/0.63 8 [] {+} -environment(A)| -subpopulations(B,C,A,D)|greater_or_equal(growth_rate(C,D),zero)| -outcompetes(C,B,D).
% 0.46/0.63 9 [] {+} -environment(A)| -subpopulations(B,C,A,D)|greater(zero,growth_rate(B,D))| -outcompetes(C,B,D).
% 0.46/0.63 10 [] {+} -environment(A)| -in_environment(A,B)|greater(zero,growth_rate(C,B))| -greater(resilience(D),resilience(C))| -greater(zero,growth_rate(D,B)).
% 0.46/0.63 11 [] {-} greater(resilience(efficient_producers),resilience(first_movers)).
% 0.46/0.63 12 [] {+} environment($c2).
% 0.46/0.63 13 [] {+} subpopulations(first_movers,efficient_producers,$c2,$c1).
% 0.46/0.63 14 [] {-} outcompetes(first_movers,efficient_producers,$c1).
% 0.46/0.63 16 [hyper,13,2,12] {+} in_environment($c2,$c1).
% 0.46/0.63 17 [hyper,13,1,12] {+} subpopulations(efficient_producers,first_movers,$c2,$c1).
% 0.46/0.63 18 [hyper,17,9,12,14] {-} greater(zero,growth_rate(efficient_producers,$c1)).
% 0.46/0.63 19 [hyper,17,8,12,14] {+} greater_or_equal(growth_rate(first_movers,$c1),zero).
% 0.46/0.63 20 [hyper,18,10,12,16,11] {-} greater(zero,growth_rate(first_movers,$c1)).
% 0.46/0.63 24 [hyper,19,5,20] {-} $F.
% 0.46/0.63
% 0.46/0.63 % SZS output end Refutation
% 0.46/0.63 ------------ end of proof -------------
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Search stopped by max_proofs option.
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Search stopped by max_proofs option.
% 0.46/0.63
% 0.46/0.63 ============ end of search ============
% 0.46/0.63
% 0.46/0.63 ----------- soft-scott stats ----------
% 0.46/0.63
% 0.46/0.63 true clauses given 5 (45.5%)
% 0.46/0.63 false clauses given 6
% 0.46/0.63
% 0.46/0.63 FALSE TRUE
% 0.46/0.63 5 2 0
% 0.46/0.63 tot: 2 0 (0.0% true)
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.63
% 0.46/0.63 That finishes the proof of the theorem.
% 0.46/0.63
% 0.46/0.63 Process 10123 finished Thu Jun 9 09:48:20 2022
%------------------------------------------------------------------------------