TSTP Solution File: MGT004+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT004+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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 : Theorem 1.72s 1.92s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of clauses : 22 ( 17 unt; 2 nHn; 22 RR)
% Number of literals : 54 ( 0 equ; 31 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 32 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| reliability(A,dollar_f1(A,B),B) ),
file('MGT004+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ organization(A,B)
| accountability(A,dollar_f2(A,B),B) ),
file('MGT004+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ reliability(A,E,B)
| ~ reliability(C,F,D)
| ~ accountability(A,G,B)
| ~ accountability(C,H,D)
| ~ survival_chance(A,I,B)
| ~ survival_chance(C,J,D)
| ~ greater(F,E)
| ~ greater(H,G)
| greater(J,I) ),
file('MGT004+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization(A,D,E)
| ~ reliability(A,F,B)
| ~ reliability(A,G,C)
| ~ accountability(A,H,B)
| ~ accountability(A,I,C)
| greater(D,B)
| ~ greater(C,B)
| greater(C,E)
| greater(F,G) ),
file('MGT004+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization(A,D,E)
| ~ reliability(A,F,B)
| ~ reliability(A,G,C)
| ~ accountability(A,H,B)
| ~ accountability(A,I,C)
| greater(D,B)
| ~ greater(C,B)
| greater(C,E)
| greater(H,I) ),
file('MGT004+1.p',unknown),
[] ).
cnf(6,axiom,
~ greater(dollar_c2,dollar_c4),
file('MGT004+1.p',unknown),
[] ).
cnf(7,axiom,
~ greater(dollar_c3,dollar_c1),
file('MGT004+1.p',unknown),
[] ).
cnf(8,axiom,
~ greater(dollar_c6,dollar_c5),
file('MGT004+1.p',unknown),
[] ).
cnf(34,axiom,
organization(dollar_c7,dollar_c4),
file('MGT004+1.p',unknown),
[] ).
cnf(35,axiom,
organization(dollar_c7,dollar_c3),
file('MGT004+1.p',unknown),
[] ).
cnf(36,axiom,
reorganization(dollar_c7,dollar_c2,dollar_c1),
file('MGT004+1.p',unknown),
[] ).
cnf(37,axiom,
survival_chance(dollar_c7,dollar_c6,dollar_c4),
file('MGT004+1.p',unknown),
[] ).
cnf(38,axiom,
survival_chance(dollar_c7,dollar_c5,dollar_c3),
file('MGT004+1.p',unknown),
[] ).
cnf(39,axiom,
greater(dollar_c3,dollar_c4),
file('MGT004+1.p',unknown),
[] ).
cnf(40,plain,
accountability(dollar_c7,dollar_f2(dollar_c7,dollar_c4),dollar_c4),
inference(hyper,[status(thm)],[34,2]),
[iquote('hyper,34,2')] ).
cnf(41,plain,
reliability(dollar_c7,dollar_f1(dollar_c7,dollar_c4),dollar_c4),
inference(hyper,[status(thm)],[34,1]),
[iquote('hyper,34,1')] ).
cnf(42,plain,
accountability(dollar_c7,dollar_f2(dollar_c7,dollar_c3),dollar_c3),
inference(hyper,[status(thm)],[35,2]),
[iquote('hyper,35,2')] ).
cnf(43,plain,
reliability(dollar_c7,dollar_f1(dollar_c7,dollar_c3),dollar_c3),
inference(hyper,[status(thm)],[35,1]),
[iquote('hyper,35,1')] ).
cnf(44,plain,
greater(dollar_f2(dollar_c7,dollar_c4),dollar_f2(dollar_c7,dollar_c3)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[43,5,34,35,36,41,40,42,39]),6,7]),
[iquote('hyper,43,5,34,35,36,41,40,42,39,unit_del,6,7')] ).
cnf(45,plain,
greater(dollar_f1(dollar_c7,dollar_c4),dollar_f1(dollar_c7,dollar_c3)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[43,4,34,35,36,41,40,42,39]),6,7]),
[iquote('hyper,43,4,34,35,36,41,40,42,39,unit_del,6,7')] ).
cnf(46,plain,
greater(dollar_c6,dollar_c5),
inference(hyper,[status(thm)],[45,3,35,34,43,41,42,40,38,37,44]),
[iquote('hyper,45,3,35,34,43,41,42,40,38,37,44')] ).
cnf(47,plain,
$false,
inference(binary,[status(thm)],[46,8]),
[iquote('binary,46.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT004+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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:01:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.72/1.92 ----- Otter 3.3f, August 2004 -----
% 1.72/1.92 The process was started by sandbox2 on n005.cluster.edu,
% 1.72/1.92 Wed Jul 27 04:01:20 2022
% 1.72/1.92 The command was "./otter". The process ID is 11285.
% 1.72/1.92
% 1.72/1.92 set(prolog_style_variables).
% 1.72/1.92 set(auto).
% 1.72/1.92 dependent: set(auto1).
% 1.72/1.92 dependent: set(process_input).
% 1.72/1.92 dependent: clear(print_kept).
% 1.72/1.92 dependent: clear(print_new_demod).
% 1.72/1.92 dependent: clear(print_back_demod).
% 1.72/1.92 dependent: clear(print_back_sub).
% 1.72/1.92 dependent: set(control_memory).
% 1.72/1.92 dependent: assign(max_mem, 12000).
% 1.72/1.92 dependent: assign(pick_given_ratio, 4).
% 1.72/1.92 dependent: assign(stats_level, 1).
% 1.72/1.92 dependent: assign(max_seconds, 10800).
% 1.72/1.92 clear(print_given).
% 1.72/1.92
% 1.72/1.92 formula_list(usable).
% 1.72/1.92 all X T (organization(X,T)-> (exists R reliability(X,R,T))).
% 1.72/1.92 all X T (organization(X,T)-> (exists A accountability(X,A,T))).
% 1.72/1.92 all X Y R1 R2 A1 A2 P1 P2 T1 T2 (organization(X,T1)&organization(Y,T2)&reliability(X,R1,T1)&reliability(Y,R2,T2)&accountability(X,A1,T1)&accountability(Y,A2,T2)&survival_chance(X,P1,T1)&survival_chance(Y,P2,T2)&greater(R2,R1)&greater(A2,A1)->greater(P2,P1)).
% 1.72/1.92 all X R1 R2 A1 A2 T1 T2 Ta Tb (organization(X,T1)&organization(X,T2)&reorganization(X,Ta,Tb)&reliability(X,R1,T1)&reliability(X,R2,T2)&accountability(X,A1,T1)&accountability(X,A2,T2)& -greater(Ta,T1)&greater(T2,T1)& -greater(T2,Tb)->greater(R1,R2)&greater(A1,A2)).
% 1.72/1.92 -(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.72/1.92 end_of_list.
% 1.72/1.92
% 1.72/1.92 -------> usable clausifies to:
% 1.72/1.92
% 1.72/1.92 list(usable).
% 1.72/1.92 0 [] -organization(X,T)|reliability(X,$f1(X,T),T).
% 1.72/1.92 0 [] -organization(X,T)|accountability(X,$f2(X,T),T).
% 1.72/1.92 0 [] -organization(X,T1)| -organization(Y,T2)| -reliability(X,R1,T1)| -reliability(Y,R2,T2)| -accountability(X,A1,T1)| -accountability(Y,A2,T2)| -survival_chance(X,P1,T1)| -survival_chance(Y,P2,T2)| -greater(R2,R1)| -greater(A2,A1)|greater(P2,P1).
% 1.72/1.92 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization(X,Ta,Tb)| -reliability(X,R1,T1)| -reliability(X,R2,T2)| -accountability(X,A1,T1)| -accountability(X,A2,T2)|greater(Ta,T1)| -greater(T2,T1)|greater(T2,Tb)|greater(R1,R2).
% 1.72/1.92 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization(X,Ta,Tb)| -reliability(X,R1,T1)| -reliability(X,R2,T2)| -accountability(X,A1,T1)| -accountability(X,A2,T2)|greater(Ta,T1)| -greater(T2,T1)|greater(T2,Tb)|greater(A1,A2).
% 1.72/1.92 0 [] organization($c7,$c4).
% 1.72/1.92 0 [] organization($c7,$c3).
% 1.72/1.92 0 [] reorganization($c7,$c2,$c1).
% 1.72/1.92 0 [] survival_chance($c7,$c6,$c4).
% 1.72/1.92 0 [] survival_chance($c7,$c5,$c3).
% 1.72/1.92 0 [] -greater($c2,$c4).
% 1.72/1.92 0 [] greater($c3,$c4).
% 1.72/1.92 0 [] -greater($c3,$c1).
% 1.72/1.92 0 [] -greater($c6,$c5).
% 1.72/1.92 end_of_list.
% 1.72/1.92
% 1.72/1.92 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 1.72/1.92
% 1.72/1.92 This is a non-Horn set without equality. The strategy will
% 1.72/1.92 be ordered hyper_res, unit deletion, and factoring, with
% 1.72/1.92 satellites in sos and with nuclei in usable.
% 1.72/1.92
% 1.72/1.92 dependent: set(hyper_res).
% 1.72/1.92 dependent: set(factor).
% 1.72/1.92 dependent: set(unit_deletion).
% 1.72/1.92
% 1.72/1.92 ------------> process usable:
% 1.72/1.92 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|reliability(A,$f1(A,B),B).
% 1.72/1.92 ** KEPT (pick-wt=9): 2 [] -organization(A,B)|accountability(A,$f2(A,B),B).
% 1.72/1.92 ** KEPT (pick-wt=39): 3 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -survival_chance(A,I,B)| -survival_chance(C,J,D)| -greater(F,E)| -greater(H,G)|greater(J,I).
% 1.72/1.92 ** KEPT (pick-wt=38): 4 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -reliability(A,F,B)| -reliability(A,G,C)| -accountability(A,H,B)| -accountability(A,I,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 1.72/1.92 ** KEPT (pick-wt=38): 5 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -reliability(A,F,B)| -reliability(A,G,C)| -accountability(A,H,B)| -accountability(A,I,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(H,I).
% 1.72/1.92 ** KEPT (pick-wt=3): 6 [] -greater($c2,$c4).
% 1.72/1.92 ** KEPT (pick-wt=3): 7 [] -greater($c3,$c1).
% 1.72/1.92 ** KEPT (pick-wt=3): 8 [] -greater($c6,$c5).
% 1.72/1.92
% 1.72/1.92 ------------> process sos:
% 1.72/1.92 ** KEPT (pick-wt=3): 34 [] organization($c7,$c4).
% 1.72/1.92 ** KEPT (pick-wt=3): 35 [] organization($c7,$c3).
% 1.72/1.92 ** KEPT (pick-wt=4): 36 [] reorganization($c7,$c2,$c1).
% 1.72/1.92 ** KEPT (pick-wt=4): 37 [] survival_chance($c7,$c6,$c4).
% 1.72/1.92 ** KEPT (pick-wt=4): 38 [] survival_chance($c7,$c5,$c3).
% 1.72/1.92 ** KEPT (pick-wt=3): 39 [] greater($c3,$c4).
% 1.72/1.92
% 1.72/1.92 ======= end of input processing =======
% 1.72/1.92
% 1.72/1.92 =========== start of search ===========
% 1.72/1.92
% 1.72/1.92 -------- PROOF --------
% 1.72/1.92
% 1.72/1.92 ----> UNIT CONFLICT at 0.01 sec ----> 47 [binary,46.1,8.1] $F.
% 1.72/1.92
% 1.72/1.92 Length of proof is 7. Level of proof is 3.
% 1.72/1.92
% 1.72/1.92 ---------------- PROOF ----------------
% 1.72/1.92 % SZS status Theorem
% 1.72/1.92 % SZS output start Refutation
% See solution above
% 1.72/1.92 ------------ end of proof -------------
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Search stopped by max_proofs option.
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Search stopped by max_proofs option.
% 1.72/1.92
% 1.72/1.92 ============ end of search ============
% 1.72/1.92
% 1.72/1.92 -------------- statistics -------------
% 1.72/1.92 clauses given 12
% 1.72/1.92 clauses generated 92
% 1.72/1.92 clauses kept 46
% 1.72/1.92 clauses forward subsumed 34
% 1.72/1.92 clauses back subsumed 0
% 1.72/1.92 Kbytes malloced 976
% 1.72/1.92
% 1.72/1.92 ----------- times (seconds) -----------
% 1.72/1.92 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.72/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.92 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.72/1.92
% 1.72/1.92 That finishes the proof of the theorem.
% 1.72/1.92
% 1.72/1.92 Process 11285 finished Wed Jul 27 04:01:22 2022
% 1.72/1.92 Otter interrupted
% 1.72/1.92 PROOF FOUND
%------------------------------------------------------------------------------