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.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.75s 0.96s
% Output : Refutation 0.75s
% 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.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.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 09:40:04 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 n024.cluster.edu,
% 0.13/0.36 Thu Jun 9 09:40:04 2022
% 0.13/0.36 The command was "./sos". The process ID is 20631.
% 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 formula_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.75/0.96
% 0.75/0.96 -------- PROOF --------
% 0.75/0.96 % SZS status Theorem
% 0.75/0.96 % SZS output start Refutation
% 0.75/0.96
% 0.75/0.96 Stopped by limit on insertions
% 0.75/0.96
% 0.75/0.96 Stopped by limit on insertions
% 0.75/0.96
% 0.75/0.96 ----> UNIT CONFLICT at 0.58 sec ----> 919 [binary,918.1,14.1] {-} $F.
% 0.75/0.96
% 0.75/0.96 Length of proof is 11. Level of proof is 8.
% 0.75/0.96
% 0.75/0.96 ---------------- PROOF ----------------
% 0.75/0.96 % SZS status Theorem
% 0.75/0.96 % SZS output start Refutation
% 0.75/0.96
% 0.75/0.96 1 [] {+} -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|subpopulations(first_movers,efficient_producers,A,$f1(A,B))|B=critical_point(A).
% 0.75/0.96 2 [] {+} -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|greater($f1(A,B),B)|B=critical_point(A).
% 0.75/0.96 3 [] {+} -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)| -greater(growth_rate(efficient_producers,$f1(A,B)),growth_rate(first_movers,$f1(A,B)))|B=critical_point(A).
% 0.75/0.96 4 [] {+} -environment(A)| -stable(A)|in_environment(A,$f2(A)).
% 0.75/0.96 5 [] {+} -environment(A)| -stable(A)| -greater(growth_rate(efficient_producers,$f2(A)),growth_rate(first_movers,$f2(A))).
% 0.75/0.96 6 [] {+} -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater(B,$f2(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 0.75/0.96 7 [] {+} -in_environment($c1,critical_point($c1)).
% 0.75/0.96 8 [] {+} environment($c1).
% 0.75/0.96 9 [] {-} stable($c1).
% 0.75/0.96 14 [hyper,9,4,8] {+} in_environment($c1,$f2($c1)).
% 0.75/0.96 18 [hyper,14,2,8,flip.3] {+} greater(growth_rate(efficient_producers,$f2($c1)),growth_rate(first_movers,$f2($c1)))|greater($f1($c1,$f2($c1)),$f2($c1))|critical_point($c1)=$f2($c1).
% 0.75/0.96 19 [hyper,14,1,8,flip.3] {+} greater(growth_rate(efficient_producers,$f2($c1)),growth_rate(first_movers,$f2($c1)))|subpopulations(first_movers,efficient_producers,$c1,$f1($c1,$f2($c1)))|critical_point($c1)=$f2($c1).
% 0.75/0.96 181 [hyper,18,5,8,9] {-} greater($f1($c1,$f2($c1)),$f2($c1))|critical_point($c1)=$f2($c1).
% 0.75/0.96 209 [para_from,181.2.1,7.1.2,unit_del,14] {-} greater($f1($c1,$f2($c1)),$f2($c1)).
% 0.75/0.96 330 [hyper,19,5,8,9] {-} subpopulations(first_movers,efficient_producers,$c1,$f1($c1,$f2($c1)))|critical_point($c1)=$f2($c1).
% 0.75/0.96 363 [para_from,330.2.1,7.1.2,unit_del,14] {-} subpopulations(first_movers,efficient_producers,$c1,$f1($c1,$f2($c1))).
% 0.75/0.96 364 [hyper,363,6,8,9,209] {+} greater(growth_rate(efficient_producers,$f1($c1,$f2($c1))),growth_rate(first_movers,$f1($c1,$f2($c1)))).
% 0.75/0.96 451 [hyper,364,3,8,14,flip.2] {+} greater(growth_rate(efficient_producers,$f2($c1)),growth_rate(first_movers,$f2($c1)))|critical_point($c1)=$f2($c1).
% 0.75/0.96 917,916 [hyper,451,5,8,9] {-} critical_point($c1)=$f2($c1).
% 0.75/0.96 918 [back_demod,7,demod,917] {-} -in_environment($c1,$f2($c1)).
% 0.75/0.96 919 [binary,918.1,14.1] {-} $F.
% 0.75/0.96
% 0.75/0.96 % SZS output end Refutation
% 0.75/0.96 ------------ end of proof -------------
% 0.75/0.96
% 0.75/0.96
% 0.75/0.96 Search stopped by max_proofs option.
% 0.75/0.96
% 0.75/0.96
% 0.75/0.96 Search stopped by max_proofs option.
% 0.75/0.96
% 0.75/0.96 ============ end of search ============
% 0.75/0.96
% 0.75/0.96 ----------- soft-scott stats ----------
% 0.75/0.96
% 0.75/0.96 true clauses given 14 (56.0%)
% 0.75/0.96 false clauses given 11
% 0.75/0.96
% 0.75/0.96 FALSE TRUE
% 0.75/0.96 22 0 2
% 0.75/0.96 24 0 2
% 0.75/0.96 25 0 3
% 0.75/0.96 26 0 5
% 0.75/0.96 27 0 4
% 0.75/0.96 28 0 5
% 0.75/0.96 29 0 3
% 0.75/0.96 30 0 3
% 0.75/0.96 31 0 16
% 0.75/0.96 32 0 6
% 0.75/0.96 33 0 16
% 0.75/0.96 35 0 8
% 0.75/0.96 36 0 7
% 0.75/0.96 37 0 18
% 0.75/0.96 38 2 16
% 0.75/0.96 39 7 14
% 0.75/0.96 40 0 20
% 0.75/0.96 41 3 6
% 0.75/0.96 42 0 27
% 0.75/0.96 43 0 11
% 0.75/0.96 44 0 62
% 0.75/0.96 45 0 9
% 0.75/0.96 46 2 66
% 0.75/0.96 47 0 1
% 0.75/0.96 48 12 44
% 0.75/0.96 49 5 5
% 0.75/0.96 50 20 54
% 0.75/0.96 51 5 5
% 0.75/0.96 52 8 51
% 0.75/0.96 53 0 30
% 0.75/0.96 54 4 47
% 0.75/0.96 55 0 49
% 0.75/0.96 56 0 34
% 0.75/0.96 57 0 23
% 0.75/0.96 58 0 41
% 0.75/0.96 59 6 3
% 0.75/0.96 60 9 17
% 0.75/0.96 tot: 83 733 (89.8% true)
% 0.75/0.96
% 0.75/0.96
% 0.75/0.96 Model 1 (0.00 seconds, 0 Inserts)
% 0.75/0.96
% 0.75/0.96 That finishes the proof of the theorem.
% 0.75/0.96
% 0.75/0.96 Process 20631 finished Thu Jun 9 09:40:05 2022
%------------------------------------------------------------------------------