TSTP Solution File: MGT010-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT010-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:58 EDT 2022
% Result : Unsatisfiable 1.74s 1.95s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 18
% Syntax : Number of clauses : 24 ( 19 unt; 0 nHn; 24 RR)
% Number of literals : 55 ( 0 equ; 32 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 31 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| reproducibility(A,sk1(B,A),B) ),
file('MGT010-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('MGT010-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('MGT010-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(C,D,D)
| ~ class(A,E,B)
| ~ class(C,E,D)
| ~ reproducibility(A,F,B)
| ~ reproducibility(C,G,D)
| ~ size(A,H,B)
| ~ size(C,I,D)
| ~ greater(I,H)
| greater(G,F) ),
file('MGT010-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ greater(sk6,sk5)
| ~ greater(sk8,sk7) ),
file('MGT010-1.p',unknown),
[] ).
cnf(7,axiom,
organization(sk2,sk11),
file('MGT010-1.p',unknown),
[] ).
cnf(8,axiom,
organization(sk3,sk12),
file('MGT010-1.p',unknown),
[] ).
cnf(9,axiom,
reorganization_free(sk2,sk11,sk11),
file('MGT010-1.p',unknown),
[] ).
cnf(10,axiom,
reorganization_free(sk3,sk12,sk12),
file('MGT010-1.p',unknown),
[] ).
cnf(11,axiom,
class(sk2,sk4,sk11),
file('MGT010-1.p',unknown),
[] ).
cnf(12,axiom,
class(sk3,sk4,sk12),
file('MGT010-1.p',unknown),
[] ).
cnf(13,axiom,
reliability(sk2,sk5,sk11),
file('MGT010-1.p',unknown),
[] ).
cnf(14,axiom,
reliability(sk3,sk6,sk12),
file('MGT010-1.p',unknown),
[] ).
cnf(15,axiom,
accountability(sk2,sk7,sk11),
file('MGT010-1.p',unknown),
[] ).
cnf(16,axiom,
accountability(sk3,sk8,sk12),
file('MGT010-1.p',unknown),
[] ).
cnf(17,axiom,
size(sk2,sk9,sk11),
file('MGT010-1.p',unknown),
[] ).
cnf(18,axiom,
size(sk3,sk10,sk12),
file('MGT010-1.p',unknown),
[] ).
cnf(19,axiom,
greater(sk10,sk9),
file('MGT010-1.p',unknown),
[] ).
cnf(20,plain,
reproducibility(sk2,sk1(sk11,sk2),sk11),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(21,plain,
reproducibility(sk3,sk1(sk12,sk3),sk12),
inference(hyper,[status(thm)],[8,1]),
[iquote('hyper,8,1')] ).
cnf(22,plain,
greater(sk1(sk12,sk3),sk1(sk11,sk2)),
inference(hyper,[status(thm)],[21,5,7,8,9,10,11,12,20,17,18,19]),
[iquote('hyper,21,5,7,8,9,10,11,12,20,17,18,19')] ).
cnf(23,plain,
greater(sk8,sk7),
inference(hyper,[status(thm)],[22,3,7,8,13,14,15,16,20,21]),
[iquote('hyper,22,3,7,8,13,14,15,16,20,21')] ).
cnf(24,plain,
greater(sk6,sk5),
inference(hyper,[status(thm)],[22,2,7,8,13,14,15,16,20,21]),
[iquote('hyper,22,2,7,8,13,14,15,16,20,21')] ).
cnf(25,plain,
$false,
inference(hyper,[status(thm)],[24,6,23]),
[iquote('hyper,24,6,23')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT010-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n010.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 03:54:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.74/1.95 ----- Otter 3.3f, August 2004 -----
% 1.74/1.95 The process was started by sandbox on n010.cluster.edu,
% 1.74/1.95 Wed Jul 27 03:54:10 2022
% 1.74/1.95 The command was "./otter". The process ID is 21146.
% 1.74/1.95
% 1.74/1.95 set(prolog_style_variables).
% 1.74/1.95 set(auto).
% 1.74/1.95 dependent: set(auto1).
% 1.74/1.95 dependent: set(process_input).
% 1.74/1.95 dependent: clear(print_kept).
% 1.74/1.95 dependent: clear(print_new_demod).
% 1.74/1.95 dependent: clear(print_back_demod).
% 1.74/1.95 dependent: clear(print_back_sub).
% 1.74/1.95 dependent: set(control_memory).
% 1.74/1.95 dependent: assign(max_mem, 12000).
% 1.74/1.95 dependent: assign(pick_given_ratio, 4).
% 1.74/1.95 dependent: assign(stats_level, 1).
% 1.74/1.95 dependent: assign(max_seconds, 10800).
% 1.74/1.95 clear(print_given).
% 1.74/1.95
% 1.74/1.95 list(usable).
% 1.74/1.95 0 [] -organization(A,B)|reproducibility(A,sk1(B,A),B).
% 1.74/1.95 0 [] -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.74/1.95 0 [] -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.74/1.95 0 [] -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(F,E)| -greater(H,G)|greater(J,I).
% 1.74/1.95 0 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -class(A,E,B)| -class(C,E,D)| -reproducibility(A,F,B)| -reproducibility(C,G,D)| -size(A,H,B)| -size(C,I,D)| -greater(I,H)|greater(G,F).
% 1.74/1.95 0 [] organization(sk2,sk11).
% 1.74/1.95 0 [] organization(sk3,sk12).
% 1.74/1.95 0 [] reorganization_free(sk2,sk11,sk11).
% 1.74/1.95 0 [] reorganization_free(sk3,sk12,sk12).
% 1.74/1.95 0 [] class(sk2,sk4,sk11).
% 1.74/1.95 0 [] class(sk3,sk4,sk12).
% 1.74/1.95 0 [] reliability(sk2,sk5,sk11).
% 1.74/1.95 0 [] reliability(sk3,sk6,sk12).
% 1.74/1.95 0 [] accountability(sk2,sk7,sk11).
% 1.74/1.95 0 [] accountability(sk3,sk8,sk12).
% 1.74/1.95 0 [] size(sk2,sk9,sk11).
% 1.74/1.95 0 [] size(sk3,sk10,sk12).
% 1.74/1.95 0 [] greater(sk10,sk9).
% 1.74/1.95 0 [] -greater(sk6,sk5)| -greater(sk8,sk7).
% 1.74/1.95 end_of_list.
% 1.74/1.95
% 1.74/1.95 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=12.
% 1.74/1.95
% 1.74/1.95 This is a Horn set without equality. The strategy will
% 1.74/1.95 be hyperresolution, with satellites in sos and nuclei
% 1.74/1.95 in usable.
% 1.74/1.95
% 1.74/1.95 dependent: set(hyper_res).
% 1.74/1.95 dependent: clear(order_hyper).
% 1.74/1.95
% 1.74/1.95 ------------> process usable:
% 1.74/1.95 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|reproducibility(A,sk1(B,A),B).
% 1.74/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.74/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.74/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(F,E)| -greater(H,G)|greater(J,I).
% 1.74/1.95 ** KEPT (pick-wt=44): 5 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -class(A,E,B)| -class(C,E,D)| -reproducibility(A,F,B)| -reproducibility(C,G,D)| -size(A,H,B)| -size(C,I,D)| -greater(I,H)|greater(G,F).
% 1.74/1.95 ** KEPT (pick-wt=6): 6 [] -greater(sk6,sk5)| -greater(sk8,sk7).
% 1.74/1.95
% 1.74/1.95 ------------> process sos:
% 1.74/1.95 ** KEPT (pick-wt=3): 7 [] organization(sk2,sk11).
% 1.74/1.95 ** KEPT (pick-wt=3): 8 [] organization(sk3,sk12).
% 1.74/1.95 ** KEPT (pick-wt=4): 9 [] reorganization_free(sk2,sk11,sk11).
% 1.74/1.95 ** KEPT (pick-wt=4): 10 [] reorganization_free(sk3,sk12,sk12).
% 1.74/1.95 ** KEPT (pick-wt=4): 11 [] class(sk2,sk4,sk11).
% 1.74/1.95 ** KEPT (pick-wt=4): 12 [] class(sk3,sk4,sk12).
% 1.74/1.95 ** KEPT (pick-wt=4): 13 [] reliability(sk2,sk5,sk11).
% 1.74/1.95 ** KEPT (pick-wt=4): 14 [] reliability(sk3,sk6,sk12).
% 1.74/1.95 ** KEPT (pick-wt=4): 15 [] accountability(sk2,sk7,sk11).
% 1.74/1.95 ** KEPT (pick-wt=4): 16 [] accountability(sk3,sk8,sk12).
% 1.74/1.95 ** KEPT (pick-wt=4): 17 [] size(sk2,sk9,sk11).
% 1.74/1.95 ** KEPT (pick-wt=4): 18 [] size(sk3,sk10,sk12).
% 1.74/1.95 ** KEPT (pick-wt=3): 19 [] greater(sk10,sk9).
% 1.74/1.95
% 1.74/1.95 ======= end of input processing =======
% 1.74/1.95
% 1.74/1.95 =========== start of search ===========
% 1.74/1.95
% 1.74/1.95 -------- PROOF --------
% 1.74/1.95
% 1.74/1.95 -----> EMPTY CLAUSE at 0.00 sec ----> 25 [hyper,24,6,23] $F.
% 1.74/1.95
% 1.74/1.95 Length of proof is 5. Level of proof is 3.
% 1.74/1.95
% 1.74/1.95 ---------------- PROOF ----------------
% 1.74/1.95 % SZS status Unsatisfiable
% 1.74/1.95 % SZS output start Refutation
% See solution above
% 1.74/1.95 ------------ end of proof -------------
% 1.74/1.95
% 1.74/1.95
% 1.74/1.95 Search stopped by max_proofs option.
% 1.74/1.95
% 1.74/1.95
% 1.74/1.95 Search stopped by max_proofs option.
% 1.74/1.95
% 1.74/1.95 ============ end of search ============
% 1.74/1.95
% 1.74/1.95 -------------- statistics -------------
% 1.74/1.95 clauses given 18
% 1.74/1.95 clauses generated 6
% 1.74/1.95 clauses kept 24
% 1.74/1.95 clauses forward subsumed 0
% 1.74/1.95 clauses back subsumed 0
% 1.74/1.95 Kbytes malloced 976
% 1.74/1.95
% 1.74/1.95 ----------- times (seconds) -----------
% 1.74/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.95 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.74/1.95
% 1.74/1.95 That finishes the proof of the theorem.
% 1.74/1.95
% 1.74/1.95 Process 21146 finished Wed Jul 27 03:54:11 2022
% 1.74/1.95 Otter interrupted
% 1.74/1.95 PROOF FOUND
%------------------------------------------------------------------------------