%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:00 PM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 165 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 206 ( 85 ~; 74 |; 39 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 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 : 116 ( 0 sgn 65 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t12_FOL,conjecture,
! [X1,X8,X9,X6,X7] :
( ( greater(X7,X6)
& complexity(X1,X9,X7)
& complexity(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp10,axiom,
! [X1,X6,X7,X8,X9] :
( ( class(X1,X9,X7)
& class(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> X8 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(mp9,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X5] : class(X1,X5,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(a12_FOL,hypothesis,
! [X1,X4,X5,X8,X9,X10,X11,X6,X7] :
( ( greater(X9,X8)
& inertia(X4,X11,X7)
& inertia(X1,X10,X6)
& complexity(X4,X9,X7)
& complexity(X1,X8,X6)
& class(X4,X5,X7)
& class(X1,X5,X6)
& organization(X4,X7)
& organization(X1,X6) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X10,X11,X6,X7] :
( ( greater(X7,X6)
& inertia(X1,X11,X7)
& inertia(X1,X10,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(mp6_2,axiom,
! [X1,X4] :
~ ( greater(X4,X1)
& greater(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X8,X9,X6,X7] :
( ( greater(X7,X6)
& complexity(X1,X9,X7)
& complexity(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> ~ greater(X8,X9) ),
inference(assume_negation,[status(cth)],[t12_FOL]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X8,X9,X6,X7] :
( ( greater(X7,X6)
& complexity(X1,X9,X7)
& complexity(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X41,X42,X43,X44,X45] :
( X44 = X45
| ~ class(X41,X45,X43)
| ~ class(X41,X44,X42)
| ~ reorganization_free(X41,X42,X43)
| ~ organization(X41,X43)
| ~ organization(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp10])])]) ).
fof(c_0_10,negated_conjecture,
( greater(esk2_0,esk3_0)
& greater(esk5_0,esk4_0)
& complexity(esk1_0,esk3_0,esk5_0)
& complexity(esk1_0,esk2_0,esk4_0)
& reorganization_free(esk1_0,esk4_0,esk5_0)
& organization(esk1_0,esk5_0)
& organization(esk1_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_11,plain,
( ~ class(X1,X5,X3)
| ~ class(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
organization(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
organization(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X38,X39] :
( class(X38,esk7_2(X38,X39),X39)
| ~ organization(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp9])])])]) ).
fof(c_0_16,hypothesis,
! [X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( greater(X18,X17)
| ~ greater(X16,X15)
| ~ inertia(X13,X18,X20)
| ~ inertia(X12,X17,X19)
| ~ complexity(X13,X16,X20)
| ~ complexity(X12,X15,X19)
| ~ class(X13,X14,X20)
| ~ class(X12,X14,X19)
| ~ organization(X13,X20)
| ~ organization(X12,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a12_FOL])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ class(esk1_0,X1,esk4_0)
| ~ class(esk1_0,X2,esk5_0)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( ~ organization(X1,X2)
| class(X1,esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
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(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
complexity(esk1_0,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ class(esk1_0,X1,esk4_0)
| X1 = esk7_2(esk1_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_13])]) ).
fof(c_0_22,hypothesis,
! [X21,X22,X23,X24,X25] :
( greater(X23,X22)
| ~ greater(X25,X24)
| ~ inertia(X21,X23,X25)
| ~ inertia(X21,X22,X24)
| ~ reorganization_free(X21,X24,X25)
| ~ organization(X21,X25)
| ~ organization(X21,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ organization(X3,X5)
| ~ inertia(X3,X2,X5)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ greater(esk2_0,X4)
| ~ class(X3,X6,X5)
| ~ class(esk1_0,X6,esk4_0)
| ~ complexity(X3,X4,X5)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14])]) ).
cnf(c_0_24,negated_conjecture,
esk7_2(esk1_0,esk5_0) = esk7_2(esk1_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_14])]) ).
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(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_27,plain,
! [X35,X36] :
( inertia(X35,esk6_2(X35,X36),X36)
| ~ organization(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ organization(X3,X5)
| ~ inertia(X3,X2,X5)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ greater(esk2_0,X4)
| ~ class(X3,esk7_2(esk1_0,esk4_0),X5)
| ~ complexity(X3,X4,X5)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_14])]) ).
cnf(c_0_29,negated_conjecture,
class(esk1_0,esk7_2(esk1_0,esk4_0),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_13])]) ).
fof(c_0_30,plain,
! [X33,X34] :
( ~ greater(X34,X33)
| ~ greater(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_2])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ inertia(esk1_0,X2,esk4_0)
| ~ inertia(esk1_0,X1,esk5_0)
| 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_25,c_0_12]),c_0_26]),c_0_13]),c_0_14])]) ).
cnf(c_0_32,plain,
( ~ organization(X1,X2)
| inertia(X1,esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ inertia(esk1_0,X2,esk5_0)
| ~ inertia(esk1_0,X1,esk4_0)
| ~ greater(esk2_0,X3)
| ~ complexity(esk1_0,X3,esk5_0)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13])]) ).
cnf(c_0_34,negated_conjecture,
complexity(esk1_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( ~ inertia(esk1_0,X1,esk4_0)
| greater(esk6_2(esk1_0,esk5_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_13])]) ).
cnf(c_0_38,negated_conjecture,
( ~ inertia(esk1_0,X2,esk5_0)
| ~ inertia(esk1_0,X1,esk4_0)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
( ~ inertia(esk1_0,X1,esk4_0)
| ~ greater(X1,esk6_2(esk1_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ inertia(esk1_0,X1,esk5_0)
| greater(esk6_2(esk1_0,esk4_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_14])]) ).
cnf(c_0_41,negated_conjecture,
( ~ inertia(esk1_0,esk6_2(esk1_0,esk5_0),esk5_0)
| ~ inertia(esk1_0,esk6_2(esk1_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
~ inertia(esk1_0,esk6_2(esk1_0,esk4_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_13])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n020.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 01:22:03 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_3 with pid 1687952 completed with status 0
% 0.14/0.44 % Result found by new_bool_3
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FHHSF-FFSM22-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1687969 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FHHSF-FFSM22-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.002 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Theorem
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 8
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 14
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 14
% 0.14/0.44 % Processed clauses : 45
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 6
% 0.14/0.44 % ...remaining for further processing : 39
% 0.14/0.44 % Other redundant clauses eliminated : 1
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 2
% 0.14/0.44 % Backward-rewritten : 1
% 0.14/0.44 % Generated clauses : 33
% 0.14/0.44 % ...of the previous two non-redundant : 33
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 32
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 1
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 23
% 0.14/0.44 % ...of those cached : 18
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 35
% 0.14/0.44 % Positive orientable unit clauses : 9
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 6
% 0.14/0.44 % Non-unit-clauses : 20
% 0.14/0.44 % Current number of unprocessed clauses: 2
% 0.14/0.44 % ...number of literals in the above : 6
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 3
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 326
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 25
% 0.14/0.44 % Non-unit clause-clause subsumptions : 4
% 0.14/0.44 % Unit Clause-clause subsumption calls : 38
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 1
% 0.14/0.44 % BW rewrite match successes : 1
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 2116
% 0.14/0.44 % Search garbage collected termcells : 344
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.011 s
% 0.14/0.44 % System time : 0.003 s
% 0.14/0.44 % Total time : 0.014 s
% 0.14/0.44 % Maximum resident set size: 3644 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.012 s
% 0.14/0.44 % System time : 0.006 s
% 0.14/0.44 % Total time : 0.018 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------