TSTP Solution File: MGT014+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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 1.79s 2.00s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 29 ( 19 unt; 3 nHn; 28 RR)
% Number of literals : 60 ( 10 equ; 30 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 30 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ greater(A,B)
| ~ greater(B,A) ),
file('MGT014+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| time(B) ),
file('MGT014+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ time(A)
| ~ time(B)
| greater(A,B)
| A = B
| greater(B,A) ),
file('MGT014+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ reorganization_free(A,B,C)
| reorganization_free(A,C,B) ),
file('MGT014+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ size(A,D,B)
| ~ size(A,E,C)
| B != C
| D = E ),
file('MGT014+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ size(A,D,B)
| ~ size(A,E,C)
| ~ greater(C,B)
| ~ greater(D,E) ),
file('MGT014+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ complexity(A,D,B)
| ~ complexity(A,E,C)
| ~ greater(C,B)
| ~ greater(D,E) ),
file('MGT014+1.p',unknown),
[] ).
cnf(9,plain,
~ greater(A,A),
inference(factor,[status(thm)],[2]),
[iquote('factor,2.1.2')] ).
cnf(11,plain,
( ~ organization(A,B)
| ~ size(A,C,B)
| ~ size(A,D,B)
| B != B
| C = D ),
inference(factor,[status(thm)],[6]),
[iquote('factor,6.1.2')] ).
cnf(15,axiom,
A = A,
file('MGT014+1.p',unknown),
[] ).
cnf(16,axiom,
organization(dollar_c7,dollar_c2),
file('MGT014+1.p',unknown),
[] ).
cnf(17,axiom,
organization(dollar_c7,dollar_c1),
file('MGT014+1.p',unknown),
[] ).
cnf(18,axiom,
reorganization_free(dollar_c7,dollar_c2,dollar_c1),
file('MGT014+1.p',unknown),
[] ).
cnf(19,axiom,
complexity(dollar_c7,dollar_c6,dollar_c2),
file('MGT014+1.p',unknown),
[] ).
cnf(20,axiom,
complexity(dollar_c7,dollar_c5,dollar_c1),
file('MGT014+1.p',unknown),
[] ).
cnf(21,axiom,
size(dollar_c7,dollar_c4,dollar_c2),
file('MGT014+1.p',unknown),
[] ).
cnf(22,axiom,
size(dollar_c7,dollar_c3,dollar_c1),
file('MGT014+1.p',unknown),
[] ).
cnf(23,axiom,
greater(dollar_c3,dollar_c4),
file('MGT014+1.p',unknown),
[] ).
cnf(24,axiom,
greater(dollar_c6,dollar_c5),
file('MGT014+1.p',unknown),
[] ).
cnf(25,plain,
time(dollar_c2),
inference(hyper,[status(thm)],[16,3]),
[iquote('hyper,16,3')] ).
cnf(34,plain,
time(dollar_c1),
inference(hyper,[status(thm)],[17,3]),
[iquote('hyper,17,3')] ).
cnf(41,plain,
( greater(dollar_c2,dollar_c1)
| dollar_c2 = dollar_c1
| greater(dollar_c1,dollar_c2) ),
inference(hyper,[status(thm)],[34,4,25]),
[iquote('hyper,34,4,25')] ).
cnf(44,plain,
reorganization_free(dollar_c7,dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[18,5]),
[iquote('hyper,18,5')] ).
cnf(111,plain,
( dollar_c2 = dollar_c1
| greater(dollar_c1,dollar_c2) ),
inference(hyper,[status(thm)],[41,7,17,16,44,22,21,23]),
[iquote('hyper,41,7,17,16,44,22,21,23')] ).
cnf(114,plain,
dollar_c2 = dollar_c1,
inference(hyper,[status(thm)],[111,8,16,17,18,19,20,24]),
[iquote('hyper,111,8,16,17,18,19,20,24')] ).
cnf(143,plain,
size(dollar_c7,dollar_c4,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[21]),114]),
[iquote('back_demod,21,demod,114')] ).
cnf(165,plain,
dollar_c4 = dollar_c3,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[143,11,17,22,15])]),
[iquote('hyper,143,11,17,22,15,flip.1')] ).
cnf(171,plain,
greater(dollar_c3,dollar_c3),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[23]),165]),
[iquote('back_demod,23,demod,165')] ).
cnf(172,plain,
$false,
inference(binary,[status(thm)],[171,9]),
[iquote('binary,171.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n021.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:57:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.79/1.99 ----- Otter 3.3f, August 2004 -----
% 1.79/1.99 The process was started by sandbox on n021.cluster.edu,
% 1.79/1.99 Wed Jul 27 03:57:38 2022
% 1.79/1.99 The command was "./otter". The process ID is 29630.
% 1.79/1.99
% 1.79/1.99 set(prolog_style_variables).
% 1.79/1.99 set(auto).
% 1.79/1.99 dependent: set(auto1).
% 1.79/1.99 dependent: set(process_input).
% 1.79/1.99 dependent: clear(print_kept).
% 1.79/1.99 dependent: clear(print_new_demod).
% 1.79/1.99 dependent: clear(print_back_demod).
% 1.79/1.99 dependent: clear(print_back_sub).
% 1.79/1.99 dependent: set(control_memory).
% 1.79/1.99 dependent: assign(max_mem, 12000).
% 1.79/1.99 dependent: assign(pick_given_ratio, 4).
% 1.79/1.99 dependent: assign(stats_level, 1).
% 1.79/1.99 dependent: assign(max_seconds, 10800).
% 1.79/1.99 clear(print_given).
% 1.79/1.99
% 1.79/1.99 formula_list(usable).
% 1.79/1.99 all A (A=A).
% 1.79/1.99 all X Y (-(greater(X,Y)&X=Y)).
% 1.79/1.99 all X Y (-(greater(X,Y)&greater(Y,X))).
% 1.79/1.99 all X T (organization(X,T)->time(T)).
% 1.79/1.99 all T1 T2 (time(T1)&time(T2)->greater(T1,T2)|T1=T2|greater(T2,T1)).
% 1.79/1.99 all X T1 T2 (reorganization_free(X,T1,T2)->reorganization_free(X,T2,T1)).
% 1.79/1.99 all X S1 S2 T1 T2 (organization(X,T1)&organization(X,T2)&size(X,S1,T1)&size(X,S2,T2)&T1=T2->S1=S2).
% 1.79/1.99 all X S1 S2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&size(X,S1,T1)&size(X,S2,T2)&greater(T2,T1)-> -greater(S1,S2)).
% 1.79/1.99 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.79/1.99 -(all X C1 C2 S1 S2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&complexity(X,C1,T1)&complexity(X,C2,T2)&size(X,S1,T1)&size(X,S2,T2)&greater(S2,S1)-> -greater(C1,C2))).
% 1.79/1.99 end_of_list.
% 1.79/1.99
% 1.79/1.99 -------> usable clausifies to:
% 1.79/1.99
% 1.79/1.99 list(usable).
% 1.79/1.99 0 [] A=A.
% 1.79/1.99 0 [] -greater(X,Y)|X!=Y.
% 1.79/1.99 0 [] -greater(X,Y)| -greater(Y,X).
% 1.79/1.99 0 [] -organization(X,T)|time(T).
% 1.79/1.99 0 [] -time(T1)| -time(T2)|greater(T1,T2)|T1=T2|greater(T2,T1).
% 1.79/1.99 0 [] -reorganization_free(X,T1,T2)|reorganization_free(X,T2,T1).
% 1.79/1.99 0 [] -organization(X,T1)| -organization(X,T2)| -size(X,S1,T1)| -size(X,S2,T2)|T1!=T2|S1=S2.
% 1.79/1.99 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization_free(X,T1,T2)| -size(X,S1,T1)| -size(X,S2,T2)| -greater(T2,T1)| -greater(S1,S2).
% 1.79/1.99 0 [] -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.79/1.99 0 [] organization($c7,$c2).
% 1.79/1.99 0 [] organization($c7,$c1).
% 1.79/1.99 0 [] reorganization_free($c7,$c2,$c1).
% 1.79/1.99 0 [] complexity($c7,$c6,$c2).
% 1.79/1.99 0 [] complexity($c7,$c5,$c1).
% 1.79/1.99 0 [] size($c7,$c4,$c2).
% 1.79/1.99 0 [] size($c7,$c3,$c1).
% 1.79/1.99 0 [] greater($c3,$c4).
% 1.79/1.99 0 [] greater($c6,$c5).
% 1.79/1.99 end_of_list.
% 1.79/1.99
% 1.79/1.99 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.79/1.99
% 1.79/1.99 This ia a non-Horn set with equality. The strategy will be
% 1.79/1.99 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/1.99 deletion, with positive clauses in sos and nonpositive
% 1.79/1.99 clauses in usable.
% 1.79/1.99
% 1.79/1.99 dependent: set(knuth_bendix).
% 1.79/1.99 dependent: set(anl_eq).
% 1.79/1.99 dependent: set(para_from).
% 1.79/1.99 dependent: set(para_into).
% 1.79/1.99 dependent: clear(para_from_right).
% 1.79/1.99 dependent: clear(para_into_right).
% 1.79/1.99 dependent: set(para_from_vars).
% 1.79/1.99 dependent: set(eq_units_both_ways).
% 1.79/1.99 dependent: set(dynamic_demod_all).
% 1.79/1.99 dependent: set(dynamic_demod).
% 1.79/1.99 dependent: set(order_eq).
% 1.79/1.99 dependent: set(back_demod).
% 1.79/1.99 dependent: set(lrpo).
% 1.79/1.99 dependent: set(hyper_res).
% 1.79/1.99 dependent: set(unit_deletion).
% 1.79/1.99 dependent: set(factor).
% 1.79/1.99
% 1.79/1.99 ------------> process usable:
% 1.79/1.99 ** KEPT (pick-wt=6): 1 [] -greater(A,B)|A!=B.
% 1.79/1.99 ** KEPT (pick-wt=6): 2 [] -greater(A,B)| -greater(B,A).
% 1.79/1.99 ** KEPT (pick-wt=5): 3 [] -organization(A,B)|time(B).
% 1.79/1.99 ** KEPT (pick-wt=13): 4 [] -time(A)| -time(B)|greater(A,B)|A=B|greater(B,A).
% 1.79/1.99 ** KEPT (pick-wt=8): 5 [] -reorganization_free(A,B,C)|reorganization_free(A,C,B).
% 1.79/1.99 ** KEPT (pick-wt=20): 6 [] -organization(A,B)| -organization(A,C)| -size(A,D,B)| -size(A,E,C)|B!=C|D=E.
% 1.79/1.99 ** KEPT (pick-wt=24): 7 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -size(A,D,B)| -size(A,E,C)| -greater(C,B)| -greater(D,E).
% 1.79/1.99 ** KEPT (pick-wt=24): 8 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -complexity(A,D,B)| -complexity(A,E,C)| -greater(C,B)| -greater(D,E).
% 1.79/1.99
% 1.79/1.99 ------------> process sos:
% 1.79/1.99 ** KEPT (pick-wt=3): 15 [] A=A.
% 1.79/1.99 ** KEPT (pick-wt=3): 16 [] organization($c7,$c2).
% 1.79/2.00 ** KEPT (pick-wt=3): 17 [] organization($c7,$c1).
% 1.79/2.00 ** KEPT (pick-wt=4): 18 [] reorganization_free($c7,$c2,$c1).
% 1.79/2.00 ** KEPT (pick-wt=4): 19 [] complexity($c7,$c6,$c2).
% 1.79/2.00 ** KEPT (pick-wt=4): 20 [] complexity($c7,$c5,$c1).
% 1.79/2.00 ** KEPT (pick-wt=4): 21 [] size($c7,$c4,$c2).
% 1.79/2.00 ** KEPT (pick-wt=4): 22 [] size($c7,$c3,$c1).
% 1.79/2.00 ** KEPT (pick-wt=3): 23 [] greater($c3,$c4).
% 1.79/2.00 ** KEPT (pick-wt=3): 24 [] greater($c6,$c5).
% 1.79/2.00 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 1.79/2.00 15 back subsumes 12.
% 1.79/2.00 15 back subsumes 10.
% 1.79/2.00
% 1.79/2.00 ======= end of input processing =======
% 1.79/2.00
% 1.79/2.00 =========== start of search ===========
% 1.79/2.00
% 1.79/2.00 -------- PROOF --------
% 1.79/2.00
% 1.79/2.00 ----> UNIT CONFLICT at 0.01 sec ----> 172 [binary,171.1,9.1] $F.
% 1.79/2.00
% 1.79/2.00 Length of proof is 11. Level of proof is 7.
% 1.79/2.00
% 1.79/2.00 ---------------- PROOF ----------------
% 1.79/2.00 % SZS status Theorem
% 1.79/2.00 % SZS output start Refutation
% See solution above
% 1.79/2.00 ------------ end of proof -------------
% 1.79/2.00
% 1.79/2.00
% 1.79/2.00 Search stopped by max_proofs option.
% 1.79/2.00
% 1.79/2.00
% 1.79/2.00 Search stopped by max_proofs option.
% 1.79/2.00
% 1.79/2.00 ============ end of search ============
% 1.79/2.00
% 1.79/2.00 -------------- statistics -------------
% 1.79/2.00 clauses given 19
% 1.79/2.00 clauses generated 392
% 1.79/2.00 clauses kept 169
% 1.79/2.00 clauses forward subsumed 309
% 1.79/2.00 clauses back subsumed 3
% 1.79/2.00 Kbytes malloced 976
% 1.79/2.00
% 1.79/2.00 ----------- times (seconds) -----------
% 1.79/2.00 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.79/2.00 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/2.00 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.79/2.00
% 1.79/2.00 That finishes the proof of the theorem.
% 1.79/2.00
% 1.79/2.00 Process 29630 finished Wed Jul 27 03:57:39 2022
% 1.79/2.00 Otter interrupted
% 1.79/2.00 PROOF FOUND
%------------------------------------------------------------------------------