TSTP Solution File: MGT018+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT018+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:06:01 EDT 2022
% Result : Theorem 1.91s 2.10s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 16
% Syntax : Number of clauses : 20 ( 17 unt; 1 nHn; 20 RR)
% Number of literals : 42 ( 0 equ; 23 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| inertia(A,dollar_f1(A,B),B) ),
file('MGT018+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,D)
| ~ size(A,F,B)
| ~ size(C,G,D)
| ~ inertia(A,H,B)
| ~ inertia(C,I,D)
| ~ greater(G,F)
| greater(I,H) ),
file('MGT018+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| ~ organization(C,B)
| organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,B)
| ~ reorganization(A,B,F)
| ~ reorganization(C,B,D)
| ~ reorganization_type(A,G,B)
| ~ reorganization_type(C,G,B)
| ~ inertia(A,H,B)
| ~ inertia(C,I,B)
| ~ greater(I,H)
| greater(F,D) ),
file('MGT018+1.p',unknown),
[] ).
cnf(4,axiom,
~ organization(dollar_c8,dollar_c1),
file('MGT018+1.p',unknown),
[] ).
cnf(5,axiom,
~ greater(dollar_c2,dollar_c1),
file('MGT018+1.p',unknown),
[] ).
cnf(14,axiom,
organization(dollar_c9,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(15,axiom,
organization(dollar_c8,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(16,axiom,
class(dollar_c9,dollar_c6,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(17,axiom,
class(dollar_c8,dollar_c6,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(18,axiom,
reorganization(dollar_c9,dollar_c3,dollar_c2),
file('MGT018+1.p',unknown),
[] ).
cnf(19,axiom,
reorganization(dollar_c8,dollar_c3,dollar_c1),
file('MGT018+1.p',unknown),
[] ).
cnf(20,axiom,
reorganization_type(dollar_c9,dollar_c7,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(21,axiom,
reorganization_type(dollar_c8,dollar_c7,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(22,axiom,
size(dollar_c9,dollar_c5,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(23,axiom,
size(dollar_c8,dollar_c4,dollar_c3),
file('MGT018+1.p',unknown),
[] ).
cnf(24,axiom,
greater(dollar_c4,dollar_c5),
file('MGT018+1.p',unknown),
[] ).
cnf(25,plain,
inertia(dollar_c9,dollar_f1(dollar_c9,dollar_c3),dollar_c3),
inference(hyper,[status(thm)],[14,1]),
[iquote('hyper,14,1')] ).
cnf(26,plain,
inertia(dollar_c8,dollar_f1(dollar_c8,dollar_c3),dollar_c3),
inference(hyper,[status(thm)],[15,1]),
[iquote('hyper,15,1')] ).
cnf(27,plain,
greater(dollar_f1(dollar_c8,dollar_c3),dollar_f1(dollar_c9,dollar_c3)),
inference(hyper,[status(thm)],[26,2,14,15,16,17,22,23,25,24]),
[iquote('hyper,26,2,14,15,16,17,22,23,25,24')] ).
cnf(28,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[27,3,14,15,16,17,18,19,20,21,25,26]),4,5]),
[iquote('hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT018+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:16:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.91/2.10 ----- Otter 3.3f, August 2004 -----
% 1.91/2.10 The process was started by sandbox2 on n026.cluster.edu,
% 1.91/2.10 Wed Jul 27 04:16:09 2022
% 1.91/2.10 The command was "./otter". The process ID is 2841.
% 1.91/2.10
% 1.91/2.10 set(prolog_style_variables).
% 1.91/2.10 set(auto).
% 1.91/2.10 dependent: set(auto1).
% 1.91/2.10 dependent: set(process_input).
% 1.91/2.10 dependent: clear(print_kept).
% 1.91/2.10 dependent: clear(print_new_demod).
% 1.91/2.10 dependent: clear(print_back_demod).
% 1.91/2.10 dependent: clear(print_back_sub).
% 1.91/2.10 dependent: set(control_memory).
% 1.91/2.10 dependent: assign(max_mem, 12000).
% 1.91/2.10 dependent: assign(pick_given_ratio, 4).
% 1.91/2.10 dependent: assign(stats_level, 1).
% 1.91/2.10 dependent: assign(max_seconds, 10800).
% 1.91/2.10 clear(print_given).
% 1.91/2.10
% 1.91/2.10 formula_list(usable).
% 1.91/2.10 all X T (organization(X,T)-> (exists I inertia(X,I,T))).
% 1.91/2.10 all X Y C S1 S2 I1 I2 T1 T2 (organization(X,T1)&organization(Y,T2)&class(X,C,T1)&class(Y,C,T2)&size(X,S1,T1)&size(Y,S2,T2)&inertia(X,I1,T1)&inertia(Y,I2,T2)&greater(S2,S1)->greater(I2,I1)).
% 1.91/2.10 all X Y Rt C I1 I2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)& -organization(Y,Tc)&class(X,C,Ta)&class(Y,C,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Rt,Ta)&reorganization_type(Y,Rt,Ta)&inertia(X,I1,Ta)&inertia(Y,I2,Ta)&greater(I2,I1)->greater(Tb,Tc)).
% 1.91/2.10 -(all X Y Rt C S1 S2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)& -organization(Y,Tc)&class(X,C,Ta)&class(Y,C,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Rt,Ta)&reorganization_type(Y,Rt,Ta)&size(X,S1,Ta)&size(Y,S2,Ta)&greater(S2,S1)->greater(Tb,Tc))).
% 1.91/2.10 end_of_list.
% 1.91/2.10
% 1.91/2.10 -------> usable clausifies to:
% 1.91/2.10
% 1.91/2.10 list(usable).
% 1.91/2.10 0 [] -organization(X,T)|inertia(X,$f1(X,T),T).
% 1.91/2.10 0 [] -organization(X,T1)| -organization(Y,T2)| -class(X,C,T1)| -class(Y,C,T2)| -size(X,S1,T1)| -size(Y,S2,T2)| -inertia(X,I1,T1)| -inertia(Y,I2,T2)| -greater(S2,S1)|greater(I2,I1).
% 1.91/2.10 0 [] -organization(X,Ta)| -organization(Y,Ta)|organization(Y,Tc)| -class(X,C,Ta)| -class(Y,C,Ta)| -reorganization(X,Ta,Tb)| -reorganization(Y,Ta,Tc)| -reorganization_type(X,Rt,Ta)| -reorganization_type(Y,Rt,Ta)| -inertia(X,I1,Ta)| -inertia(Y,I2,Ta)| -greater(I2,I1)|greater(Tb,Tc).
% 1.91/2.10 0 [] organization($c9,$c3).
% 1.91/2.10 0 [] organization($c8,$c3).
% 1.91/2.10 0 [] -organization($c8,$c1).
% 1.91/2.10 0 [] class($c9,$c6,$c3).
% 1.91/2.10 0 [] class($c8,$c6,$c3).
% 1.91/2.10 0 [] reorganization($c9,$c3,$c2).
% 1.91/2.10 0 [] reorganization($c8,$c3,$c1).
% 1.91/2.10 0 [] reorganization_type($c9,$c7,$c3).
% 1.91/2.10 0 [] reorganization_type($c8,$c7,$c3).
% 1.91/2.10 0 [] size($c9,$c5,$c3).
% 1.91/2.10 0 [] size($c8,$c4,$c3).
% 1.91/2.10 0 [] greater($c4,$c5).
% 1.91/2.10 0 [] -greater($c2,$c1).
% 1.91/2.10 end_of_list.
% 1.91/2.10
% 1.91/2.10 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 1.91/2.10
% 1.91/2.10 This is a non-Horn set without equality. The strategy will
% 1.91/2.10 be ordered hyper_res, unit deletion, and factoring, with
% 1.91/2.10 satellites in sos and with nuclei in usable.
% 1.91/2.10
% 1.91/2.10 dependent: set(hyper_res).
% 1.91/2.10 dependent: set(factor).
% 1.91/2.10 dependent: set(unit_deletion).
% 1.91/2.10
% 1.91/2.10 ------------> process usable:
% 1.91/2.10 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|inertia(A,$f1(A,B),B).
% 1.91/2.10 ** KEPT (pick-wt=36): 2 [] -organization(A,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,D)| -size(A,F,B)| -size(C,G,D)| -inertia(A,H,B)| -inertia(C,I,D)| -greater(G,F)|greater(I,H).
% 1.91/2.10 ** KEPT (pick-wt=47): 3 [] -organization(A,B)| -organization(C,B)|organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -inertia(A,H,B)| -inertia(C,I,B)| -greater(I,H)|greater(F,D).
% 1.91/2.10 ** KEPT (pick-wt=3): 4 [] -organization($c8,$c1).
% 1.91/2.10 ** KEPT (pick-wt=3): 5 [] -greater($c2,$c1).
% 1.91/2.10
% 1.91/2.10 ------------> process sos:
% 1.91/2.10 ** KEPT (pick-wt=3): 14 [] organization($c9,$c3).
% 1.91/2.10 ** KEPT (pick-wt=3): 15 [] organization($c8,$c3).
% 1.91/2.10 ** KEPT (pick-wt=4): 16 [] class($c9,$c6,$c3).
% 1.91/2.10 ** KEPT (pick-wt=4): 17 [] class($c8,$c6,$c3).
% 1.91/2.10 ** KEPT (pick-wt=4): 18 [] reorganization($c9,$c3,$c2).
% 1.91/2.10 ** KEPT (pick-wt=4): 19 [] reorganization($c8,$c3,$c1).
% 1.91/2.10 ** KEPT (pick-wt=4): 20 [] reorganization_type($c9,$c7,$c3).
% 1.91/2.10 ** KEPT (pick-wt=4): 21 [] reorganization_type($c8,$c7,$c3).
% 1.91/2.10 ** KEPT (pick-wt=4): 22 [] size($c9,$c5,$c3).
% 1.91/2.10 ** KEPT (pick-wt=4): 23 [] size($c8,$c4,$c3).
% 1.91/2.10 ** KEPT (pick-wt=3): 24 [] greater($c4,$c5).
% 1.91/2.10
% 1.91/2.10 ======= end of input processing =======
% 1.91/2.10
% 1.91/2.10 =========== start of search ===========
% 1.91/2.10
% 1.91/2.10 -------- PROOF --------
% 1.91/2.10
% 1.91/2.10 -----> EMPTY CLAUSE at 0.00 sec ----> 28 [hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5] $F.
% 1.91/2.10
% 1.91/2.10 Length of proof is 3. Level of proof is 2.
% 1.91/2.10
% 1.91/2.10 ---------------- PROOF ----------------
% 1.91/2.10 % SZS status Theorem
% 1.91/2.10 % SZS output start Refutation
% See solution above
% 1.91/2.10 ------------ end of proof -------------
% 1.91/2.10
% 1.91/2.10
% 1.91/2.10 Search stopped by max_proofs option.
% 1.91/2.10
% 1.91/2.10
% 1.91/2.10 Search stopped by max_proofs option.
% 1.91/2.10
% 1.91/2.10 ============ end of search ============
% 1.91/2.10
% 1.91/2.10 -------------- statistics -------------
% 1.91/2.10 clauses given 14
% 1.91/2.10 clauses generated 21
% 1.91/2.10 clauses kept 27
% 1.91/2.10 clauses forward subsumed 9
% 1.91/2.10 clauses back subsumed 0
% 1.91/2.10 Kbytes malloced 976
% 1.91/2.10
% 1.91/2.10 ----------- times (seconds) -----------
% 1.91/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.10 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.91/2.10
% 1.91/2.10 That finishes the proof of the theorem.
% 1.91/2.10
% 1.91/2.10 Process 2841 finished Wed Jul 27 04:16:10 2022
% 1.91/2.10 Otter interrupted
% 1.91/2.10 PROOF FOUND
%------------------------------------------------------------------------------