TSTP Solution File: MGT012+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT012+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:59 EDT 2022
% Result : Theorem 2.00s 2.16s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 22 ( 16 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 2 equ; 24 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| inertia(A,dollar_f1(A,B),B) ),
file('MGT012+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ greater(A,B)
| ~ greater(B,A) ),
file('MGT012+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ organization(A,B)
| class(A,dollar_f2(A,B),B) ),
file('MGT012+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ class(A,D,B)
| ~ class(A,E,C)
| D = E ),
file('MGT012+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,D)
| ~ complexity(A,F,B)
| ~ complexity(C,G,D)
| ~ inertia(A,H,B)
| ~ inertia(C,I,D)
| ~ greater(G,F)
| greater(I,H) ),
file('MGT012+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ inertia(A,D,B)
| ~ inertia(A,E,C)
| ~ greater(C,B)
| greater(E,D) ),
file('MGT012+1.p',unknown),
[] ).
cnf(9,axiom,
organization(dollar_c5,dollar_c2),
file('MGT012+1.p',unknown),
[] ).
cnf(10,axiom,
organization(dollar_c5,dollar_c1),
file('MGT012+1.p',unknown),
[] ).
cnf(11,axiom,
reorganization_free(dollar_c5,dollar_c2,dollar_c1),
file('MGT012+1.p',unknown),
[] ).
cnf(12,axiom,
complexity(dollar_c5,dollar_c4,dollar_c2),
file('MGT012+1.p',unknown),
[] ).
cnf(13,axiom,
complexity(dollar_c5,dollar_c3,dollar_c1),
file('MGT012+1.p',unknown),
[] ).
cnf(14,axiom,
greater(dollar_c1,dollar_c2),
file('MGT012+1.p',unknown),
[] ).
cnf(15,axiom,
greater(dollar_c4,dollar_c3),
file('MGT012+1.p',unknown),
[] ).
cnf(16,plain,
class(dollar_c5,dollar_f2(dollar_c5,dollar_c2),dollar_c2),
inference(hyper,[status(thm)],[9,4]),
[iquote('hyper,9,4')] ).
cnf(17,plain,
inertia(dollar_c5,dollar_f1(dollar_c5,dollar_c2),dollar_c2),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(20,plain,
class(dollar_c5,dollar_f2(dollar_c5,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[10,4]),
[iquote('hyper,10,4')] ).
cnf(21,plain,
inertia(dollar_c5,dollar_f1(dollar_c5,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[10,1]),
[iquote('hyper,10,1')] ).
cnf(50,plain,
dollar_f2(dollar_c5,dollar_c2) = dollar_f2(dollar_c5,dollar_c1),
inference(hyper,[status(thm)],[20,5,9,10,11,16]),
[iquote('hyper,20,5,9,10,11,16')] ).
cnf(54,plain,
class(dollar_c5,dollar_f2(dollar_c5,dollar_c1),dollar_c2),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[16]),50]),
[iquote('back_demod,16,demod,50')] ).
cnf(60,plain,
greater(dollar_f1(dollar_c5,dollar_c1),dollar_f1(dollar_c5,dollar_c2)),
inference(hyper,[status(thm)],[21,7,9,10,11,17,14]),
[iquote('hyper,21,7,9,10,11,17,14')] ).
cnf(66,plain,
greater(dollar_f1(dollar_c5,dollar_c2),dollar_f1(dollar_c5,dollar_c1)),
inference(hyper,[status(thm)],[54,6,10,9,20,13,12,21,17,15]),
[iquote('hyper,54,6,10,9,20,13,12,21,17,15')] ).
cnf(79,plain,
$false,
inference(hyper,[status(thm)],[66,3,60]),
[iquote('hyper,66,3,60')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT012+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:15:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.56/2.15 ----- Otter 3.3f, August 2004 -----
% 1.56/2.15 The process was started by sandbox2 on n026.cluster.edu,
% 1.56/2.15 Wed Jul 27 04:15:54 2022
% 1.56/2.15 The command was "./otter". The process ID is 1939.
% 1.56/2.15
% 1.56/2.15 set(prolog_style_variables).
% 1.56/2.15 set(auto).
% 1.56/2.15 dependent: set(auto1).
% 1.56/2.15 dependent: set(process_input).
% 1.56/2.15 dependent: clear(print_kept).
% 1.56/2.15 dependent: clear(print_new_demod).
% 1.56/2.15 dependent: clear(print_back_demod).
% 1.56/2.15 dependent: clear(print_back_sub).
% 1.56/2.15 dependent: set(control_memory).
% 1.56/2.15 dependent: assign(max_mem, 12000).
% 1.56/2.15 dependent: assign(pick_given_ratio, 4).
% 1.56/2.15 dependent: assign(stats_level, 1).
% 1.56/2.15 dependent: assign(max_seconds, 10800).
% 1.56/2.15 clear(print_given).
% 1.56/2.15
% 1.56/2.15 formula_list(usable).
% 1.56/2.15 all A (A=A).
% 1.56/2.15 all X T (organization(X,T)-> (exists I inertia(X,I,T))).
% 1.56/2.15 all X Y (-(greater(X,Y)&X=Y)).
% 1.56/2.15 all X Y (-(greater(X,Y)&greater(Y,X))).
% 1.56/2.15 all X T (organization(X,T)-> (exists C class(X,C,T))).
% 1.56/2.15 all X T1 T2 C1 C2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&class(X,C1,T1)&class(X,C2,T2)->C1=C2).
% 1.56/2.15 all X Y C C1 C2 I1 I2 T1 T2 (organization(X,T1)&organization(Y,T2)&class(X,C,T1)&class(Y,C,T2)&complexity(X,C1,T1)&complexity(Y,C2,T2)&inertia(X,I1,T1)&inertia(Y,I2,T2)&greater(C2,C1)->greater(I2,I1)).
% 1.56/2.15 all X I1 I2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&inertia(X,I1,T1)&inertia(X,I2,T2)&greater(T2,T1)->greater(I2,I1)).
% 1.56/2.15 -(all X C1 C2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&complexity(X,C1,T1)&complexity(X,C2,T2)&greater(T2,T1)-> -greater(C1,C2))).
% 1.56/2.15 end_of_list.
% 1.56/2.15
% 1.56/2.15 -------> usable clausifies to:
% 1.56/2.15
% 1.56/2.15 list(usable).
% 1.56/2.15 0 [] A=A.
% 1.56/2.15 0 [] -organization(X,T)|inertia(X,$f1(X,T),T).
% 1.56/2.15 0 [] -greater(X,Y)|X!=Y.
% 1.56/2.15 0 [] -greater(X,Y)| -greater(Y,X).
% 1.56/2.15 0 [] -organization(X,T)|class(X,$f2(X,T),T).
% 1.56/2.15 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization_free(X,T1,T2)| -class(X,C1,T1)| -class(X,C2,T2)|C1=C2.
% 1.56/2.15 0 [] -organization(X,T1)| -organization(Y,T2)| -class(X,C,T1)| -class(Y,C,T2)| -complexity(X,C1,T1)| -complexity(Y,C2,T2)| -inertia(X,I1,T1)| -inertia(Y,I2,T2)| -greater(C2,C1)|greater(I2,I1).
% 1.56/2.15 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization_free(X,T1,T2)| -inertia(X,I1,T1)| -inertia(X,I2,T2)| -greater(T2,T1)|greater(I2,I1).
% 1.56/2.15 0 [] organization($c5,$c2).
% 1.56/2.15 0 [] organization($c5,$c1).
% 1.56/2.15 0 [] reorganization_free($c5,$c2,$c1).
% 1.56/2.15 0 [] complexity($c5,$c4,$c2).
% 1.56/2.15 0 [] complexity($c5,$c3,$c1).
% 1.56/2.15 0 [] greater($c1,$c2).
% 1.56/2.15 0 [] greater($c4,$c3).
% 1.56/2.15 end_of_list.
% 1.56/2.15
% 1.56/2.15 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=10.
% 1.56/2.15
% 1.56/2.15 This is a Horn set with equality. The strategy will be
% 1.56/2.15 Knuth-Bendix and hyper_res, with positive clauses in
% 1.56/2.15 sos and nonpositive clauses in usable.
% 1.56/2.15
% 1.56/2.15 dependent: set(knuth_bendix).
% 1.56/2.15 dependent: set(anl_eq).
% 1.56/2.15 dependent: set(para_from).
% 1.56/2.15 dependent: set(para_into).
% 1.56/2.15 dependent: clear(para_from_right).
% 1.56/2.15 dependent: clear(para_into_right).
% 1.56/2.15 dependent: set(para_from_vars).
% 1.56/2.15 dependent: set(eq_units_both_ways).
% 1.56/2.15 dependent: set(dynamic_demod_all).
% 1.56/2.15 dependent: set(dynamic_demod).
% 1.56/2.15 dependent: set(order_eq).
% 1.56/2.15 dependent: set(back_demod).
% 1.56/2.15 dependent: set(lrpo).
% 1.56/2.15 dependent: set(hyper_res).
% 1.56/2.15 dependent: clear(order_hyper).
% 1.56/2.15
% 1.56/2.15 ------------> process usable:
% 1.56/2.15 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|inertia(A,$f1(A,B),B).
% 1.56/2.15 ** KEPT (pick-wt=6): 2 [] -greater(A,B)|A!=B.
% 1.56/2.15 ** KEPT (pick-wt=6): 3 [] -greater(A,B)| -greater(B,A).
% 1.56/2.15 ** KEPT (pick-wt=9): 4 [] -organization(A,B)|class(A,$f2(A,B),B).
% 1.56/2.15 ** KEPT (pick-wt=21): 5 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -class(A,D,B)| -class(A,E,C)|D=E.
% 1.56/2.15 ** KEPT (pick-wt=36): 6 [] -organization(A,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,D)| -complexity(A,F,B)| -complexity(C,G,D)| -inertia(A,H,B)| -inertia(C,I,D)| -greater(G,F)|greater(I,H).
% 1.56/2.15 ** KEPT (pick-wt=24): 7 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -inertia(A,D,B)| -inertia(A,E,C)| -greater(C,B)|greater(E,D).
% 1.56/2.15
% 1.56/2.15 ------------> process sos:
% 1.56/2.15 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.56/2.15 ** KEPT (pick-wt=3): 9 [] organization($c5,$c2).
% 1.56/2.15 ** KEPT (pick-wt=3): 10 [] organization($c5,$c1).
% 1.56/2.15 ** KEPT (pick-wt=4): 11 [] reorganization_free($c5,$c2,$c1).
% 1.56/2.15 ** KEPT (pick-wt=4): 12 [] complexity($c5,$c4,$c2).
% 2.00/2.16 ** KEPT (pick-wt=4): 13 [] complexity($c5,$c3,$c1).
% 2.00/2.16 ** KEPT (pick-wt=3): 14 [] greater($c1,$c2).
% 2.00/2.16 ** KEPT (pick-wt=3): 15 [] greater($c4,$c3).
% 2.00/2.16 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 2.00/2.16
% 2.00/2.16 ======= end of input processing =======
% 2.00/2.16
% 2.00/2.16 =========== start of search ===========
% 2.00/2.16
% 2.00/2.16 -------- PROOF --------
% 2.00/2.16
% 2.00/2.16 -----> EMPTY CLAUSE at 0.01 sec ----> 79 [hyper,66,3,60] $F.
% 2.00/2.16
% 2.00/2.16 Length of proof is 8. Level of proof is 4.
% 2.00/2.16
% 2.00/2.16 ---------------- PROOF ----------------
% 2.00/2.16 % SZS status Theorem
% 2.00/2.16 % SZS output start Refutation
% See solution above
% 2.00/2.16 ------------ end of proof -------------
% 2.00/2.16
% 2.00/2.16
% 2.00/2.16 Search stopped by max_proofs option.
% 2.00/2.16
% 2.00/2.16
% 2.00/2.16 Search stopped by max_proofs option.
% 2.00/2.16
% 2.00/2.16 ============ end of search ============
% 2.00/2.16
% 2.00/2.16 -------------- statistics -------------
% 2.00/2.16 clauses given 18
% 2.00/2.16 clauses generated 67
% 2.00/2.16 clauses kept 77
% 2.00/2.16 clauses forward subsumed 9
% 2.00/2.16 clauses back subsumed 0
% 2.00/2.16 Kbytes malloced 976
% 2.00/2.16
% 2.00/2.16 ----------- times (seconds) -----------
% 2.00/2.16 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.00/2.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.16 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.16
% 2.00/2.16 That finishes the proof of the theorem.
% 2.00/2.16
% 2.00/2.16 Process 1939 finished Wed Jul 27 04:15:56 2022
% 2.00/2.16 Otter interrupted
% 2.00/2.16 PROOF FOUND
%------------------------------------------------------------------------------