%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT012-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 : n026.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.15s 0.63s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 18 unt; 0 nHn; 47 RR)
% Number of literals : 144 ( 6 equ; 103 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp10_24,axiom,
( ~ class(X1,X5,X3)
| ~ class(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp10_24) ).
cnf(t12_FOL_29,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_29) ).
cnf(t12_FOL_28,negated_conjecture,
organization(sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_28) ).
cnf(t12_FOL_27,negated_conjecture,
organization(sk3,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_27) ).
cnf(mp9_23,axiom,
( ~ organization(X1,X2)
| class(X1,sk2(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp9_23) ).
cnf(a12_FOL_25,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_25) ).
cnf(t12_FOL_30,negated_conjecture,
complexity(sk3,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_30) ).
cnf(t2_FOL_26,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_26) ).
cnf(t12_FOL_32,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_32) ).
cnf(mp5_20,axiom,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_20) ).
cnf(mp6_2_22,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_2_22) ).
cnf(t12_FOL_31,negated_conjecture,
complexity(sk3,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_31) ).
cnf(t12_FOL_33,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_33) ).
cnf(c_0_13,plain,
( ~ class(X1,X5,X3)
| ~ class(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
inference(fof_simplification,[status(thm)],[mp10_24]) ).
cnf(c_0_14,plain,
( ~ class(X1,X5,X3)
| ~ class(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
c_0_13 ).
cnf(c_0_15,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
t12_FOL_29 ).
cnf(c_0_16,negated_conjecture,
organization(sk3,sk7),
t12_FOL_28 ).
cnf(c_0_17,negated_conjecture,
organization(sk3,sk6),
t12_FOL_27 ).
cnf(c_0_18,plain,
( ~ organization(X1,X2)
| class(X1,sk2(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp9_23]) ).
cnf(c_0_19,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_25]) ).
cnf(c_0_20,negated_conjecture,
( ~ class(sk3,X1,sk6)
| ~ class(sk3,X2,sk7)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( ~ organization(X1,X2)
| class(X1,sk2(X2,X1),X2) ),
c_0_18 ).
cnf(c_0_22,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_19 ).
cnf(c_0_23,negated_conjecture,
complexity(sk3,sk4,sk6),
t12_FOL_30 ).
cnf(c_0_24,negated_conjecture,
( ~ class(sk3,X1,sk6)
| X1 = sk2(sk7,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16])]) ).
cnf(c_0_25,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(fof_simplification,[status(thm)],[t2_FOL_26]) ).
cnf(c_0_26,negated_conjecture,
( ~ organization(X3,X5)
| ~ inertia(X3,X2,X5)
| ~ inertia(sk3,X1,sk6)
| ~ greater(sk4,X4)
| ~ class(X3,X6,X5)
| ~ class(sk3,X6,sk6)
| ~ complexity(X3,X4,X5)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
sk2(sk7,sk3) = sk2(sk6,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_17])]) ).
cnf(c_0_28,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
greater(sk7,sk6),
t12_FOL_32 ).
cnf(c_0_30,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp5_20]) ).
cnf(c_0_31,negated_conjecture,
( ~ organization(X3,X5)
| ~ inertia(X3,X2,X5)
| ~ inertia(sk3,X1,sk6)
| ~ greater(sk4,X4)
| ~ class(X3,sk2(sk6,sk3),X5)
| ~ complexity(X3,X4,X5)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_21]),c_0_17])]) ).
cnf(c_0_32,negated_conjecture,
class(sk3,sk2(sk6,sk3),sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_16])]) ).
cnf(c_0_33,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp6_2_22]) ).
cnf(c_0_34,negated_conjecture,
( ~ inertia(sk3,X2,sk6)
| ~ inertia(sk3,X1,sk7)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_29]),c_0_16]),c_0_17])]) ).
cnf(c_0_35,plain,
( ~ organization(X1,X2)
| inertia(X1,sk1(X2,X1),X2) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( ~ inertia(sk3,X2,sk7)
| ~ inertia(sk3,X1,sk6)
| ~ greater(sk4,X3)
| ~ complexity(sk3,X3,sk7)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_16])]) ).
cnf(c_0_37,negated_conjecture,
complexity(sk3,sk5,sk7),
t12_FOL_31 ).
cnf(c_0_38,negated_conjecture,
greater(sk4,sk5),
t12_FOL_33 ).
cnf(c_0_39,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
( ~ inertia(sk3,X1,sk6)
| greater(sk1(sk7,sk3),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16])]) ).
cnf(c_0_41,negated_conjecture,
( ~ inertia(sk3,X2,sk7)
| ~ inertia(sk3,X1,sk6)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
( ~ inertia(sk3,X1,sk6)
| ~ greater(X1,sk1(sk7,sk3)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ inertia(sk3,X1,sk7)
| greater(sk1(sk6,sk3),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_17])]) ).
cnf(c_0_44,negated_conjecture,
( ~ inertia(sk3,sk1(sk7,sk3),sk7)
| ~ inertia(sk3,sk1(sk6,sk3),sk6) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
~ inertia(sk3,sk1(sk6,sk3),sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_16])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT012-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.10/0.55 % Computer : n026.cluster.edu
% 0.10/0.55 % Model : x86_64 x86_64
% 0.10/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.55 % Memory : 8046.5625MB
% 0.10/0.55 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 01:23:53 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.60 Running first-order theorem proving
% 0.10/0.60 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.15/0.63 % Version: 3.5.1
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % sh5l with pid 1060428 completed with status 0
% 0.15/0.63 % Result found by sh5l
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.63 % Search class: FHHSF-FFSM22-SFFFFFNN
% 0.15/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.63 % SubtermCWHack with pid 1060435 completed with status 0
% 0.15/0.63 % Result found by SubtermCWHack
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.63 % Search class: FHHSF-FFSM22-SFFFFFNN
% 0.15/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.63 % Preprocessing time : 0.001 s
% 0.15/0.63
% 0.15/0.63 % Proof found!
% 0.15/0.63 % SZS status Unsatisfiable
% 0.15/0.63 % SZS output start CNFRefutation
% See solution above
% 0.15/0.63 % Parsed axioms : 14
% 0.15/0.63 % Removed by relevancy pruning/SinE : 0
% 0.15/0.63 % Initial clauses : 14
% 0.15/0.63 % Removed in clause preprocessing : 0
% 0.15/0.63 % Initial clauses in saturation : 14
% 0.15/0.63 % Processed clauses : 45
% 0.15/0.63 % ...of these trivial : 0
% 0.15/0.63 % ...subsumed : 6
% 0.15/0.63 % ...remaining for further processing : 39
% 0.15/0.63 % Other redundant clauses eliminated : 1
% 0.15/0.63 % Clauses deleted for lack of memory : 0
% 0.15/0.63 % Backward-subsumed : 2
% 0.15/0.63 % Backward-rewritten : 1
% 0.15/0.63 % Generated clauses : 33
% 0.15/0.63 % ...of the previous two non-redundant : 33
% 0.15/0.63 % ...aggressively subsumed : 0
% 0.15/0.63 % Contextual simplify-reflections : 0
% 0.15/0.63 % Paramodulations : 32
% 0.15/0.63 % Factorizations : 0
% 0.15/0.63 % NegExts : 0
% 0.15/0.63 % Equation resolutions : 1
% 0.15/0.63 % Disequality decompositions : 0
% 0.15/0.63 % Total rewrite steps : 23
% 0.15/0.63 % ...of those cached : 18
% 0.15/0.63 % Propositional unsat checks : 0
% 0.15/0.63 % Propositional check models : 0
% 0.15/0.63 % Propositional check unsatisfiable : 0
% 0.15/0.63 % Propositional clauses : 0
% 0.15/0.63 % Propositional clauses after purity: 0
% 0.15/0.63 % Propositional unsat core size : 0
% 0.15/0.63 % Propositional preprocessing time : 0.000
% 0.15/0.63 % Propositional encoding time : 0.000
% 0.15/0.63 % Propositional solver time : 0.000
% 0.15/0.63 % Success case prop preproc time : 0.000
% 0.15/0.63 % Success case prop encoding time : 0.000
% 0.15/0.63 % Success case prop solver time : 0.000
% 0.15/0.63 % Current number of processed clauses : 35
% 0.15/0.63 % Positive orientable unit clauses : 9
% 0.15/0.63 % Positive unorientable unit clauses: 0
% 0.15/0.63 % Negative unit clauses : 6
% 0.15/0.63 % Non-unit-clauses : 20
% 0.15/0.63 % Current number of unprocessed clauses: 2
% 0.15/0.63 % ...number of literals in the above : 6
% 0.15/0.63 % Current number of archived formulas : 0
% 0.15/0.63 % Current number of archived clauses : 3
% 0.15/0.63 % Clause-clause subsumption calls (NU) : 324
% 0.15/0.63 % Rec. Clause-clause subsumption calls : 26
% 0.15/0.63 % Non-unit clause-clause subsumptions : 4
% 0.15/0.63 % Unit Clause-clause subsumption calls : 37
% 0.15/0.63 % Rewrite failures with RHS unbound : 0
% 0.15/0.63 % BW rewrite match attempts : 1
% 0.15/0.63 % BW rewrite match successes : 1
% 0.15/0.63 % Condensation attempts : 0
% 0.15/0.63 % Condensation successes : 0
% 0.15/0.63 % Termbank termtop insertions : 1259
% 0.15/0.63 % Search garbage collected termcells : 62
% 0.15/0.63
% 0.15/0.63 % -------------------------------------------------
% 0.15/0.63 % User time : 0.006 s
% 0.15/0.63 % System time : 0.002 s
% 0.15/0.63 % Total time : 0.008 s
% 0.15/0.63 % Maximum resident set size: 3644 pages
% 0.15/0.63
% 0.15/0.63 % -------------------------------------------------
% 0.15/0.63 % User time : 0.008 s
% 0.15/0.63 % System time : 0.006 s
% 0.15/0.63 % Total time : 0.014 s
% 0.15/0.63 % Maximum resident set size: 4608 pages
% 0.15/0.63 % E exiting
%------------------------------------------------------------------------------