TSTP Solution File: MGT005+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT005+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:05:56 EDT 2022
% Result : Timeout 299.84s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT005+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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:21:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.75/1.94 ----- Otter 3.3f, August 2004 -----
% 1.75/1.94 The process was started by sandbox on n016.cluster.edu,
% 1.75/1.94 Wed Jul 27 04:21:22 2022
% 1.75/1.94 The command was "./otter". The process ID is 21636.
% 1.75/1.94
% 1.75/1.94 set(prolog_style_variables).
% 1.75/1.94 set(auto).
% 1.75/1.94 dependent: set(auto1).
% 1.75/1.94 dependent: set(process_input).
% 1.75/1.94 dependent: clear(print_kept).
% 1.75/1.94 dependent: clear(print_new_demod).
% 1.75/1.94 dependent: clear(print_back_demod).
% 1.75/1.94 dependent: clear(print_back_sub).
% 1.75/1.94 dependent: set(control_memory).
% 1.75/1.94 dependent: assign(max_mem, 12000).
% 1.75/1.94 dependent: assign(pick_given_ratio, 4).
% 1.75/1.94 dependent: assign(stats_level, 1).
% 1.75/1.94 dependent: assign(max_seconds, 10800).
% 1.75/1.94 clear(print_given).
% 1.75/1.94
% 1.75/1.94 formula_list(usable).
% 1.75/1.94 all A (A=A).
% 1.75/1.94 all X Y (-(greater(X,Y)&X=Y)).
% 1.75/1.94 all X Y (-(greater(X,Y)&greater(Y,X))).
% 1.75/1.94 all X Y Z (greater(X,Y)&greater(Y,Z)->greater(X,Z)).
% 1.75/1.94 all X T (organization(X,T)-> (exists P survival_chance(X,P,T))).
% 1.75/1.94 all X T T1 T2 (organization(X,T1)&organization(X,T2)&greater(T,T1)&greater(T2,T)->organization(X,T)).
% 1.75/1.94 all X Ta Tb (reorganization(X,Ta,Tb)->greater(Tb,Ta)).
% 1.75/1.94 all X P1 P2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&survival_chance(X,P1,T1)&survival_chance(X,P2,T2)&greater(T2,T1)->greater(P2,P1)).
% 1.75/1.94 all X P1 P2 T1 T2 Ta Tb (organization(X,T1)&organization(X,T2)&reorganization(X,Ta,Tb)&survival_chance(X,P1,T1)&survival_chance(X,P2,T2)& -greater(Ta,T1)&greater(T2,T1)& -greater(T2,Tb)->greater(P1,P2)).
% 1.75/1.94 all X Y Re C C1 C2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)&organization(Y,Tc)&class(X,C,Ta)&class(Y,C,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Re,Ta)&reorganization_type(Y,Re,Ta)&complexity(X,C1,Ta)&complexity(Y,C2,Ta)&greater(C2,C1)->greater(Tc,Tb)).
% 1.75/1.94 all X Y Re C P P1 P2 C1 C2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)&organization(X,Tb)&organization(Y,Tb)&class(X,C,Ta)&class(Y,C,Ta)&survival_chance(X,P,Ta)&survival_chance(Y,P,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Re,Ta)&reorganization_type(Y,Re,Ta)&survival_chance(X,P1,Tb)&survival_chance(Y,P2,Tb)&complexity(X,C1,Ta)&complexity(Y,C2,Ta)&greater(C2,C1)->greater(P1,P2)|P1=P2).
% 1.75/1.94 -(all X Y Re C P P1 P2 C1 C2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)&organization(X,Tc)&organization(Y,Tc)&class(X,C,Ta)&class(Y,C,Ta)&survival_chance(X,P,Ta)&survival_chance(Y,P,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Re,Ta)&reorganization_type(Y,Re,Ta)&reorganization_free(X,Tb,Tc)&survival_chance(X,P1,Tc)&survival_chance(Y,P2,Tc)&complexity(X,C1,Ta)&complexity(Y,C2,Ta)&greater(C2,C1)->greater(P1,P2))).
% 1.75/1.94 end_of_list.
% 1.75/1.94
% 1.75/1.94 -------> usable clausifies to:
% 1.75/1.94
% 1.75/1.94 list(usable).
% 1.75/1.94 0 [] A=A.
% 1.75/1.94 0 [] -greater(X,Y)|X!=Y.
% 1.75/1.94 0 [] -greater(X,Y)| -greater(Y,X).
% 1.75/1.94 0 [] -greater(X,Y)| -greater(Y,Z)|greater(X,Z).
% 1.75/1.94 0 [] -organization(X,T)|survival_chance(X,$f1(X,T),T).
% 1.75/1.94 0 [] -organization(X,T1)| -organization(X,T2)| -greater(T,T1)| -greater(T2,T)|organization(X,T).
% 1.75/1.94 0 [] -reorganization(X,Ta,Tb)|greater(Tb,Ta).
% 1.75/1.94 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization_free(X,T1,T2)| -survival_chance(X,P1,T1)| -survival_chance(X,P2,T2)| -greater(T2,T1)|greater(P2,P1).
% 1.75/1.94 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization(X,Ta,Tb)| -survival_chance(X,P1,T1)| -survival_chance(X,P2,T2)|greater(Ta,T1)| -greater(T2,T1)|greater(T2,Tb)|greater(P1,P2).
% 1.75/1.94 0 [] -organization(X,Ta)| -organization(Y,Ta)| -organization(Y,Tc)| -class(X,C,Ta)| -class(Y,C,Ta)| -reorganization(X,Ta,Tb)| -reorganization(Y,Ta,Tc)| -reorganization_type(X,Re,Ta)| -reorganization_type(Y,Re,Ta)| -complexity(X,C1,Ta)| -complexity(Y,C2,Ta)| -greater(C2,C1)|greater(Tc,Tb).
% 1.75/1.94 0 [] -organization(X,Ta)| -organization(Y,Ta)| -organization(X,Tb)| -organization(Y,Tb)| -class(X,C,Ta)| -class(Y,C,Ta)| -survival_chance(X,P,Ta)| -survival_chance(Y,P,Ta)| -reorganization(X,Ta,Tb)| -reorganization(Y,Ta,Tc)| -reorganization_type(X,Re,Ta)| -reorganization_type(Y,Re,Ta)| -survival_chance(X,P1,Tb)| -survival_chance(Y,P2,Tb)| -complexity(X,C1,Ta)| -complexity(Y,C2,Ta)| -greater(C2,C1)|greater(P1,P2)|P1=P2.
% 1.75/1.94 0 [] organization($c12,$c3).
% 1.75/1.94 0 [] organization($c11,$c3).
% 1.75/1.94 0 [] organization($c12,$c1).
% 1.75/1.94 0 [] organization($c11,$c1).
% 1.75/1.94 0 [] class($c12,$c9,$c3).
% 1.75/1.94 0 [] class($c11,$c9,$c3).
% 1.75/1.94 0 [] survival_chance($c12,$c8,$c3).
% 1.75/1.94 0 [] survival_chance($c11,$c8,$c3).
% 1.75/1.94 0 [] reorganization($c12,$c3,$c2).
% 1.75/1.94 0 [] reorganization($c11,$c3,$c1).
% 1.75/1.94 0 [] reorganization_type($c12,$c10,$c3).
% 1.75/1.94 0 [] reorganization_type($c11,$c10,$c3).
% 1.75/1.94 0 [] reorganization_free($c12,$c2,$c1).
% 1.75/1.94 0 [] survival_chance($c12,$c7,$c1).
% 1.75/1.94 0 [] survival_chance($c11,$c6,$c1).
% 1.75/1.94 0 [] complexity($c12,$c5,$c3).
% 1.75/1.94 0 [] complexity($c11,$c4,$c3).
% 1.75/1.94 0 [] greater($c4,$c5).
% 1.75/1.94 0 [] -greater($c7,$c6).
% 1.75/1.94 end_of_list.
% 1.75/1.94
% 1.75/1.94 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 1.75/1.94
% 1.75/1.94 This ia a non-Horn set with equality. The strategy will be
% 1.75/1.94 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.75/1.94 deletion, with positive clauses in sos and nonpositive
% 1.75/1.94 clauses in usable.
% 1.75/1.94
% 1.75/1.94 dependent: set(knuth_bendix).
% 1.75/1.94 dependent: set(anl_eq).
% 1.75/1.94 dependent: set(para_from).
% 1.75/1.94 dependent: set(para_into).
% 1.75/1.94 dependent: clear(para_from_right).
% 1.75/1.94 dependent: clear(para_into_right).
% 1.75/1.94 dependent: set(para_from_vars).
% 1.75/1.94 dependent: set(eq_units_both_ways).
% 1.75/1.94 dependent: set(dynamic_demod_all).
% 1.75/1.94 dependent: set(dynamic_demod).
% 1.75/1.94 dependent: set(order_eq).
% 1.75/1.94 dependent: set(back_demod).
% 1.75/1.94 dependent: set(lrpo).
% 1.75/1.94 dependent: set(hyper_res).
% 1.75/1.94 dependent: set(unit_deletion).
% 1.75/1.94 dependent: set(factor).
% 1.75/1.94
% 1.75/1.94 ------------> process usable:
% 1.75/1.94 ** KEPT (pick-wt=6): 1 [] -greater(A,B)|A!=B.
% 1.75/1.94 ** KEPT (pick-wt=6): 2 [] -greater(A,B)| -greater(B,A).
% 1.75/1.94 ** KEPT (pick-wt=9): 3 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.75/1.94 ** KEPT (pick-wt=9): 4 [] -organization(A,B)|survival_chance(A,$f1(A,B),B).
% 1.75/1.94 ** KEPT (pick-wt=15): 5 [] -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 1.75/1.94 ** KEPT (pick-wt=7): 6 [] -reorganization(A,B,C)|greater(C,B).
% 1.75/1.94 ** KEPT (pick-wt=24): 7 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 1.75/1.94 ** KEPT (pick-wt=30): 8 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 1.75/1.94 ** KEPT (pick-wt=47): 9 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 1.75/1.94 ** KEPT (pick-wt=69): 10 [] -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 1.75/1.94 ** KEPT (pick-wt=3): 11 [] -greater($c7,$c6).
% 1.75/1.94 18 back subsumes 16.
% 1.75/1.94 18 back subsumes 15.
% 1.75/1.94
% 1.75/1.94 ------------> process sos:
% 1.75/1.94 ** KEPT (pick-wt=3): 24 [] A=A.
% 1.75/1.94 ** KEPT (pick-wt=3): 25 [] organization($c12,$c3).
% 1.75/1.94 ** KEPT (pick-wt=3): 26 [] organization($c11,$c3).
% 1.75/1.94 ** KEPT (pick-wt=3): 27 [] organization($c12,$c1).
% 1.75/1.94 ** KEPT (pick-wt=3): 28 [] organization($c11,$c1).
% 1.75/1.94 ** KEPT (pick-wt=4): 29 [] class($c12,$c9,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 30 [] class($c11,$c9,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 31 [] survival_chance($c12,$c8,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 32 [] survival_chance($c11,$c8,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 33 [] reorganization($c12,$c3,$c2).
% 1.75/1.94 ** KEPT (pick-wt=4): 34 [] reorganization($c11,$c3,$c1).
% 1.75/1.94 ** KEPT (pick-wt=4): 35 [] reorganization_type($c12,$c10,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 36 [] reorganization_type($c11,$c10,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 37 [] reorganization_free($c12,$c2,$c1).
% 1.75/1.94 ** KEPT (pick-wt=4): 38 [] survival_chance($c12,$c7,$c1).
% 1.75/1.94 ** KEPT (pick-wt=4): 39 [] survival_chance($c11,$c6,$c1).
% 1.75/1.94 ** KEPT (pick-wt=4): 40 [] complexity($c12,$c5,$c3).
% 1.75/1.94 ** KEPT (pick-wt=4): 41 [] complexity($c11,$c4,$c3).
% 1.75/1.94 ** KEPT (pick-wt=3): 42 [] greater($c4,$c5).
% 1.75/1.94 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] A=A.
% 1.75/1.94 24 back subsumes 23.
% 1.75/1.94
% 1.75/1.94 ======= end of input procAlarm clock
% 299.84/300.02 Otter interrupted
% 299.84/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------