%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT057-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:57 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 42 ( 18 unt; 3 nHn; 39 RR)
% Number of literals : 84 ( 10 equ; 47 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 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/sandbox2/benchmark/theBenchmark.p',definition_1_32) ).
cnf(definition_smaller_or_equal_2,axiom,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_2) ).
cnf(definition_smaller_8,axiom,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_8) ).
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/sandbox2/benchmark/theBenchmark.p',assumption_2_38) ).
cnf(theorem_6_43,negated_conjecture,
smaller_or_equal(age(sk2,sk4),eta),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6_43) ).
cnf(theorem_6_41,negated_conjecture,
has_endowment(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6_41) ).
cnf(theorem_6_42,negated_conjecture,
age(sk2,sk3) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6_42) ).
cnf(theorem_6_40,negated_conjecture,
organization(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6_40) ).
cnf(theorem_6_45,negated_conjecture,
greater(eta,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6_45) ).
cnf(theorem_6_46,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/sandbox2/benchmark/theBenchmark.p',theorem_6_46) ).
cnf(definition_1_33,axiom,
( ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta)
| ~ has_endowment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_1_33) ).
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/sandbox2/benchmark/theBenchmark.p',assumption_3_39) ).
cnf(theorem_6_44,negated_conjecture,
greater(age(sk2,sk5),eta),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_6_44) ).
cnf(c_0_13,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_14,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_2]) ).
cnf(c_0_15,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
inference(fof_simplification,[status(thm)],[definition_smaller_8]) ).
cnf(c_0_16,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_17,plain,
( ~ smaller_or_equal(age(X1,X2),eta)
| ~ has_endowment(X1)
| has_immunity(X1,X2) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
smaller_or_equal(age(sk2,sk4),eta),
theorem_6_43 ).
cnf(c_0_19,negated_conjecture,
has_endowment(sk2),
theorem_6_41 ).
cnf(c_0_20,negated_conjecture,
age(sk2,sk3) = zero,
theorem_6_42 ).
cnf(c_0_21,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
c_0_14 ).
cnf(c_0_22,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
c_0_15 ).
cnf(c_0_23,plain,
( ~ has_immunity(X1,X3)
| ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
has_immunity(sk2,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
organization(sk2),
theorem_6_40 ).
cnf(c_0_26,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_17,c_0_20]),c_0_19])]) ).
cnf(c_0_27,plain,
( ~ greater(X2,X1)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
greater(eta,zero),
theorem_6_45 ).
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)],[theorem_6_46]) ).
cnf(c_0_30,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_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
has_immunity(sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta)
| ~ has_endowment(X1) ),
inference(fof_simplification,[status(thm)],[definition_1_33]) ).
cnf(c_0_33,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_34,negated_conjecture,
hazard_of_mortality(sk2,sk3) = hazard_of_mortality(sk2,sk4),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_36,plain,
( ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta)
| ~ has_endowment(X1) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
greater(age(sk2,sk5),eta),
theorem_6_44 ).
cnf(c_0_38,negated_conjecture,
~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,plain,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| greater(hazard_of_mortality(X1,X3),hazard_of_mortality(X1,X2))
| has_immunity(X1,X3) ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
~ has_immunity(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_19])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]),c_0_25])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT057-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 01:29:29 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % new_bool_3 with pid 1911880 completed with status 0
% 0.09/0.43 % Result found by new_bool_3
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 1911883 completed with status 0
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Unsatisfiable
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 27
% 0.09/0.43 % Removed by relevancy pruning/SinE : 7
% 0.09/0.43 % Initial clauses : 20
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 20
% 0.09/0.43 % Processed clauses : 55
% 0.09/0.43 % ...of these trivial : 0
% 0.09/0.43 % ...subsumed : 9
% 0.09/0.43 % ...remaining for further processing : 46
% 0.09/0.43 % Other redundant clauses eliminated : 1
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 0
% 0.09/0.43 % Backward-rewritten : 1
% 0.09/0.43 % Generated clauses : 85
% 0.09/0.43 % ...of the previous two non-redundant : 67
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 0
% 0.09/0.43 % Paramodulations : 82
% 0.09/0.43 % Factorizations : 2
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 1
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 29
% 0.09/0.43 % ...of those cached : 23
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 44
% 0.09/0.43 % Positive orientable unit clauses : 10
% 0.09/0.43 % Positive unorientable unit clauses: 0
% 0.09/0.43 % Negative unit clauses : 4
% 0.09/0.43 % Non-unit-clauses : 30
% 0.09/0.43 % Current number of unprocessed clauses: 29
% 0.09/0.43 % ...number of literals in the above : 112
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 1
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 128
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 114
% 0.09/0.43 % Non-unit clause-clause subsumptions : 7
% 0.09/0.43 % Unit Clause-clause subsumption calls : 3
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 2
% 0.09/0.43 % BW rewrite match successes : 1
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 1482
% 0.09/0.43 % Search garbage collected termcells : 67
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.007 s
% 0.09/0.43 % System time : 0.000 s
% 0.09/0.43 % Total time : 0.007 s
% 0.09/0.43 % Maximum resident set size: 3652 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.009 s
% 0.09/0.43 % System time : 0.005 s
% 0.09/0.43 % Total time : 0.014 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------