TSTP Solution File: MGT001+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT001+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:55 EDT 2022
% Result : Theorem 1.89s 2.09s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of clauses : 28 ( 21 unt; 0 nHn; 28 RR)
% Number of literals : 68 ( 0 equ; 41 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 44 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| reliability(A,dollar_f1(A,B),B) ),
file('MGT001+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ organization(A,B)
| accountability(A,dollar_f2(A,B),B) ),
file('MGT001+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| reproducibility(A,dollar_f3(A,B),B) ),
file('MGT001+1.p',unknown),
[] ).
cnf(4,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('MGT001+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ reliability(A,E,B)
| ~ reliability(C,F,D)
| ~ accountability(A,G,B)
| ~ accountability(C,H,D)
| ~ reproducibility(A,I,B)
| ~ reproducibility(C,J,D)
| ~ greater(J,I)
| greater(F,E) ),
file('MGT001+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ reliability(A,E,B)
| ~ reliability(C,F,D)
| ~ accountability(A,G,B)
| ~ accountability(C,H,D)
| ~ reproducibility(A,I,B)
| ~ reproducibility(C,J,D)
| ~ greater(J,I)
| greater(H,G) ),
file('MGT001+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(C,D,D)
| ~ reproducibility(A,E,B)
| ~ reproducibility(C,F,D)
| ~ inertia(A,G,B)
| ~ inertia(C,H,D)
| greater(F,E)
| ~ greater(H,G) ),
file('MGT001+1.p',unknown),
[] ).
cnf(10,axiom,
~ greater(dollar_c1,dollar_c2),
file('MGT001+1.p',unknown),
[] ).
cnf(11,axiom,
organization(dollar_c8,dollar_c6),
file('MGT001+1.p',unknown),
[] ).
cnf(12,axiom,
organization(dollar_c7,dollar_c5),
file('MGT001+1.p',unknown),
[] ).
cnf(13,axiom,
reorganization_free(dollar_c8,dollar_c6,dollar_c6),
file('MGT001+1.p',unknown),
[] ).
cnf(14,axiom,
reorganization_free(dollar_c7,dollar_c5,dollar_c5),
file('MGT001+1.p',unknown),
[] ).
cnf(15,axiom,
inertia(dollar_c8,dollar_c4,dollar_c6),
file('MGT001+1.p',unknown),
[] ).
cnf(16,axiom,
inertia(dollar_c7,dollar_c3,dollar_c5),
file('MGT001+1.p',unknown),
[] ).
cnf(17,axiom,
survival_chance(dollar_c8,dollar_c2,dollar_c6),
file('MGT001+1.p',unknown),
[] ).
cnf(18,axiom,
survival_chance(dollar_c7,dollar_c1,dollar_c5),
file('MGT001+1.p',unknown),
[] ).
cnf(19,axiom,
greater(dollar_c3,dollar_c4),
file('MGT001+1.p',unknown),
[] ).
cnf(20,plain,
reproducibility(dollar_c8,dollar_f3(dollar_c8,dollar_c6),dollar_c6),
inference(hyper,[status(thm)],[11,3]),
[iquote('hyper,11,3')] ).
cnf(21,plain,
accountability(dollar_c8,dollar_f2(dollar_c8,dollar_c6),dollar_c6),
inference(hyper,[status(thm)],[11,2]),
[iquote('hyper,11,2')] ).
cnf(22,plain,
reliability(dollar_c8,dollar_f1(dollar_c8,dollar_c6),dollar_c6),
inference(hyper,[status(thm)],[11,1]),
[iquote('hyper,11,1')] ).
cnf(23,plain,
reproducibility(dollar_c7,dollar_f3(dollar_c7,dollar_c5),dollar_c5),
inference(hyper,[status(thm)],[12,3]),
[iquote('hyper,12,3')] ).
cnf(24,plain,
accountability(dollar_c7,dollar_f2(dollar_c7,dollar_c5),dollar_c5),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(25,plain,
reliability(dollar_c7,dollar_f1(dollar_c7,dollar_c5),dollar_c5),
inference(hyper,[status(thm)],[12,1]),
[iquote('hyper,12,1')] ).
cnf(26,plain,
greater(dollar_f3(dollar_c7,dollar_c5),dollar_f3(dollar_c8,dollar_c6)),
inference(hyper,[status(thm)],[23,9,11,12,13,14,20,15,16,19]),
[iquote('hyper,23,9,11,12,13,14,20,15,16,19')] ).
cnf(27,plain,
greater(dollar_f2(dollar_c7,dollar_c5),dollar_f2(dollar_c8,dollar_c6)),
inference(hyper,[status(thm)],[26,6,11,12,22,25,21,24,20,23]),
[iquote('hyper,26,6,11,12,22,25,21,24,20,23')] ).
cnf(28,plain,
greater(dollar_f1(dollar_c7,dollar_c5),dollar_f1(dollar_c8,dollar_c6)),
inference(hyper,[status(thm)],[26,5,11,12,22,25,21,24,20,23]),
[iquote('hyper,26,5,11,12,22,25,21,24,20,23')] ).
cnf(29,plain,
greater(dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[28,4,11,12,22,25,21,24,17,18,27]),
[iquote('hyper,28,4,11,12,22,25,21,24,17,18,27')] ).
cnf(30,plain,
$false,
inference(binary,[status(thm)],[29,10]),
[iquote('binary,29.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 04:14:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n026.cluster.edu,
% 1.89/2.09 Wed Jul 27 04:14:09 2022
% 1.89/2.09 The command was "./otter". The process ID is 29873.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 formula_list(usable).
% 1.89/2.09 all X T (organization(X,T)-> (exists R reliability(X,R,T))).
% 1.89/2.09 all X T (organization(X,T)-> (exists A accountability(X,A,T))).
% 1.89/2.09 all X T (organization(X,T)-> (exists Rp reproducibility(X,Rp,T))).
% 1.89/2.09 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.89/2.09 all X Y T1 T2 R1 R2 A1 A2 Rp1 Rp2 (organization(X,T1)&organization(Y,T2)&reliability(X,R1,T1)&reliability(Y,R2,T2)&accountability(X,A1,T1)&accountability(Y,A2,T2)&reproducibility(X,Rp1,T1)&reproducibility(Y,Rp2,T2)-> (greater(Rp2,Rp1)<->greater(R2,R1)&greater(A2,A1))).
% 1.89/2.09 all X Y T1 T2 Rp1 Rp2 I1 I2 (organization(X,T1)&organization(Y,T2)&reorganization_free(X,T1,T1)&reorganization_free(Y,T2,T2)&reproducibility(X,Rp1,T1)&reproducibility(Y,Rp2,T2)&inertia(X,I1,T1)&inertia(Y,I2,T2)-> (greater(Rp2,Rp1)<->greater(I2,I1))).
% 1.89/2.09 -(all X Y T1 T2 I1 I2 P1 P2 (organization(X,T1)&organization(Y,T2)&reorganization_free(X,T1,T1)&reorganization_free(Y,T2,T2)&inertia(X,I1,T1)&inertia(Y,I2,T2)&survival_chance(X,P1,T1)&survival_chance(Y,P2,T2)&greater(I2,I1)->greater(P2,P1))).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 -------> usable clausifies to:
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] -organization(X,T)|reliability(X,$f1(X,T),T).
% 1.89/2.09 0 [] -organization(X,T)|accountability(X,$f2(X,T),T).
% 1.89/2.09 0 [] -organization(X,T)|reproducibility(X,$f3(X,T),T).
% 1.89/2.09 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.89/2.09 0 [] -organization(X,T1)| -organization(Y,T2)| -reliability(X,R1,T1)| -reliability(Y,R2,T2)| -accountability(X,A1,T1)| -accountability(Y,A2,T2)| -reproducibility(X,Rp1,T1)| -reproducibility(Y,Rp2,T2)| -greater(Rp2,Rp1)|greater(R2,R1).
% 1.89/2.09 0 [] -organization(X,T1)| -organization(Y,T2)| -reliability(X,R1,T1)| -reliability(Y,R2,T2)| -accountability(X,A1,T1)| -accountability(Y,A2,T2)| -reproducibility(X,Rp1,T1)| -reproducibility(Y,Rp2,T2)| -greater(Rp2,Rp1)|greater(A2,A1).
% 1.89/2.09 0 [] -organization(X,T1)| -organization(Y,T2)| -reliability(X,R1,T1)| -reliability(Y,R2,T2)| -accountability(X,A1,T1)| -accountability(Y,A2,T2)| -reproducibility(X,Rp1,T1)| -reproducibility(Y,Rp2,T2)|greater(Rp2,Rp1)| -greater(R2,R1)| -greater(A2,A1).
% 1.89/2.09 0 [] -organization(X,T1)| -organization(Y,T2)| -reorganization_free(X,T1,T1)| -reorganization_free(Y,T2,T2)| -reproducibility(X,Rp1,T1)| -reproducibility(Y,Rp2,T2)| -inertia(X,I1,T1)| -inertia(Y,I2,T2)| -greater(Rp2,Rp1)|greater(I2,I1).
% 1.89/2.09 0 [] -organization(X,T1)| -organization(Y,T2)| -reorganization_free(X,T1,T1)| -reorganization_free(Y,T2,T2)| -reproducibility(X,Rp1,T1)| -reproducibility(Y,Rp2,T2)| -inertia(X,I1,T1)| -inertia(Y,I2,T2)|greater(Rp2,Rp1)| -greater(I2,I1).
% 1.89/2.09 0 [] organization($c8,$c6).
% 1.89/2.09 0 [] organization($c7,$c5).
% 1.89/2.09 0 [] reorganization_free($c8,$c6,$c6).
% 1.89/2.09 0 [] reorganization_free($c7,$c5,$c5).
% 1.89/2.09 0 [] inertia($c8,$c4,$c6).
% 1.89/2.09 0 [] inertia($c7,$c3,$c5).
% 1.89/2.09 0 [] survival_chance($c8,$c2,$c6).
% 1.89/2.09 0 [] survival_chance($c7,$c1,$c5).
% 1.89/2.09 0 [] greater($c3,$c4).
% 1.89/2.09 0 [] -greater($c1,$c2).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 1.89/2.09
% 1.89/2.09 This is a Horn set without equality. The strategy will
% 1.89/2.09 be hyperresolution, with satellites in sos and nuclei
% 1.89/2.09 in usable.
% 1.89/2.09
% 1.89/2.09 dependent: set(hyper_res).
% 1.89/2.09 dependent: clear(order_hyper).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|reliability(A,$f1(A,B),B).
% 1.89/2.09 ** KEPT (pick-wt=9): 2 [] -organization(A,B)|accountability(A,$f2(A,B),B).
% 1.89/2.09 ** KEPT (pick-wt=9): 3 [] -organization(A,B)|reproducibility(A,$f3(A,B),B).
% 1.89/2.09 ** KEPT (pick-wt=39): 4 [] -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.89/2.09 ** KEPT (pick-wt=36): 5 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(F,E).
% 1.89/2.09 ** KEPT (pick-wt=36): 6 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(H,G).
% 1.89/2.09 ** KEPT (pick-wt=39): 7 [] -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)|greater(J,I)| -greater(F,E)| -greater(H,G).
% 1.89/2.09 ** KEPT (pick-wt=36): 8 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(F,E)|greater(H,G).
% 1.89/2.09 ** KEPT (pick-wt=36): 9 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)|greater(F,E)| -greater(H,G).
% 1.89/2.09 ** KEPT (pick-wt=3): 10 [] -greater($c1,$c2).
% 1.89/2.09
% 1.89/2.09 ------------> process sos:
% 1.89/2.09 ** KEPT (pick-wt=3): 11 [] organization($c8,$c6).
% 1.89/2.09 ** KEPT (pick-wt=3): 12 [] organization($c7,$c5).
% 1.89/2.09 ** KEPT (pick-wt=4): 13 [] reorganization_free($c8,$c6,$c6).
% 1.89/2.09 ** KEPT (pick-wt=4): 14 [] reorganization_free($c7,$c5,$c5).
% 1.89/2.09 ** KEPT (pick-wt=4): 15 [] inertia($c8,$c4,$c6).
% 1.89/2.09 ** KEPT (pick-wt=4): 16 [] inertia($c7,$c3,$c5).
% 1.89/2.09 ** KEPT (pick-wt=4): 17 [] survival_chance($c8,$c2,$c6).
% 1.89/2.09 ** KEPT (pick-wt=4): 18 [] survival_chance($c7,$c1,$c5).
% 1.89/2.09 ** KEPT (pick-wt=3): 19 [] greater($c3,$c4).
% 1.89/2.09
% 1.89/2.09 ======= end of input processing =======
% 1.89/2.09
% 1.89/2.09 =========== start of search ===========
% 1.89/2.09
% 1.89/2.09 -------- PROOF --------
% 1.89/2.09
% 1.89/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 30 [binary,29.1,10.1] $F.
% 1.89/2.09
% 1.89/2.09 Length of proof is 10. Level of proof is 4.
% 1.89/2.09
% 1.89/2.09 ---------------- PROOF ----------------
% 1.89/2.09 % SZS status Theorem
% 1.89/2.09 % SZS output start Refutation
% See solution above
% 1.89/2.09 ------------ end of proof -------------
% 1.89/2.09
% 1.89/2.09
% 1.89/2.09 Search stopped by max_proofs option.
% 1.89/2.09
% 1.89/2.09
% 1.89/2.09 Search stopped by max_proofs option.
% 1.89/2.09
% 1.89/2.09 ============ end of search ============
% 1.89/2.09
% 1.89/2.09 -------------- statistics -------------
% 1.89/2.09 clauses given 18
% 1.89/2.09 clauses generated 12
% 1.89/2.09 clauses kept 29
% 1.89/2.09 clauses forward subsumed 2
% 1.89/2.09 clauses back subsumed 0
% 1.89/2.09 Kbytes malloced 976
% 1.89/2.09
% 1.89/2.09 ----------- times (seconds) -----------
% 1.89/2.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.89/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.09 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.89/2.09
% 1.89/2.09 That finishes the proof of the theorem.
% 1.89/2.09
% 1.89/2.09 Process 29873 finished Wed Jul 27 04:14:10 2022
% 1.89/2.09 Otter interrupted
% 1.89/2.09 PROOF FOUND
%------------------------------------------------------------------------------