%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT056-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 : n026.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:28:04 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 55 ( 20 unt; 8 nHn; 52 RR)
% Number of literals : 114 ( 17 equ; 60 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_1_32,axiom,
( ~ smaller_or_equal(age(X1,X2),eta)
| ~ has_endowment(X1)
| has_immunity(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_1_32) ).
cnf(definition_smaller_or_equal_2,axiom,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_2) ).
cnf(definition_smaller_8,axiom,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_8) ).
cnf(definition_1_33,axiom,
( ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta)
| ~ has_endowment(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_1_33) ).
cnf(assumption_2_38,axiom,
( ~ has_immunity(X1,X3)
| ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_2_38) ).
cnf(lemma_9_43,negated_conjecture,
smaller_or_equal(age(sk2,sk4),eta),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_43) ).
cnf(lemma_9_41,negated_conjecture,
has_endowment(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_41) ).
cnf(lemma_9_42,negated_conjecture,
age(sk2,sk3) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_42) ).
cnf(meaning_postulate_greater_transitive_10,axiom,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_transitive_10) ).
cnf(definition_greater_or_equal_4,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_greater_or_equal_4) ).
cnf(lemma_9_47,negated_conjecture,
( hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3)
| ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_47) ).
cnf(assumption_3_39,axiom,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| greater(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_3_39) ).
cnf(lemma_9_44,negated_conjecture,
greater(age(sk2,sk5),eta),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_44) ).
cnf(lemma_9_40,negated_conjecture,
organization(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_40) ).
cnf(lemma_9_46,negated_conjecture,
greater(sigma,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_46) ).
cnf(lemma_9_45,negated_conjecture,
greater_or_equal(eta,sigma),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_9_45) ).
cnf(c_0_16,plain,
( ~ smaller_or_equal(age(X1,X2),eta)
| ~ has_endowment(X1)
| has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_1_32]) ).
cnf(c_0_17,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_2]) ).
cnf(c_0_18,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
inference(fof_simplification,[status(thm)],[definition_smaller_8]) ).
cnf(c_0_19,plain,
( ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta)
| ~ has_endowment(X1) ),
inference(fof_simplification,[status(thm)],[definition_1_33]) ).
cnf(c_0_20,plain,
( ~ has_immunity(X1,X3)
| ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3) ),
inference(fof_simplification,[status(thm)],[assumption_2_38]) ).
cnf(c_0_21,plain,
( ~ smaller_or_equal(age(X1,X2),eta)
| ~ has_endowment(X1)
| has_immunity(X1,X2) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
smaller_or_equal(age(sk2,sk4),eta),
lemma_9_43 ).
cnf(c_0_23,negated_conjecture,
has_endowment(sk2),
lemma_9_41 ).
cnf(c_0_24,negated_conjecture,
age(sk2,sk3) = zero,
lemma_9_42 ).
cnf(c_0_25,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
c_0_18 ).
cnf(c_0_27,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(fof_simplification,[status(thm)],[meaning_postulate_greater_transitive_10]) ).
cnf(c_0_28,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_greater_or_equal_4]) ).
cnf(c_0_29,negated_conjecture,
( hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3)
| ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) ),
inference(fof_simplification,[status(thm)],[lemma_9_47]) ).
cnf(c_0_30,plain,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| greater(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3) ),
inference(fof_simplification,[status(thm)],[assumption_3_39]) ).
cnf(c_0_31,plain,
( ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta)
| ~ has_endowment(X1) ),
c_0_19 ).
cnf(c_0_32,negated_conjecture,
greater(age(sk2,sk5),eta),
lemma_9_44 ).
cnf(c_0_33,plain,
( ~ has_immunity(X1,X3)
| ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3) ),
c_0_20 ).
cnf(c_0_34,negated_conjecture,
has_immunity(sk2,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
organization(sk2),
lemma_9_40 ).
cnf(c_0_36,negated_conjecture,
( ~ smaller_or_equal(zero,eta)
| has_immunity(sk2,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_23])]) ).
cnf(c_0_37,plain,
( ~ greater(X2,X1)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_27 ).
cnf(c_0_39,negated_conjecture,
greater(sigma,zero),
lemma_9_46 ).
cnf(c_0_40,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_28 ).
cnf(c_0_41,negated_conjecture,
greater_or_equal(eta,sigma),
lemma_9_45 ).
cnf(c_0_42,negated_conjecture,
( hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3)
| ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) ),
c_0_29 ).
cnf(c_0_43,plain,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| greater(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3) ),
c_0_30 ).
cnf(c_0_44,negated_conjecture,
~ has_immunity(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23])]) ).
cnf(c_0_45,negated_conjecture,
( ~ has_immunity(sk2,X1)
| hazard_of_mortality(sk2,X1) = hazard_of_mortality(sk2,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
( ~ greater(eta,zero)
| has_immunity(sk2,sk3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( ~ greater(X1,sigma)
| greater(X1,zero) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( greater(eta,sigma)
| sigma = eta ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
hazard_of_mortality(sk2,sk3) != hazard_of_mortality(sk2,sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_34]),c_0_35])]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( ~ greater(eta,zero)
| hazard_of_mortality(sk2,sk3) = hazard_of_mortality(sk2,sk4) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( greater(eta,zero)
| sigma = eta ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
~ greater(eta,zero),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
sigma = eta,
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_53]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT056-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n026.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 01:26:58 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.45 % Version: 3.5.1
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.45 % Starting sh5l with 300s (1) cores
% 0.16/5.45 % new_bool_3 with pid 1069137 completed with status 0
% 0.16/5.45 % Result found by new_bool_3
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % SubtermCWHack with pid 1069145 completed with status 0
% 0.16/5.45 % Result found by SubtermCWHack
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % Preprocessing time : 0.001 s
% 0.16/5.45
% 0.16/5.45 % Proof found!
% 0.16/5.45 % SZS status Unsatisfiable
% 0.16/5.45 % SZS output start CNFRefutation
% See solution above
% 0.16/5.45 % Parsed axioms : 28
% 0.16/5.45 % Removed by relevancy pruning/SinE : 4
% 0.16/5.45 % Initial clauses : 24
% 0.16/5.45 % Removed in clause preprocessing : 0
% 0.16/5.45 % Initial clauses in saturation : 24
% 0.16/5.45 % Processed clauses : 80
% 0.16/5.45 % ...of these trivial : 0
% 0.16/5.45 % ...subsumed : 21
% 0.16/5.45 % ...remaining for further processing : 59
% 0.16/5.45 % Other redundant clauses eliminated : 2
% 0.16/5.45 % Clauses deleted for lack of memory : 0
% 0.16/5.45 % Backward-subsumed : 3
% 0.16/5.45 % Backward-rewritten : 14
% 0.16/5.45 % Generated clauses : 99
% 0.16/5.45 % ...of the previous two non-redundant : 94
% 0.16/5.45 % ...aggressively subsumed : 0
% 0.16/5.46 % Contextual simplify-reflections : 0
% 0.16/5.46 % Paramodulations : 94
% 0.16/5.46 % Factorizations : 2
% 0.16/5.46 % NegExts : 0
% 0.16/5.46 % Equation resolutions : 2
% 0.16/5.46 % Disequality decompositions : 0
% 0.16/5.46 % Total rewrite steps : 34
% 0.16/5.46 % ...of those cached : 30
% 0.16/5.46 % Propositional unsat checks : 0
% 0.16/5.46 % Propositional check models : 0
% 0.16/5.46 % Propositional check unsatisfiable : 0
% 0.16/5.46 % Propositional clauses : 0
% 0.16/5.46 % Propositional clauses after purity: 0
% 0.16/5.46 % Propositional unsat core size : 0
% 0.16/5.46 % Propositional preprocessing time : 0.000
% 0.16/5.46 % Propositional encoding time : 0.000
% 0.16/5.46 % Propositional solver time : 0.000
% 0.16/5.46 % Success case prop preproc time : 0.000
% 0.16/5.46 % Success case prop encoding time : 0.000
% 0.16/5.46 % Success case prop solver time : 0.000
% 0.16/5.46 % Current number of processed clauses : 39
% 0.16/5.46 % Positive orientable unit clauses : 9
% 0.16/5.46 % Positive unorientable unit clauses: 0
% 0.16/5.46 % Negative unit clauses : 4
% 0.16/5.46 % Non-unit-clauses : 26
% 0.16/5.46 % Current number of unprocessed clauses: 33
% 0.16/5.46 % ...number of literals in the above : 119
% 0.16/5.46 % Current number of archived formulas : 0
% 0.16/5.46 % Current number of archived clauses : 18
% 0.16/5.46 % Clause-clause subsumption calls (NU) : 324
% 0.16/5.46 % Rec. Clause-clause subsumption calls : 297
% 0.16/5.46 % Non-unit clause-clause subsumptions : 21
% 0.16/5.46 % Unit Clause-clause subsumption calls : 31
% 0.16/5.46 % Rewrite failures with RHS unbound : 0
% 0.16/5.46 % BW rewrite match attempts : 3
% 0.16/5.46 % BW rewrite match successes : 1
% 0.16/5.46 % Condensation attempts : 0
% 0.16/5.46 % Condensation successes : 0
% 0.16/5.46 % Termbank termtop insertions : 1616
% 0.16/5.46 % Search garbage collected termcells : 64
% 0.16/5.46
% 0.16/5.46 % -------------------------------------------------
% 0.16/5.46 % User time : 0.008 s
% 0.16/5.46 % System time : 0.001 s
% 0.16/5.46 % Total time : 0.009 s
% 0.16/5.46 % Maximum resident set size: 3652 pages
% 0.16/5.46
% 0.16/5.46 % -------------------------------------------------
% 0.16/5.46 % User time : 0.008 s
% 0.16/5.46 % System time : 0.007 s
% 0.16/5.46 % Total time : 0.015 s
% 0.16/5.46 % Maximum resident set size: 4608 pages
% 0.16/5.46 % E exiting
%------------------------------------------------------------------------------