%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT058-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 : n012.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.07s 0.33s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 54 ( 14 unt; 9 nHn; 50 RR)
% Number of literals : 106 ( 25 equ; 51 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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',definition_3_30) ).
cnf(lemma_10_43,negated_conjecture,
age(sk3,sk4) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10_43) ).
cnf(lemma_10_47,negated_conjecture,
robust_position(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10_47) ).
cnf(lemma_10_46,negated_conjecture,
fragile_position(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10_46) ).
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(definition_greater_or_equal_4,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_greater_or_equal_4) ).
cnf(lemma_10_45,negated_conjecture,
greater_or_equal(tau,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10_45) ).
cnf(lemma_10_44,negated_conjecture,
greater_or_equal(sigma,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_10_44) ).
cnf(definition_smaller_or_equal_3,axiom,
( X1 != X2
| smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_3) ).
cnf(meaning_postulate_greater_strict_9,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_strict_9) ).
cnf(meaning_postulate_greater_comparable_11,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_comparable_11) ).
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,
( ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ robust_position(X1) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
age(sk3,sk4) = zero,
lemma_10_43 ).
cnf(c_0_17,negated_conjecture,
robust_position(sk3),
lemma_10_47 ).
cnf(c_0_18,plain,
( ~ smaller_or_equal(age(X1,X2),sigma)
| ~ fragile_position(X1)
| positional_advantage(X1,X2) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
fragile_position(sk3),
lemma_10_46 ).
cnf(c_0_20,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_2]) ).
cnf(c_0_21,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
inference(fof_simplification,[status(thm)],[definition_smaller_8]) ).
cnf(c_0_22,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_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,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_18,c_0_16]),c_0_19])]) ).
cnf(c_0_24,plain,
( ~ smaller(X1,X2)
| smaller_or_equal(X1,X2) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ greater(X1,X2)
| smaller(X2,X1) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
( ~ smaller_or_equal(zero,sigma)
| ~ smaller_or_equal(zero,tau) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ greater(X2,X1)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
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,
( ~ smaller_or_equal(zero,sigma)
| ~ greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_28 ).
cnf(c_0_31,negated_conjecture,
greater_or_equal(tau,zero),
lemma_10_45 ).
cnf(c_0_32,negated_conjecture,
( ~ greater(sigma,zero)
| ~ greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( greater(tau,zero)
| zero = tau ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
greater_or_equal(sigma,zero),
lemma_10_44 ).
cnf(c_0_35,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_3]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(sigma,zero)
| zero = tau ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( greater(sigma,zero)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_38,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
c_0_35 ).
cnf(c_0_39,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[meaning_postulate_greater_strict_9]) ).
cnf(c_0_40,negated_conjecture,
( zero = tau
| zero = sigma ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,axiom,
( greater(X1,X2)
| X1 = X2
| smaller(X1,X2) ),
meaning_postulate_greater_comparable_11 ).
cnf(c_0_43,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( ~ smaller_or_equal(tau,sigma)
| zero = sigma ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_41])]) ).
cnf(c_0_45,plain,
( smaller_or_equal(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( ~ greater(zero,tau)
| zero = tau ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_47,negated_conjecture,
( ~ greater(sigma,tau)
| zero = sigma ),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_48,negated_conjecture,
( tau != sigma
| zero = sigma ),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( ~ smaller_or_equal(zero,sigma)
| zero = tau ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_47]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( ~ smaller_or_equal(sigma,tau)
| tau != sigma ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_48]),c_0_41])]) ).
cnf(c_0_52,negated_conjecture,
tau = sigma,
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_41])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT058-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.29 % Computer : n012.cluster.edu
% 0.04/0.29 % Model : x86_64 x86_64
% 0.04/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.29 % Memory : 8046.5625MB
% 0.04/0.29 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 01:24:06 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.07/0.33 % Version: 3.5.1
% 0.07/0.33 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.33 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.33 % Starting sh5l with 300s (1) cores
% 0.07/0.33 % sh5l with pid 1303498 completed with status 0
% 0.07/0.33 % Result found by sh5l
% 0.07/0.33 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.33 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.33 % Starting sh5l with 300s (1) cores
% 0.07/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.33 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.33 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.33 % SubtermCWHack with pid 1303506 completed with status 0
% 0.07/0.33 % Result found by SubtermCWHack
% 0.07/0.33 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.33 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.33 % Starting sh5l with 300s (1) cores
% 0.07/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.33 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.33 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.33 % Preprocessing time : 0.001 s
% 0.07/0.33
% 0.07/0.33 % Proof found!
% 0.07/0.33 % SZS status Unsatisfiable
% 0.07/0.33 % SZS output start CNFRefutation
% See solution above
% 0.07/0.33 % Parsed axioms : 29
% 0.07/0.33 % Removed by relevancy pruning/SinE : 0
% 0.07/0.33 % Initial clauses : 29
% 0.07/0.33 % Removed in clause preprocessing : 2
% 0.07/0.33 % Initial clauses in saturation : 27
% 0.07/0.33 % Processed clauses : 81
% 0.07/0.33 % ...of these trivial : 0
% 0.07/0.33 % ...subsumed : 16
% 0.07/0.33 % ...remaining for further processing : 65
% 0.07/0.33 % Other redundant clauses eliminated : 2
% 0.07/0.33 % Clauses deleted for lack of memory : 0
% 0.07/0.33 % Backward-subsumed : 1
% 0.07/0.33 % Backward-rewritten : 37
% 0.07/0.33 % Generated clauses : 113
% 0.07/0.33 % ...of the previous two non-redundant : 104
% 0.07/0.33 % ...aggressively subsumed : 0
% 0.07/0.33 % Contextual simplify-reflections : 4
% 0.07/0.33 % Paramodulations : 108
% 0.07/0.33 % Factorizations : 3
% 0.07/0.33 % NegExts : 0
% 0.07/0.33 % Equation resolutions : 2
% 0.07/0.33 % Disequality decompositions : 0
% 0.07/0.33 % Total rewrite steps : 70
% 0.07/0.33 % ...of those cached : 61
% 0.07/0.33 % Propositional unsat checks : 0
% 0.07/0.33 % Propositional check models : 0
% 0.07/0.33 % Propositional check unsatisfiable : 0
% 0.07/0.33 % Propositional clauses : 0
% 0.07/0.33 % Propositional clauses after purity: 0
% 0.07/0.33 % Propositional unsat core size : 0
% 0.07/0.33 % Propositional preprocessing time : 0.000
% 0.07/0.33 % Propositional encoding time : 0.000
% 0.07/0.33 % Propositional solver time : 0.000
% 0.07/0.33 % Success case prop preproc time : 0.000
% 0.07/0.33 % Success case prop encoding time : 0.000
% 0.07/0.33 % Success case prop solver time : 0.000
% 0.07/0.33 % Current number of processed clauses : 25
% 0.07/0.33 % Positive orientable unit clauses : 7
% 0.07/0.33 % Positive unorientable unit clauses: 0
% 0.07/0.33 % Negative unit clauses : 0
% 0.07/0.33 % Non-unit-clauses : 18
% 0.07/0.33 % Current number of unprocessed clauses: 49
% 0.07/0.33 % ...number of literals in the above : 145
% 0.07/0.33 % Current number of archived formulas : 0
% 0.07/0.33 % Current number of archived clauses : 38
% 0.07/0.33 % Clause-clause subsumption calls (NU) : 528
% 0.07/0.33 % Rec. Clause-clause subsumption calls : 488
% 0.07/0.33 % Non-unit clause-clause subsumptions : 20
% 0.07/0.33 % Unit Clause-clause subsumption calls : 5
% 0.07/0.33 % Rewrite failures with RHS unbound : 0
% 0.07/0.33 % BW rewrite match attempts : 4
% 0.07/0.33 % BW rewrite match successes : 2
% 0.07/0.33 % Condensation attempts : 0
% 0.07/0.33 % Condensation successes : 0
% 0.07/0.33 % Termbank termtop insertions : 1796
% 0.07/0.33 % Search garbage collected termcells : 44
% 0.07/0.33
% 0.07/0.33 % -------------------------------------------------
% 0.07/0.33 % User time : 0.004 s
% 0.07/0.33 % System time : 0.001 s
% 0.07/0.33 % Total time : 0.005 s
% 0.07/0.33 % Maximum resident set size: 3648 pages
% 0.07/0.33
% 0.07/0.33 % -------------------------------------------------
% 0.07/0.33 % User time : 0.006 s
% 0.07/0.33 % System time : 0.002 s
% 0.07/0.33 % Total time : 0.009 s
% 0.07/0.33 % Maximum resident set size: 4864 pages
% 0.07/0.33 % E exiting
%------------------------------------------------------------------------------