TSTP Solution File: MGT006+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:57 EDT 2022
% Result : Theorem 1.75s 1.95s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 19 ( 14 unt; 0 nHn; 19 RR)
% Number of literals : 45 ( 0 equ; 27 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| reproducibility(A,dollar_f1(A,B),B) ),
file('MGT006+1.p',unknown),
[] ).
cnf(2,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('MGT006+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)
| ~ reproducibility(A,I,B)
| ~ reproducibility(C,J,D)
| ~ greater(J,I)
| greater(H,G) ),
file('MGT006+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ reproducibility(A,D,B)
| ~ reproducibility(A,E,C)
| ~ greater(C,B)
| greater(E,D) ),
file('MGT006+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ greater(dollar_c5,dollar_c6)
| ~ greater(dollar_c3,dollar_c4) ),
file('MGT006+1.p',unknown),
[] ).
cnf(7,axiom,
organization(dollar_c7,dollar_c2),
file('MGT006+1.p',unknown),
[] ).
cnf(8,axiom,
organization(dollar_c7,dollar_c1),
file('MGT006+1.p',unknown),
[] ).
cnf(9,axiom,
reorganization_free(dollar_c7,dollar_c2,dollar_c1),
file('MGT006+1.p',unknown),
[] ).
cnf(10,axiom,
reliability(dollar_c7,dollar_c6,dollar_c2),
file('MGT006+1.p',unknown),
[] ).
cnf(11,axiom,
reliability(dollar_c7,dollar_c5,dollar_c1),
file('MGT006+1.p',unknown),
[] ).
cnf(12,axiom,
accountability(dollar_c7,dollar_c4,dollar_c2),
file('MGT006+1.p',unknown),
[] ).
cnf(13,axiom,
accountability(dollar_c7,dollar_c3,dollar_c1),
file('MGT006+1.p',unknown),
[] ).
cnf(14,axiom,
greater(dollar_c1,dollar_c2),
file('MGT006+1.p',unknown),
[] ).
cnf(15,plain,
reproducibility(dollar_c7,dollar_f1(dollar_c7,dollar_c2),dollar_c2),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(16,plain,
reproducibility(dollar_c7,dollar_f1(dollar_c7,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[8,1]),
[iquote('hyper,8,1')] ).
cnf(17,plain,
greater(dollar_f1(dollar_c7,dollar_c1),dollar_f1(dollar_c7,dollar_c2)),
inference(hyper,[status(thm)],[16,5,7,8,9,15,14]),
[iquote('hyper,16,5,7,8,9,15,14')] ).
cnf(18,plain,
greater(dollar_c3,dollar_c4),
inference(hyper,[status(thm)],[17,3,7,8,10,11,12,13,15,16]),
[iquote('hyper,17,3,7,8,10,11,12,13,15,16')] ).
cnf(19,plain,
greater(dollar_c5,dollar_c6),
inference(hyper,[status(thm)],[17,2,7,8,10,11,12,13,15,16]),
[iquote('hyper,17,2,7,8,10,11,12,13,15,16')] ).
cnf(20,plain,
$false,
inference(hyper,[status(thm)],[19,6,18]),
[iquote('hyper,19,6,18')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n028.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 04:08:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.75/1.95 ----- Otter 3.3f, August 2004 -----
% 1.75/1.95 The process was started by sandbox on n028.cluster.edu,
% 1.75/1.95 Wed Jul 27 04:08:18 2022
% 1.75/1.95 The command was "./otter". The process ID is 9286.
% 1.75/1.95
% 1.75/1.95 set(prolog_style_variables).
% 1.75/1.95 set(auto).
% 1.75/1.95 dependent: set(auto1).
% 1.75/1.95 dependent: set(process_input).
% 1.75/1.95 dependent: clear(print_kept).
% 1.75/1.95 dependent: clear(print_new_demod).
% 1.75/1.95 dependent: clear(print_back_demod).
% 1.75/1.95 dependent: clear(print_back_sub).
% 1.75/1.95 dependent: set(control_memory).
% 1.75/1.95 dependent: assign(max_mem, 12000).
% 1.75/1.95 dependent: assign(pick_given_ratio, 4).
% 1.75/1.95 dependent: assign(stats_level, 1).
% 1.75/1.95 dependent: assign(max_seconds, 10800).
% 1.75/1.95 clear(print_given).
% 1.75/1.95
% 1.75/1.95 formula_list(usable).
% 1.75/1.95 all X T (organization(X,T)-> (exists Rp reproducibility(X,Rp,T))).
% 1.75/1.95 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.75/1.95 all X Rp1 Rp2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&reproducibility(X,Rp1,T1)&reproducibility(X,Rp2,T2)&greater(T2,T1)->greater(Rp2,Rp1)).
% 1.75/1.95 -(all X R1 R2 A1 A2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&reliability(X,R1,T1)&reliability(X,R2,T2)&accountability(X,A1,T1)&accountability(X,A2,T2)&greater(T2,T1)->greater(R2,R1)&greater(A2,A1))).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 -------> usable clausifies to:
% 1.75/1.95
% 1.75/1.95 list(usable).
% 1.75/1.95 0 [] -organization(X,T)|reproducibility(X,$f1(X,T),T).
% 1.75/1.95 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.75/1.95 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.75/1.95 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.75/1.95 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization_free(X,T1,T2)| -reproducibility(X,Rp1,T1)| -reproducibility(X,Rp2,T2)| -greater(T2,T1)|greater(Rp2,Rp1).
% 1.75/1.95 0 [] organization($c7,$c2).
% 1.75/1.95 0 [] organization($c7,$c1).
% 1.75/1.95 0 [] reorganization_free($c7,$c2,$c1).
% 1.75/1.95 0 [] reliability($c7,$c6,$c2).
% 1.75/1.95 0 [] reliability($c7,$c5,$c1).
% 1.75/1.95 0 [] accountability($c7,$c4,$c2).
% 1.75/1.95 0 [] accountability($c7,$c3,$c1).
% 1.75/1.95 0 [] greater($c1,$c2).
% 1.75/1.95 0 [] -greater($c5,$c6)| -greater($c3,$c4).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 1.75/1.95
% 1.75/1.95 This is a Horn set without equality. The strategy will
% 1.75/1.95 be hyperresolution, with satellites in sos and nuclei
% 1.75/1.95 in usable.
% 1.75/1.95
% 1.75/1.95 dependent: set(hyper_res).
% 1.75/1.95 dependent: clear(order_hyper).
% 1.75/1.95
% 1.75/1.95 ------------> process usable:
% 1.75/1.95 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|reproducibility(A,$f1(A,B),B).
% 1.75/1.95 ** KEPT (pick-wt=36): 2 [] -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.75/1.95 ** KEPT (pick-wt=36): 3 [] -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.75/1.95 ** 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)| -reproducibility(A,I,B)| -reproducibility(C,J,D)|greater(J,I)| -greater(F,E)| -greater(H,G).
% 1.75/1.95 ** KEPT (pick-wt=24): 5 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -reproducibility(A,D,B)| -reproducibility(A,E,C)| -greater(C,B)|greater(E,D).
% 1.75/1.95 ** KEPT (pick-wt=6): 6 [] -greater($c5,$c6)| -greater($c3,$c4).
% 1.75/1.95
% 1.75/1.95 ------------> process sos:
% 1.75/1.95 ** KEPT (pick-wt=3): 7 [] organization($c7,$c2).
% 1.75/1.95 ** KEPT (pick-wt=3): 8 [] organization($c7,$c1).
% 1.75/1.95 ** KEPT (pick-wt=4): 9 [] reorganization_free($c7,$c2,$c1).
% 1.75/1.95 ** KEPT (pick-wt=4): 10 [] reliability($c7,$c6,$c2).
% 1.75/1.95 ** KEPT (pick-wt=4): 11 [] reliability($c7,$c5,$c1).
% 1.75/1.95 ** KEPT (pick-wt=4): 12 [] accountability($c7,$c4,$c2).
% 1.75/1.95 ** KEPT (pick-wt=4): 13 [] accountability($c7,$c3,$c1).
% 1.75/1.95 ** KEPT (pick-wt=3): 14 [] greater($c1,$c2).
% 1.75/1.95
% 1.75/1.95 ======= end of input processing =======
% 1.75/1.95
% 1.75/1.95 =========== start of search ===========
% 1.75/1.95
% 1.75/1.95 -------- PROOF --------
% 1.75/1.95
% 1.75/1.95 -----> EMPTY CLAUSE at 0.00 sec ----> 20 [hyper,19,6,18] $F.
% 1.75/1.95
% 1.75/1.95 Length of proof is 5. Level of proof is 3.
% 1.75/1.95
% 1.75/1.95 ---------------- PROOF ----------------
% 1.75/1.95 % SZS status Theorem
% 1.75/1.95 % SZS output start Refutation
% See solution above
% 1.75/1.95 ------------ end of proof -------------
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Search stopped by max_proofs option.
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Search stopped by max_proofs option.
% 1.75/1.95
% 1.75/1.95 ============ end of search ============
% 1.75/1.95
% 1.75/1.95 -------------- statistics -------------
% 1.75/1.95 clauses given 13
% 1.75/1.95 clauses generated 6
% 1.75/1.95 clauses kept 19
% 1.75/1.95 clauses forward subsumed 0
% 1.75/1.95 clauses back subsumed 0
% 1.75/1.95 Kbytes malloced 976
% 1.75/1.95
% 1.75/1.95 ----------- times (seconds) -----------
% 1.75/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.95 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.75/1.95
% 1.75/1.95 That finishes the proof of the theorem.
% 1.75/1.95
% 1.75/1.95 Process 9286 finished Wed Jul 27 04:08:20 2022
% 1.75/1.95 Otter interrupted
% 1.75/1.95 PROOF FOUND
%------------------------------------------------------------------------------