%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT060-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 : n004.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:05 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 23 unt; 18 nHn; 44 RR)
% Number of literals : 133 ( 34 equ; 51 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_17_32,axiom,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = very_low ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_17_32) ).
cnf(assumption_17_33,axiom,
( ~ positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = low
| has_immunity(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_17_33) ).
cnf(assumption_17_35,axiom,
( ~ is_aligned(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| has_immunity(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_17_35) ).
cnf(assumption_17_34,axiom,
( ~ positional_advantage(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| has_immunity(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_17_34) ).
cnf(assumption_17_36,axiom,
( ~ organization(X1)
| hazard_of_mortality(X1,X2) = high
| positional_advantage(X1,X2)
| is_aligned(X1,X2)
| has_immunity(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_17_36) ).
cnf(assumption_3_45,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_3_45) ).
cnf(assumption_3_42,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_3_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(assumption_3_43,negated_conjecture,
has_immunity(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_3_43) ).
cnf(assumption_18c_39,axiom,
greater(low,very_low),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18c_39) ).
cnf(assumption_18e_41,axiom,
greater(mod2,low),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18e_41) ).
cnf(assumption_18d_40,axiom,
greater(high,mod2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18d_40) ).
cnf(assumption_3_44,negated_conjecture,
~ has_immunity(sk1,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_3_44) ).
cnf(assumption_18b_38,axiom,
greater(mod1,low),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_18b_38) ).
cnf(c_0_14,plain,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = very_low ),
inference(fof_simplification,[status(thm)],[assumption_17_32]) ).
cnf(c_0_15,plain,
( ~ positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = low
| has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_17_33]) ).
cnf(c_0_16,plain,
( ~ is_aligned(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_17_35]) ).
cnf(c_0_17,plain,
( ~ positional_advantage(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_17_34]) ).
cnf(c_0_18,plain,
( ~ organization(X1)
| hazard_of_mortality(X1,X2) = high
| positional_advantage(X1,X2)
| is_aligned(X1,X2)
| has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_17_36]) ).
cnf(c_0_19,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
inference(fof_simplification,[status(thm)],[assumption_3_45]) ).
cnf(c_0_20,plain,
( ~ has_immunity(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = very_low ),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
organization(sk1),
assumption_3_42 ).
cnf(c_0_22,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(fof_simplification,[status(thm)],[meaning_postulate_greater_transitive_10]) ).
cnf(c_0_23,plain,
( ~ positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = low
| has_immunity(X1,X2) ),
c_0_15 ).
cnf(c_0_24,plain,
( ~ is_aligned(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| has_immunity(X1,X2) ),
c_0_16 ).
cnf(c_0_25,plain,
( ~ positional_advantage(X1,X2)
| ~ organization(X1)
| hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| has_immunity(X1,X2) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ organization(X1)
| hazard_of_mortality(X1,X2) = high
| positional_advantage(X1,X2)
| is_aligned(X1,X2)
| has_immunity(X1,X2) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)),
c_0_19 ).
cnf(c_0_28,negated_conjecture,
( ~ has_immunity(sk1,X1)
| hazard_of_mortality(sk1,X1) = very_low ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
has_immunity(sk1,sk2),
assumption_3_43 ).
cnf(c_0_30,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_22 ).
cnf(c_0_31,axiom,
greater(low,very_low),
assumption_18c_39 ).
cnf(c_0_32,plain,
( ~ organization(X1)
| ~ is_aligned(X1,X2)
| has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = low
| hazard_of_mortality(X1,X2) = mod2 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( ~ organization(X1)
| has_immunity(X1,X2)
| is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| hazard_of_mortality(X1,X2) = high ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,axiom,
greater(mod2,low),
assumption_18e_41 ).
cnf(c_0_35,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),very_low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_36,plain,
( ~ greater(X1,low)
| greater(X1,very_low) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ organization(X1)
| has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = mod2
| hazard_of_mortality(X1,X2) = low
| hazard_of_mortality(X1,X2) = high
| hazard_of_mortality(X1,X2) = mod1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( ~ greater(X1,mod2)
| greater(X1,low) ),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_39,axiom,
greater(high,mod2),
assumption_18d_40 ).
cnf(c_0_40,negated_conjecture,
~ has_immunity(sk1,sk3),
inference(fof_simplification,[status(thm)],[assumption_3_44]) ).
cnf(c_0_41,negated_conjecture,
~ greater(hazard_of_mortality(sk1,sk3),low),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( has_immunity(sk1,X1)
| hazard_of_mortality(sk1,X1) = mod1
| hazard_of_mortality(sk1,X1) = high
| hazard_of_mortality(sk1,X1) = low
| hazard_of_mortality(sk1,X1) = mod2 ),
inference(spm,[status(thm)],[c_0_37,c_0_21]) ).
cnf(c_0_43,plain,
greater(high,low),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ has_immunity(sk1,sk3),
c_0_40 ).
cnf(c_0_45,negated_conjecture,
( hazard_of_mortality(sk1,sk3) = mod2
| hazard_of_mortality(sk1,sk3) = low
| hazard_of_mortality(sk1,sk3) = mod1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( hazard_of_mortality(sk1,sk3) = mod1
| hazard_of_mortality(sk1,sk3) = low ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_45]),c_0_34])]) ).
cnf(c_0_47,axiom,
greater(mod1,low),
assumption_18b_38 ).
cnf(c_0_48,negated_conjecture,
hazard_of_mortality(sk1,sk3) = low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_46]),c_0_47])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_48]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT060-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.12/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 01:24:19 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.19/0.52 % Version: 3.5.1
% 0.19/0.52 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 % Starting sh5l with 300s (1) cores
% 0.19/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1960612 completed with status 0
% 0.19/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.52 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.19/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.52 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1960619 completed with status 0
% 0.19/0.52 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.19/0.52 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FGHSF-FFSM22-SFFFFFNN
% 0.19/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.52 % Preprocessing time : 0.001 s
% 0.19/0.52 % Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 % Proof found!
% 0.19/0.52 % SZS status Unsatisfiable
% 0.19/0.52 % SZS output start CNFRefutation
% See solution above
% 0.19/0.52 % Parsed axioms : 25
% 0.19/0.52 % Removed by relevancy pruning/SinE : 0
% 0.19/0.52 % Initial clauses : 25
% 0.19/0.52 % Removed in clause preprocessing : 0
% 0.19/0.52 % Initial clauses in saturation : 25
% 0.19/0.52 % Processed clauses : 1142
% 0.19/0.52 % ...of these trivial : 0
% 0.19/0.52 % ...subsumed : 867
% 0.19/0.52 % ...remaining for further processing : 275
% 0.19/0.52 % Other redundant clauses eliminated : 2
% 0.19/0.52 % Clauses deleted for lack of memory : 0
% 0.19/0.52 % Backward-subsumed : 14
% 0.19/0.52 % Backward-rewritten : 72
% 0.19/0.52 % Generated clauses : 5701
% 0.19/0.52 % ...of the previous two non-redundant : 4460
% 0.19/0.52 % ...aggressively subsumed : 0
% 0.19/0.52 % Contextual simplify-reflections : 0
% 0.19/0.52 % Paramodulations : 5645
% 0.19/0.52 % Factorizations : 54
% 0.19/0.52 % NegExts : 0
% 0.19/0.52 % Equation resolutions : 2
% 0.19/0.52 % Disequality decompositions : 0
% 0.19/0.52 % Total rewrite steps : 1474
% 0.19/0.52 % ...of those cached : 1466
% 0.19/0.52 % Propositional unsat checks : 0
% 0.19/0.52 % Propositional check models : 0
% 0.19/0.52 % Propositional check unsatisfiable : 0
% 0.19/0.52 % Propositional clauses : 0
% 0.19/0.52 % Propositional clauses after purity: 0
% 0.19/0.52 % Propositional unsat core size : 0
% 0.19/0.52 % Propositional preprocessing time : 0.000
% 0.19/0.52 % Propositional encoding time : 0.000
% 0.19/0.52 % Propositional solver time : 0.000
% 0.19/0.52 % Success case prop preproc time : 0.000
% 0.19/0.52 % Success case prop encoding time : 0.000
% 0.19/0.52 % Success case prop solver time : 0.000
% 0.19/0.52 % Current number of processed clauses : 162
% 0.19/0.52 % Positive orientable unit clauses : 11
% 0.19/0.52 % Positive unorientable unit clauses: 0
% 0.19/0.52 % Negative unit clauses : 10
% 0.19/0.52 % Non-unit-clauses : 141
% 0.19/0.52 % Current number of unprocessed clauses: 3289
% 0.19/0.52 % ...number of literals in the above : 18178
% 0.19/0.52 % Current number of archived formulas : 0
% 0.19/0.52 % Current number of archived clauses : 111
% 0.19/0.52 % Clause-clause subsumption calls (NU) : 10919
% 0.19/0.52 % Rec. Clause-clause subsumption calls : 5374
% 0.19/0.52 % Non-unit clause-clause subsumptions : 334
% 0.19/0.52 % Unit Clause-clause subsumption calls : 152
% 0.19/0.52 % Rewrite failures with RHS unbound : 0
% 0.19/0.52 % BW rewrite match attempts : 1
% 0.19/0.52 % BW rewrite match successes : 1
% 0.19/0.52 % Condensation attempts : 0
% 0.19/0.52 % Condensation successes : 0
% 0.19/0.52 % Termbank termtop insertions : 74801
% 0.19/0.52 % Search garbage collected termcells : 38
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.068 s
% 0.19/0.52 % System time : 0.003 s
% 0.19/0.52 % Total time : 0.071 s
% 0.19/0.52 % Maximum resident set size: 3648 pages
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.303 s
% 0.19/0.52 % System time : 0.021 s
% 0.19/0.52 % Total time : 0.325 s
% 0.19/0.52 % Maximum resident set size: 4608 pages
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------