TSTP Solution File: MGT018-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT018-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:00 EDT 2022
% Result : Unsatisfiable 1.56s 1.77s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 16
% Syntax : Number of clauses : 20 ( 17 unt; 1 nHn; 20 RR)
% Number of literals : 42 ( 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('MGT018-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('MGT018-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(F,D) ),
file('MGT018-1.p',unknown),
[] ).
cnf(4,axiom,
~ organization(sk3,sk10),
file('MGT018-1.p',unknown),
[] ).
cnf(5,axiom,
~ greater(sk9,sk10),
file('MGT018-1.p',unknown),
[] ).
cnf(14,axiom,
organization(sk2,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(15,axiom,
organization(sk3,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(16,axiom,
class(sk2,sk5,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(17,axiom,
class(sk3,sk5,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(18,axiom,
reorganization(sk2,sk8,sk9),
file('MGT018-1.p',unknown),
[] ).
cnf(19,axiom,
reorganization(sk3,sk8,sk10),
file('MGT018-1.p',unknown),
[] ).
cnf(20,axiom,
reorganization_type(sk2,sk4,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(21,axiom,
reorganization_type(sk3,sk4,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(22,axiom,
size(sk2,sk6,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(23,axiom,
size(sk3,sk7,sk8),
file('MGT018-1.p',unknown),
[] ).
cnf(24,axiom,
greater(sk7,sk6),
file('MGT018-1.p',unknown),
[] ).
cnf(25,plain,
inertia(sk2,sk1(sk8,sk2),sk8),
inference(hyper,[status(thm)],[14,1]),
[iquote('hyper,14,1')] ).
cnf(26,plain,
inertia(sk3,sk1(sk8,sk3),sk8),
inference(hyper,[status(thm)],[15,1]),
[iquote('hyper,15,1')] ).
cnf(27,plain,
greater(sk1(sk8,sk3),sk1(sk8,sk2)),
inference(hyper,[status(thm)],[26,2,14,15,16,17,22,23,25,24]),
[iquote('hyper,26,2,14,15,16,17,22,23,25,24')] ).
cnf(28,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[27,3,14,15,16,17,18,19,20,21,25,26]),4,5]),
[iquote('hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT018-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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 03:59:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.56/1.77 ----- Otter 3.3f, August 2004 -----
% 1.56/1.77 The process was started by sandbox2 on n005.cluster.edu,
% 1.56/1.77 Wed Jul 27 03:59:35 2022
% 1.56/1.77 The command was "./otter". The process ID is 4153.
% 1.56/1.77
% 1.56/1.77 set(prolog_style_variables).
% 1.56/1.77 set(auto).
% 1.56/1.77 dependent: set(auto1).
% 1.56/1.77 dependent: set(process_input).
% 1.56/1.77 dependent: clear(print_kept).
% 1.56/1.77 dependent: clear(print_new_demod).
% 1.56/1.77 dependent: clear(print_back_demod).
% 1.56/1.77 dependent: clear(print_back_sub).
% 1.56/1.77 dependent: set(control_memory).
% 1.56/1.77 dependent: assign(max_mem, 12000).
% 1.56/1.77 dependent: assign(pick_given_ratio, 4).
% 1.56/1.77 dependent: assign(stats_level, 1).
% 1.56/1.77 dependent: assign(max_seconds, 10800).
% 1.56/1.77 clear(print_given).
% 1.56/1.77
% 1.56/1.77 list(usable).
% 1.56/1.77 0 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.56/1.77 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.56/1.77 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(F,D).
% 1.56/1.77 0 [] organization(sk2,sk8).
% 1.56/1.77 0 [] organization(sk3,sk8).
% 1.56/1.77 0 [] -organization(sk3,sk10).
% 1.56/1.77 0 [] class(sk2,sk5,sk8).
% 1.56/1.77 0 [] class(sk3,sk5,sk8).
% 1.56/1.77 0 [] reorganization(sk2,sk8,sk9).
% 1.56/1.77 0 [] reorganization(sk3,sk8,sk10).
% 1.56/1.77 0 [] reorganization_type(sk2,sk4,sk8).
% 1.56/1.77 0 [] reorganization_type(sk3,sk4,sk8).
% 1.56/1.77 0 [] size(sk2,sk6,sk8).
% 1.56/1.77 0 [] size(sk3,sk7,sk8).
% 1.56/1.77 0 [] greater(sk7,sk6).
% 1.56/1.77 0 [] -greater(sk9,sk10).
% 1.56/1.77 end_of_list.
% 1.56/1.77
% 1.56/1.77 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 1.56/1.77
% 1.56/1.77 This is a non-Horn set without equality. The strategy will
% 1.56/1.77 be ordered hyper_res, unit deletion, and factoring, with
% 1.56/1.77 satellites in sos and with nuclei in usable.
% 1.56/1.77
% 1.56/1.77 dependent: set(hyper_res).
% 1.56/1.77 dependent: set(factor).
% 1.56/1.77 dependent: set(unit_deletion).
% 1.56/1.77
% 1.56/1.77 ------------> process usable:
% 1.56/1.77 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.56/1.77 ** 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.56/1.77 ** 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(F,D).
% 1.56/1.77 ** KEPT (pick-wt=3): 4 [] -organization(sk3,sk10).
% 1.56/1.77 ** KEPT (pick-wt=3): 5 [] -greater(sk9,sk10).
% 1.56/1.77
% 1.56/1.77 ------------> process sos:
% 1.56/1.77 ** KEPT (pick-wt=3): 14 [] organization(sk2,sk8).
% 1.56/1.77 ** KEPT (pick-wt=3): 15 [] organization(sk3,sk8).
% 1.56/1.77 ** KEPT (pick-wt=4): 16 [] class(sk2,sk5,sk8).
% 1.56/1.77 ** KEPT (pick-wt=4): 17 [] class(sk3,sk5,sk8).
% 1.56/1.77 ** KEPT (pick-wt=4): 18 [] reorganization(sk2,sk8,sk9).
% 1.56/1.77 ** KEPT (pick-wt=4): 19 [] reorganization(sk3,sk8,sk10).
% 1.56/1.77 ** KEPT (pick-wt=4): 20 [] reorganization_type(sk2,sk4,sk8).
% 1.56/1.77 ** KEPT (pick-wt=4): 21 [] reorganization_type(sk3,sk4,sk8).
% 1.56/1.77 ** KEPT (pick-wt=4): 22 [] size(sk2,sk6,sk8).
% 1.56/1.77 ** KEPT (pick-wt=4): 23 [] size(sk3,sk7,sk8).
% 1.56/1.77 ** KEPT (pick-wt=3): 24 [] greater(sk7,sk6).
% 1.56/1.77
% 1.56/1.77 ======= end of input processing =======
% 1.56/1.77
% 1.56/1.77 =========== start of search ===========
% 1.56/1.77
% 1.56/1.77 -------- PROOF --------
% 1.56/1.77
% 1.56/1.77 -----> EMPTY CLAUSE at 0.00 sec ----> 28 [hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5] $F.
% 1.56/1.77
% 1.56/1.77 Length of proof is 3. Level of proof is 2.
% 1.56/1.77
% 1.56/1.77 ---------------- PROOF ----------------
% 1.56/1.77 % SZS status Unsatisfiable
% 1.56/1.77 % SZS output start Refutation
% See solution above
% 1.56/1.77 ------------ end of proof -------------
% 1.56/1.77
% 1.56/1.77
% 1.56/1.77 Search stopped by max_proofs option.
% 1.56/1.77
% 1.56/1.77
% 1.56/1.77 Search stopped by max_proofs option.
% 1.56/1.77
% 1.56/1.77 ============ end of search ============
% 1.56/1.77
% 1.56/1.77 -------------- statistics -------------
% 1.56/1.77 clauses given 14
% 1.56/1.77 clauses generated 21
% 1.56/1.77 clauses kept 27
% 1.56/1.77 clauses forward subsumed 9
% 1.56/1.77 clauses back subsumed 0
% 1.56/1.77 Kbytes malloced 976
% 1.56/1.77
% 1.56/1.77 ----------- times (seconds) -----------
% 1.56/1.77 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.56/1.77 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.56/1.77 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.56/1.77
% 1.56/1.77 That finishes the proof of the theorem.
% 1.56/1.77
% 1.56/1.77 Process 4153 finished Wed Jul 27 03:59:37 2022
% 1.56/1.77 Otter interrupted
% 1.56/1.77 PROOF FOUND
%------------------------------------------------------------------------------