TSTP Solution File: MGT050-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT050-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:12 EDT 2022
% Result : Unsatisfiable 6.45s 6.62s
% Output : Refutation 6.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 31 ( 15 unt; 6 nHn; 21 RR)
% Number of literals : 60 ( 11 equ; 22 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( A != B
| smaller_or_e_qual(A,B) ),
file('MGT050-1.p',unknown),
[] ).
cnf(6,axiom,
( A != B
| greater_or_e_qual(A,B) ),
file('MGT050-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ smaller(A,B)
| greater(B,A) ),
file('MGT050-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(A,B)
| ~ greater(B,A) ),
file('MGT050-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(A)
| has_endowment(A)
| ~ has_immunity(A,B) ),
file('MGT050-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ organization(A)
| has_immunity(A,B)
| has_immunity(A,C)
| ~ greater(capability(A,C),capability(A,B))
| ~ greater_or_e_qual(position(A,C),position(A,B))
| smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) ),
file('MGT050-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ organization(A)
| ~ smaller_or_e_qual(stock_of_knowledge(A,B),stock_of_knowledge(A,C))
| ~ greater(internal_friction(A,B),internal_friction(A,C))
| smaller(capability(A,B),capability(A,C)) ),
file('MGT050-1.p',unknown),
[] ).
cnf(19,axiom,
( ~ organization(A)
| external_ties(A,B) != external_ties(A,C)
| position(A,B) = position(A,C) ),
file('MGT050-1.p',unknown),
[] ).
cnf(20,axiom,
( ~ organization(A)
| stock_of_knowledge(A,B) = stock_of_knowledge(A,C) ),
file('MGT050-1.p',unknown),
[] ).
cnf(21,axiom,
( ~ organization(A)
| external_ties(A,B) = external_ties(A,C) ),
file('MGT050-1.p',unknown),
[] ).
cnf(22,axiom,
( ~ organization(A)
| ~ greater(age(A,B),age(A,C))
| greater(internal_friction(A,B),internal_friction(A,C)) ),
file('MGT050-1.p',unknown),
[] ).
cnf(23,axiom,
~ has_endowment(sk1),
file('MGT050-1.p',unknown),
[] ).
cnf(24,axiom,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
file('MGT050-1.p',unknown),
[] ).
cnf(25,plain,
~ greater(A,A),
inference(factor,[status(thm)],[9]),
[iquote('factor,9.1.2')] ).
cnf(28,axiom,
( smaller(A,B)
| A = B
| greater(A,B) ),
file('MGT050-1.p',unknown),
[] ).
cnf(29,axiom,
organization(sk1),
file('MGT050-1.p',unknown),
[] ).
cnf(30,axiom,
greater(age(sk1,sk3),age(sk1,sk2)),
file('MGT050-1.p',unknown),
[] ).
cnf(33,plain,
external_ties(sk1,A) = external_ties(sk1,B),
inference(hyper,[status(thm)],[29,21]),
[iquote('hyper,29,21')] ).
cnf(34,plain,
stock_of_knowledge(sk1,A) = stock_of_knowledge(sk1,B),
inference(hyper,[status(thm)],[29,20]),
[iquote('hyper,29,20')] ).
cnf(37,plain,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(hyper,[status(thm)],[30,22,29]),
[iquote('hyper,30,22,29')] ).
cnf(52,plain,
( A = B
| greater(A,B)
| greater(B,A) ),
inference(hyper,[status(thm)],[28,7]),
[iquote('hyper,28,7')] ).
cnf(111,plain,
position(sk1,A) = position(sk1,B),
inference(hyper,[status(thm)],[33,19,29]),
[iquote('hyper,33,19,29')] ).
cnf(123,plain,
smaller_or_e_qual(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)),
inference(hyper,[status(thm)],[34,3]),
[iquote('hyper,34,3')] ).
cnf(197,plain,
greater_or_e_qual(position(sk1,A),position(sk1,B)),
inference(hyper,[status(thm)],[111,6]),
[iquote('hyper,111,6')] ).
cnf(253,plain,
smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(hyper,[status(thm)],[123,16,29,37]),
[iquote('hyper,123,16,29,37')] ).
cnf(374,plain,
greater(capability(sk1,sk2),capability(sk1,sk3)),
inference(hyper,[status(thm)],[253,7]),
[iquote('hyper,253,7')] ).
cnf(437,plain,
( has_immunity(sk1,sk3)
| has_immunity(sk1,sk2)
| smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3)) ),
inference(hyper,[status(thm)],[374,12,29,197]),
[iquote('hyper,374,12,29,197')] ).
cnf(1026,plain,
( organization(A)
| greater(sk1,A)
| greater(A,sk1) ),
inference(para_from,[status(thm),theory(equality)],[52,29]),
[iquote('para_from,52.1.1,29.1.1')] ).
cnf(3704,plain,
( has_immunity(sk1,sk3)
| has_immunity(sk1,sk2) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[437,7]),24]),
[iquote('hyper,437,7,unit_del,24')] ).
cnf(3706,plain,
has_immunity(sk1,sk2),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[3704,11,1026]),23,25,25]),
[iquote('hyper,3704,11,1026,unit_del,23,25,25')] ).
cnf(3710,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[3706,11,1026]),23,25,25]),
[iquote('hyper,3706,11,1026,unit_del,23,25,25')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT050-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n011.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 03:57:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.02/2.19 ----- Otter 3.3f, August 2004 -----
% 2.02/2.19 The process was started by sandbox2 on n011.cluster.edu,
% 2.02/2.19 Wed Jul 27 03:57:25 2022
% 2.02/2.19 The command was "./otter". The process ID is 20606.
% 2.02/2.19
% 2.02/2.19 set(prolog_style_variables).
% 2.02/2.19 set(auto).
% 2.02/2.19 dependent: set(auto1).
% 2.02/2.19 dependent: set(process_input).
% 2.02/2.19 dependent: clear(print_kept).
% 2.02/2.19 dependent: clear(print_new_demod).
% 2.02/2.19 dependent: clear(print_back_demod).
% 2.02/2.19 dependent: clear(print_back_sub).
% 2.02/2.19 dependent: set(control_memory).
% 2.02/2.19 dependent: assign(max_mem, 12000).
% 2.02/2.19 dependent: assign(pick_given_ratio, 4).
% 2.02/2.19 dependent: assign(stats_level, 1).
% 2.02/2.19 dependent: assign(max_seconds, 10800).
% 2.02/2.19 clear(print_given).
% 2.02/2.19
% 2.02/2.19 list(usable).
% 2.02/2.19 0 [] A=A.
% 2.02/2.19 0 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 2.02/2.19 0 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 2.02/2.19 0 [] A!=B|smaller_or_e_qual(A,B).
% 2.02/2.19 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 2.02/2.19 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 2.02/2.19 0 [] A!=B|greater_or_e_qual(A,B).
% 2.02/2.19 0 [] -smaller(A,B)|greater(B,A).
% 2.02/2.19 0 [] -greater(A,B)|smaller(B,A).
% 2.02/2.19 0 [] -greater(A,B)| -greater(B,A).
% 2.02/2.19 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 2.02/2.19 0 [] smaller(A,B)|A=B|greater(A,B).
% 2.02/2.19 0 [] -organization(A)|has_endowment(A)| -has_immunity(A,B).
% 2.02/2.19 0 [] -organization(A)|has_immunity(A,B)|has_immunity(A,C)| -greater(capability(A,C),capability(A,B))| -greater_or_e_qual(position(A,C),position(A,B))|smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)).
% 2.02/2.19 0 [] -organization(A)|has_immunity(A,B)|has_immunity(A,C)| -greater_or_e_qual(capability(A,C),capability(A,B))| -greater(position(A,C),position(A,B))|smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)).
% 2.02/2.19 0 [] -organization(A)|has_immunity(A,B)|has_immunity(A,C)|capability(A,C)!=capability(A,B)|position(A,C)!=position(A,B)|hazard_of_mortality(A,C)=hazard_of_mortality(A,B).
% 2.02/2.19 0 [] -organization(A)| -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -smaller_or_e_qual(internal_friction(A,B),internal_friction(A,C))|greater(capability(A,B),capability(A,C)).
% 2.02/2.19 0 [] -organization(A)| -smaller_or_e_qual(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -greater(internal_friction(A,B),internal_friction(A,C))|smaller(capability(A,B),capability(A,C)).
% 2.02/2.19 0 [] -organization(A)|stock_of_knowledge(A,B)!=stock_of_knowledge(A,C)|internal_friction(A,B)!=internal_friction(A,C)|capability(A,B)=capability(A,C).
% 2.02/2.19 0 [] -organization(A)| -greater(external_ties(A,B),external_ties(A,C))|greater(position(A,B),position(A,C)).
% 2.02/2.19 0 [] -organization(A)|external_ties(A,B)!=external_ties(A,C)|position(A,B)=position(A,C).
% 2.02/2.19 0 [] -organization(A)|stock_of_knowledge(A,B)=stock_of_knowledge(A,C).
% 2.02/2.19 0 [] -organization(A)|external_ties(A,B)=external_ties(A,C).
% 2.02/2.19 0 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(internal_friction(A,B),internal_friction(A,C)).
% 2.02/2.19 0 [] organization(sk1).
% 2.02/2.19 0 [] -has_endowment(sk1).
% 2.02/2.19 0 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 2.02/2.19 0 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 2.02/2.19 end_of_list.
% 2.02/2.19
% 2.02/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.02/2.19
% 2.02/2.19 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.19 deletion, with positive clauses in sos and nonpositive
% 2.02/2.19 clauses in usable.
% 2.02/2.19
% 2.02/2.19 dependent: set(knuth_bendix).
% 2.02/2.19 dependent: set(anl_eq).
% 2.02/2.19 dependent: set(para_from).
% 2.02/2.19 dependent: set(para_into).
% 2.02/2.19 dependent: clear(para_from_right).
% 2.02/2.19 dependent: clear(para_into_right).
% 2.02/2.19 dependent: set(para_from_vars).
% 2.02/2.19 dependent: set(eq_units_both_ways).
% 2.02/2.19 dependent: set(dynamic_demod_all).
% 2.02/2.19 dependent: set(dynamic_demod).
% 2.02/2.19 dependent: set(order_eq).
% 2.02/2.19 dependent: set(back_demod).
% 2.02/2.19 dependent: set(lrpo).
% 2.02/2.19 dependent: set(hyper_res).
% 2.02/2.19 dependent: set(unit_deletion).
% 2.02/2.19 dependent: set(factor).
% 2.02/2.19
% 2.02/2.19 ------------> process usable:
% 2.02/2.19 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 2.02/2.19 ** KEPT (pick-wt=6): 2 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 2.02/2.19 ** KEPT (pick-wt=6): 3 [] A!=B|smaller_or_e_qual(A,B).
% 2.02/2.19 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 2.02/2.19 ** KEPT (pick-wt=6): 5 [] -greater(A,B)|greater_or_e_qual(A,B).
% 2.02/2.19 ** KEPT (pick-wt=6): 6 [] A!=B|greater_or_e_qual(A,B).
% 2.02/2.19 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 6.45/6.62 ** KEPT (pick-wt=6): 8 [] -greater(A,B)|smaller(B,A).
% 6.45/6.62 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 6.45/6.62 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 6.45/6.62 ** KEPT (pick-wt=7): 11 [] -organization(A)|has_endowment(A)| -has_immunity(A,B).
% 6.45/6.62 ** KEPT (pick-wt=29): 12 [] -organization(A)|has_immunity(A,B)|has_immunity(A,C)| -greater(capability(A,C),capability(A,B))| -greater_or_e_qual(position(A,C),position(A,B))|smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)).
% 6.45/6.62 ** KEPT (pick-wt=29): 13 [] -organization(A)|has_immunity(A,B)|has_immunity(A,C)| -greater_or_e_qual(capability(A,C),capability(A,B))| -greater(position(A,C),position(A,B))|smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)).
% 6.45/6.62 ** KEPT (pick-wt=29): 14 [] -organization(A)|has_immunity(A,B)|has_immunity(A,C)|capability(A,C)!=capability(A,B)|position(A,C)!=position(A,B)|hazard_of_mortality(A,C)=hazard_of_mortality(A,B).
% 6.45/6.62 ** KEPT (pick-wt=23): 15 [] -organization(A)| -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -smaller_or_e_qual(internal_friction(A,B),internal_friction(A,C))|greater(capability(A,B),capability(A,C)).
% 6.45/6.62 ** KEPT (pick-wt=23): 16 [] -organization(A)| -smaller_or_e_qual(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -greater(internal_friction(A,B),internal_friction(A,C))|smaller(capability(A,B),capability(A,C)).
% 6.45/6.62 ** KEPT (pick-wt=23): 17 [] -organization(A)|stock_of_knowledge(A,B)!=stock_of_knowledge(A,C)|internal_friction(A,B)!=internal_friction(A,C)|capability(A,B)=capability(A,C).
% 6.45/6.62 ** KEPT (pick-wt=16): 18 [] -organization(A)| -greater(external_ties(A,B),external_ties(A,C))|greater(position(A,B),position(A,C)).
% 6.45/6.62 ** KEPT (pick-wt=16): 19 [] -organization(A)|external_ties(A,B)!=external_ties(A,C)|position(A,B)=position(A,C).
% 6.45/6.62 ** KEPT (pick-wt=9): 20 [] -organization(A)|stock_of_knowledge(A,B)=stock_of_knowledge(A,C).
% 6.45/6.62 ** KEPT (pick-wt=9): 21 [] -organization(A)|external_ties(A,B)=external_ties(A,C).
% 6.45/6.62 ** KEPT (pick-wt=16): 22 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(internal_friction(A,B),internal_friction(A,C)).
% 6.45/6.62 ** KEPT (pick-wt=2): 23 [] -has_endowment(sk1).
% 6.45/6.62 ** KEPT (pick-wt=7): 24 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 6.45/6.62
% 6.45/6.62 ------------> process sos:
% 6.45/6.62 ** KEPT (pick-wt=3): 27 [] A=A.
% 6.45/6.62 ** KEPT (pick-wt=9): 28 [] smaller(A,B)|A=B|greater(A,B).
% 6.45/6.62 ** KEPT (pick-wt=2): 29 [] organization(sk1).
% 6.45/6.62 ** KEPT (pick-wt=7): 30 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 6.45/6.62 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] A=A.
% 6.45/6.62 27 back subsumes 26.
% 6.45/6.62
% 6.45/6.62 ======= end of input processing =======
% 6.45/6.62
% 6.45/6.62 =========== start of search ===========
% 6.45/6.62
% 6.45/6.62
% 6.45/6.62 Resetting weight limit to 12.
% 6.45/6.62
% 6.45/6.62
% 6.45/6.62 Resetting weight limit to 12.
% 6.45/6.62
% 6.45/6.62 sos_size=3455
% 6.45/6.62
% 6.45/6.62 -------- PROOF --------
% 6.45/6.62
% 6.45/6.62 -----> EMPTY CLAUSE at 4.42 sec ----> 3710 [hyper,3706,11,1026,unit_del,23,25,25] $F.
% 6.45/6.62
% 6.45/6.62 Length of proof is 14. Level of proof is 7.
% 6.45/6.62
% 6.45/6.62 ---------------- PROOF ----------------
% 6.45/6.62 % SZS status Unsatisfiable
% 6.45/6.62 % SZS output start Refutation
% See solution above
% 6.45/6.62 ------------ end of proof -------------
% 6.45/6.62
% 6.45/6.62
% 6.45/6.62 Search stopped by max_proofs option.
% 6.45/6.62
% 6.45/6.62
% 6.45/6.62 Search stopped by max_proofs option.
% 6.45/6.62
% 6.45/6.62 ============ end of search ============
% 6.45/6.62
% 6.45/6.62 -------------- statistics -------------
% 6.45/6.62 clauses given 667
% 6.45/6.62 clauses generated 134835
% 6.45/6.62 clauses kept 3709
% 6.45/6.62 clauses forward subsumed 12526
% 6.45/6.62 clauses back subsumed 268
% 6.45/6.62 Kbytes malloced 4882
% 6.45/6.62
% 6.45/6.62 ----------- times (seconds) -----------
% 6.45/6.62 user CPU time 4.42 (0 hr, 0 min, 4 sec)
% 6.45/6.62 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 6.45/6.62 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.45/6.62
% 6.45/6.62 That finishes the proof of the theorem.
% 6.45/6.62
% 6.45/6.62 Process 20606 finished Wed Jul 27 03:57:31 2022
% 6.45/6.62 Otter interrupted
% 6.45/6.62 PROOF FOUND
%------------------------------------------------------------------------------