TSTP Solution File: MGT040+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT040+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:09 EDT 2022
% Result : Unknown 26.46s 26.64s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT040+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:10:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.17 ----- Otter 3.3f, August 2004 -----
% 1.96/2.17 The process was started by sandbox on n025.cluster.edu,
% 1.96/2.17 Wed Jul 27 04:10:45 2022
% 1.96/2.17 The command was "./otter". The process ID is 29634.
% 1.96/2.17
% 1.96/2.17 set(prolog_style_variables).
% 1.96/2.17 set(auto).
% 1.96/2.17 dependent: set(auto1).
% 1.96/2.17 dependent: set(process_input).
% 1.96/2.17 dependent: clear(print_kept).
% 1.96/2.17 dependent: clear(print_new_demod).
% 1.96/2.17 dependent: clear(print_back_demod).
% 1.96/2.17 dependent: clear(print_back_sub).
% 1.96/2.17 dependent: set(control_memory).
% 1.96/2.17 dependent: assign(max_mem, 12000).
% 1.96/2.17 dependent: assign(pick_given_ratio, 4).
% 1.96/2.17 dependent: assign(stats_level, 1).
% 1.96/2.17 dependent: assign(max_seconds, 10800).
% 1.96/2.17 clear(print_given).
% 1.96/2.17
% 1.96/2.17 formula_list(usable).
% 1.96/2.17 all A (A=A).
% 1.96/2.17 all P (observational_period(P)&propagation_strategy(first_movers)&propagation_strategy(efficient_producers)& (all E (environment(E)&in_environment(P,E)->selection_favors(efficient_producers,first_movers,end_time(E))))->selection_favors(efficient_producers,first_movers,P)).
% 1.96/2.17 all P (observational_period(P)&rapid_change(P)-> (all E (environment(E)&in_environment(P,E)-> -in_environment(E,critical_point(E))))).
% 1.96/2.17 all P (observational_period(P)& -extreme(P)-> (all E (environment(E)&in_environment(P,E)-> -empty(E)))).
% 1.96/2.17 propagation_strategy(first_movers).
% 1.96/2.17 propagation_strategy(efficient_producers).
% 1.96/2.17 all E (environment(E)->in_environment(E,end_time(E))).
% 1.96/2.17 all E (environment(E)& -in_environment(E,critical_point(E))->greater(critical_point(E),end_time(E))).
% 1.96/2.17 all E (environment(E)& -empty(E)->greater_or_e_qual(end_time(E),appear(an_organisation,E))).
% 1.96/2.17 all E T (environment(E)&greater_or_e_qual(T,appear(efficient_producers,E))&greater(critical_point(E),T)& (in_environment(E,critical_point(E))->selection_favors(first_movers,efficient_producers,T))-> (-in_environment(E,critical_point(E))->selection_favors(first_movers,efficient_producers,end_time(E)))).
% 1.96/2.17 all X Y (greater_or_e_qual(X,Y)->greater(X,Y)|X=Y).
% 1.96/2.17 all E T (in_environment(E,T)& -greater(appear(efficient_producers,E),T)->greater_or_e_qual(T,appear(efficient_producers,E))).
% 1.96/2.17 all E T (environment(E)&in_environment(E,T)&greater_or_e_qual(T,appear(first_movers,E))&greater(appear(efficient_producers,E),T)->selection_favors(first_movers,efficient_producers,T)).
% 1.96/2.17 all E T (environment(E)&in_environment(E,critical_point(E))&greater_or_e_qual(T,appear(efficient_producers,E))&greater(critical_point(E),T)->selection_favors(first_movers,efficient_producers,T)).
% 1.96/2.17 -(all P (observational_period(P)&rapid_change(P)& -extreme(P)->selection_favors(first_movers,efficient_producers,P))).
% 1.96/2.17 end_of_list.
% 1.96/2.17
% 1.96/2.17 -------> usable clausifies to:
% 1.96/2.17
% 1.96/2.17 list(usable).
% 1.96/2.17 0 [] A=A.
% 1.96/2.17 0 [] -observational_period(P)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|environment($f1(P))|selection_favors(efficient_producers,first_movers,P).
% 1.96/2.17 0 [] -observational_period(P)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|in_environment(P,$f1(P))|selection_favors(efficient_producers,first_movers,P).
% 1.96/2.17 0 [] -observational_period(P)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)| -selection_favors(efficient_producers,first_movers,end_time($f1(P)))|selection_favors(efficient_producers,first_movers,P).
% 1.96/2.17 0 [] -observational_period(P)| -rapid_change(P)| -environment(E)| -in_environment(P,E)| -in_environment(E,critical_point(E)).
% 1.96/2.17 0 [] -observational_period(P)|extreme(P)| -environment(E)| -in_environment(P,E)| -empty(E).
% 1.96/2.17 0 [] propagation_strategy(first_movers).
% 1.96/2.17 0 [] propagation_strategy(efficient_producers).
% 1.96/2.17 0 [] -environment(E)|in_environment(E,end_time(E)).
% 1.96/2.17 0 [] -environment(E)|in_environment(E,critical_point(E))|greater(critical_point(E),end_time(E)).
% 1.96/2.17 0 [] -environment(E)|empty(E)|greater_or_e_qual(end_time(E),appear(an_organisation,E)).
% 1.96/2.17 0 [] -environment(E)| -greater_or_e_qual(T,appear(efficient_producers,E))| -greater(critical_point(E),T)|in_environment(E,critical_point(E))|selection_favors(first_movers,efficient_producers,end_time(E)).
% 1.96/2.17 0 [] -greater_or_e_qual(X,Y)|greater(X,Y)|X=Y.
% 1.96/2.17 0 [] -in_environment(E,T)|greater(appear(efficient_producers,E),T)|greater_or_e_qual(T,appear(efficient_producers,E)).
% 1.96/2.17 0 [] -environment(E)| -in_environment(E,T)| -greater_or_e_qual(T,appear(first_movers,E))| -greater(appear(efficient_producers,E),T)|selection_favors(first_movers,efficient_producers,T).
% 5.45/5.68 0 [] -environment(E)| -in_environment(E,critical_point(E))| -greater_or_e_qual(T,appear(efficient_producers,E))| -greater(critical_point(E),T)|selection_favors(first_movers,efficient_producers,T).
% 5.45/5.68 0 [] observational_period($c1).
% 5.45/5.68 0 [] rapid_change($c1).
% 5.45/5.68 0 [] -extreme($c1).
% 5.45/5.68 0 [] -selection_favors(first_movers,efficient_producers,$c1).
% 5.45/5.68 end_of_list.
% 5.45/5.68
% 5.45/5.68 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 5.45/5.68
% 5.45/5.68 This ia a non-Horn set with equality. The strategy will be
% 5.45/5.68 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 5.45/5.68 deletion, with positive clauses in sos and nonpositive
% 5.45/5.68 clauses in usable.
% 5.45/5.68
% 5.45/5.68 dependent: set(knuth_bendix).
% 5.45/5.68 dependent: set(anl_eq).
% 5.45/5.68 dependent: set(para_from).
% 5.45/5.68 dependent: set(para_into).
% 5.45/5.68 dependent: clear(para_from_right).
% 5.45/5.68 dependent: clear(para_into_right).
% 5.45/5.68 dependent: set(para_from_vars).
% 5.45/5.68 dependent: set(eq_units_both_ways).
% 5.45/5.68 dependent: set(dynamic_demod_all).
% 5.45/5.68 dependent: set(dynamic_demod).
% 5.45/5.68 dependent: set(order_eq).
% 5.45/5.68 dependent: set(back_demod).
% 5.45/5.68 dependent: set(lrpo).
% 5.45/5.68 dependent: set(hyper_res).
% 5.45/5.68 dependent: set(unit_deletion).
% 5.45/5.68 dependent: set(factor).
% 5.45/5.68
% 5.45/5.68 ------------> process usable:
% 5.45/5.68 ** KEPT (pick-wt=13): 1 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|environment($f1(A))|selection_favors(efficient_producers,first_movers,A).
% 5.45/5.68 ** KEPT (pick-wt=14): 2 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|in_environment(A,$f1(A))|selection_favors(efficient_producers,first_movers,A).
% 5.45/5.68 ** KEPT (pick-wt=16): 3 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)| -selection_favors(efficient_producers,first_movers,end_time($f1(A)))|selection_favors(efficient_producers,first_movers,A).
% 5.45/5.68 ** KEPT (pick-wt=13): 4 [] -observational_period(A)| -rapid_change(A)| -environment(B)| -in_environment(A,B)| -in_environment(B,critical_point(B)).
% 5.45/5.68 ** KEPT (pick-wt=11): 5 [] -observational_period(A)|extreme(A)| -environment(B)| -in_environment(A,B)| -empty(B).
% 5.45/5.68 ** KEPT (pick-wt=6): 6 [] -environment(A)|in_environment(A,end_time(A)).
% 5.45/5.68 ** KEPT (pick-wt=11): 7 [] -environment(A)|in_environment(A,critical_point(A))|greater(critical_point(A),end_time(A)).
% 5.45/5.68 ** KEPT (pick-wt=10): 8 [] -environment(A)|empty(A)|greater_or_e_qual(end_time(A),appear(an_organisation,A)).
% 5.45/5.68 ** KEPT (pick-wt=20): 9 [] -environment(A)| -greater_or_e_qual(B,appear(efficient_producers,A))| -greater(critical_point(A),B)|in_environment(A,critical_point(A))|selection_favors(first_movers,efficient_producers,end_time(A)).
% 5.45/5.68 ** KEPT (pick-wt=9): 10 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 5.45/5.68 ** KEPT (pick-wt=13): 11 [] -in_environment(A,B)|greater(appear(efficient_producers,A),B)|greater_or_e_qual(B,appear(efficient_producers,A)).
% 5.45/5.68 ** KEPT (pick-wt=19): 12 [] -environment(A)| -in_environment(A,B)| -greater_or_e_qual(B,appear(first_movers,A))| -greater(appear(efficient_producers,A),B)|selection_favors(first_movers,efficient_producers,B).
% 5.45/5.68 ** KEPT (pick-wt=19): 13 [] -environment(A)| -in_environment(A,critical_point(A))| -greater_or_e_qual(B,appear(efficient_producers,A))| -greater(critical_point(A),B)|selection_favors(first_movers,efficient_producers,B).
% 5.45/5.68 ** KEPT (pick-wt=2): 14 [] -extreme($c1).
% 5.45/5.68 ** KEPT (pick-wt=4): 15 [] -selection_favors(first_movers,efficient_producers,$c1).
% 5.45/5.68
% 5.45/5.68 ------------> process sos:
% 5.45/5.68 ** KEPT (pick-wt=3): 16 [] A=A.
% 5.45/5.68 ** KEPT (pick-wt=2): 17 [] propagation_strategy(first_movers).
% 5.45/5.68 ** KEPT (pick-wt=2): 18 [] propagation_strategy(efficient_producers).
% 5.45/5.68 ** KEPT (pick-wt=2): 19 [] observational_period($c1).
% 5.45/5.68 ** KEPT (pick-wt=2): 20 [] rapid_change($c1).
% 5.45/5.68 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 5.45/5.68
% 5.45/5.68 ======= end of input processing =======
% 5.45/5.68
% 5.45/5.68 =========== start of search ===========
% 5.45/5.68
% 5.45/5.68
% 5.45/5.68 Resetting weight limit to 22.
% 5.45/5.68
% 5.45/5.68
% 5.45/5.68 Resetting weight limit to 22.
% 5.45/5.68
% 5.45/5.68 sos_size=2671
% 26.46/26.64
% 26.46/26.64 Search stopped because sos empty.
% 26.46/26.64
% 26.46/26.64
% 26.46/26.64 Search stopped because sos empty.
% 26.46/26.64
% 26.46/26.64 ============ end of search ============
% 26.46/26.64
% 26.46/26.64 -------------- statistics -------------
% 26.46/26.64 clauses given 3079
% 26.46/26.64 clauses generated 307572
% 26.46/26.64 clauses kept 3337
% 26.46/26.64 clauses forward subsumed 7525
% 26.46/26.64 clauses back subsumed 277
% 26.46/26.64 Kbytes malloced 4882
% 26.46/26.64
% 26.46/26.64 ----------- times (seconds) -----------
% 26.46/26.64 user CPU time 24.47 (0 hr, 0 min, 24 sec)
% 26.46/26.64 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 26.46/26.64 wall-clock time 26 (0 hr, 0 min, 26 sec)
% 26.46/26.64
% 26.46/26.64 Process 29634 finished Wed Jul 27 04:11:11 2022
% 26.46/26.64 Otter interrupted
% 26.46/26.64 PROOF NOT FOUND
%------------------------------------------------------------------------------