TSTP Solution File: MGT003-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT003-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:56 EDT 2022
% Result : Unsatisfiable 1.62s 1.84s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 19 ( 14 unt; 0 nHn; 19 RR)
% Number of literals : 37 ( 0 equ; 19 neg)
% Maximal clause size : 10 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ reorganization_free(A,B,C)
| reorganization_free(A,B,B) ),
file('MGT003-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ reorganization_free(A,B,C)
| reorganization_free(A,C,C) ),
file('MGT003-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| inertia(A,sk1(B,A),B) ),
file('MGT003-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ organization(A,B)
| ~ organization(C,D)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(C,D,D)
| ~ inertia(A,E,B)
| ~ inertia(C,F,D)
| ~ survival_chance(A,G,B)
| ~ survival_chance(C,H,D)
| ~ greater(F,E)
| greater(H,G) ),
file('MGT003-1.p',unknown),
[] ).
cnf(5,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('MGT003-1.p',unknown),
[] ).
cnf(6,axiom,
~ greater(sk4,sk3),
file('MGT003-1.p',unknown),
[] ).
cnf(7,axiom,
organization(sk2,sk5),
file('MGT003-1.p',unknown),
[] ).
cnf(8,axiom,
organization(sk2,sk6),
file('MGT003-1.p',unknown),
[] ).
cnf(9,axiom,
reorganization_free(sk2,sk5,sk6),
file('MGT003-1.p',unknown),
[] ).
cnf(10,axiom,
survival_chance(sk2,sk3,sk5),
file('MGT003-1.p',unknown),
[] ).
cnf(11,axiom,
survival_chance(sk2,sk4,sk6),
file('MGT003-1.p',unknown),
[] ).
cnf(12,axiom,
greater(sk6,sk5),
file('MGT003-1.p',unknown),
[] ).
cnf(13,plain,
inertia(sk2,sk1(sk5,sk2),sk5),
inference(hyper,[status(thm)],[7,3]),
[iquote('hyper,7,3')] ).
cnf(14,plain,
inertia(sk2,sk1(sk6,sk2),sk6),
inference(hyper,[status(thm)],[8,3]),
[iquote('hyper,8,3')] ).
cnf(15,plain,
reorganization_free(sk2,sk6,sk6),
inference(hyper,[status(thm)],[9,2]),
[iquote('hyper,9,2')] ).
cnf(16,plain,
reorganization_free(sk2,sk5,sk5),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(17,plain,
greater(sk1(sk6,sk2),sk1(sk5,sk2)),
inference(hyper,[status(thm)],[14,5,7,8,9,13,12]),
[iquote('hyper,14,5,7,8,9,13,12')] ).
cnf(18,plain,
greater(sk4,sk3),
inference(hyper,[status(thm)],[17,4,7,8,16,15,13,14,10,11]),
[iquote('hyper,17,4,7,8,16,15,13,14,10,11')] ).
cnf(19,plain,
$false,
inference(binary,[status(thm)],[18,6]),
[iquote('binary,18.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT003-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.32 % Computer : n010.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Wed Jul 27 03:52:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.62/1.84 ----- Otter 3.3f, August 2004 -----
% 1.62/1.84 The process was started by sandbox on n010.cluster.edu,
% 1.62/1.84 Wed Jul 27 03:52:55 2022
% 1.62/1.84 The command was "./otter". The process ID is 14925.
% 1.62/1.84
% 1.62/1.84 set(prolog_style_variables).
% 1.62/1.84 set(auto).
% 1.62/1.84 dependent: set(auto1).
% 1.62/1.84 dependent: set(process_input).
% 1.62/1.84 dependent: clear(print_kept).
% 1.62/1.84 dependent: clear(print_new_demod).
% 1.62/1.84 dependent: clear(print_back_demod).
% 1.62/1.84 dependent: clear(print_back_sub).
% 1.62/1.84 dependent: set(control_memory).
% 1.62/1.84 dependent: assign(max_mem, 12000).
% 1.62/1.84 dependent: assign(pick_given_ratio, 4).
% 1.62/1.84 dependent: assign(stats_level, 1).
% 1.62/1.84 dependent: assign(max_seconds, 10800).
% 1.62/1.84 clear(print_given).
% 1.62/1.84
% 1.62/1.84 list(usable).
% 1.62/1.84 0 [] -reorganization_free(A,B,C)|reorganization_free(A,B,B).
% 1.62/1.84 0 [] -reorganization_free(A,B,C)|reorganization_free(A,C,C).
% 1.62/1.84 0 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.62/1.84 0 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -inertia(A,E,B)| -inertia(C,F,D)| -survival_chance(A,G,B)| -survival_chance(C,H,D)| -greater(F,E)|greater(H,G).
% 1.62/1.84 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.62/1.84 0 [] organization(sk2,sk5).
% 1.62/1.84 0 [] organization(sk2,sk6).
% 1.62/1.84 0 [] reorganization_free(sk2,sk5,sk6).
% 1.62/1.84 0 [] survival_chance(sk2,sk3,sk5).
% 1.62/1.84 0 [] survival_chance(sk2,sk4,sk6).
% 1.62/1.84 0 [] greater(sk6,sk5).
% 1.62/1.84 0 [] -greater(sk4,sk3).
% 1.62/1.84 end_of_list.
% 1.62/1.84
% 1.62/1.84 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 1.62/1.84
% 1.62/1.84 This is a Horn set without equality. The strategy will
% 1.62/1.84 be hyperresolution, with satellites in sos and nuclei
% 1.62/1.84 in usable.
% 1.62/1.84
% 1.62/1.84 dependent: set(hyper_res).
% 1.62/1.84 dependent: clear(order_hyper).
% 1.62/1.84
% 1.62/1.84 ------------> process usable:
% 1.62/1.84 ** KEPT (pick-wt=8): 1 [] -reorganization_free(A,B,C)|reorganization_free(A,B,B).
% 1.62/1.84 ** KEPT (pick-wt=8): 2 [] -reorganization_free(A,B,C)|reorganization_free(A,C,C).
% 1.62/1.84 ** KEPT (pick-wt=9): 3 [] -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.62/1.84 ** KEPT (pick-wt=36): 4 [] -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -inertia(A,E,B)| -inertia(C,F,D)| -survival_chance(A,G,B)| -survival_chance(C,H,D)| -greater(F,E)|greater(H,G).
% 1.62/1.84 ** KEPT (pick-wt=24): 5 [] -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.62/1.84 ** KEPT (pick-wt=3): 6 [] -greater(sk4,sk3).
% 1.62/1.84
% 1.62/1.84 ------------> process sos:
% 1.62/1.84 ** KEPT (pick-wt=3): 7 [] organization(sk2,sk5).
% 1.62/1.84 ** KEPT (pick-wt=3): 8 [] organization(sk2,sk6).
% 1.62/1.84 ** KEPT (pick-wt=4): 9 [] reorganization_free(sk2,sk5,sk6).
% 1.62/1.84 ** KEPT (pick-wt=4): 10 [] survival_chance(sk2,sk3,sk5).
% 1.62/1.84 ** KEPT (pick-wt=4): 11 [] survival_chance(sk2,sk4,sk6).
% 1.62/1.84 ** KEPT (pick-wt=3): 12 [] greater(sk6,sk5).
% 1.62/1.84
% 1.62/1.84 ======= end of input processing =======
% 1.62/1.84
% 1.62/1.84 =========== start of search ===========
% 1.62/1.84
% 1.62/1.84 -------- PROOF --------
% 1.62/1.84
% 1.62/1.84 ----> UNIT CONFLICT at 0.00 sec ----> 19 [binary,18.1,6.1] $F.
% 1.62/1.84
% 1.62/1.84 Length of proof is 6. Level of proof is 3.
% 1.62/1.84
% 1.62/1.84 ---------------- PROOF ----------------
% 1.62/1.84 % SZS status Unsatisfiable
% 1.62/1.84 % SZS output start Refutation
% See solution above
% 1.62/1.84 ------------ end of proof -------------
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Search stopped by max_proofs option.
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Search stopped by max_proofs option.
% 1.62/1.84
% 1.62/1.84 ============ end of search ============
% 1.62/1.84
% 1.62/1.84 -------------- statistics -------------
% 1.62/1.84 clauses given 11
% 1.62/1.84 clauses generated 10
% 1.62/1.84 clauses kept 18
% 1.62/1.84 clauses forward subsumed 4
% 1.62/1.84 clauses back subsumed 0
% 1.62/1.84 Kbytes malloced 976
% 1.62/1.84
% 1.62/1.84 ----------- times (seconds) -----------
% 1.62/1.84 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.84 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.84 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.62/1.84
% 1.62/1.84 That finishes the proof of the theorem.
% 1.62/1.84
% 1.62/1.84 Process 14925 finished Wed Jul 27 03:52:56 2022
% 1.62/1.84 Otter interrupted
% 1.62/1.84 PROOF FOUND
%------------------------------------------------------------------------------