%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT013-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 : n005.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:01 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 57 ( 28 unt; 6 nHn; 57 RR)
% Number of literals : 149 ( 19 equ; 96 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 84 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp15_20,axiom,
( ~ organization(X1,X2)
| time(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15_20) ).
cnf(t12_FOL_25,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_25) ).
cnf(mp17_22,axiom,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17_22) ).
cnf(mp16_21,axiom,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16_21) ).
cnf(t13_FOL_27,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_27) ).
cnf(t13_FOL_29,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_29) ).
cnf(t13_FOL_26,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_26) ).
cnf(t13_FOL_28,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_28) ).
cnf(t11_FOL_24,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ size(X1,X5,X3)
| ~ size(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_24) ).
cnf(t13_FOL_30,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_30) ).
cnf(t13_FOL_33,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_33) ).
cnf(t13_FOL_32,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_32) ).
cnf(mp18_23,axiom,
( X2 != X3
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18_23) ).
cnf(t13_FOL_31,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_31) ).
cnf(t13_FOL_34,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_34) ).
cnf(mp6_1_18,axiom,
( X1 != X2
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1_18) ).
cnf(c_0_16,plain,
( ~ organization(X1,X2)
| time(X2) ),
inference(fof_simplification,[status(thm)],[mp15_20]) ).
cnf(c_0_17,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(fof_simplification,[status(thm)],[t12_FOL_25]) ).
cnf(c_0_18,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[mp17_22]) ).
cnf(c_0_19,plain,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp16_21]) ).
cnf(c_0_20,plain,
( ~ organization(X1,X2)
| time(X2) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
organization(sk1,sk7),
t13_FOL_27 ).
cnf(c_0_22,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
complexity(sk1,sk2,sk6),
t13_FOL_29 ).
cnf(c_0_24,negated_conjecture,
organization(sk1,sk6),
t13_FOL_26 ).
cnf(c_0_25,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X2) ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
t13_FOL_28 ).
cnf(c_0_27,plain,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X1 = X2
| greater(X1,X2) ),
c_0_19 ).
cnf(c_0_28,negated_conjecture,
time(sk7),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ greater(sk6,X2)
| ~ greater(X1,sk2)
| ~ organization(sk1,X2)
| ~ reorganization_free(sk1,X2,sk6)
| ~ complexity(sk1,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
reorganization_free(sk1,sk7,sk6),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ size(X1,X5,X3)
| ~ size(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(fof_simplification,[status(thm)],[t11_FOL_24]) ).
cnf(c_0_32,negated_conjecture,
( ~ time(X1)
| greater(X1,sk7)
| greater(sk7,X1)
| X1 = sk7 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
time(sk6),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ greater(X1,sk2)
| ~ greater(sk6,sk7)
| ~ complexity(sk1,X1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]) ).
cnf(c_0_35,negated_conjecture,
complexity(sk1,sk3,sk7),
t13_FOL_30 ).
cnf(c_0_36,negated_conjecture,
greater(sk3,sk2),
t13_FOL_33 ).
cnf(c_0_37,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ size(X1,X5,X3)
| ~ size(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
c_0_31 ).
cnf(c_0_38,negated_conjecture,
size(sk1,sk5,sk7),
t13_FOL_32 ).
cnf(c_0_39,plain,
( X2 != X3
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
inference(fof_simplification,[status(thm)],[mp18_23]) ).
cnf(c_0_40,negated_conjecture,
( greater(sk7,sk6)
| greater(sk6,sk7)
| sk7 = sk6 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ greater(sk6,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
( ~ greater(sk7,X2)
| ~ greater(X1,sk5)
| ~ organization(sk1,X2)
| ~ reorganization_free(sk1,X2,sk7)
| ~ size(sk1,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21])]) ).
cnf(c_0_43,negated_conjecture,
size(sk1,sk4,sk6),
t13_FOL_31 ).
cnf(c_0_44,negated_conjecture,
greater(sk4,sk5),
t13_FOL_34 ).
cnf(c_0_45,plain,
( X2 != X3
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
( greater(sk7,sk6)
| sk7 = sk6 ),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
~ greater(sk7,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_26]),c_0_24]),c_0_44])]) ).
cnf(c_0_48,plain,
( ~ organization(X3,X4)
| ~ complexity(X3,X1,X4)
| ~ complexity(X3,X2,X4)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
sk7 = sk6,
inference(sr,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp6_1_18]) ).
cnf(c_0_51,negated_conjecture,
( ~ complexity(sk1,X1,sk6)
| X1 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_23]),c_0_24])]) ).
cnf(c_0_52,negated_conjecture,
complexity(sk1,sk3,sk6),
inference(rw,[status(thm)],[c_0_35,c_0_49]) ).
cnf(c_0_53,plain,
( X1 != X2
| ~ greater(X1,X2) ),
c_0_50 ).
cnf(c_0_54,negated_conjecture,
sk3 = sk2,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013-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.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 01:20:48 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2232727 completed with status 0
% 0.12/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHSF-FFSM00-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.42 % SubtermCWHack with pid 2232732 completed with status 0
% 0.12/0.42 % Result found by SubtermCWHack
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHSF-FFSM00-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Unsatisfiable
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 17
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 17
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 17
% 0.12/0.42 % Processed clauses : 48
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 5
% 0.12/0.42 % ...remaining for further processing : 43
% 0.12/0.42 % Other redundant clauses eliminated : 2
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 2
% 0.12/0.42 % Backward-rewritten : 15
% 0.12/0.42 % Generated clauses : 36
% 0.12/0.42 % ...of the previous two non-redundant : 44
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 0
% 0.12/0.42 % Paramodulations : 32
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 2
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 44
% 0.12/0.42 % ...of those cached : 34
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 22
% 0.12/0.42 % Positive orientable unit clauses : 9
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 2
% 0.12/0.42 % Non-unit-clauses : 11
% 0.12/0.42 % Current number of unprocessed clauses: 12
% 0.12/0.42 % ...number of literals in the above : 40
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 19
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 132
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 45
% 0.12/0.42 % Non-unit clause-clause subsumptions : 1
% 0.12/0.42 % Unit Clause-clause subsumption calls : 31
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 2
% 0.12/0.42 % BW rewrite match successes : 2
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 1154
% 0.12/0.42 % Search garbage collected termcells : 47
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.003 s
% 0.12/0.42 % System time : 0.003 s
% 0.12/0.42 % Total time : 0.006 s
% 0.12/0.42 % Maximum resident set size: 3640 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.007 s
% 0.12/0.42 % System time : 0.016 s
% 0.12/0.42 % Total time : 0.023 s
% 0.12/0.42 % Maximum resident set size: 4864 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------