TSTP Solution File: MGT007-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT007-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 : Unsatisfiable 1.75s 1.96s
% Output : Refutation 1.75s
% 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,sk1(B,A),B) ),
file('MGT007-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ organization(A,B)
| accountability(A,sk2(B,A),B) ),
file('MGT007-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(F,E)
| ~ greater(H,G)
| greater(J,I) ),
file('MGT007-1.p',unknown),
[] ).
cnf(7,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('MGT007-1.p',unknown),
[] ).
cnf(8,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('MGT007-1.p',unknown),
[] ).
cnf(9,axiom,
~ greater(sk9,sk7),
file('MGT007-1.p',unknown),
[] ).
cnf(10,axiom,
~ greater(sk8,sk10),
file('MGT007-1.p',unknown),
[] ).
cnf(11,axiom,
~ greater(sk5,sk6),
file('MGT007-1.p',unknown),
[] ).
cnf(45,axiom,
organization(sk4,sk7),
file('MGT007-1.p',unknown),
[] ).
cnf(46,axiom,
organization(sk4,sk8),
file('MGT007-1.p',unknown),
[] ).
cnf(47,axiom,
reorganization(sk4,sk9,sk10),
file('MGT007-1.p',unknown),
[] ).
cnf(48,axiom,
reproducibility(sk4,sk5,sk7),
file('MGT007-1.p',unknown),
[] ).
cnf(49,axiom,
reproducibility(sk4,sk6,sk8),
file('MGT007-1.p',unknown),
[] ).
cnf(50,axiom,
greater(sk8,sk7),
file('MGT007-1.p',unknown),
[] ).
cnf(52,plain,
accountability(sk4,sk2(sk7,sk4),sk7),
inference(hyper,[status(thm)],[45,2]),
[iquote('hyper,45,2')] ).
cnf(53,plain,
reliability(sk4,sk1(sk7,sk4),sk7),
inference(hyper,[status(thm)],[45,1]),
[iquote('hyper,45,1')] ).
cnf(55,plain,
accountability(sk4,sk2(sk8,sk4),sk8),
inference(hyper,[status(thm)],[46,2]),
[iquote('hyper,46,2')] ).
cnf(56,plain,
reliability(sk4,sk1(sk8,sk4),sk8),
inference(hyper,[status(thm)],[46,1]),
[iquote('hyper,46,1')] ).
cnf(57,plain,
greater(sk2(sk7,sk4),sk2(sk8,sk4)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[56,8,45,46,47,53,52,55,50]),9,10]),
[iquote('hyper,56,8,45,46,47,53,52,55,50,unit_del,9,10')] ).
cnf(58,plain,
greater(sk1(sk7,sk4),sk1(sk8,sk4)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[56,7,45,46,47,53,52,55,50]),9,10]),
[iquote('hyper,56,7,45,46,47,53,52,55,50,unit_del,9,10')] ).
cnf(62,plain,
greater(sk5,sk6),
inference(hyper,[status(thm)],[58,6,46,45,56,53,55,52,49,48,57]),
[iquote('hyper,58,6,46,45,56,53,55,52,49,48,57')] ).
cnf(63,plain,
$false,
inference(binary,[status(thm)],[62,11]),
[iquote('binary,62.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT007-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 03:44:46 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.75/1.95 ----- Otter 3.3f, August 2004 -----
% 1.75/1.95 The process was started by sandbox on n007.cluster.edu,
% 1.75/1.95 Wed Jul 27 03:44:46 2022
% 1.75/1.95 The command was "./otter". The process ID is 5479.
% 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 list(usable).
% 1.75/1.95 0 [] -organization(A,B)|reliability(A,sk1(B,A),B).
% 1.75/1.95 0 [] -organization(A,B)|accountability(A,sk2(B,A),B).
% 1.75/1.95 0 [] -organization(A,B)|reproducibility(A,sk3(B,A),B).
% 1.75/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.75/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.75/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.75/1.95 0 [] -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.75/1.95 0 [] -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.75/1.95 0 [] organization(sk4,sk7).
% 1.75/1.95 0 [] organization(sk4,sk8).
% 1.75/1.95 0 [] reorganization(sk4,sk9,sk10).
% 1.75/1.95 0 [] reproducibility(sk4,sk5,sk7).
% 1.75/1.95 0 [] reproducibility(sk4,sk6,sk8).
% 1.75/1.95 0 [] -greater(sk9,sk7).
% 1.75/1.95 0 [] greater(sk8,sk7).
% 1.75/1.95 0 [] -greater(sk8,sk10).
% 1.75/1.95 0 [] -greater(sk5,sk6).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 1.75/1.95
% 1.75/1.95 This is a non-Horn set without equality. The strategy will
% 1.75/1.95 be ordered hyper_res, unit deletion, and factoring, with
% 1.75/1.95 satellites in sos and with nuclei in usable.
% 1.75/1.95
% 1.75/1.95 dependent: set(hyper_res).
% 1.75/1.95 dependent: set(factor).
% 1.75/1.95 dependent: set(unit_deletion).
% 1.75/1.95
% 1.75/1.95 ------------> process usable:
% 1.75/1.95 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|reliability(A,sk1(B,A),B).
% 1.75/1.95 ** KEPT (pick-wt=9): 2 [] -organization(A,B)|accountability(A,sk2(B,A),B).
% 1.75/1.95 ** KEPT (pick-wt=9): 3 [] -organization(A,B)|reproducibility(A,sk3(B,A),B).
% 1.75/1.95 ** KEPT (pick-wt=36): 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).
% 1.75/1.95 ** 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(H,G).
% 1.75/1.95 ** KEPT (pick-wt=39): 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(F,E)| -greater(H,G)|greater(J,I).
% 1.75/1.95 ** KEPT (pick-wt=38): 7 [] -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.75/1.95 ** KEPT (pick-wt=38): 8 [] -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.75/1.95 ** KEPT (pick-wt=3): 9 [] -greater(sk9,sk7).
% 1.75/1.95 ** KEPT (pick-wt=3): 10 [] -greater(sk8,sk10).
% 1.75/1.95 ** KEPT (pick-wt=3): 11 [] -greater(sk5,sk6).
% 1.75/1.95
% 1.75/1.95 ------------> process sos:
% 1.75/1.95 ** KEPT (pick-wt=3): 45 [] organization(sk4,sk7).
% 1.75/1.96 ** KEPT (pick-wt=3): 46 [] organization(sk4,sk8).
% 1.75/1.96 ** KEPT (pick-wt=4): 47 [] reorganization(sk4,sk9,sk10).
% 1.75/1.96 ** KEPT (pick-wt=4): 48 [] reproducibility(sk4,sk5,sk7).
% 1.75/1.96 ** KEPT (pick-wt=4): 49 [] reproducibility(sk4,sk6,sk8).
% 1.75/1.96 ** KEPT (pick-wt=3): 50 [] greater(sk8,sk7).
% 1.75/1.96
% 1.75/1.96 ======= end of input processing =======
% 1.75/1.96
% 1.75/1.96 =========== start of search ===========
% 1.75/1.96
% 1.75/1.96 -------- PROOF --------
% 1.75/1.96
% 1.75/1.96 ----> UNIT CONFLICT at 0.02 sec ----> 63 [binary,62.1,11.1] $F.
% 1.75/1.96
% 1.75/1.96 Length of proof is 7. Level of proof is 3.
% 1.75/1.96
% 1.75/1.96 ---------------- PROOF ----------------
% 1.75/1.96 % SZS status Unsatisfiable
% 1.75/1.96 % SZS output start Refutation
% See solution above
% 1.75/1.96 ------------ end of proof -------------
% 1.75/1.96
% 1.75/1.96
% 1.75/1.96 Search stopped by max_proofs option.
% 1.75/1.96
% 1.75/1.96
% 1.75/1.96 Search stopped by max_proofs option.
% 1.75/1.96
% 1.75/1.96 ============ end of search ============
% 1.75/1.96
% 1.75/1.96 -------------- statistics -------------
% 1.75/1.96 clauses given 14
% 1.75/1.96 clauses generated 113
% 1.75/1.96 clauses kept 62
% 1.75/1.96 clauses forward subsumed 42
% 1.75/1.96 clauses back subsumed 0
% 1.75/1.96 Kbytes malloced 976
% 1.75/1.96
% 1.75/1.96 ----------- times (seconds) -----------
% 1.75/1.96 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.75/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.96
% 1.75/1.96 That finishes the proof of the theorem.
% 1.75/1.96
% 1.75/1.96 Process 5479 finished Wed Jul 27 03:44:47 2022
% 1.75/1.96 Otter interrupted
% 1.75/1.96 PROOF FOUND
%------------------------------------------------------------------------------