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