TSTP Solution File: MGT017-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT017-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:00 EDT 2022
% Result : Unsatisfiable 1.71s 1.92s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of clauses : 21 ( 18 unt; 0 nHn; 21 RR)
% Number of literals : 43 ( 0 equ; 23 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| inertia(A,sk1(B,A),B) ),
file('MGT017-1.p',unknown),
[] ).
cnf(2,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('MGT017-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| ~ organization(C,B)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,B)
| ~ reorganization(A,B,F)
| ~ reorganization(C,B,D)
| ~ reorganization_type(A,G,B)
| ~ reorganization_type(C,G,B)
| ~ inertia(A,H,B)
| ~ inertia(C,I,B)
| ~ greater(I,H)
| greater(D,F) ),
file('MGT017-1.p',unknown),
[] ).
cnf(4,axiom,
~ greater(sk10,sk9),
file('MGT017-1.p',unknown),
[] ).
cnf(5,axiom,
organization(sk2,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(6,axiom,
organization(sk3,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(7,axiom,
organization(sk3,sk10),
file('MGT017-1.p',unknown),
[] ).
cnf(8,axiom,
class(sk2,sk5,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(9,axiom,
class(sk3,sk5,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(10,axiom,
reorganization(sk2,sk8,sk9),
file('MGT017-1.p',unknown),
[] ).
cnf(11,axiom,
reorganization(sk3,sk8,sk10),
file('MGT017-1.p',unknown),
[] ).
cnf(12,axiom,
reorganization_type(sk2,sk4,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(13,axiom,
reorganization_type(sk3,sk4,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(14,axiom,
size(sk2,sk6,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(15,axiom,
size(sk3,sk7,sk8),
file('MGT017-1.p',unknown),
[] ).
cnf(16,axiom,
greater(sk7,sk6),
file('MGT017-1.p',unknown),
[] ).
cnf(17,plain,
inertia(sk2,sk1(sk8,sk2),sk8),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(18,plain,
inertia(sk3,sk1(sk8,sk3),sk8),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(20,plain,
greater(sk1(sk8,sk3),sk1(sk8,sk2)),
inference(hyper,[status(thm)],[18,2,5,6,8,9,14,15,17,16]),
[iquote('hyper,18,2,5,6,8,9,14,15,17,16')] ).
cnf(21,plain,
greater(sk10,sk9),
inference(hyper,[status(thm)],[20,3,5,6,7,8,9,10,11,12,13,17,18]),
[iquote('hyper,20,3,5,6,7,8,9,10,11,12,13,17,18')] ).
cnf(22,plain,
$false,
inference(binary,[status(thm)],[21,4]),
[iquote('binary,21.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT017-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n008.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 04:03:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.71/1.92 ----- Otter 3.3f, August 2004 -----
% 1.71/1.92 The process was started by sandbox2 on n008.cluster.edu,
% 1.71/1.92 Wed Jul 27 04:03:08 2022
% 1.71/1.92 The command was "./otter". The process ID is 15642.
% 1.71/1.92
% 1.71/1.92 set(prolog_style_variables).
% 1.71/1.92 set(auto).
% 1.71/1.92 dependent: set(auto1).
% 1.71/1.92 dependent: set(process_input).
% 1.71/1.92 dependent: clear(print_kept).
% 1.71/1.92 dependent: clear(print_new_demod).
% 1.71/1.92 dependent: clear(print_back_demod).
% 1.71/1.92 dependent: clear(print_back_sub).
% 1.71/1.92 dependent: set(control_memory).
% 1.71/1.92 dependent: assign(max_mem, 12000).
% 1.71/1.92 dependent: assign(pick_given_ratio, 4).
% 1.71/1.92 dependent: assign(stats_level, 1).
% 1.71/1.92 dependent: assign(max_seconds, 10800).
% 1.71/1.92 clear(print_given).
% 1.71/1.92
% 1.71/1.92 list(usable).
% 1.71/1.92 0 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.71/1.92 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.71/1.92 0 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -inertia(A,H,B)| -inertia(C,I,B)| -greater(I,H)|greater(D,F).
% 1.71/1.92 0 [] organization(sk2,sk8).
% 1.71/1.92 0 [] organization(sk3,sk8).
% 1.71/1.92 0 [] organization(sk3,sk10).
% 1.71/1.92 0 [] class(sk2,sk5,sk8).
% 1.71/1.92 0 [] class(sk3,sk5,sk8).
% 1.71/1.92 0 [] reorganization(sk2,sk8,sk9).
% 1.71/1.92 0 [] reorganization(sk3,sk8,sk10).
% 1.71/1.92 0 [] reorganization_type(sk2,sk4,sk8).
% 1.71/1.92 0 [] reorganization_type(sk3,sk4,sk8).
% 1.71/1.92 0 [] size(sk2,sk6,sk8).
% 1.71/1.92 0 [] size(sk3,sk7,sk8).
% 1.71/1.92 0 [] greater(sk7,sk6).
% 1.71/1.92 0 [] -greater(sk10,sk9).
% 1.71/1.92 end_of_list.
% 1.71/1.92
% 1.71/1.92 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=13.
% 1.71/1.92
% 1.71/1.92 This is a Horn set without equality. The strategy will
% 1.71/1.92 be hyperresolution, with satellites in sos and nuclei
% 1.71/1.92 in usable.
% 1.71/1.92
% 1.71/1.92 dependent: set(hyper_res).
% 1.71/1.92 dependent: clear(order_hyper).
% 1.71/1.92
% 1.71/1.92 ------------> process usable:
% 1.71/1.92 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.71/1.92 ** KEPT (pick-wt=36): 2 [] -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.71/1.92 ** KEPT (pick-wt=47): 3 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -inertia(A,H,B)| -inertia(C,I,B)| -greater(I,H)|greater(D,F).
% 1.71/1.92 ** KEPT (pick-wt=3): 4 [] -greater(sk10,sk9).
% 1.71/1.92
% 1.71/1.92 ------------> process sos:
% 1.71/1.92 ** KEPT (pick-wt=3): 5 [] organization(sk2,sk8).
% 1.71/1.92 ** KEPT (pick-wt=3): 6 [] organization(sk3,sk8).
% 1.71/1.92 ** KEPT (pick-wt=3): 7 [] organization(sk3,sk10).
% 1.71/1.92 ** KEPT (pick-wt=4): 8 [] class(sk2,sk5,sk8).
% 1.71/1.92 ** KEPT (pick-wt=4): 9 [] class(sk3,sk5,sk8).
% 1.71/1.92 ** KEPT (pick-wt=4): 10 [] reorganization(sk2,sk8,sk9).
% 1.71/1.92 ** KEPT (pick-wt=4): 11 [] reorganization(sk3,sk8,sk10).
% 1.71/1.92 ** KEPT (pick-wt=4): 12 [] reorganization_type(sk2,sk4,sk8).
% 1.71/1.92 ** KEPT (pick-wt=4): 13 [] reorganization_type(sk3,sk4,sk8).
% 1.71/1.92 ** KEPT (pick-wt=4): 14 [] size(sk2,sk6,sk8).
% 1.71/1.92 ** KEPT (pick-wt=4): 15 [] size(sk3,sk7,sk8).
% 1.71/1.92 ** KEPT (pick-wt=3): 16 [] greater(sk7,sk6).
% 1.71/1.92
% 1.71/1.92 ======= end of input processing =======
% 1.71/1.92
% 1.71/1.92 =========== start of search ===========
% 1.71/1.92
% 1.71/1.92 -------- PROOF --------
% 1.71/1.92
% 1.71/1.92 ----> UNIT CONFLICT at 0.00 sec ----> 22 [binary,21.1,4.1] $F.
% 1.71/1.92
% 1.71/1.92 Length of proof is 4. Level of proof is 3.
% 1.71/1.92
% 1.71/1.92 ---------------- PROOF ----------------
% 1.71/1.92 % SZS status Unsatisfiable
% 1.71/1.92 % SZS output start Refutation
% See solution above
% 1.71/1.92 ------------ end of proof -------------
% 1.71/1.92
% 1.71/1.92
% 1.71/1.92 Search stopped by max_proofs option.
% 1.71/1.92
% 1.71/1.92
% 1.71/1.92 Search stopped by max_proofs option.
% 1.71/1.92
% 1.71/1.92 ============ end of search ============
% 1.71/1.92
% 1.71/1.92 -------------- statistics -------------
% 1.71/1.92 clauses given 16
% 1.71/1.92 clauses generated 5
% 1.71/1.92 clauses kept 21
% 1.71/1.92 clauses forward subsumed 0
% 1.71/1.92 clauses back subsumed 0
% 1.71/1.92 Kbytes malloced 976
% 1.71/1.92
% 1.71/1.92 ----------- times (seconds) -----------
% 1.71/1.92 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.92 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.71/1.92
% 1.71/1.92 That finishes the proof of the theorem.
% 1.71/1.92
% 1.71/1.92 Process 15642 finished Wed Jul 27 04:03:10 2022
% 1.71/1.92 Otter interrupted
% 1.71/1.92 PROOF FOUND
%------------------------------------------------------------------------------