%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT043-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:26:53 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 24 unt; 3 nHn; 42 RR)
% Number of literals : 86 ( 19 equ; 45 neg)
% Maximal clause size : 6 ( 1 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 : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_5_42,axiom,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_5_42) ).
cnf(definition_smaller_or_equal_3,axiom,
( X1 != X2
| smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(lemma_2_49,negated_conjecture,
stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_49) ).
cnf(lemma_2_46,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_46) ).
cnf(assumption_6_45,axiom,
( external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1)
| position(X1,X2) = position(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6_45) ).
cnf(definition_smaller_7,axiom,
( ~ smaller(X1,X2)
| greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_7) ).
cnf(lemma_2_50,negated_conjecture,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_50) ).
cnf(lemma_2_51,negated_conjecture,
external_ties(sk1,sk2) = external_ties(sk1,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_51) ).
cnf(definition_greater_or_equal_6,axiom,
( X1 != X2
| greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_greater_or_equal_6) ).
cnf(assumption_4_38,axiom,
( ~ greater_or_equal(position(X1,X3),position(X1,X2))
| ~ greater(capability(X1,X3),capability(X1,X2))
| ~ organization(X1)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3)
| has_immunity(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_4_38) ).
cnf(lemma_2_47,negated_conjecture,
~ has_immunity(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_47) ).
cnf(lemma_2_48,negated_conjecture,
~ has_immunity(sk1,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_48) ).
cnf(lemma_2_52,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2_52) ).
cnf(c_0_13,plain,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_5_42]) ).
cnf(c_0_14,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_15,plain,
( ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| ~ organization(X1)
| smaller(capability(X1,X2),capability(X1,X3)) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
stock_of_knowledge(sk1,sk3) = stock_of_knowledge(sk1,sk2),
lemma_2_49 ).
cnf(c_0_17,negated_conjecture,
organization(sk1),
lemma_2_46 ).
cnf(c_0_18,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
c_0_14 ).
cnf(c_0_19,plain,
( external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1)
| position(X1,X2) = position(X1,X3) ),
inference(fof_simplification,[status(thm)],[assumption_6_45]) ).
cnf(c_0_20,plain,
( ~ smaller(X1,X2)
| greater(X2,X1) ),
inference(fof_simplification,[status(thm)],[definition_smaller_7]) ).
cnf(c_0_21,negated_conjecture,
( ~ smaller_or_equal(stock_of_knowledge(sk1,X1),stock_of_knowledge(sk1,sk3))
| ~ greater(internal_friction(sk1,X1),internal_friction(sk1,sk2))
| smaller(capability(sk1,X1),capability(sk1,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)),
lemma_2_50 ).
cnf(c_0_24,plain,
( external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1)
| position(X1,X2) = position(X1,X3) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
external_ties(sk1,sk2) = external_ties(sk1,sk3),
lemma_2_51 ).
cnf(c_0_26,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_greater_or_equal_6]) ).
cnf(c_0_27,plain,
( ~ greater_or_equal(position(X1,X3),position(X1,X2))
| ~ greater(capability(X1,X3),capability(X1,X2))
| ~ organization(X1)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3)
| has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_4_38]) ).
cnf(c_0_28,plain,
( ~ smaller(X1,X2)
| greater(X2,X1) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
smaller(capability(sk1,sk3),capability(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
( external_ties(sk1,X1) != external_ties(sk1,sk3)
| position(sk1,X1) = position(sk1,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]) ).
cnf(c_0_31,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
~ has_immunity(sk1,sk2),
inference(fof_simplification,[status(thm)],[lemma_2_47]) ).
cnf(c_0_33,negated_conjecture,
~ has_immunity(sk1,sk3),
inference(fof_simplification,[status(thm)],[lemma_2_48]) ).
cnf(c_0_34,plain,
( ~ greater_or_equal(position(X1,X3),position(X1,X2))
| ~ greater(capability(X1,X3),capability(X1,X2))
| ~ organization(X1)
| smaller(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3)
| has_immunity(X1,X2) ),
c_0_27 ).
cnf(c_0_35,negated_conjecture,
greater(capability(sk1,sk2),capability(sk1,sk3)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
position(sk1,sk2) = position(sk1,sk3),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
~ has_immunity(sk1,sk2),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
~ has_immunity(sk1,sk3),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_2_52]) ).
cnf(c_0_41,negated_conjecture,
smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]),c_0_36]),c_0_37])]),c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT043-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:21:20 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/benchmark/theBenchmark.p
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4058593 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFMS22-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4058599 completed with status 0
% 0.15/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFMS22-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44 % Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 26
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 26
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 26
% 0.15/0.44 % Processed clauses : 88
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 11
% 0.15/0.44 % ...remaining for further processing : 77
% 0.15/0.44 % Other redundant clauses eliminated : 2
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 1
% 0.15/0.44 % Generated clauses : 82
% 0.15/0.44 % ...of the previous two non-redundant : 69
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 74
% 0.15/0.44 % Factorizations : 2
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 6
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 25
% 0.15/0.44 % ...of those cached : 20
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 48
% 0.15/0.44 % Positive orientable unit clauses : 10
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 5
% 0.15/0.44 % Non-unit-clauses : 33
% 0.15/0.44 % Current number of unprocessed clauses: 33
% 0.15/0.44 % ...number of literals in the above : 137
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 27
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 744
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 462
% 0.15/0.44 % Non-unit clause-clause subsumptions : 9
% 0.15/0.44 % Unit Clause-clause subsumption calls : 11
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 1
% 0.15/0.44 % BW rewrite match successes : 1
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 2543
% 0.15/0.44 % Search garbage collected termcells : 76
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.010 s
% 0.15/0.44 % System time : 0.001 s
% 0.15/0.44 % Total time : 0.011 s
% 0.15/0.44 % Maximum resident set size: 3652 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.039 s
% 0.15/0.44 % System time : 0.012 s
% 0.15/0.44 % Total time : 0.051 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------