%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT015-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 : n020.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.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 47 ( 29 unt; 0 nHn; 47 RR)
% Number of literals : 162 ( 0 equ; 121 neg)
% Maximal clause size : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 97 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a13_FOL_3,hypothesis,
( ~ greater(X9,X8)
| ~ inertia(X3,X9,X2)
| ~ inertia(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a13_FOL_3) ).
cnf(t15_FOL_12,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_12) ).
cnf(t15_FOL_5,negated_conjecture,
organization(sk3,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_5) ).
cnf(a12_FOL_2,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ complexity(X3,X7,X4)
| ~ complexity(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a12_FOL_2) ).
cnf(t15_FOL_11,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_11) ).
cnf(t15_FOL_4,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_4) ).
cnf(t15_FOL_14,negated_conjecture,
complexity(sk3,sk7,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_14) ).
cnf(t15_FOL_10,negated_conjecture,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_10) ).
cnf(t15_FOL_6,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_6) ).
cnf(t15_FOL_16,negated_conjecture,
~ greater(sk10,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_16) ).
cnf(t15_FOL_8,negated_conjecture,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_8) ).
cnf(mp5_1,axiom,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_1) ).
cnf(t15_FOL_9,negated_conjecture,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_9) ).
cnf(t15_FOL_7,negated_conjecture,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_7) ).
cnf(t15_FOL_13,negated_conjecture,
complexity(sk2,sk6,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_13) ).
cnf(t15_FOL_15,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_FOL_15) ).
cnf(c_0_16,hypothesis,
( ~ greater(X9,X8)
| ~ inertia(X3,X9,X2)
| ~ inertia(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X4,X6) ),
inference(fof_simplification,[status(thm)],[a13_FOL_3]) ).
cnf(c_0_17,hypothesis,
( ~ greater(X9,X8)
| ~ inertia(X3,X9,X2)
| ~ inertia(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X4,X6) ),
c_0_16 ).
cnf(c_0_18,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
t15_FOL_12 ).
cnf(c_0_19,negated_conjecture,
organization(sk3,sk8),
t15_FOL_5 ).
cnf(c_0_20,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ complexity(X3,X7,X4)
| ~ complexity(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
inference(fof_simplification,[status(thm)],[a12_FOL_2]) ).
cnf(c_0_21,negated_conjecture,
( ~ organization(X3,sk8)
| ~ organization(sk3,X1)
| ~ inertia(X3,X5,sk8)
| ~ inertia(sk3,X4,sk8)
| ~ class(X3,X6,sk8)
| ~ class(sk3,X6,sk8)
| ~ greater(X4,X5)
| ~ reorganization(X3,sk8,X2)
| ~ reorganization(sk3,sk8,X1)
| ~ reorganization_type(X3,sk4,sk8)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
t15_FOL_11 ).
cnf(c_0_23,negated_conjecture,
organization(sk2,sk8),
t15_FOL_4 ).
cnf(c_0_24,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ complexity(X3,X7,X4)
| ~ complexity(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
complexity(sk3,sk7,sk8),
t15_FOL_14 ).
cnf(c_0_26,negated_conjecture,
( ~ organization(sk3,X1)
| ~ inertia(sk2,X4,sk8)
| ~ inertia(sk3,X3,sk8)
| ~ class(sk2,X5,sk8)
| ~ class(sk3,X5,sk8)
| ~ greater(X3,X4)
| ~ reorganization(sk2,sk8,X2)
| ~ reorganization(sk3,sk8,X1)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
reorganization(sk3,sk8,sk10),
t15_FOL_10 ).
cnf(c_0_28,negated_conjecture,
organization(sk3,sk10),
t15_FOL_6 ).
cnf(c_0_29,negated_conjecture,
~ greater(sk10,sk9),
inference(fof_simplification,[status(thm)],[t15_FOL_16]) ).
cnf(c_0_30,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(sk3,X1,sk8)
| ~ class(X4,X6,X5)
| ~ class(sk3,X6,sk8)
| ~ complexity(X4,X3,X5)
| ~ greater(sk7,X3)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19])]) ).
cnf(c_0_31,negated_conjecture,
class(sk3,sk5,sk8),
t15_FOL_8 ).
cnf(c_0_32,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp5_1]) ).
cnf(c_0_33,negated_conjecture,
( ~ inertia(sk2,X3,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ class(sk2,X4,sk8)
| ~ class(sk3,X4,sk8)
| ~ greater(X2,X3)
| ~ reorganization(sk2,sk8,X1)
| greater(sk10,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_34,negated_conjecture,
reorganization(sk2,sk8,sk9),
t15_FOL_9 ).
cnf(c_0_35,negated_conjecture,
~ greater(sk10,sk9),
c_0_29 ).
cnf(c_0_36,negated_conjecture,
( ~ organization(X4,X5)
| ~ inertia(X4,X2,X5)
| ~ inertia(sk3,X1,sk8)
| ~ class(X4,sk5,X5)
| ~ complexity(X4,X3,X5)
| ~ greater(sk7,X3)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( ~ inertia(sk2,X2,sk8)
| ~ inertia(sk3,X1,sk8)
| ~ class(sk2,X3,sk8)
| ~ class(sk3,X3,sk8)
| ~ greater(X1,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
class(sk2,sk5,sk8),
t15_FOL_7 ).
cnf(c_0_40,negated_conjecture,
( ~ organization(X3,X4)
| ~ inertia(X3,X1,X4)
| ~ class(X3,sk5,X4)
| ~ complexity(X3,X2,X4)
| ~ greater(sk7,X2)
| greater(sk1(sk8,sk3),X1) ),
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,
complexity(sk2,sk6,sk8),
t15_FOL_13 ).
cnf(c_0_42,negated_conjecture,
greater(sk7,sk6),
t15_FOL_15 ).
cnf(c_0_43,negated_conjecture,
( ~ inertia(sk2,X2,sk8)
| ~ inertia(sk3,X1,sk8)
| ~ greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31])]) ).
cnf(c_0_44,negated_conjecture,
( ~ inertia(sk2,X1,sk8)
| greater(sk1(sk8,sk3),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_39]),c_0_23])]) ).
cnf(c_0_45,negated_conjecture,
~ inertia(sk2,X1,sk8),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_37]),c_0_19])]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT015-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:22:18 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % sh5l with pid 1688816 completed with status 0
% 0.11/0.43 % Result found by sh5l
% 0.11/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 1688823 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Unsatisfiable
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 16
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 16
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 16
% 0.11/0.43 % Processed clauses : 51
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 51
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 19
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 37
% 0.11/0.43 % ...of the previous two non-redundant : 36
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 1
% 0.11/0.43 % Paramodulations : 37
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 30
% 0.11/0.43 % ...of those cached : 24
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 32
% 0.11/0.43 % Positive orientable unit clauses : 12
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 2
% 0.11/0.43 % Non-unit-clauses : 18
% 0.11/0.43 % Current number of unprocessed clauses: 1
% 0.11/0.43 % ...number of literals in the above : 9
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 19
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 454
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 37
% 0.11/0.43 % Non-unit clause-clause subsumptions : 8
% 0.11/0.43 % Unit Clause-clause subsumption calls : 27
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 0
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 2078
% 0.11/0.43 % Search garbage collected termcells : 57
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.006 s
% 0.11/0.43 % System time : 0.002 s
% 0.11/0.43 % Total time : 0.009 s
% 0.11/0.43 % Maximum resident set size: 3644 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.007 s
% 0.11/0.43 % System time : 0.005 s
% 0.11/0.43 % Total time : 0.013 s
% 0.11/0.43 % Maximum resident set size: 4864 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------