TSTP Solution File: MGT011-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT011-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:05:58 EDT 2022
% Result : Unsatisfiable 1.67s 1.87s
% Output : Refutation 1.67s
% 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,sk1(B,A),B) ),
file('MGT011-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ greater(A,B)
| ~ greater(B,A) ),
file('MGT011-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ organization(A,B)
| class(A,sk2(B,A),B) ),
file('MGT011-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('MGT011-1.p',unknown),
[] ).
cnf(6,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('MGT011-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('MGT011-1.p',unknown),
[] ).
cnf(9,axiom,
organization(sk3,sk6),
file('MGT011-1.p',unknown),
[] ).
cnf(10,axiom,
organization(sk3,sk7),
file('MGT011-1.p',unknown),
[] ).
cnf(11,axiom,
reorganization_free(sk3,sk6,sk7),
file('MGT011-1.p',unknown),
[] ).
cnf(12,axiom,
size(sk3,sk4,sk6),
file('MGT011-1.p',unknown),
[] ).
cnf(13,axiom,
size(sk3,sk5,sk7),
file('MGT011-1.p',unknown),
[] ).
cnf(14,axiom,
greater(sk7,sk6),
file('MGT011-1.p',unknown),
[] ).
cnf(15,axiom,
greater(sk4,sk5),
file('MGT011-1.p',unknown),
[] ).
cnf(16,plain,
class(sk3,sk2(sk6,sk3),sk6),
inference(hyper,[status(thm)],[9,4]),
[iquote('hyper,9,4')] ).
cnf(17,plain,
inertia(sk3,sk1(sk6,sk3),sk6),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(20,plain,
class(sk3,sk2(sk7,sk3),sk7),
inference(hyper,[status(thm)],[10,4]),
[iquote('hyper,10,4')] ).
cnf(21,plain,
inertia(sk3,sk1(sk7,sk3),sk7),
inference(hyper,[status(thm)],[10,1]),
[iquote('hyper,10,1')] ).
cnf(50,plain,
sk2(sk7,sk3) = sk2(sk6,sk3),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[20,5,9,10,11,16])]),
[iquote('hyper,20,5,9,10,11,16,flip.1')] ).
cnf(51,plain,
class(sk3,sk2(sk6,sk3),sk7),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[20]),50]),
[iquote('back_demod,20,demod,50')] ).
cnf(52,plain,
greater(sk1(sk7,sk3),sk1(sk6,sk3)),
inference(hyper,[status(thm)],[21,7,9,10,11,17,14]),
[iquote('hyper,21,7,9,10,11,17,14')] ).
cnf(58,plain,
greater(sk1(sk6,sk3),sk1(sk7,sk3)),
inference(hyper,[status(thm)],[51,6,10,9,16,13,12,21,17,15]),
[iquote('hyper,51,6,10,9,16,13,12,21,17,15')] ).
cnf(74,plain,
$false,
inference(hyper,[status(thm)],[58,3,52]),
[iquote('hyper,58,3,52')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT011-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 04:01:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.67/1.87 ----- Otter 3.3f, August 2004 -----
% 1.67/1.87 The process was started by sandbox2 on n005.cluster.edu,
% 1.67/1.87 Wed Jul 27 04:01:05 2022
% 1.67/1.87 The command was "./otter". The process ID is 10296.
% 1.67/1.87
% 1.67/1.87 set(prolog_style_variables).
% 1.67/1.87 set(auto).
% 1.67/1.87 dependent: set(auto1).
% 1.67/1.87 dependent: set(process_input).
% 1.67/1.87 dependent: clear(print_kept).
% 1.67/1.87 dependent: clear(print_new_demod).
% 1.67/1.87 dependent: clear(print_back_demod).
% 1.67/1.87 dependent: clear(print_back_sub).
% 1.67/1.87 dependent: set(control_memory).
% 1.67/1.87 dependent: assign(max_mem, 12000).
% 1.67/1.87 dependent: assign(pick_given_ratio, 4).
% 1.67/1.87 dependent: assign(stats_level, 1).
% 1.67/1.87 dependent: assign(max_seconds, 10800).
% 1.67/1.87 clear(print_given).
% 1.67/1.87
% 1.67/1.87 list(usable).
% 1.67/1.87 0 [] A=A.
% 1.67/1.87 0 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.67/1.87 0 [] -greater(A,B)|A!=B.
% 1.67/1.87 0 [] -greater(A,B)| -greater(B,A).
% 1.67/1.87 0 [] -organization(A,B)|class(A,sk2(B,A),B).
% 1.67/1.87 0 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -class(A,D,B)| -class(A,E,C)|D=E.
% 1.67/1.87 0 [] -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.67/1.87 0 [] -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.67/1.87 0 [] organization(sk3,sk6).
% 1.67/1.87 0 [] organization(sk3,sk7).
% 1.67/1.87 0 [] reorganization_free(sk3,sk6,sk7).
% 1.67/1.87 0 [] size(sk3,sk4,sk6).
% 1.67/1.87 0 [] size(sk3,sk5,sk7).
% 1.67/1.87 0 [] greater(sk7,sk6).
% 1.67/1.87 0 [] greater(sk4,sk5).
% 1.67/1.87 end_of_list.
% 1.67/1.87
% 1.67/1.87 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=10.
% 1.67/1.87
% 1.67/1.87 This is a Horn set with equality. The strategy will be
% 1.67/1.87 Knuth-Bendix and hyper_res, with positive clauses in
% 1.67/1.87 sos and nonpositive clauses in usable.
% 1.67/1.87
% 1.67/1.87 dependent: set(knuth_bendix).
% 1.67/1.87 dependent: set(anl_eq).
% 1.67/1.87 dependent: set(para_from).
% 1.67/1.87 dependent: set(para_into).
% 1.67/1.87 dependent: clear(para_from_right).
% 1.67/1.87 dependent: clear(para_into_right).
% 1.67/1.87 dependent: set(para_from_vars).
% 1.67/1.87 dependent: set(eq_units_both_ways).
% 1.67/1.87 dependent: set(dynamic_demod_all).
% 1.67/1.87 dependent: set(dynamic_demod).
% 1.67/1.87 dependent: set(order_eq).
% 1.67/1.87 dependent: set(back_demod).
% 1.67/1.87 dependent: set(lrpo).
% 1.67/1.87 dependent: set(hyper_res).
% 1.67/1.87 dependent: clear(order_hyper).
% 1.67/1.87
% 1.67/1.87 ------------> process usable:
% 1.67/1.87 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.67/1.87 ** KEPT (pick-wt=6): 2 [] -greater(A,B)|A!=B.
% 1.67/1.87 ** KEPT (pick-wt=6): 3 [] -greater(A,B)| -greater(B,A).
% 1.67/1.87 ** KEPT (pick-wt=9): 4 [] -organization(A,B)|class(A,sk2(B,A),B).
% 1.67/1.87 ** 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.67/1.87 ** KEPT (pick-wt=36): 6 [] -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.67/1.87 ** 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.67/1.87
% 1.67/1.87 ------------> process sos:
% 1.67/1.87 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.67/1.87 ** KEPT (pick-wt=3): 9 [] organization(sk3,sk6).
% 1.67/1.87 ** KEPT (pick-wt=3): 10 [] organization(sk3,sk7).
% 1.67/1.87 ** KEPT (pick-wt=4): 11 [] reorganization_free(sk3,sk6,sk7).
% 1.67/1.87 ** KEPT (pick-wt=4): 12 [] size(sk3,sk4,sk6).
% 1.67/1.87 ** KEPT (pick-wt=4): 13 [] size(sk3,sk5,sk7).
% 1.67/1.87 ** KEPT (pick-wt=3): 14 [] greater(sk7,sk6).
% 1.67/1.87 ** KEPT (pick-wt=3): 15 [] greater(sk4,sk5).
% 1.67/1.87 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.67/1.87
% 1.67/1.87 ======= end of input processing =======
% 1.67/1.87
% 1.67/1.87 =========== start of search ===========
% 1.67/1.87
% 1.67/1.87 -------- PROOF --------
% 1.67/1.87
% 1.67/1.87 -----> EMPTY CLAUSE at 0.01 sec ----> 74 [hyper,58,3,52] $F.
% 1.67/1.87
% 1.67/1.87 Length of proof is 8. Level of proof is 4.
% 1.67/1.87
% 1.67/1.87 ---------------- PROOF ----------------
% 1.67/1.87 % SZS status Unsatisfiable
% 1.67/1.87 % SZS output start Refutation
% See solution above
% 1.67/1.87 ------------ end of proof -------------
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87 ============ end of search ============
% 1.67/1.87
% 1.67/1.87 -------------- statistics -------------
% 1.67/1.87 clauses given 18
% 1.67/1.87 clauses generated 62
% 1.67/1.87 clauses kept 72
% 1.67/1.87 clauses forward subsumed 6
% 1.67/1.87 clauses back subsumed 0
% 1.67/1.87 Kbytes malloced 976
% 1.67/1.87
% 1.67/1.87 ----------- times (seconds) -----------
% 1.67/1.87 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.67/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.87
% 1.67/1.87 That finishes the proof of the theorem.
% 1.67/1.87
% 1.67/1.87 Process 10296 finished Wed Jul 27 04:01:07 2022
% 1.67/1.87 Otter interrupted
% 1.67/1.87 PROOF FOUND
%------------------------------------------------------------------------------