TSTP Solution File: MGT023-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT023-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:25:51 EDT 2022
% Result : Unsatisfiable 0.85s 1.03s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT023-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 10:39:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n026.cluster.edu,
% 0.13/0.36 Thu Jun 9 10:39:02 2022
% 0.13/0.36 The command was "./sos". The process ID is 583.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 7
% 0.13/0.38 number of clauses initially in problem: 10
% 0.13/0.38 percentage of clauses intially in UL: 70
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 90
% 0.13/0.38 absolute distinct symbol count: 13
% 0.13/0.38 distinct predicate count: 6
% 0.13/0.38 distinct function count: 4
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.85/1.03
% 0.85/1.03 -------- PROOF --------
% 0.85/1.03 % SZS status Unsatisfiable
% 0.85/1.03 % SZS output start Refutation
% 0.85/1.03
% 0.85/1.03 Stopped by limit on insertions
% 0.85/1.03
% 0.85/1.03 ----> UNIT CONFLICT at 0.65 sec ----> 1217 [binary,1216.1,7.1] {-} $F.
% 0.85/1.03
% 0.85/1.03 Length of proof is 11. Level of proof is 8.
% 0.85/1.03
% 0.85/1.03 ---------------- PROOF ----------------
% 0.85/1.03 % SZS status Unsatisfiable
% 0.85/1.03 % SZS output start Refutation
% 0.85/1.03
% 0.85/1.03 1 [] {+} -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|subpopulations(first_movers,efficient_producers,A,sk1(B,A))|B=critical_point(A).
% 0.85/1.03 2 [] {+} -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|greater(sk1(B,A),B)|B=critical_point(A).
% 0.85/1.03 3 [] {+} -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)| -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A)))|B=critical_point(A).
% 0.85/1.03 4 [] {+} -environment(A)| -stable(A)|in_environment(A,sk2(A)).
% 0.85/1.03 5 [] {+} -environment(A)| -stable(A)| -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))).
% 0.85/1.03 6 [] {+} -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater(B,sk2(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 0.85/1.03 7 [] {+} -in_environment(sk3,critical_point(sk3)).
% 0.85/1.03 8 [] {+} environment(sk3).
% 0.85/1.03 9 [] {-} stable(sk3).
% 0.85/1.03 14 [hyper,9,4,8] {+} in_environment(sk3,sk2(sk3)).
% 0.85/1.03 18 [hyper,14,2,8] {+} greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))|greater(sk1(sk2(sk3),sk3),sk2(sk3))|sk2(sk3)=critical_point(sk3).
% 0.85/1.03 19 [hyper,14,1,8] {+} greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))|subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3))|sk2(sk3)=critical_point(sk3).
% 0.85/1.03 181 [hyper,18,5,8,9] {+} greater(sk1(sk2(sk3),sk3),sk2(sk3))|sk2(sk3)=critical_point(sk3).
% 0.85/1.03 206 [para_from,181.2.1,14.1.2,unit_del,7] {+} greater(sk1(sk2(sk3),sk3),sk2(sk3)).
% 0.85/1.03 327 [hyper,19,5,8,9] {+} subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3))|sk2(sk3)=critical_point(sk3).
% 0.85/1.03 357 [para_from,327.2.1,14.1.2,unit_del,7] {+} subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)).
% 0.85/1.03 358 [hyper,357,6,8,9,206] {-} greater(growth_rate(efficient_producers,sk1(sk2(sk3),sk3)),growth_rate(first_movers,sk1(sk2(sk3),sk3))).
% 0.85/1.03 445 [hyper,358,3,8,14] {+} greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))|sk2(sk3)=critical_point(sk3).
% 0.85/1.03 816,815 [hyper,445,5,8,9] {-} sk2(sk3)=critical_point(sk3).
% 0.85/1.03 1216 [back_demod,14,demod,816] {-} in_environment(sk3,critical_point(sk3)).
% 0.85/1.03 1217 [binary,1216.1,7.1] {-} $F.
% 0.85/1.03
% 0.85/1.03 % SZS output end Refutation
% 0.85/1.03 ------------ end of proof -------------
% 0.85/1.03
% 0.85/1.03
% 0.85/1.03 Search stopped by max_proofs option.
% 0.85/1.03
% 0.85/1.03
% 0.85/1.03 Search stopped by max_proofs option.
% 0.85/1.03
% 0.85/1.03 ============ end of search ============
% 0.85/1.03
% 0.85/1.03 ----------- soft-scott stats ----------
% 0.85/1.03
% 0.85/1.03 true clauses given 17 (68.0%)
% 0.85/1.03 false clauses given 8
% 0.85/1.03
% 0.85/1.03 FALSE TRUE
% 0.85/1.03 22 0 2
% 0.85/1.03 24 0 2
% 0.85/1.03 25 0 3
% 0.85/1.03 26 0 6
% 0.85/1.03 27 0 4
% 0.85/1.03 28 0 6
% 0.85/1.03 29 0 3
% 0.85/1.03 30 0 3
% 0.85/1.03 31 0 15
% 0.85/1.03 32 0 6
% 0.85/1.03 33 0 15
% 0.85/1.03 35 0 8
% 0.85/1.03 36 0 7
% 0.85/1.03 37 0 18
% 0.85/1.03 38 0 16
% 0.85/1.03 39 0 14
% 0.85/1.03 40 0 20
% 0.85/1.03 41 0 6
% 0.85/1.03 42 0 22
% 0.85/1.03 43 2 8
% 0.85/1.03 44 7 46
% 0.85/1.03 45 0 6
% 0.85/1.03 46 3 48
% 0.85/1.03 47 0 6
% 0.85/1.03 48 1 33
% 0.85/1.03 49 0 22
% 0.85/1.03 50 0 41
% 0.85/1.03 51 3 25
% 0.85/1.03 52 0 42
% 0.85/1.03 53 12 17
% 0.85/1.03 54 5 21
% 0.85/1.03 55 20 19
% 0.85/1.03 56 5 16
% 0.85/1.03 57 8 15
% 0.85/1.03 58 0 58
% 0.85/1.03 59 4 20
% 0.85/1.03 60 0 32
% 0.85/1.03 tot: 70 651 (90.3% true)
% 0.85/1.03
% 0.85/1.03
% 0.85/1.03 Model 1 (0.00 seconds, 0 Inserts)
% 0.85/1.03
% 0.85/1.03 That finishes the proof of the theorem.
% 0.85/1.03
% 0.85/1.03 Process 583 finished Thu Jun 9 10:39:03 2022
%------------------------------------------------------------------------------