TSTP Solution File: MGT049+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:11 EDT 2022
% Result : Theorem 1.74s 1.92s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 5 RR)
% Number of literals : 11 ( 7 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,axiom,
( ~ organization(A)
| external_ties(A,B) != external_ties(A,C)
| position(A,B) = position(A,C) ),
file('MGT049+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ organization(A)
| external_ties(A,B) = external_ties(A,C) ),
file('MGT049+1.p',unknown),
[] ).
cnf(14,axiom,
position(dollar_c3,dollar_c1) != position(dollar_c3,dollar_c2),
file('MGT049+1.p',unknown),
[] ).
cnf(15,plain,
position(dollar_c3,dollar_c2) != position(dollar_c3,dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[14])]),
[iquote('copy,14,flip.1')] ).
cnf(19,axiom,
organization(dollar_c3),
file('MGT049+1.p',unknown),
[] ).
cnf(23,plain,
external_ties(dollar_c3,A) = external_ties(dollar_c3,B),
inference(hyper,[status(thm)],[19,13]),
[iquote('hyper,19,13')] ).
cnf(59,plain,
position(dollar_c3,A) = position(dollar_c3,B),
inference(hyper,[status(thm)],[23,12,19]),
[iquote('hyper,23,12,19')] ).
cnf(60,plain,
$false,
inference(binary,[status(thm)],[59,15]),
[iquote('binary,59.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT049+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n004.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 03:58:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.74/1.92 ----- Otter 3.3f, August 2004 -----
% 1.74/1.92 The process was started by sandbox on n004.cluster.edu,
% 1.74/1.92 Wed Jul 27 03:58:51 2022
% 1.74/1.92 The command was "./otter". The process ID is 333.
% 1.74/1.92
% 1.74/1.92 set(prolog_style_variables).
% 1.74/1.92 set(auto).
% 1.74/1.92 dependent: set(auto1).
% 1.74/1.92 dependent: set(process_input).
% 1.74/1.92 dependent: clear(print_kept).
% 1.74/1.92 dependent: clear(print_new_demod).
% 1.74/1.92 dependent: clear(print_back_demod).
% 1.74/1.92 dependent: clear(print_back_sub).
% 1.74/1.92 dependent: set(control_memory).
% 1.74/1.92 dependent: assign(max_mem, 12000).
% 1.74/1.92 dependent: assign(pick_given_ratio, 4).
% 1.74/1.92 dependent: assign(stats_level, 1).
% 1.74/1.92 dependent: assign(max_seconds, 10800).
% 1.74/1.92 clear(print_given).
% 1.74/1.92
% 1.74/1.92 formula_list(usable).
% 1.74/1.92 all A (A=A).
% 1.74/1.92 all X Y (smaller_or_e_qual(X,Y)<->smaller(X,Y)|X=Y).
% 1.74/1.92 all X Y (greater_or_e_qual(X,Y)<->greater(X,Y)|X=Y).
% 1.74/1.92 all X Y (smaller(X,Y)<->greater(Y,X)).
% 1.74/1.92 all X Y (-(greater(X,Y)&greater(Y,X))).
% 1.74/1.92 all X Y Z (greater(X,Y)&greater(Y,Z)->greater(X,Z)).
% 1.74/1.92 all X Y (smaller(X,Y)|X=Y|greater(X,Y)).
% 1.74/1.92 all X T0 T (organization(X)-> (greater(external_ties(X,T),external_ties(X,T0))->greater(position(X,T),position(X,T0)))& (external_ties(X,T)=external_ties(X,T0)->position(X,T)=position(X,T0))).
% 1.74/1.92 all X T0 T (organization(X)->external_ties(X,T)=external_ties(X,T0)).
% 1.74/1.92 -(all X T0 T (organization(X)&greater(age(X,T),age(X,T0))->position(X,T)=position(X,T0))).
% 1.74/1.92 end_of_list.
% 1.74/1.92
% 1.74/1.92 -------> usable clausifies to:
% 1.74/1.92
% 1.74/1.92 list(usable).
% 1.74/1.92 0 [] A=A.
% 1.74/1.92 0 [] -smaller_or_e_qual(X,Y)|smaller(X,Y)|X=Y.
% 1.74/1.92 0 [] smaller_or_e_qual(X,Y)| -smaller(X,Y).
% 1.74/1.92 0 [] smaller_or_e_qual(X,Y)|X!=Y.
% 1.74/1.92 0 [] -greater_or_e_qual(X,Y)|greater(X,Y)|X=Y.
% 1.74/1.92 0 [] greater_or_e_qual(X,Y)| -greater(X,Y).
% 1.74/1.92 0 [] greater_or_e_qual(X,Y)|X!=Y.
% 1.74/1.92 0 [] -smaller(X,Y)|greater(Y,X).
% 1.74/1.92 0 [] smaller(X,Y)| -greater(Y,X).
% 1.74/1.92 0 [] -greater(X,Y)| -greater(Y,X).
% 1.74/1.92 0 [] -greater(X,Y)| -greater(Y,Z)|greater(X,Z).
% 1.74/1.92 0 [] smaller(X,Y)|X=Y|greater(X,Y).
% 1.74/1.92 0 [] -organization(X)| -greater(external_ties(X,T),external_ties(X,T0))|greater(position(X,T),position(X,T0)).
% 1.74/1.92 0 [] -organization(X)|external_ties(X,T)!=external_ties(X,T0)|position(X,T)=position(X,T0).
% 1.74/1.92 0 [] -organization(X)|external_ties(X,T)=external_ties(X,T0).
% 1.74/1.92 0 [] organization($c3).
% 1.74/1.92 0 [] greater(age($c3,$c1),age($c3,$c2)).
% 1.74/1.92 0 [] position($c3,$c1)!=position($c3,$c2).
% 1.74/1.92 end_of_list.
% 1.74/1.92
% 1.74/1.92 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.74/1.92
% 1.74/1.92 This ia a non-Horn set with equality. The strategy will be
% 1.74/1.92 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.74/1.92 deletion, with positive clauses in sos and nonpositive
% 1.74/1.92 clauses in usable.
% 1.74/1.92
% 1.74/1.92 dependent: set(knuth_bendix).
% 1.74/1.92 dependent: set(anl_eq).
% 1.74/1.92 dependent: set(para_from).
% 1.74/1.92 dependent: set(para_into).
% 1.74/1.92 dependent: clear(para_from_right).
% 1.74/1.92 dependent: clear(para_into_right).
% 1.74/1.92 dependent: set(para_from_vars).
% 1.74/1.92 dependent: set(eq_units_both_ways).
% 1.74/1.92 dependent: set(dynamic_demod_all).
% 1.74/1.92 dependent: set(dynamic_demod).
% 1.74/1.92 dependent: set(order_eq).
% 1.74/1.92 dependent: set(back_demod).
% 1.74/1.92 dependent: set(lrpo).
% 1.74/1.92 dependent: set(hyper_res).
% 1.74/1.92 dependent: set(unit_deletion).
% 1.74/1.92 dependent: set(factor).
% 1.74/1.92
% 1.74/1.92 ------------> process usable:
% 1.74/1.92 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.74/1.92 ** KEPT (pick-wt=6): 2 [] smaller_or_e_qual(A,B)| -smaller(A,B).
% 1.74/1.92 ** KEPT (pick-wt=6): 3 [] smaller_or_e_qual(A,B)|A!=B.
% 1.74/1.92 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.74/1.92 ** KEPT (pick-wt=6): 5 [] greater_or_e_qual(A,B)| -greater(A,B).
% 1.74/1.92 ** KEPT (pick-wt=6): 6 [] greater_or_e_qual(A,B)|A!=B.
% 1.74/1.92 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 1.74/1.92 ** KEPT (pick-wt=6): 8 [] smaller(A,B)| -greater(B,A).
% 1.74/1.92 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 1.74/1.92 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.74/1.92 ** KEPT (pick-wt=16): 11 [] -organization(A)| -greater(external_ties(A,B),external_ties(A,C))|greater(position(A,B),position(A,C)).
% 1.74/1.92 ** KEPT (pick-wt=16): 12 [] -organization(A)|external_ties(A,B)!=external_ties(A,C)|position(A,B)=position(A,C).
% 1.74/1.92 ** KEPT (pick-wt=9): 13 [] -organization(A)|external_ties(A,B)=external_ties(A,C).
% 1.74/1.92 ** KEPT (pick-wt=7): 15 [copy,14,flip.1] position($c3,$c2)!=position($c3,$c1).
% 1.74/1.92
% 1.74/1.92 ------------> process sos:
% 1.74/1.92 ** KEPT (pick-wt=3): 17 [] A=A.
% 1.74/1.92 ** KEPT (pick-wt=9): 18 [] smaller(A,B)|A=B|greater(A,B).
% 1.74/1.92 ** KEPT (pick-wt=2): 19 [] organization($c3).
% 1.74/1.92 ** KEPT (pick-wt=7): 20 [] greater(age($c3,$c1),age($c3,$c2)).
% 1.74/1.92 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 1.74/1.92
% 1.74/1.92 ======= end of input processing =======
% 1.74/1.92
% 1.74/1.92 =========== start of search ===========
% 1.74/1.92
% 1.74/1.92 -------- PROOF --------
% 1.74/1.92
% 1.74/1.92 ----> UNIT CONFLICT at 0.00 sec ----> 60 [binary,59.1,15.1] $F.
% 1.74/1.92
% 1.74/1.92 Length of proof is 3. Level of proof is 2.
% 1.74/1.92
% 1.74/1.92 ---------------- PROOF ----------------
% 1.74/1.92 % SZS status Theorem
% 1.74/1.92 % SZS output start Refutation
% See solution above
% 1.74/1.92 ------------ end of proof -------------
% 1.74/1.92
% 1.74/1.92
% 1.74/1.92 Search stopped by max_proofs option.
% 1.74/1.92
% 1.74/1.92
% 1.74/1.92 Search stopped by max_proofs option.
% 1.74/1.92
% 1.74/1.92 ============ end of search ============
% 1.74/1.92
% 1.74/1.92 -------------- statistics -------------
% 1.74/1.92 clauses given 7
% 1.74/1.92 clauses generated 47
% 1.74/1.92 clauses kept 58
% 1.74/1.92 clauses forward subsumed 9
% 1.74/1.92 clauses back subsumed 0
% 1.74/1.92 Kbytes malloced 976
% 1.74/1.92
% 1.74/1.92 ----------- times (seconds) -----------
% 1.74/1.92 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.92 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.74/1.92
% 1.74/1.92 That finishes the proof of the theorem.
% 1.74/1.92
% 1.74/1.92 Process 333 finished Wed Jul 27 03:58:52 2022
% 1.74/1.92 Otter interrupted
% 1.74/1.92 PROOF FOUND
%------------------------------------------------------------------------------