TSTP Solution File: MGT042-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT042-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:47 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 22
% Syntax : Number of clauses : 82 ( 19 unt; 26 nHn; 80 RR)
% Number of literals : 198 ( 48 equ; 93 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lemma_1_57,negated_conjecture,
( greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2))
| greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_57) ).
cnf(definition_greater_or_equal_5,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',definition_greater_or_equal_5) ).
cnf(assumption_4_39,axiom,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| ~ organization(X1)
| ~ greater_or_equal(capability(X1,X3),capability(X1,X2))
| ~ greater(position(X1,X3),position(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_4_39) ).
cnf(assumption_6_44,axiom,
( greater(position(X1,X2),position(X1,X3))
| ~ organization(X1)
| ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_6_44) ).
cnf(definition_greater_or_equal_4,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',definition_greater_or_equal_4) ).
cnf(lemma_1_64,negated_conjecture,
( ~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2))
| ~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_64) ).
cnf(lemma_1_46,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_46) ).
cnf(lemma_1_47,negated_conjecture,
~ has_immunity(sk1,sk2),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_47) ).
cnf(lemma_1_48,negated_conjecture,
~ has_immunity(sk1,sk3),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_48) ).
cnf(lemma_1_54,negated_conjecture,
( smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2))
| smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_54) ).
cnf(lemma_1_49,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_49) ).
cnf(assumption_5_41,axiom,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_5_41) ).
cnf(assumption_6_45,axiom,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1)
| external_ties(X1,X2) != external_ties(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_6_45) ).
cnf(lemma_1_51,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',lemma_1_51) ).
cnf(assumption_4_38,axiom,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| ~ organization(X1)
| ~ greater(capability(X1,X3),capability(X1,X2))
| ~ greater_or_equal(position(X1,X3),position(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_4_38) ).
cnf(definition_smaller_7,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',definition_smaller_7) ).
cnf(assumption_5_42,axiom,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_5_42) ).
cnf(definition_greater_or_equal_6,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',definition_greater_or_equal_6) ).
cnf(definition_smaller_or_equal_3,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',definition_smaller_or_equal_3) ).
cnf(definition_smaller_or_equal_1,axiom,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',definition_smaller_or_equal_1) ).
cnf(assumption_5_43,axiom,
( capability(X1,X2) = capability(X1,X3)
| ~ organization(X1)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',assumption_5_43) ).
cnf(meaning_postulate_greater_strict_9,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p',meaning_postulate_greater_strict_9) ).
cnf(c_0_22,negated_conjecture,
( greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2))
| greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) ),
lemma_1_57 ).
cnf(c_0_23,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
definition_greater_or_equal_5 ).
cnf(c_0_24,axiom,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| ~ organization(X1)
| ~ greater_or_equal(capability(X1,X3),capability(X1,X2))
| ~ greater(position(X1,X3),position(X1,X2)) ),
assumption_4_39 ).
cnf(c_0_25,axiom,
( greater(position(X1,X2),position(X1,X3))
| ~ organization(X1)
| ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
assumption_6_44 ).
cnf(c_0_26,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
definition_greater_or_equal_4 ).
cnf(c_0_27,negated_conjecture,
greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2)),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_1_64]) ).
cnf(c_0_29,plain,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| ~ organization(X1)
| ~ greater(external_ties(X1,X3),external_ties(X1,X2))
| ~ greater_or_equal(capability(X1,X3),capability(X1,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( external_ties(sk1,sk2) = external_ties(sk1,sk3)
| greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
organization(sk1),
lemma_1_46 ).
cnf(c_0_32,negated_conjecture,
~ has_immunity(sk1,sk2),
lemma_1_47 ).
cnf(c_0_33,negated_conjecture,
~ has_immunity(sk1,sk3),
lemma_1_48 ).
cnf(c_0_34,negated_conjecture,
~ smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
( external_ties(sk1,sk2) = external_ties(sk1,sk3)
| ~ greater_or_equal(capability(sk1,sk3),capability(sk1,sk2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_36,negated_conjecture,
smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_1_54]) ).
cnf(c_0_37,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) ),
lemma_1_49 ).
cnf(c_0_38,negated_conjecture,
( external_ties(sk1,sk2) = external_ties(sk1,sk3)
| ~ greater(capability(sk1,sk3),capability(sk1,sk2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_39,axiom,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3)) ),
assumption_5_41 ).
cnf(c_0_40,negated_conjecture,
smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)),
inference(csr,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_42,axiom,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1)
| external_ties(X1,X2) != external_ties(X1,X3) ),
assumption_6_45 ).
cnf(c_0_43,negated_conjecture,
( external_ties(sk1,sk2) = external_ties(sk1,sk3)
| ~ greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31]),c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
( stock_of_knowledge(sk1,sk2) = stock_of_knowledge(sk1,sk3)
| greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) ),
lemma_1_51 ).
cnf(c_0_46,axiom,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| ~ organization(X1)
| ~ greater(capability(X1,X3),capability(X1,X2))
| ~ greater_or_equal(position(X1,X3),position(X1,X2)) ),
assumption_4_38 ).
cnf(c_0_47,negated_conjecture,
( position(sk1,X1) = position(sk1,X2)
| external_ties(sk1,X1) != external_ties(sk1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_48,negated_conjecture,
( stock_of_knowledge(sk1,sk2) = stock_of_knowledge(sk1,sk3)
| external_ties(sk1,sk2) = external_ties(sk1,sk3) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ greater_or_equal(capability(sk1,sk3),capability(sk1,sk2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_45]),c_0_31])]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_50,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
definition_smaller_7 ).
cnf(c_0_51,axiom,
( smaller(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3)) ),
assumption_5_42 ).
cnf(c_0_52,plain,
( has_immunity(X1,X2)
| has_immunity(X1,X3)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| ~ organization(X1)
| ~ greater(stock_of_knowledge(X1,X3),stock_of_knowledge(X1,X2))
| ~ greater_or_equal(position(X1,X3),position(X1,X2))
| ~ smaller_or_equal(internal_friction(X1,X3),internal_friction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_53,negated_conjecture,
( stock_of_knowledge(sk1,sk2) = stock_of_knowledge(sk1,sk3)
| position(sk1,sk2) = position(sk1,X1)
| external_ties(sk1,sk3) != external_ties(sk1,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
definition_greater_or_equal_6 ).
cnf(c_0_55,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ greater(capability(sk1,sk3),capability(sk1,sk2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_23]) ).
cnf(c_0_56,plain,
( greater(capability(X1,X2),capability(X1,X3))
| ~ organization(X1)
| ~ greater(internal_friction(X1,X3),internal_friction(X1,X2))
| ~ smaller_or_equal(stock_of_knowledge(X1,X3),stock_of_knowledge(X1,X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( stock_of_knowledge(sk1,sk2) = stock_of_knowledge(sk1,sk3)
| ~ greater_or_equal(position(sk1,sk3),position(sk1,sk2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_31]),c_0_40])]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_58,negated_conjecture,
( position(sk1,sk2) = position(sk1,sk3)
| stock_of_knowledge(sk1,sk2) = stock_of_knowledge(sk1,sk3) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_60,axiom,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
definition_smaller_or_equal_3 ).
cnf(c_0_61,axiom,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
definition_smaller_or_equal_1 ).
cnf(c_0_62,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3))
| ~ smaller_or_equal(stock_of_knowledge(sk1,sk2),stock_of_knowledge(sk1,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_31])]) ).
cnf(c_0_63,negated_conjecture,
stock_of_knowledge(sk1,sk2) = stock_of_knowledge(sk1,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_64,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( internal_friction(sk1,sk2) = internal_friction(sk1,sk3)
| smaller(internal_friction(sk1,sk3),internal_friction(sk1,sk2)) ),
inference(spm,[status(thm)],[c_0_61,c_0_40]) ).
cnf(c_0_66,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk3))
| ~ greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_63]),c_0_64])]) ).
cnf(c_0_67,negated_conjecture,
( internal_friction(sk1,sk2) = internal_friction(sk1,sk3)
| greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3)) ),
inference(spm,[status(thm)],[c_0_50,c_0_65]) ).
cnf(c_0_68,axiom,
( capability(X1,X2) = capability(X1,X3)
| ~ organization(X1)
| stock_of_knowledge(X1,X2) != stock_of_knowledge(X1,X3)
| internal_friction(X1,X2) != internal_friction(X1,X3) ),
assumption_5_43 ).
cnf(c_0_69,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
meaning_postulate_greater_strict_9 ).
cnf(c_0_70,negated_conjecture,
( internal_friction(sk1,sk2) = internal_friction(sk1,sk3)
| greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk3)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( capability(sk1,X1) = capability(sk1,X2)
| stock_of_knowledge(sk1,X1) != stock_of_knowledge(sk1,X2)
| internal_friction(sk1,X1) != internal_friction(sk1,X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_31]) ).
cnf(c_0_72,negated_conjecture,
internal_friction(sk1,sk2) = internal_friction(sk1,sk3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( capability(sk1,sk2) = capability(sk1,X1)
| stock_of_knowledge(sk1,sk3) != stock_of_knowledge(sk1,X1)
| internal_friction(sk1,sk3) != internal_friction(sk1,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_63]),c_0_72]) ).
cnf(c_0_74,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2))
| ~ greater(external_ties(sk1,sk2),external_ties(sk1,sk3)) ),
inference(spm,[status(thm)],[c_0_69,c_0_45]) ).
cnf(c_0_75,negated_conjecture,
( external_ties(sk1,sk2) = external_ties(sk1,sk3)
| stock_of_knowledge(sk1,sk3) != stock_of_knowledge(sk1,X1)
| internal_friction(sk1,sk3) != internal_friction(sk1,X1)
| ~ greater_or_equal(capability(sk1,sk3),capability(sk1,X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk3))
| ~ greater(external_ties(sk1,sk2),external_ties(sk1,sk3)) ),
inference(rw,[status(thm)],[c_0_74,c_0_63]) ).
cnf(c_0_77,negated_conjecture,
external_ties(sk1,sk2) = external_ties(sk1,sk3),
inference(spm,[status(thm)],[c_0_75,c_0_59]) ).
cnf(c_0_78,negated_conjecture,
( greater(external_ties(sk1,sk3),external_ties(sk1,sk2))
| greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk3)) ),
inference(rw,[status(thm)],[c_0_45,c_0_63]) ).
cnf(c_0_79,negated_conjecture,
( greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk3))
| ~ greater(external_ties(sk1,sk3),external_ties(sk1,sk3)) ),
inference(rw,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk3)),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_77]),c_0_79]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_80]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MGT042-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 00:42:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.kJEDyc6jFj/E---3.1_20946.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21024 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21030 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 38
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 38
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 38
% 0.20/0.52 # Processed clauses : 256
% 0.20/0.52 # ...of these trivial : 6
% 0.20/0.52 # ...subsumed : 79
% 0.20/0.52 # ...remaining for further processing : 171
% 0.20/0.52 # Other redundant clauses eliminated : 2
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 7
% 0.20/0.52 # Backward-rewritten : 66
% 0.20/0.52 # Generated clauses : 580
% 0.20/0.52 # ...of the previous two non-redundant : 560
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 5
% 0.20/0.52 # Paramodulations : 566
% 0.20/0.52 # Factorizations : 8
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 6
% 0.20/0.52 # Total rewrite steps : 299
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 69
% 0.20/0.52 # Positive orientable unit clauses : 7
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 5
% 0.20/0.52 # Non-unit-clauses : 57
% 0.20/0.52 # Current number of unprocessed clauses: 347
% 0.20/0.52 # ...number of literals in the above : 2190
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 100
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 4214
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1717
% 0.20/0.52 # Non-unit clause-clause subsumptions : 72
% 0.20/0.52 # Unit Clause-clause subsumption calls : 10
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 6
% 0.20/0.52 # BW rewrite match successes : 5
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 13651
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.023 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.025 s
% 0.20/0.52 # Maximum resident set size: 1672 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.096 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.101 s
% 0.20/0.52 # Maximum resident set size: 1692 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------