TSTP Solution File: MGT008+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:57 EDT 2022
% Result : Theorem 1.70s 1.90s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 20 RR)
% Number of literals : 39 ( 0 equ; 20 neg)
% Maximal clause size : 10 ( 1 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ organization(A,B)
| inertia(A,dollar_f1(A,B),B) ),
file('MGT008+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('MGT008+1.p',unknown),
[] ).
cnf(3,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('MGT008+1.p',unknown),
[] ).
cnf(4,axiom,
~ greater(dollar_c5,dollar_c6),
file('MGT008+1.p',unknown),
[] ).
cnf(5,axiom,
organization(dollar_c9,dollar_c2),
file('MGT008+1.p',unknown),
[] ).
cnf(6,axiom,
organization(dollar_c8,dollar_c1),
file('MGT008+1.p',unknown),
[] ).
cnf(7,axiom,
reorganization_free(dollar_c9,dollar_c2,dollar_c2),
file('MGT008+1.p',unknown),
[] ).
cnf(8,axiom,
reorganization_free(dollar_c8,dollar_c1,dollar_c1),
file('MGT008+1.p',unknown),
[] ).
cnf(9,axiom,
class(dollar_c9,dollar_c7,dollar_c2),
file('MGT008+1.p',unknown),
[] ).
cnf(10,axiom,
class(dollar_c8,dollar_c7,dollar_c1),
file('MGT008+1.p',unknown),
[] ).
cnf(11,axiom,
survival_chance(dollar_c9,dollar_c6,dollar_c2),
file('MGT008+1.p',unknown),
[] ).
cnf(12,axiom,
survival_chance(dollar_c8,dollar_c5,dollar_c1),
file('MGT008+1.p',unknown),
[] ).
cnf(13,axiom,
size(dollar_c9,dollar_c4,dollar_c2),
file('MGT008+1.p',unknown),
[] ).
cnf(14,axiom,
size(dollar_c8,dollar_c3,dollar_c1),
file('MGT008+1.p',unknown),
[] ).
cnf(15,axiom,
greater(dollar_c3,dollar_c4),
file('MGT008+1.p',unknown),
[] ).
cnf(16,plain,
inertia(dollar_c9,dollar_f1(dollar_c9,dollar_c2),dollar_c2),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(17,plain,
inertia(dollar_c8,dollar_f1(dollar_c8,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(18,plain,
greater(dollar_f1(dollar_c8,dollar_c1),dollar_f1(dollar_c9,dollar_c2)),
inference(hyper,[status(thm)],[17,2,5,6,9,10,13,14,16,15]),
[iquote('hyper,17,2,5,6,9,10,13,14,16,15')] ).
cnf(19,plain,
greater(dollar_c5,dollar_c6),
inference(hyper,[status(thm)],[18,3,5,6,7,8,16,17,11,12]),
[iquote('hyper,18,3,5,6,7,8,16,17,11,12')] ).
cnf(20,plain,
$false,
inference(binary,[status(thm)],[19,4]),
[iquote('binary,19.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 04:01:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.70/1.90 ----- Otter 3.3f, August 2004 -----
% 1.70/1.90 The process was started by sandbox2 on n019.cluster.edu,
% 1.70/1.90 Wed Jul 27 04:01:52 2022
% 1.70/1.90 The command was "./otter". The process ID is 31932.
% 1.70/1.90
% 1.70/1.90 set(prolog_style_variables).
% 1.70/1.90 set(auto).
% 1.70/1.90 dependent: set(auto1).
% 1.70/1.90 dependent: set(process_input).
% 1.70/1.90 dependent: clear(print_kept).
% 1.70/1.90 dependent: clear(print_new_demod).
% 1.70/1.90 dependent: clear(print_back_demod).
% 1.70/1.90 dependent: clear(print_back_sub).
% 1.70/1.90 dependent: set(control_memory).
% 1.70/1.90 dependent: assign(max_mem, 12000).
% 1.70/1.90 dependent: assign(pick_given_ratio, 4).
% 1.70/1.90 dependent: assign(stats_level, 1).
% 1.70/1.90 dependent: assign(max_seconds, 10800).
% 1.70/1.90 clear(print_given).
% 1.70/1.90
% 1.70/1.90 formula_list(usable).
% 1.70/1.90 all X T (organization(X,T)-> (exists I inertia(X,I,T))).
% 1.70/1.90 all X Y C S1 S2 I1 I2 T1 T2 (organization(X,T1)&organization(Y,T2)&class(X,C,T1)&class(Y,C,T2)&size(X,S1,T1)&size(Y,S2,T2)&inertia(X,I1,T1)&inertia(Y,I2,T2)&greater(S2,S1)->greater(I2,I1)).
% 1.70/1.90 all X Y T1 T2 I1 I2 P1 P2 (organization(X,T1)&organization(Y,T2)&reorganization_free(X,T1,T1)&reorganization_free(Y,T2,T2)&inertia(X,I1,T1)&inertia(Y,I2,T2)&survival_chance(X,P1,T1)&survival_chance(Y,P2,T2)&greater(I2,I1)->greater(P2,P1)).
% 1.70/1.90 -(all X Y C P1 P2 S1 S2 T1 T2 (organization(X,T1)&organization(Y,T2)&reorganization_free(X,T1,T1)&reorganization_free(Y,T2,T2)&class(X,C,T1)&class(Y,C,T2)&survival_chance(X,P1,T1)&survival_chance(Y,P2,T2)&size(X,S1,T1)&size(Y,S2,T2)&greater(S2,S1)->greater(P2,P1))).
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 -------> usable clausifies to:
% 1.70/1.90
% 1.70/1.90 list(usable).
% 1.70/1.90 0 [] -organization(X,T)|inertia(X,$f1(X,T),T).
% 1.70/1.90 0 [] -organization(X,T1)| -organization(Y,T2)| -class(X,C,T1)| -class(Y,C,T2)| -size(X,S1,T1)| -size(Y,S2,T2)| -inertia(X,I1,T1)| -inertia(Y,I2,T2)| -greater(S2,S1)|greater(I2,I1).
% 1.70/1.90 0 [] -organization(X,T1)| -organization(Y,T2)| -reorganization_free(X,T1,T1)| -reorganization_free(Y,T2,T2)| -inertia(X,I1,T1)| -inertia(Y,I2,T2)| -survival_chance(X,P1,T1)| -survival_chance(Y,P2,T2)| -greater(I2,I1)|greater(P2,P1).
% 1.70/1.90 0 [] organization($c9,$c2).
% 1.70/1.90 0 [] organization($c8,$c1).
% 1.70/1.90 0 [] reorganization_free($c9,$c2,$c2).
% 1.70/1.90 0 [] reorganization_free($c8,$c1,$c1).
% 1.70/1.90 0 [] class($c9,$c7,$c2).
% 1.70/1.90 0 [] class($c8,$c7,$c1).
% 1.70/1.90 0 [] survival_chance($c9,$c6,$c2).
% 1.70/1.90 0 [] survival_chance($c8,$c5,$c1).
% 1.70/1.90 0 [] size($c9,$c4,$c2).
% 1.70/1.90 0 [] size($c8,$c3,$c1).
% 1.70/1.90 0 [] greater($c3,$c4).
% 1.70/1.90 0 [] -greater($c5,$c6).
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 1.70/1.90
% 1.70/1.90 This is a Horn set without equality. The strategy will
% 1.70/1.90 be hyperresolution, with satellites in sos and nuclei
% 1.70/1.90 in usable.
% 1.70/1.90
% 1.70/1.90 dependent: set(hyper_res).
% 1.70/1.90 dependent: clear(order_hyper).
% 1.70/1.90
% 1.70/1.90 ------------> process usable:
% 1.70/1.90 ** KEPT (pick-wt=9): 1 [] -organization(A,B)|inertia(A,$f1(A,B),B).
% 1.70/1.90 ** 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.70/1.90 ** KEPT (pick-wt=36): 3 [] -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.70/1.90 ** KEPT (pick-wt=3): 4 [] -greater($c5,$c6).
% 1.70/1.90
% 1.70/1.90 ------------> process sos:
% 1.70/1.90 ** KEPT (pick-wt=3): 5 [] organization($c9,$c2).
% 1.70/1.90 ** KEPT (pick-wt=3): 6 [] organization($c8,$c1).
% 1.70/1.90 ** KEPT (pick-wt=4): 7 [] reorganization_free($c9,$c2,$c2).
% 1.70/1.90 ** KEPT (pick-wt=4): 8 [] reorganization_free($c8,$c1,$c1).
% 1.70/1.90 ** KEPT (pick-wt=4): 9 [] class($c9,$c7,$c2).
% 1.70/1.90 ** KEPT (pick-wt=4): 10 [] class($c8,$c7,$c1).
% 1.70/1.90 ** KEPT (pick-wt=4): 11 [] survival_chance($c9,$c6,$c2).
% 1.70/1.90 ** KEPT (pick-wt=4): 12 [] survival_chance($c8,$c5,$c1).
% 1.70/1.90 ** KEPT (pick-wt=4): 13 [] size($c9,$c4,$c2).
% 1.70/1.90 ** KEPT (pick-wt=4): 14 [] size($c8,$c3,$c1).
% 1.70/1.90 ** KEPT (pick-wt=3): 15 [] greater($c3,$c4).
% 1.70/1.90
% 1.70/1.90 ======= end of input processing =======
% 1.70/1.90
% 1.70/1.90 =========== start of search ===========
% 1.70/1.90
% 1.70/1.90 -------- PROOF --------
% 1.70/1.90
% 1.70/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 20 [binary,19.1,4.1] $F.
% 1.70/1.90
% 1.70/1.90 Length of proof is 4. Level of proof is 3.
% 1.70/1.90
% 1.70/1.90 ---------------- PROOF ----------------
% 1.70/1.90 % SZS status Theorem
% 1.70/1.90 % SZS output start Refutation
% See solution above
% 1.70/1.90 ------------ end of proof -------------
% 1.70/1.90
% 1.70/1.90
% 1.70/1.90 Search stopped by max_proofs option.
% 1.70/1.90
% 1.70/1.90
% 1.70/1.90 Search stopped by max_proofs option.
% 1.70/1.90
% 1.70/1.90 ============ end of search ============
% 1.70/1.90
% 1.70/1.90 -------------- statistics -------------
% 1.70/1.90 clauses given 14
% 1.70/1.90 clauses generated 4
% 1.70/1.90 clauses kept 19
% 1.70/1.90 clauses forward subsumed 0
% 1.70/1.90 clauses back subsumed 0
% 1.70/1.90 Kbytes malloced 976
% 1.70/1.90
% 1.70/1.90 ----------- times (seconds) -----------
% 1.70/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.70/1.90
% 1.70/1.90 That finishes the proof of the theorem.
% 1.70/1.90
% 1.70/1.90 Process 31932 finished Wed Jul 27 04:01:53 2022
% 1.70/1.90 Otter interrupted
% 1.70/1.90 PROOF FOUND
%------------------------------------------------------------------------------