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