TSTP Solution File: MGT048-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:11 EDT 2022
% Result : Unsatisfiable 1.70s 1.91s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 19 ( 3 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( A != B
| smaller_or_e_qual(A,B) ),
file('MGT048-1.p',unknown),
[] ).
cnf(12,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('MGT048-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ organization(A)
| stock_of_knowledge(A,B) = stock_of_knowledge(A,C) ),
file('MGT048-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ organization(A)
| ~ greater(age(A,B),age(A,C))
| greater(internal_friction(A,B),internal_friction(A,C)) ),
file('MGT048-1.p',unknown),
[] ).
cnf(16,axiom,
~ smaller(capability(sk1,sk3),capability(sk1,sk2)),
file('MGT048-1.p',unknown),
[] ).
cnf(20,axiom,
organization(sk1),
file('MGT048-1.p',unknown),
[] ).
cnf(21,axiom,
greater(age(sk1,sk3),age(sk1,sk2)),
file('MGT048-1.p',unknown),
[] ).
cnf(24,plain,
stock_of_knowledge(sk1,A) = stock_of_knowledge(sk1,B),
inference(hyper,[status(thm)],[20,14]),
[iquote('hyper,20,14')] ).
cnf(27,plain,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(hyper,[status(thm)],[21,15,20]),
[iquote('hyper,21,15,20')] ).
cnf(79,plain,
smaller_or_e_qual(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)),
inference(hyper,[status(thm)],[24,3]),
[iquote('hyper,24,3')] ).
cnf(165,plain,
smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(hyper,[status(thm)],[79,12,20,27]),
[iquote('hyper,79,12,20,27')] ).
cnf(166,plain,
$false,
inference(binary,[status(thm)],[165,16]),
[iquote('binary,165.1,16.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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 04:05:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.70/1.91 ----- Otter 3.3f, August 2004 -----
% 1.70/1.91 The process was started by sandbox on n018.cluster.edu,
% 1.70/1.91 Wed Jul 27 04:05:31 2022
% 1.70/1.91 The command was "./otter". The process ID is 19424.
% 1.70/1.91
% 1.70/1.91 set(prolog_style_variables).
% 1.70/1.91 set(auto).
% 1.70/1.91 dependent: set(auto1).
% 1.70/1.91 dependent: set(process_input).
% 1.70/1.91 dependent: clear(print_kept).
% 1.70/1.91 dependent: clear(print_new_demod).
% 1.70/1.91 dependent: clear(print_back_demod).
% 1.70/1.91 dependent: clear(print_back_sub).
% 1.70/1.91 dependent: set(control_memory).
% 1.70/1.91 dependent: assign(max_mem, 12000).
% 1.70/1.91 dependent: assign(pick_given_ratio, 4).
% 1.70/1.91 dependent: assign(stats_level, 1).
% 1.70/1.91 dependent: assign(max_seconds, 10800).
% 1.70/1.91 clear(print_given).
% 1.70/1.91
% 1.70/1.91 list(usable).
% 1.70/1.91 0 [] A=A.
% 1.70/1.91 0 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.70/1.91 0 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.70/1.91 0 [] A!=B|smaller_or_e_qual(A,B).
% 1.70/1.91 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.70/1.91 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.70/1.91 0 [] A!=B|greater_or_e_qual(A,B).
% 1.70/1.91 0 [] -smaller(A,B)|greater(B,A).
% 1.70/1.91 0 [] -greater(A,B)|smaller(B,A).
% 1.70/1.91 0 [] -greater(A,B)| -greater(B,A).
% 1.70/1.91 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.70/1.91 0 [] smaller(A,B)|A=B|greater(A,B).
% 1.70/1.91 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)).
% 1.70/1.91 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)).
% 1.70/1.91 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).
% 1.70/1.91 0 [] -organization(A)|stock_of_knowledge(A,B)=stock_of_knowledge(A,C).
% 1.70/1.91 0 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(internal_friction(A,B),internal_friction(A,C)).
% 1.70/1.91 0 [] organization(sk1).
% 1.70/1.91 0 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 1.70/1.91 0 [] -smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 1.70/1.91 end_of_list.
% 1.70/1.91
% 1.70/1.91 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.70/1.91
% 1.70/1.91 This ia a non-Horn set with equality. The strategy will be
% 1.70/1.91 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.70/1.91 deletion, with positive clauses in sos and nonpositive
% 1.70/1.91 clauses in usable.
% 1.70/1.91
% 1.70/1.91 dependent: set(knuth_bendix).
% 1.70/1.91 dependent: set(anl_eq).
% 1.70/1.91 dependent: set(para_from).
% 1.70/1.91 dependent: set(para_into).
% 1.70/1.91 dependent: clear(para_from_right).
% 1.70/1.91 dependent: clear(para_into_right).
% 1.70/1.91 dependent: set(para_from_vars).
% 1.70/1.91 dependent: set(eq_units_both_ways).
% 1.70/1.91 dependent: set(dynamic_demod_all).
% 1.70/1.91 dependent: set(dynamic_demod).
% 1.70/1.91 dependent: set(order_eq).
% 1.70/1.91 dependent: set(back_demod).
% 1.70/1.91 dependent: set(lrpo).
% 1.70/1.91 dependent: set(hyper_res).
% 1.70/1.91 dependent: set(unit_deletion).
% 1.70/1.91 dependent: set(factor).
% 1.70/1.91
% 1.70/1.91 ------------> process usable:
% 1.70/1.91 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.70/1.91 ** KEPT (pick-wt=6): 2 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.70/1.91 ** KEPT (pick-wt=6): 3 [] A!=B|smaller_or_e_qual(A,B).
% 1.70/1.91 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.70/1.91 ** KEPT (pick-wt=6): 5 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.70/1.91 ** KEPT (pick-wt=6): 6 [] A!=B|greater_or_e_qual(A,B).
% 1.70/1.91 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 1.70/1.91 ** KEPT (pick-wt=6): 8 [] -greater(A,B)|smaller(B,A).
% 1.70/1.91 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 1.70/1.91 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.70/1.91 ** KEPT (pick-wt=23): 11 [] -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)).
% 1.70/1.91 ** KEPT (pick-wt=23): 12 [] -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)).
% 1.70/1.91 ** KEPT (pick-wt=23): 13 [] -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).
% 1.70/1.91 ** KEPT (pick-wt=9): 14 [] -organization(A)|stock_of_knowledge(A,B)=stock_of_knowledge(A,C).
% 1.70/1.91 ** KEPT (pick-wt=16): 15 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(internal_friction(A,B),internal_friction(A,C)).
% 1.70/1.91 ** KEPT (pick-wt=7): 16 [] -smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 1.70/1.91
% 1.70/1.91 ------------> process sos:
% 1.70/1.91 ** KEPT (pick-wt=3): 18 [] A=A.
% 1.70/1.91 ** KEPT (pick-wt=9): 19 [] smaller(A,B)|A=B|greater(A,B).
% 1.70/1.91 ** KEPT (pick-wt=2): 20 [] organization(sk1).
% 1.70/1.91 ** KEPT (pick-wt=7): 21 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 1.70/1.91 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] A=A.
% 1.70/1.91
% 1.70/1.91 ======= end of input processing =======
% 1.70/1.91
% 1.70/1.91 =========== start of search ===========
% 1.70/1.91
% 1.70/1.91 -------- PROOF --------
% 1.70/1.91
% 1.70/1.91 ----> UNIT CONFLICT at 0.00 sec ----> 166 [binary,165.1,16.1] $F.
% 1.70/1.91
% 1.70/1.91 Length of proof is 4. Level of proof is 3.
% 1.70/1.91
% 1.70/1.91 ---------------- PROOF ----------------
% 1.70/1.91 % SZS status Unsatisfiable
% 1.70/1.91 % SZS output start Refutation
% See solution above
% 1.70/1.91 ------------ end of proof -------------
% 1.70/1.91
% 1.70/1.91
% 1.70/1.91 Search stopped by max_proofs option.
% 1.70/1.91
% 1.70/1.91
% 1.70/1.91 Search stopped by max_proofs option.
% 1.70/1.91
% 1.70/1.91 ============ end of search ============
% 1.70/1.91
% 1.70/1.91 -------------- statistics -------------
% 1.70/1.91 clauses given 13
% 1.70/1.91 clauses generated 176
% 1.70/1.91 clauses kept 165
% 1.70/1.91 clauses forward subsumed 33
% 1.70/1.91 clauses back subsumed 0
% 1.70/1.91 Kbytes malloced 976
% 1.70/1.91
% 1.70/1.91 ----------- times (seconds) -----------
% 1.70/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.70/1.91
% 1.70/1.91 That finishes the proof of the theorem.
% 1.70/1.91
% 1.70/1.91 Process 19424 finished Wed Jul 27 04:05:32 2022
% 1.70/1.91 Otter interrupted
% 1.70/1.91 PROOF FOUND
%------------------------------------------------------------------------------