TSTP Solution File: MGT044+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:10 EDT 2022
% Result : Theorem 1.77s 1.97s
% Output : Refutation 1.77s
% 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 : 5 ( 3 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,
( smaller_or_e_qual(A,B)
| A != B ),
file('MGT044+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ 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)) ),
file('MGT044+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ organization(A)
| ~ greater(age(A,B),age(A,C))
| greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) ),
file('MGT044+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ organization(A)
| internal_friction(A,B) = internal_friction(A,C) ),
file('MGT044+1.p',unknown),
[] ).
cnf(16,axiom,
~ greater(capability(dollar_c3,dollar_c1),capability(dollar_c3,dollar_c2)),
file('MGT044+1.p',unknown),
[] ).
cnf(20,axiom,
organization(dollar_c3),
file('MGT044+1.p',unknown),
[] ).
cnf(21,axiom,
greater(age(dollar_c3,dollar_c1),age(dollar_c3,dollar_c2)),
file('MGT044+1.p',unknown),
[] ).
cnf(24,plain,
internal_friction(dollar_c3,A) = internal_friction(dollar_c3,B),
inference(hyper,[status(thm)],[20,15]),
[iquote('hyper,20,15')] ).
cnf(27,plain,
greater(stock_of_knowledge(dollar_c3,dollar_c1),stock_of_knowledge(dollar_c3,dollar_c2)),
inference(hyper,[status(thm)],[21,14,20]),
[iquote('hyper,21,14,20')] ).
cnf(78,plain,
smaller_or_e_qual(internal_friction(dollar_c3,A),internal_friction(dollar_c3,B)),
inference(hyper,[status(thm)],[24,3]),
[iquote('hyper,24,3')] ).
cnf(164,plain,
greater(capability(dollar_c3,dollar_c1),capability(dollar_c3,dollar_c2)),
inference(hyper,[status(thm)],[78,11,20,27]),
[iquote('hyper,78,11,20,27')] ).
cnf(165,plain,
$false,
inference(binary,[status(thm)],[164,16]),
[iquote('binary,164.1,16.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:01:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.77/1.96 ----- Otter 3.3f, August 2004 -----
% 1.77/1.96 The process was started by sandbox2 on n012.cluster.edu,
% 1.77/1.96 Wed Jul 27 04:01:20 2022
% 1.77/1.96 The command was "./otter". The process ID is 27588.
% 1.77/1.96
% 1.77/1.96 set(prolog_style_variables).
% 1.77/1.96 set(auto).
% 1.77/1.96 dependent: set(auto1).
% 1.77/1.96 dependent: set(process_input).
% 1.77/1.96 dependent: clear(print_kept).
% 1.77/1.96 dependent: clear(print_new_demod).
% 1.77/1.96 dependent: clear(print_back_demod).
% 1.77/1.96 dependent: clear(print_back_sub).
% 1.77/1.96 dependent: set(control_memory).
% 1.77/1.96 dependent: assign(max_mem, 12000).
% 1.77/1.96 dependent: assign(pick_given_ratio, 4).
% 1.77/1.96 dependent: assign(stats_level, 1).
% 1.77/1.96 dependent: assign(max_seconds, 10800).
% 1.77/1.96 clear(print_given).
% 1.77/1.96
% 1.77/1.96 formula_list(usable).
% 1.77/1.96 all A (A=A).
% 1.77/1.96 all X Y (smaller_or_e_qual(X,Y)<->smaller(X,Y)|X=Y).
% 1.77/1.96 all X Y (greater_or_e_qual(X,Y)<->greater(X,Y)|X=Y).
% 1.77/1.96 all X Y (smaller(X,Y)<->greater(Y,X)).
% 1.77/1.96 all X Y (-(greater(X,Y)&greater(Y,X))).
% 1.77/1.96 all X Y Z (greater(X,Y)&greater(Y,Z)->greater(X,Z)).
% 1.77/1.96 all X Y (smaller(X,Y)|X=Y|greater(X,Y)).
% 1.77/1.96 all X T0 T (organization(X)-> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))&smaller_or_e_qual(internal_friction(X,T),internal_friction(X,T0))->greater(capability(X,T),capability(X,T0)))& (smaller_or_e_qual(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))&greater(internal_friction(X,T),internal_friction(X,T0))->smaller(capability(X,T),capability(X,T0)))& (stock_of_knowledge(X,T)=stock_of_knowledge(X,T0)&internal_friction(X,T)=internal_friction(X,T0)->capability(X,T)=capability(X,T0))).
% 1.77/1.96 all X T0 T (organization(X)&greater(age(X,T),age(X,T0))->greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))).
% 1.77/1.96 all X T0 T (organization(X)->internal_friction(X,T)=internal_friction(X,T0)).
% 1.77/1.96 -(all X T0 T (organization(X)&greater(age(X,T),age(X,T0))->greater(capability(X,T),capability(X,T0)))).
% 1.77/1.96 end_of_list.
% 1.77/1.96
% 1.77/1.96 -------> usable clausifies to:
% 1.77/1.96
% 1.77/1.96 list(usable).
% 1.77/1.96 0 [] A=A.
% 1.77/1.96 0 [] -smaller_or_e_qual(X,Y)|smaller(X,Y)|X=Y.
% 1.77/1.96 0 [] smaller_or_e_qual(X,Y)| -smaller(X,Y).
% 1.77/1.96 0 [] smaller_or_e_qual(X,Y)|X!=Y.
% 1.77/1.96 0 [] -greater_or_e_qual(X,Y)|greater(X,Y)|X=Y.
% 1.77/1.96 0 [] greater_or_e_qual(X,Y)| -greater(X,Y).
% 1.77/1.96 0 [] greater_or_e_qual(X,Y)|X!=Y.
% 1.77/1.96 0 [] -smaller(X,Y)|greater(Y,X).
% 1.77/1.96 0 [] smaller(X,Y)| -greater(Y,X).
% 1.77/1.96 0 [] -greater(X,Y)| -greater(Y,X).
% 1.77/1.96 0 [] -greater(X,Y)| -greater(Y,Z)|greater(X,Z).
% 1.77/1.96 0 [] smaller(X,Y)|X=Y|greater(X,Y).
% 1.77/1.96 0 [] -organization(X)| -greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))| -smaller_or_e_qual(internal_friction(X,T),internal_friction(X,T0))|greater(capability(X,T),capability(X,T0)).
% 1.77/1.96 0 [] -organization(X)| -smaller_or_e_qual(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))| -greater(internal_friction(X,T),internal_friction(X,T0))|smaller(capability(X,T),capability(X,T0)).
% 1.77/1.96 0 [] -organization(X)|stock_of_knowledge(X,T)!=stock_of_knowledge(X,T0)|internal_friction(X,T)!=internal_friction(X,T0)|capability(X,T)=capability(X,T0).
% 1.77/1.96 0 [] -organization(X)| -greater(age(X,T),age(X,T0))|greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)).
% 1.77/1.96 0 [] -organization(X)|internal_friction(X,T)=internal_friction(X,T0).
% 1.77/1.96 0 [] organization($c3).
% 1.77/1.96 0 [] greater(age($c3,$c1),age($c3,$c2)).
% 1.77/1.96 0 [] -greater(capability($c3,$c1),capability($c3,$c2)).
% 1.77/1.96 end_of_list.
% 1.77/1.96
% 1.77/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.77/1.96
% 1.77/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.77/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.96 deletion, with positive clauses in sos and nonpositive
% 1.77/1.96 clauses in usable.
% 1.77/1.96
% 1.77/1.96 dependent: set(knuth_bendix).
% 1.77/1.96 dependent: set(anl_eq).
% 1.77/1.96 dependent: set(para_from).
% 1.77/1.96 dependent: set(para_into).
% 1.77/1.96 dependent: clear(para_from_right).
% 1.77/1.96 dependent: clear(para_into_right).
% 1.77/1.96 dependent: set(para_from_vars).
% 1.77/1.96 dependent: set(eq_units_both_ways).
% 1.77/1.96 dependent: set(dynamic_demod_all).
% 1.77/1.96 dependent: set(dynamic_demod).
% 1.77/1.96 dependent: set(order_eq).
% 1.77/1.96 dependent: set(back_demod).
% 1.77/1.96 dependent: set(lrpo).
% 1.77/1.96 dependent: set(hyper_res).
% 1.77/1.96 dependent: set(unit_deletion).
% 1.77/1.96 dependent: set(factor).
% 1.77/1.96
% 1.77/1.96 ------------> process usable:
% 1.77/1.96 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.77/1.96 ** KEPT (pick-wt=6): 2 [] smaller_or_e_qual(A,B)| -smaller(A,B).
% 1.77/1.96 ** KEPT (pick-wt=6): 3 [] smaller_or_e_qual(A,B)|A!=B.
% 1.77/1.97 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.77/1.97 ** KEPT (pick-wt=6): 5 [] greater_or_e_qual(A,B)| -greater(A,B).
% 1.77/1.97 ** KEPT (pick-wt=6): 6 [] greater_or_e_qual(A,B)|A!=B.
% 1.77/1.97 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 1.77/1.97 ** KEPT (pick-wt=6): 8 [] smaller(A,B)| -greater(B,A).
% 1.77/1.97 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 1.77/1.97 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.77/1.97 ** 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.77/1.97 ** 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.77/1.97 ** 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.77/1.97 ** KEPT (pick-wt=16): 14 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)).
% 1.77/1.97 ** KEPT (pick-wt=9): 15 [] -organization(A)|internal_friction(A,B)=internal_friction(A,C).
% 1.77/1.97 ** KEPT (pick-wt=7): 16 [] -greater(capability($c3,$c1),capability($c3,$c2)).
% 1.77/1.97
% 1.77/1.97 ------------> process sos:
% 1.77/1.97 ** KEPT (pick-wt=3): 18 [] A=A.
% 1.77/1.97 ** KEPT (pick-wt=9): 19 [] smaller(A,B)|A=B|greater(A,B).
% 1.77/1.97 ** KEPT (pick-wt=2): 20 [] organization($c3).
% 1.77/1.97 ** KEPT (pick-wt=7): 21 [] greater(age($c3,$c1),age($c3,$c2)).
% 1.77/1.97 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] A=A.
% 1.77/1.97
% 1.77/1.97 ======= end of input processing =======
% 1.77/1.97
% 1.77/1.97 =========== start of search ===========
% 1.77/1.97
% 1.77/1.97 -------- PROOF --------
% 1.77/1.97
% 1.77/1.97 ----> UNIT CONFLICT at 0.01 sec ----> 165 [binary,164.1,16.1] $F.
% 1.77/1.97
% 1.77/1.97 Length of proof is 4. Level of proof is 3.
% 1.77/1.97
% 1.77/1.97 ---------------- PROOF ----------------
% 1.77/1.97 % SZS status Theorem
% 1.77/1.97 % SZS output start Refutation
% See solution above
% 1.77/1.97 ------------ end of proof -------------
% 1.77/1.97
% 1.77/1.97
% 1.77/1.97 Search stopped by max_proofs option.
% 1.77/1.97
% 1.77/1.97
% 1.77/1.97 Search stopped by max_proofs option.
% 1.77/1.97
% 1.77/1.97 ============ end of search ============
% 1.77/1.97
% 1.77/1.97 -------------- statistics -------------
% 1.77/1.97 clauses given 13
% 1.77/1.97 clauses generated 175
% 1.77/1.97 clauses kept 164
% 1.77/1.97 clauses forward subsumed 33
% 1.77/1.97 clauses back subsumed 0
% 1.77/1.97 Kbytes malloced 976
% 1.77/1.97
% 1.77/1.97 ----------- times (seconds) -----------
% 1.77/1.97 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.77/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.97 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.77/1.97
% 1.77/1.97 That finishes the proof of the theorem.
% 1.77/1.97
% 1.77/1.97 Process 27588 finished Wed Jul 27 04:01:22 2022
% 1.77/1.97 Otter interrupted
% 1.77/1.97 PROOF FOUND
%------------------------------------------------------------------------------