TSTP Solution File: MGT038+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT038+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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 : 300s
% DateTime : Wed Jul 27 13:06:08 EDT 2022
% Result : Unknown 36.11s 36.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT038+2 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 03:58:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.80/2.00 ----- Otter 3.3f, August 2004 -----
% 1.80/2.00 The process was started by sandbox on n021.cluster.edu,
% 1.80/2.00 Wed Jul 27 03:58:53 2022
% 1.80/2.00 The command was "./otter". The process ID is 1637.
% 1.80/2.00
% 1.80/2.00 set(prolog_style_variables).
% 1.80/2.00 set(auto).
% 1.80/2.00 dependent: set(auto1).
% 1.80/2.00 dependent: set(process_input).
% 1.80/2.00 dependent: clear(print_kept).
% 1.80/2.00 dependent: clear(print_new_demod).
% 1.80/2.00 dependent: clear(print_back_demod).
% 1.80/2.00 dependent: clear(print_back_sub).
% 1.80/2.00 dependent: set(control_memory).
% 1.80/2.00 dependent: assign(max_mem, 12000).
% 1.80/2.00 dependent: assign(pick_given_ratio, 4).
% 1.80/2.00 dependent: assign(stats_level, 1).
% 1.80/2.00 dependent: assign(max_seconds, 10800).
% 1.80/2.00 clear(print_given).
% 1.80/2.00
% 1.80/2.00 formula_list(usable).
% 1.80/2.00 all A (A=A).
% 1.80/2.00 finite_set(first_movers).
% 1.80/2.00 all S To (finite_set(S)&contracts_from(To,S)-> (exists T2 (greater(T2,To)&cardinality_at_time(s,t2)=zero))).
% 1.80/2.00 all E To (environment(E)&stable(E)&in_environment(E,To)& (all T (greater(cardinality_at_time(first_movers,T),zero)&greater_or_e_qual(T,To)->greater(zero,growth_rate(first_movers,T))))->contracts_from(To,first_movers)).
% 1.80/2.00 all E T (environment(E)&in_environment(E,T)&greater(cardinality_at_time(first_movers,T),zero)&greater(cardinality_at_time(efficient_producers,T),zero)->subpopulations(first_movers,efficient_producers,E,T)).
% 1.80/2.00 all E T1 T2 (environment(E)&stable(E)&in_environment(E,T1)&greater(T2,T1)->in_environment(E,T2)).
% 1.80/2.00 all E (environment(E)&stable(E)->in_environment(E,appear(first_movers,E))).
% 1.80/2.00 all E (environment(E)&stable(E)->in_environment(E,appear(efficient_producers,E))).
% 1.80/2.00 all E (environment(E)&stable(E)& (exists T1 (in_environment(E,T1)& (all T (subpopulations(first_movers,efficient_producers,E,T)&greater_or_e_qual(T,T1)->greater(zero,growth_rate(first_movers,T))))))-> (exists T2 (greater(T2,appear(efficient_producers,E))& (all T (subpopulations(first_movers,efficient_producers,E,T)&greater_or_e_qual(T,T2)->greater(zero,growth_rate(first_movers,T))))))).
% 1.80/2.00 all X Y Z (greater(X,Y)&greater(Y,Z)->greater(X,Z)).
% 1.80/2.00 all E T1 T2 (in_environment(E,T1)&in_environment(E,T2)->greater(T2,T1)|T2=T1|greater(T1,T2)).
% 1.80/2.00 all X Y (greater_or_e_qual(X,Y)<->greater(X,Y)|X=Y).
% 1.80/2.00 all E (environment(E)->greater(appear(efficient_producers,e),appear(first_movers,E))).
% 1.80/2.00 all E (environment(E)&stable(E)-> (exists T (in_environment(E,T)&greater_or_e_qual(T,e_quilibrium(E))))).
% 1.80/2.00 all E T (environment(E)&in_environment(E,T)&greater_or_e_qual(T,appear(efficient_producers,E))->greater(cardinality_at_time(efficient_producers,T),zero)).
% 1.80/2.00 all E (environment(E)&stable(E)-> (exists To (in_environment(E,To)& (all T (subpopulations(first_movers,efficient_producers,E,T)&greater_or_e_qual(T,To)->greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T))))))).
% 1.80/2.00 -(all E (environment(E)&stable(E)-> (exists To (in_environment(E,To)&greater(To,appear(first_movers,E))&cardinality_at_time(first_movers,to)=zero)))).
% 1.80/2.00 end_of_list.
% 1.80/2.00
% 1.80/2.00 -------> usable clausifies to:
% 1.80/2.00
% 1.80/2.00 list(usable).
% 1.80/2.00 0 [] A=A.
% 1.80/2.00 0 [] finite_set(first_movers).
% 1.80/2.00 0 [] -finite_set(S)| -contracts_from(To,S)|greater($f1(S,To),To).
% 1.80/2.00 0 [] -finite_set(S)| -contracts_from(To,S)|cardinality_at_time(s,t2)=zero.
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,To)|greater(cardinality_at_time(first_movers,$f2(E,To)),zero)|contracts_from(To,first_movers).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,To)|greater_or_e_qual($f2(E,To),To)|contracts_from(To,first_movers).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,To)| -greater(zero,growth_rate(first_movers,$f2(E,To)))|contracts_from(To,first_movers).
% 1.80/2.00 0 [] -environment(E)| -in_environment(E,T)| -greater(cardinality_at_time(first_movers,T),zero)| -greater(cardinality_at_time(efficient_producers,T),zero)|subpopulations(first_movers,efficient_producers,E,T).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)| -greater(T2,T1)|in_environment(E,T2).
% 1.80/2.00 0 [] -environment(E)| -stable(E)|in_environment(E,appear(first_movers,E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)|in_environment(E,appear(efficient_producers,E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)|subpopulations(first_movers,efficient_producers,E,$f3(E,T1))|greater($f4(E),appear(efficient_producers,E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)|subpopulations(first_movers,efficient_producers,E,$f3(E,T1))| -subpopulations(first_movers,efficient_producers,E,T)| -greater_or_e_qual(T,$f4(E))|greater(zero,growth_rate(first_movers,T)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)|greater_or_e_qual($f3(E,T1),T1)|greater($f4(E),appear(efficient_producers,E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)|greater_or_e_qual($f3(E,T1),T1)| -subpopulations(first_movers,efficient_producers,E,T)| -greater_or_e_qual(T,$f4(E))|greater(zero,growth_rate(first_movers,T)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)| -greater(zero,growth_rate(first_movers,$f3(E,T1)))|greater($f4(E),appear(efficient_producers,E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -in_environment(E,T1)| -greater(zero,growth_rate(first_movers,$f3(E,T1)))| -subpopulations(first_movers,efficient_producers,E,T)| -greater_or_e_qual(T,$f4(E))|greater(zero,growth_rate(first_movers,T)).
% 1.80/2.00 0 [] -greater(X,Y)| -greater(Y,Z)|greater(X,Z).
% 1.80/2.00 0 [] -in_environment(E,T1)| -in_environment(E,T2)|greater(T2,T1)|T2=T1|greater(T1,T2).
% 1.80/2.00 0 [] -greater_or_e_qual(X,Y)|greater(X,Y)|X=Y.
% 1.80/2.00 0 [] greater_or_e_qual(X,Y)| -greater(X,Y).
% 1.80/2.00 0 [] greater_or_e_qual(X,Y)|X!=Y.
% 1.80/2.00 0 [] -environment(E)|greater(appear(efficient_producers,e),appear(first_movers,E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)|in_environment(E,$f5(E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)|greater_or_e_qual($f5(E),e_quilibrium(E)).
% 1.80/2.00 0 [] -environment(E)| -in_environment(E,T)| -greater_or_e_qual(T,appear(efficient_producers,E))|greater(cardinality_at_time(efficient_producers,T),zero).
% 1.80/2.00 0 [] -environment(E)| -stable(E)|in_environment(E,$f6(E)).
% 1.80/2.00 0 [] -environment(E)| -stable(E)| -subpopulations(first_movers,efficient_producers,E,T)| -greater_or_e_qual(T,$f6(E))|greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)).
% 1.80/2.00 0 [] environment($c1).
% 1.80/2.00 0 [] stable($c1).
% 1.80/2.00 0 [] -in_environment($c1,To)| -greater(To,appear(first_movers,$c1))|cardinality_at_time(first_movers,to)!=zero.
% 1.80/2.00 end_of_list.
% 1.80/2.00
% 1.80/2.00 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.80/2.00
% 1.80/2.00 This ia a non-Horn set with equality. The strategy will be
% 1.80/2.00 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.80/2.00 deletion, with positive clauses in sos and nonpositive
% 1.80/2.00 clauses in usable.
% 1.80/2.00
% 1.80/2.00 dependent: set(knuth_bendix).
% 1.80/2.00 dependent: set(anl_eq).
% 1.80/2.00 dependent: set(para_from).
% 1.80/2.00 dependent: set(para_into).
% 1.80/2.00 dependent: clear(para_from_right).
% 1.80/2.00 dependent: clear(para_into_right).
% 1.80/2.00 dependent: set(para_from_vars).
% 1.80/2.00 dependent: set(eq_units_both_ways).
% 1.80/2.00 dependent: set(dynamic_demod_all).
% 1.80/2.00 dependent: set(dynamic_demod).
% 1.80/2.00 dependent: set(order_eq).
% 1.80/2.00 dependent: set(back_demod).
% 1.80/2.00 dependent: set(lrpo).
% 1.80/2.00 dependent: set(hyper_res).
% 1.80/2.00 dependent: set(unit_deletion).
% 1.80/2.00 dependent: set(factor).
% 1.80/2.00
% 1.80/2.00 ------------> process usable:
% 1.80/2.00 ** KEPT (pick-wt=10): 1 [] -finite_set(A)| -contracts_from(B,A)|greater($f1(A,B),B).
% 1.80/2.00 ** KEPT (pick-wt=10): 2 [] -finite_set(A)| -contracts_from(B,A)|cardinality_at_time(s,t2)=zero.
% 1.80/2.00 ** KEPT (pick-wt=17): 3 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater(cardinality_at_time(first_movers,$f2(A,B)),zero)|contracts_from(B,first_movers).
% 1.80/2.00 ** KEPT (pick-wt=15): 4 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater_or_e_qual($f2(A,B),B)|contracts_from(B,first_movers).
% 1.80/2.00 ** KEPT (pick-wt=17): 5 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(zero,growth_rate(first_movers,$f2(A,B)))|contracts_from(B,first_movers).
% 1.80/2.00 ** KEPT (pick-wt=20): 6 [] -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).
% 1.80/2.00 ** KEPT (pick-wt=13): 7 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(C,B)|in_environment(A,C).
% 1.80/2.00 ** KEPT (pick-wt=9): 8 [] -environment(A)| -stable(A)|in_environment(A,appear(first_movers,A)).
% 1.80/2.00 ** KEPT (pick-wt=9): 9 [] -environment(A)| -stable(A)|in_environment(A,appear(efficient_producers,A)).
% 1.80/2.00 ** KEPT (pick-wt=20): 10 [] -environment(A)| -stable(A)| -in_environment(A,B)|subpopulations(first_movers,efficient_producers,A,$f3(A,B))|greater($f4(A),appear(efficient_producers,A)).
% 36.11/36.30 ** KEPT (pick-wt=28): 11 [] -environment(A)| -stable(A)| -in_environment(A,B)|subpopulations(first_movers,efficient_producers,A,$f3(A,B))| -subpopulations(first_movers,efficient_producers,A,C)| -greater_or_e_qual(C,$f4(A))|greater(zero,growth_rate(first_movers,C)).
% 36.11/36.30 ** KEPT (pick-wt=18): 12 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater_or_e_qual($f3(A,B),B)|greater($f4(A),appear(efficient_producers,A)).
% 36.11/36.30 ** KEPT (pick-wt=26): 13 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater_or_e_qual($f3(A,B),B)| -subpopulations(first_movers,efficient_producers,A,C)| -greater_or_e_qual(C,$f4(A))|greater(zero,growth_rate(first_movers,C)).
% 36.11/36.30 ** KEPT (pick-wt=20): 14 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(zero,growth_rate(first_movers,$f3(A,B)))|greater($f4(A),appear(efficient_producers,A)).
% 36.11/36.30 ** KEPT (pick-wt=28): 15 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(zero,growth_rate(first_movers,$f3(A,B)))| -subpopulations(first_movers,efficient_producers,A,C)| -greater_or_e_qual(C,$f4(A))|greater(zero,growth_rate(first_movers,C)).
% 36.11/36.30 ** KEPT (pick-wt=9): 16 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 36.11/36.30 ** KEPT (pick-wt=15): 17 [] -in_environment(A,B)| -in_environment(A,C)|greater(C,B)|C=B|greater(B,C).
% 36.11/36.30 ** KEPT (pick-wt=9): 18 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 36.11/36.30 ** KEPT (pick-wt=6): 19 [] greater_or_e_qual(A,B)| -greater(A,B).
% 36.11/36.30 ** KEPT (pick-wt=6): 20 [] greater_or_e_qual(A,B)|A!=B.
% 36.11/36.30 ** KEPT (pick-wt=9): 21 [] -environment(A)|greater(appear(efficient_producers,e),appear(first_movers,A)).
% 36.11/36.30 ** KEPT (pick-wt=8): 22 [] -environment(A)| -stable(A)|in_environment(A,$f5(A)).
% 36.11/36.30 ** KEPT (pick-wt=9): 23 [] -environment(A)| -stable(A)|greater_or_e_qual($f5(A),e_quilibrium(A)).
% 36.11/36.30 ** KEPT (pick-wt=15): 24 [] -environment(A)| -in_environment(A,B)| -greater_or_e_qual(B,appear(efficient_producers,A))|greater(cardinality_at_time(efficient_producers,B),zero).
% 36.11/36.30 ** KEPT (pick-wt=8): 25 [] -environment(A)| -stable(A)|in_environment(A,$f6(A)).
% 36.11/36.30 ** KEPT (pick-wt=20): 26 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,$f6(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 36.11/36.30 ** KEPT (pick-wt=13): 27 [] -in_environment($c1,A)| -greater(A,appear(first_movers,$c1))|cardinality_at_time(first_movers,to)!=zero.
% 36.11/36.30
% 36.11/36.30 ------------> process sos:
% 36.11/36.30 ** KEPT (pick-wt=3): 29 [] A=A.
% 36.11/36.30 ** KEPT (pick-wt=2): 30 [] finite_set(first_movers).
% 36.11/36.30 ** KEPT (pick-wt=2): 31 [] environment($c1).
% 36.11/36.30 ** KEPT (pick-wt=2): 32 [] stable($c1).
% 36.11/36.30 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] A=A.
% 36.11/36.30 29 back subsumes 28.
% 36.11/36.30
% 36.11/36.30 ======= end of input processing =======
% 36.11/36.30
% 36.11/36.30 =========== start of search ===========
% 36.11/36.30
% 36.11/36.30
% 36.11/36.30 Resetting weight limit to 17.
% 36.11/36.30
% 36.11/36.30
% 36.11/36.30 Resetting weight limit to 17.
% 36.11/36.30
% 36.11/36.30 sos_size=2246
% 36.11/36.30
% 36.11/36.30 Search stopped because sos empty.
% 36.11/36.30
% 36.11/36.30
% 36.11/36.30 Search stopped because sos empty.
% 36.11/36.30
% 36.11/36.30 ============ end of search ============
% 36.11/36.30
% 36.11/36.30 -------------- statistics -------------
% 36.11/36.30 clauses given 2458
% 36.11/36.30 clauses generated 605958
% 36.11/36.30 clauses kept 2507
% 36.11/36.30 clauses forward subsumed 6158
% 36.11/36.30 clauses back subsumed 33
% 36.11/36.30 Kbytes malloced 5859
% 36.11/36.30
% 36.11/36.30 ----------- times (seconds) -----------
% 36.11/36.30 user CPU time 34.30 (0 hr, 0 min, 34 sec)
% 36.11/36.30 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 36.11/36.30 wall-clock time 36 (0 hr, 0 min, 36 sec)
% 36.11/36.30
% 36.11/36.30 Process 1637 finished Wed Jul 27 03:59:29 2022
% 36.11/36.30 Otter interrupted
% 36.11/36.30 PROOF NOT FOUND
%------------------------------------------------------------------------------