%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT058-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 : n002.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.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 52 ( 14 unt; 9 nHn; 48 RR)
% Number of literals : 102 ( 25 equ; 47 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_4_36,axiom,
( ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ robust_position(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_4_36) ).
cnf(definition_3_30,axiom,
( ~ smaller_or_equal(age(X1,X2),sigma)
| ~ fragile_position(X1)
| positional_advantage(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_3_30) ).
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_10_43,negated_conjecture,
age(sk3,sk4) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_43) ).
cnf(lemma_10_47,negated_conjecture,
robust_position(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_47) ).
cnf(lemma_10_46,negated_conjecture,
fragile_position(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_46) ).
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(meaning_postulate_greater_strict_9,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_strict_9) ).
cnf(lemma_10_45,negated_conjecture,
greater_or_equal(tau,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_45) ).
cnf(meaning_postulate_greater_comparable_11,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_comparable_11) ).
cnf(definition_smaller_8,axiom,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_8) ).
cnf(lemma_10_44,negated_conjecture,
greater_or_equal(sigma,zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_10_44) ).
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(c_0_13,plain,
( ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ robust_position(X1) ),
inference(fof_simplification,[status(thm)],[definition_4_36]) ).
cnf(c_0_14,plain,
( ~ smaller_or_equal(age(X1,X2),sigma)
| ~ fragile_position(X1)
| positional_advantage(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_3_30]) ).
cnf(c_0_15,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_greater_or_equal_4]) ).
cnf(c_0_16,plain,
( ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ robust_position(X1) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
age(sk3,sk4) = zero,
lemma_10_43 ).
cnf(c_0_18,negated_conjecture,
robust_position(sk3),
lemma_10_47 ).
cnf(c_0_19,plain,
( ~ smaller_or_equal(age(X1,X2),sigma)
| ~ fragile_position(X1)
| positional_advantage(X1,X2) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
fragile_position(sk3),
lemma_10_46 ).
cnf(c_0_21,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_2]) ).
cnf(c_0_22,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[meaning_postulate_greater_strict_9]) ).
cnf(c_0_23,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
greater_or_equal(tau,zero),
lemma_10_45 ).
cnf(c_0_25,negated_conjecture,
( ~ smaller_or_equal(zero,tau)
| ~ positional_advantage(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
( ~ smaller_or_equal(zero,sigma)
| positional_advantage(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20])]) ).
cnf(c_0_27,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
c_0_21 ).
cnf(c_0_28,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
meaning_postulate_greater_comparable_11 ).
cnf(c_0_29,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
c_0_22 ).
cnf(c_0_30,negated_conjecture,
( greater(tau,zero)
| zero = tau ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
inference(fof_simplification,[status(thm)],[definition_smaller_8]) ).
cnf(c_0_32,negated_conjecture,
( ~ smaller_or_equal(zero,sigma)
| ~ smaller_or_equal(zero,tau) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( smaller_or_equal(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ greater(zero,tau)
| zero = tau ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( ~ smaller_or_equal(zero,sigma)
| zero = tau ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
( ~ greater(X2,X1)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
greater_or_equal(sigma,zero),
lemma_10_44 ).
cnf(c_0_39,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_40,negated_conjecture,
( ~ greater(sigma,zero)
| zero = tau ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( greater(sigma,zero)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_42,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
( zero = tau
| zero = sigma ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( ~ smaller_or_equal(tau,sigma)
| zero = sigma ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_43]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
( ~ greater(sigma,tau)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( tau != sigma
| zero = sigma ),
inference(ef,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_46]),c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( ~ smaller_or_equal(sigma,tau)
| tau != sigma ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_44])]) ).
cnf(c_0_50,negated_conjecture,
tau = sigma,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_48]),c_0_48]),c_0_44])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_50]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT058-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 : n002.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:27:01 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2155913 completed with status 0
% 0.12/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.12/0.45 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.12/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2155923 completed with status 0
% 0.12/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45 % Presaturation interreduction done
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Unsatisfiable
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 29
% 0.12/0.45 % Removed by relevancy pruning/SinE : 0
% 0.12/0.45 % Initial clauses : 29
% 0.12/0.45 % Removed in clause preprocessing : 2
% 0.12/0.45 % Initial clauses in saturation : 27
% 0.12/0.45 % Processed clauses : 104
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 14
% 0.12/0.45 % ...remaining for further processing : 90
% 0.12/0.45 % Other redundant clauses eliminated : 2
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 1
% 0.12/0.45 % Backward-rewritten : 36
% 0.12/0.45 % Generated clauses : 98
% 0.12/0.45 % ...of the previous two non-redundant : 95
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 4
% 0.12/0.45 % Paramodulations : 93
% 0.12/0.45 % Factorizations : 3
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 2
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 61
% 0.12/0.45 % ...of those cached : 53
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 24
% 0.12/0.45 % Positive orientable unit clauses : 7
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 0
% 0.12/0.45 % Non-unit-clauses : 17
% 0.12/0.45 % Current number of unprocessed clauses: 44
% 0.12/0.45 % ...number of literals in the above : 121
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 64
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 532
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 465
% 0.12/0.45 % Non-unit clause-clause subsumptions : 18
% 0.12/0.45 % Unit Clause-clause subsumption calls : 6
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 5
% 0.12/0.45 % BW rewrite match successes : 2
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 1843
% 0.12/0.45 % Search garbage collected termcells : 44
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.004 s
% 0.12/0.45 % System time : 0.004 s
% 0.12/0.45 % Total time : 0.008 s
% 0.12/0.45 % Maximum resident set size: 3648 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.020 s
% 0.12/0.45 % System time : 0.013 s
% 0.12/0.45 % Total time : 0.033 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------