%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT026-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:52 EDT 2022
% Result : Unsatisfiable 0.94s 1.13s
% Output : Refutation 0.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT026-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 9 08:48:57 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n027.cluster.edu,
% 0.11/0.34 Thu Jun 9 08:48:57 2022
% 0.11/0.34 The command was "./sos". The process ID is 15690.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.36/0.55
% 0.36/0.55 Model 1 (0.00 seconds, 0 Inserts)
% 0.36/0.55
% 0.36/0.55 Stopped by limit on number of solutions
% 0.36/0.55
% 0.36/0.55
% 0.36/0.55 -------------- Softie stats --------------
% 0.36/0.55
% 0.36/0.55 UPDATE_STOP: 300
% 0.36/0.55 SFINDER_TIME_LIMIT: 2
% 0.36/0.55 SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.55 number of clauses in intial UL: 16
% 0.36/0.55 number of clauses initially in problem: 20
% 0.36/0.55 percentage of clauses intially in UL: 80
% 0.36/0.55 percentage of distinct symbols occuring in initial UL: 94
% 0.36/0.55 percent of all initial clauses that are short: 95
% 0.36/0.55 absolute distinct symbol count: 17
% 0.36/0.55 distinct predicate count: 8
% 0.36/0.55 distinct function count: 4
% 0.36/0.55 distinct constant count: 5
% 0.36/0.55
% 0.36/0.55 ---------- no more Softie stats ----------
% 0.36/0.55
% 0.36/0.55
% 0.36/0.55
% 0.36/0.55 Stopped by limit on insertions
% 0.36/0.55
% 0.36/0.55 =========== start of search ===========
% 0.94/1.13
% 0.94/1.13 -------- PROOF --------
% 0.94/1.13 % SZS status Unsatisfiable
% 0.94/1.13 % SZS output start Refutation
% 0.94/1.13
% 0.94/1.13 Stopped by limit on insertions
% 0.94/1.13
% 0.94/1.13 Stopped by limit on insertions
% 0.94/1.13
% 0.94/1.13 Stopped by limit on insertions
% 0.94/1.13
% 0.94/1.13 Model 2 [ 1 10 207475 ] (0.00 seconds, 250000 Inserts)
% 0.94/1.13
% 0.94/1.13 Stopped by limit on insertions
% 0.94/1.13
% 0.94/1.13 ----> UNIT CONFLICT at 0.76 sec ----> 608 [binary,607.1,15.1] {-} $F.
% 0.94/1.13
% 0.94/1.13 Length of proof is 14. Level of proof is 9.
% 0.94/1.13
% 0.94/1.13 ---------------- PROOF ----------------
% 0.94/1.13 % SZS status Unsatisfiable
% 0.94/1.13 % SZS output start Refutation
% 0.94/1.13
% 0.94/1.13 1 [] {+} -environment(A)| -subpopulations(B,C,A,D)| -greater(growth_rate(C,D),growth_rate(B,D))|selection_favors(C,B,D).
% 0.94/1.13 2 [] {+} -environment(A)| -subpopulation(B,A,C)| -subpopulation(D,A,C)| -greater(cardinality_at_time(B,C),zero)|cardinality_at_time(D,C)!=zero|selection_favors(B,D,C).
% 0.94/1.13 3 [] {+} -environment(A)| -in_environment(A,B)| -greater(cardinality_at_time(first_movers,B),zero)| -greater(cardinality_at_time(efficient_producers,B),zero)|subpopulations(first_movers,efficient_producers,A,B).
% 0.94/1.13 4 [] {+} -environment(A)| -in_environment(A,B)|greater_or_equal(cardinality_at_time(first_movers,B),zero).
% 0.94/1.13 5 [] {+} -environment(A)| -in_environment(A,B)|subpopulation(first_movers,A,B).
% 0.94/1.13 6 [] {+} -environment(A)| -in_environment(A,B)|subpopulation(efficient_producers,A,B).
% 0.94/1.13 7 [] {+} -environment(A)|greater_or_equal(critical_point(A),appear(efficient_producers,A)).
% 0.94/1.13 8 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 0.94/1.13 9 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 0.94/1.13 10 [] {+} -greater(A,B)|greater_or_equal(A,B).
% 0.94/1.13 13 [] {+} -environment(A)|B!=critical_point(A)| -subpopulations(first_movers,efficient_producers,A,C)| -greater(C,B)|greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)).
% 0.94/1.13 14 [] {+} -environment(A)| -in_environment(A,B)| -greater_or_equal(B,appear(efficient_producers,A))|greater(cardinality_at_time(efficient_producers,B),zero).
% 0.94/1.13 15 [] {+} -selection_favors(efficient_producers,first_movers,sk2).
% 0.94/1.13 17 [] {-} environment(sk1).
% 0.94/1.13 18 [] {+} in_environment(sk1,sk2).
% 0.94/1.13 19 [] {-} greater(sk2,critical_point(sk1)).
% 0.94/1.13 20 [] {+} A=A.
% 0.94/1.13 21 [hyper,17,7] {-} greater_or_equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 0.94/1.13 26 [para_into,19.1.2,9.3.1] {+} greater(sk2,A)| -greater_or_equal(critical_point(sk1),A)|greater(critical_point(sk1),A).
% 0.94/1.13 36 [hyper,18,6,17] {+} subpopulation(efficient_producers,sk1,sk2).
% 0.94/1.13 37 [hyper,18,5,17] {+} subpopulation(first_movers,sk1,sk2).
% 0.94/1.13 38 [hyper,18,4,17] {+} greater_or_equal(cardinality_at_time(first_movers,sk2),zero).
% 0.94/1.13 68 [hyper,38,9] {+} greater(cardinality_at_time(first_movers,sk2),zero)|cardinality_at_time(first_movers,sk2)=zero.
% 0.94/1.13 87 [hyper,26,21] {+} greater(sk2,appear(efficient_producers,sk1))|greater(critical_point(sk1),appear(efficient_producers,sk1)).
% 0.94/1.13 451 [hyper,87,8,19,factor_simp] {+} greater(sk2,appear(efficient_producers,sk1)).
% 0.94/1.13 500 [hyper,451,10] {+} greater_or_equal(sk2,appear(efficient_producers,sk1)).
% 0.94/1.13 532 [hyper,500,14,17,18] {+} greater(cardinality_at_time(efficient_producers,sk2),zero).
% 0.94/1.13 556 [hyper,532,3,17,18,68] {-} subpopulations(first_movers,efficient_producers,sk1,sk2)|cardinality_at_time(first_movers,sk2)=zero.
% 0.94/1.13 561 [hyper,556,2,17,36,37,532,unit_del,15] {-} subpopulations(first_movers,efficient_producers,sk1,sk2).
% 0.94/1.13 562 [hyper,561,13,17,20,19] {+} greater(growth_rate(efficient_producers,sk2),growth_rate(first_movers,sk2)).
% 0.94/1.13 607 [hyper,562,1,17,561] {-} selection_favors(efficient_producers,first_movers,sk2).
% 0.94/1.13 608 [binary,607.1,15.1] {-} $F.
% 0.94/1.13
% 0.94/1.13 % SZS output end Refutation
% 0.94/1.13 ------------ end of proof -------------
% 0.94/1.13
% 0.94/1.13
% 0.94/1.13 Search stopped by max_proofs option.
% 0.94/1.13
% 0.94/1.13
% 0.94/1.13 Search stopped by max_proofs option.
% 0.94/1.13
% 0.94/1.13 ============ end of search ============
% 0.94/1.13
% 0.94/1.13 ----------- soft-scott stats ----------
% 0.94/1.13
% 0.94/1.13 true clauses given 37 (35.2%)
% 0.94/1.13 false clauses given 68
% 0.94/1.13
% 0.94/1.13 FALSE TRUE
% 0.94/1.13 11 0 12
% 0.94/1.13 12 0 1
% 0.94/1.13 13 0 5
% 0.94/1.13 15 1 1
% 0.94/1.13 16 0 31
% 0.94/1.13 17 14 16
% 0.94/1.13 18 46 23
% 0.94/1.13 19 0 16
% 0.94/1.13 20 9 15
% 0.94/1.13 21 180 3
% 0.94/1.13 22 0 11
% 0.94/1.13 23 0 9
% 0.94/1.13 24 8 5
% 0.94/1.13 26 12 0
% 0.94/1.13 27 0 1
% 0.94/1.13 tot: 270 149 (35.6% true)
% 0.94/1.13
% 0.94/1.13
% 0.94/1.13 Model 2 [ 1 -2 207475 ] (0.00 seconds, 250000 Inserts)
% 0.94/1.13
% 0.94/1.13 That finishes the proof of the theorem.
% 0.94/1.13
% 0.94/1.13 Process 15690 finished Thu Jun 9 08:48:58 2022
%------------------------------------------------------------------------------