TSTP Solution File: MGT060-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT060-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:15 EDT 2022
% Result : Unsatisfiable 1.96s 2.15s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 29 ( 19 unt; 6 nHn; 27 RR)
% Number of literals : 55 ( 8 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
( ~ greater(A,B)
| ~ greater(B,C)
| greater(A,C) ),
file('MGT060-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(A)
| ~ has_immunity(A,B)
| hazard_of_mortality(A,B) = very_low ),
file('MGT060-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ organization(A)
| has_immunity(A,B)
| ~ is_aligned(A,B)
| ~ positional_advantage(A,B)
| hazard_of_mortality(A,B) = low ),
file('MGT060-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ organization(A)
| has_immunity(A,B)
| is_aligned(A,B)
| ~ positional_advantage(A,B)
| hazard_of_mortality(A,B) = mod1 ),
file('MGT060-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ organization(A)
| has_immunity(A,B)
| ~ is_aligned(A,B)
| positional_advantage(A,B)
| hazard_of_mortality(A,B) = mod2 ),
file('MGT060-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ organization(A)
| has_immunity(A,B)
| is_aligned(A,B)
| positional_advantage(A,B)
| hazard_of_mortality(A,B) = high ),
file('MGT060-1.p',unknown),
[] ).
cnf(16,axiom,
~ has_immunity(sk1,sk3),
file('MGT060-1.p',unknown),
[] ).
cnf(17,axiom,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
file('MGT060-1.p',unknown),
[] ).
cnf(21,axiom,
greater(high,mod1),
file('MGT060-1.p',unknown),
[] ).
cnf(22,axiom,
greater(mod1,low),
file('MGT060-1.p',unknown),
[] ).
cnf(23,axiom,
greater(low,very_low),
file('MGT060-1.p',unknown),
[] ).
cnf(25,axiom,
greater(mod2,low),
file('MGT060-1.p',unknown),
[] ).
cnf(26,axiom,
organization(sk1),
file('MGT060-1.p',unknown),
[] ).
cnf(27,axiom,
has_immunity(sk1,sk2),
file('MGT060-1.p',unknown),
[] ).
cnf(30,plain,
( has_immunity(sk1,A)
| is_aligned(sk1,A)
| positional_advantage(sk1,A)
| hazard_of_mortality(sk1,A) = high ),
inference(hyper,[status(thm)],[26,15]),
[iquote('hyper,26,15')] ).
cnf(39,plain,
greater(high,low),
inference(hyper,[status(thm)],[22,10,21]),
[iquote('hyper,22,10,21')] ).
cnf(46,plain,
greater(mod1,very_low),
inference(hyper,[status(thm)],[23,10,22]),
[iquote('hyper,23,10,22')] ).
cnf(83,plain,
greater(mod2,very_low),
inference(hyper,[status(thm)],[25,10,23]),
[iquote('hyper,25,10,23')] ).
cnf(93,plain,
hazard_of_mortality(sk1,sk2) = very_low,
inference(hyper,[status(thm)],[27,11,26]),
[iquote('hyper,27,11,26')] ).
cnf(98,plain,
~ greater(hazard_of_mortality(sk1,sk3),very_low),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[17]),93]),
[iquote('back_demod,17,demod,93')] ).
cnf(118,plain,
greater(high,very_low),
inference(hyper,[status(thm)],[39,10,23]),
[iquote('hyper,39,10,23')] ).
cnf(395,plain,
( is_aligned(sk1,sk3)
| positional_advantage(sk1,sk3) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[98,30]),118,16]),
[iquote('para_into,98.1.1,30.4.1,unit_del,118,16')] ).
cnf(396,plain,
( ~ is_aligned(sk1,sk3)
| positional_advantage(sk1,sk3) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[98,14]),83,26,16]),
[iquote('para_into,98.1.1,14.5.1,unit_del,83,26,16')] ).
cnf(397,plain,
( is_aligned(sk1,sk3)
| ~ positional_advantage(sk1,sk3) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[98,13]),46,26,16]),
[iquote('para_into,98.1.1,13.5.1,unit_del,46,26,16')] ).
cnf(485,plain,
is_aligned(sk1,sk3),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[397,395])]),
[iquote('hyper,397,395,factor_simp')] ).
cnf(493,plain,
positional_advantage(sk1,sk3),
inference(hyper,[status(thm)],[485,396]),
[iquote('hyper,485,396')] ).
cnf(501,plain,
hazard_of_mortality(sk1,sk3) = low,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[493,12,26,485]),16]),
[iquote('hyper,493,12,26,485,unit_del,16')] ).
cnf(506,plain,
~ greater(low,very_low),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[98]),501]),
[iquote('back_demod,98,demod,501')] ).
cnf(507,plain,
$false,
inference(binary,[status(thm)],[506,23]),
[iquote('binary,506.1,23.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT060-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:57:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.13 ----- Otter 3.3f, August 2004 -----
% 1.96/2.13 The process was started by sandbox on n013.cluster.edu,
% 1.96/2.13 Wed Jul 27 03:57:00 2022
% 1.96/2.13 The command was "./otter". The process ID is 5373.
% 1.96/2.13
% 1.96/2.13 set(prolog_style_variables).
% 1.96/2.13 set(auto).
% 1.96/2.13 dependent: set(auto1).
% 1.96/2.13 dependent: set(process_input).
% 1.96/2.13 dependent: clear(print_kept).
% 1.96/2.13 dependent: clear(print_new_demod).
% 1.96/2.13 dependent: clear(print_back_demod).
% 1.96/2.13 dependent: clear(print_back_sub).
% 1.96/2.13 dependent: set(control_memory).
% 1.96/2.13 dependent: assign(max_mem, 12000).
% 1.96/2.13 dependent: assign(pick_given_ratio, 4).
% 1.96/2.13 dependent: assign(stats_level, 1).
% 1.96/2.13 dependent: assign(max_seconds, 10800).
% 1.96/2.13 clear(print_given).
% 1.96/2.13
% 1.96/2.13 list(usable).
% 1.96/2.13 0 [] A=A.
% 1.96/2.13 0 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.96/2.13 0 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.96/2.13 0 [] A!=B|smaller_or_e_qual(A,B).
% 1.96/2.13 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.96/2.13 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.96/2.13 0 [] A!=B|greater_or_e_qual(A,B).
% 1.96/2.13 0 [] -smaller(A,B)|greater(B,A).
% 1.96/2.13 0 [] -greater(A,B)|smaller(B,A).
% 1.96/2.13 0 [] -greater(A,B)| -greater(B,A).
% 1.96/2.13 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.96/2.13 0 [] smaller(A,B)|A=B|greater(A,B).
% 1.96/2.13 0 [] -organization(A)| -has_immunity(A,B)|hazard_of_mortality(A,B)=very_low.
% 1.96/2.13 0 [] -organization(A)|has_immunity(A,B)| -is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=low.
% 1.96/2.13 0 [] -organization(A)|has_immunity(A,B)|is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=mod1.
% 1.96/2.13 0 [] -organization(A)|has_immunity(A,B)| -is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=mod2.
% 1.96/2.13 0 [] -organization(A)|has_immunity(A,B)|is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=high.
% 1.96/2.13 0 [] greater(high,mod1).
% 1.96/2.13 0 [] greater(mod1,low).
% 1.96/2.13 0 [] greater(low,very_low).
% 1.96/2.13 0 [] greater(high,mod2).
% 1.96/2.13 0 [] greater(mod2,low).
% 1.96/2.13 0 [] organization(sk1).
% 1.96/2.13 0 [] has_immunity(sk1,sk2).
% 1.96/2.13 0 [] -has_immunity(sk1,sk3).
% 1.96/2.13 0 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 1.96/2.13 end_of_list.
% 1.96/2.13
% 1.96/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.96/2.13
% 1.96/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.96/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.13 deletion, with positive clauses in sos and nonpositive
% 1.96/2.13 clauses in usable.
% 1.96/2.13
% 1.96/2.13 dependent: set(knuth_bendix).
% 1.96/2.13 dependent: set(anl_eq).
% 1.96/2.13 dependent: set(para_from).
% 1.96/2.13 dependent: set(para_into).
% 1.96/2.13 dependent: clear(para_from_right).
% 1.96/2.13 dependent: clear(para_into_right).
% 1.96/2.13 dependent: set(para_from_vars).
% 1.96/2.13 dependent: set(eq_units_both_ways).
% 1.96/2.13 dependent: set(dynamic_demod_all).
% 1.96/2.13 dependent: set(dynamic_demod).
% 1.96/2.13 dependent: set(order_eq).
% 1.96/2.13 dependent: set(back_demod).
% 1.96/2.13 dependent: set(lrpo).
% 1.96/2.13 dependent: set(hyper_res).
% 1.96/2.13 dependent: set(unit_deletion).
% 1.96/2.13 dependent: set(factor).
% 1.96/2.13
% 1.96/2.13 ------------> process usable:
% 1.96/2.13 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.96/2.13 ** KEPT (pick-wt=6): 2 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.96/2.13 ** KEPT (pick-wt=6): 3 [] A!=B|smaller_or_e_qual(A,B).
% 1.96/2.13 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.96/2.13 ** KEPT (pick-wt=6): 5 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.96/2.13 ** KEPT (pick-wt=6): 6 [] A!=B|greater_or_e_qual(A,B).
% 1.96/2.13 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 1.96/2.13 ** KEPT (pick-wt=6): 8 [] -greater(A,B)|smaller(B,A).
% 1.96/2.13 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 1.96/2.13 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.96/2.13 ** KEPT (pick-wt=10): 11 [] -organization(A)| -has_immunity(A,B)|hazard_of_mortality(A,B)=very_low.
% 1.96/2.13 ** KEPT (pick-wt=16): 12 [] -organization(A)|has_immunity(A,B)| -is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=low.
% 1.96/2.13 ** KEPT (pick-wt=16): 13 [] -organization(A)|has_immunity(A,B)|is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=mod1.
% 1.96/2.13 ** KEPT (pick-wt=16): 14 [] -organization(A)|has_immunity(A,B)| -is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=mod2.
% 1.96/2.13 ** KEPT (pick-wt=16): 15 [] -organization(A)|has_immunity(A,B)|is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=high.
% 1.96/2.13 ** KEPT (pick-wt=3): 16 [] -has_immunity(sk1,sk3).
% 1.96/2.13 ** KEPT (pick-wt=7): 17 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 1.96/2.15
% 1.96/2.15 ------------> process sos:
% 1.96/2.15 ** KEPT (pick-wt=3): 19 [] A=A.
% 1.96/2.15 ** KEPT (pick-wt=9): 20 [] smaller(A,B)|A=B|greater(A,B).
% 1.96/2.15 ** KEPT (pick-wt=3): 21 [] greater(high,mod1).
% 1.96/2.15 ** KEPT (pick-wt=3): 22 [] greater(mod1,low).
% 1.96/2.15 ** KEPT (pick-wt=3): 23 [] greater(low,very_low).
% 1.96/2.15 ** KEPT (pick-wt=3): 24 [] greater(high,mod2).
% 1.96/2.15 ** KEPT (pick-wt=3): 25 [] greater(mod2,low).
% 1.96/2.15 ** KEPT (pick-wt=2): 26 [] organization(sk1).
% 1.96/2.15 ** KEPT (pick-wt=3): 27 [] has_immunity(sk1,sk2).
% 1.96/2.15 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 1.96/2.15
% 1.96/2.15 ======= end of input processing =======
% 1.96/2.15
% 1.96/2.15 =========== start of search ===========
% 1.96/2.15
% 1.96/2.15 -------- PROOF --------
% 1.96/2.15
% 1.96/2.15 ----> UNIT CONFLICT at 0.02 sec ----> 507 [binary,506.1,23.1] $F.
% 1.96/2.15
% 1.96/2.15 Length of proof is 14. Level of proof is 7.
% 1.96/2.15
% 1.96/2.15 ---------------- PROOF ----------------
% 1.96/2.15 % SZS status Unsatisfiable
% 1.96/2.15 % SZS output start Refutation
% See solution above
% 1.96/2.15 ------------ end of proof -------------
% 1.96/2.15
% 1.96/2.15
% 1.96/2.15 Search stopped by max_proofs option.
% 1.96/2.15
% 1.96/2.15
% 1.96/2.15 Search stopped by max_proofs option.
% 1.96/2.15
% 1.96/2.15 ============ end of search ============
% 1.96/2.15
% 1.96/2.15 -------------- statistics -------------
% 1.96/2.15 clauses given 63
% 1.96/2.15 clauses generated 675
% 1.96/2.15 clauses kept 504
% 1.96/2.15 clauses forward subsumed 200
% 1.96/2.15 clauses back subsumed 22
% 1.96/2.15 Kbytes malloced 976
% 1.96/2.15
% 1.96/2.15 ----------- times (seconds) -----------
% 1.96/2.15 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.96/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.15 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.96/2.15
% 1.96/2.15 That finishes the proof of the theorem.
% 1.96/2.15
% 1.96/2.15 Process 5373 finished Wed Jul 27 03:57:01 2022
% 1.96/2.15 Otter interrupted
% 1.96/2.15 PROOF FOUND
%------------------------------------------------------------------------------