%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT002+1 : TPTP v9.3.1. Released v2.0.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:25:57 PM UTC 2026
% Result : Theorem 0.16s 0.62s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 179 ( 72 ~; 69 |; 31 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 2 sgn 46 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_FOL,conjecture,
! [X1,X9,X10,X4,X5] :
( ( greater(X5,X4)
& inertia(X1,X10,X5)
& inertia(X1,X9,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).
fof(mp4,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> ( reorganization_free(X1,X5,X5)
& reorganization_free(X1,X4,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4) ).
fof(a3_FOL,hypothesis,
! [X1,X6,X4,X5,X7,X8,X9,X10] :
( ( inertia(X6,X10,X5)
& inertia(X1,X9,X4)
& reproducibility(X6,X8,X5)
& reproducibility(X1,X7,X4)
& reorganization_free(X6,X5,X5)
& reorganization_free(X1,X4,X4)
& organization(X6,X5)
& organization(X1,X4) )
=> ( greater(X8,X7)
<=> greater(X10,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).
fof(a4_FOL,hypothesis,
! [X1,X7,X8,X4,X5] :
( ( greater(X5,X4)
& reproducibility(X1,X8,X5)
& reproducibility(X1,X7,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_FOL) ).
fof(mp3,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : reproducibility(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X9,X10,X4,X5] :
( ( greater(X5,X4)
& inertia(X1,X10,X5)
& inertia(X1,X9,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> greater(X10,X9) ),
inference(assume_negation,[status(cth)],[t2_FOL]) ).
fof(c_0_6,plain,
! [X29,X30,X31] :
( ( ~ reorganization_free(X29,X30,X31)
| reorganization_free(X29,X31,X31) )
& ( ~ reorganization_free(X29,X30,X31)
| reorganization_free(X29,X30,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4])])])]) ).
fof(c_0_7,negated_conjecture,
( ~ greater(esk3_0,esk2_0)
& greater(esk5_0,esk4_0)
& inertia(esk1_0,esk3_0,esk5_0)
& inertia(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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,hypothesis,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( ~ inertia(X17,X23,X19)
| ~ inertia(X16,X22,X18)
| ~ reproducibility(X17,X21,X19)
| ~ reproducibility(X16,X20,X18)
| ~ reorganization_free(X17,X19,X19)
| ~ reorganization_free(X16,X18,X18)
| ~ organization(X17,X19)
| ~ organization(X16,X18)
| greater(X21,X20)
| ~ greater(X23,X22) )
& ( ~ inertia(X17,X23,X19)
| ~ inertia(X16,X22,X18)
| ~ reproducibility(X17,X21,X19)
| ~ reproducibility(X16,X20,X18)
| ~ reorganization_free(X17,X19,X19)
| ~ reorganization_free(X16,X18,X18)
| ~ organization(X17,X19)
| ~ organization(X16,X18)
| greater(X23,X22)
| ~ greater(X21,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a3_FOL])])])]) ).
cnf(c_0_9,plain,
( ~ reorganization_free(X1,X3,X2)
| reorganization_free(X1,X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X24,X25,X26,X27,X28] :
( greater(X26,X25)
| ~ greater(X28,X27)
| ~ reproducibility(X24,X26,X28)
| ~ reproducibility(X24,X25,X27)
| ~ reorganization_free(X24,X27,X28)
| ~ organization(X24,X28)
| ~ organization(X24,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a4_FOL])])]) ).
cnf(c_0_12,hypothesis,
( ~ inertia(X7,X3,X8)
| ~ inertia(X5,X4,X6)
| ~ reproducibility(X7,X1,X8)
| ~ reproducibility(X5,X2,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ organization(X7,X8)
| ~ organization(X5,X6)
| ~ greater(X1,X2)
| greater(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
inertia(esk1_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
reorganization_free(esk1_0,esk5_0,esk5_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
organization(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X32,X33] :
( reproducibility(X32,esk6_2(X32,X33),X33)
| ~ organization(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3])])])]) ).
cnf(c_0_17,hypothesis,
( ~ greater(X3,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
organization(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( ~ organization(X4,X5)
| ~ reproducibility(X4,X3,X5)
| ~ reproducibility(esk1_0,X2,esk5_0)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(X4,X1,X5)
| ~ greater(X2,X3)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_21,plain,
( ~ organization(X1,X2)
| reproducibility(X1,esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ reproducibility(esk1_0,X2,esk4_0)
| ~ reproducibility(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_17,c_0_10]),c_0_18]),c_0_15]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
( ~ organization(X3,X4)
| ~ reproducibility(X3,X2,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X1,X4)
| ~ greater(esk6_2(esk1_0,esk5_0),X2)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]) ).
cnf(c_0_24,negated_conjecture,
( ~ reproducibility(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_22,c_0_21]),c_0_15])]) ).
cnf(c_0_25,negated_conjecture,
( ~ organization(X2,X3)
| ~ reproducibility(X2,X4,X3)
| ~ reproducibility(esk1_0,X4,esk4_0)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,X1,X3)
| greater(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( ~ organization(X2,X3)
| ~ reproducibility(X2,esk6_2(esk1_0,esk4_0),X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,X1,X3)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_19])]) ).
cnf(c_0_28,negated_conjecture,
reorganization_free(esk1_0,esk4_0,esk4_0),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( ~ inertia(esk1_0,X1,esk4_0)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_28]),c_0_19])]) ).
cnf(c_0_30,negated_conjecture,
inertia(esk1_0,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,negated_conjecture,
~ greater(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.55 % Computer : n026.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Mon Sep 21 01:23:08 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.60 Running first-order theorem proving
% 0.16/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.16/0.62 % Version: 3.5.1
% 0.16/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.62 % Starting sh5l with 300s (1) cores
% 0.16/0.62 % sh5l with pid 1057825 completed with status 0
% 0.16/0.62 % Result found by sh5l
% 0.16/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.62 % Starting sh5l with 300s (1) cores
% 0.16/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.62 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.16/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.62 % SubtermCWHack with pid 1057832 completed with status 0
% 0.16/0.62 % Result found by SubtermCWHack
% 0.16/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.62 % Starting sh5l with 300s (1) cores
% 0.16/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.62 % Search class: FHUNF-FFSM22-SFFFFFNN
% 0.16/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.62 % Preprocessing time : 0.001 s
% 0.16/0.62
% 0.16/0.62 % Proof found!
% 0.16/0.62 % SZS status Theorem
% 0.16/0.62 % SZS output start CNFRefutation
% See solution above
% 0.16/0.62 % Parsed axioms : 5
% 0.16/0.62 % Removed by relevancy pruning/SinE : 0
% 0.16/0.62 % Initial clauses : 13
% 0.16/0.62 % Removed in clause preprocessing : 0
% 0.16/0.62 % Initial clauses in saturation : 13
% 0.16/0.62 % Processed clauses : 35
% 0.16/0.62 % ...of these trivial : 0
% 0.16/0.62 % ...subsumed : 1
% 0.16/0.62 % ...remaining for further processing : 34
% 0.16/0.62 % Other redundant clauses eliminated : 0
% 0.16/0.62 % Clauses deleted for lack of memory : 0
% 0.16/0.62 % Backward-subsumed : 0
% 0.16/0.62 % Backward-rewritten : 0
% 0.16/0.62 % Generated clauses : 30
% 0.16/0.62 % ...of the previous two non-redundant : 25
% 0.16/0.62 % ...aggressively subsumed : 0
% 0.16/0.62 % Contextual simplify-reflections : 0
% 0.16/0.62 % Paramodulations : 30
% 0.16/0.62 % Factorizations : 0
% 0.16/0.62 % NegExts : 0
% 0.16/0.62 % Equation resolutions : 0
% 0.16/0.62 % Disequality decompositions : 0
% 0.16/0.62 % Total rewrite steps : 35
% 0.16/0.62 % ...of those cached : 30
% 0.16/0.62 % Propositional unsat checks : 0
% 0.16/0.62 % Propositional check models : 0
% 0.16/0.62 % Propositional check unsatisfiable : 0
% 0.16/0.62 % Propositional clauses : 0
% 0.16/0.62 % Propositional clauses after purity: 0
% 0.16/0.62 % Propositional unsat core size : 0
% 0.16/0.62 % Propositional preprocessing time : 0.000
% 0.16/0.62 % Propositional encoding time : 0.000
% 0.16/0.62 % Propositional solver time : 0.000
% 0.16/0.62 % Success case prop preproc time : 0.000
% 0.16/0.62 % Success case prop encoding time : 0.000
% 0.16/0.62 % Success case prop solver time : 0.000
% 0.16/0.62 % Current number of processed clauses : 34
% 0.16/0.62 % Positive orientable unit clauses : 8
% 0.16/0.62 % Positive unorientable unit clauses: 0
% 0.16/0.62 % Negative unit clauses : 1
% 0.16/0.62 % Non-unit-clauses : 25
% 0.16/0.62 % Current number of unprocessed clauses: 3
% 0.16/0.62 % ...number of literals in the above : 20
% 0.16/0.62 % Current number of archived formulas : 0
% 0.16/0.62 % Current number of archived clauses : 0
% 0.16/0.62 % Clause-clause subsumption calls (NU) : 257
% 0.16/0.62 % Rec. Clause-clause subsumption calls : 38
% 0.16/0.62 % Non-unit clause-clause subsumptions : 0
% 0.16/0.62 % Unit Clause-clause subsumption calls : 0
% 0.16/0.62 % Rewrite failures with RHS unbound : 0
% 0.16/0.62 % BW rewrite match attempts : 1
% 0.16/0.62 % BW rewrite match successes : 0
% 0.16/0.62 % Condensation attempts : 0
% 0.16/0.62 % Condensation successes : 0
% 0.16/0.62 % Termbank termtop insertions : 2038
% 0.16/0.62 % Search garbage collected termcells : 291
% 0.16/0.62
% 0.16/0.62 % -------------------------------------------------
% 0.16/0.62 % User time : 0.004 s
% 0.16/0.62 % System time : 0.003 s
% 0.16/0.62 % Total time : 0.007 s
% 0.16/0.62 % Maximum resident set size: 3636 pages
% 0.16/0.62
% 0.16/0.62 % -------------------------------------------------
% 0.16/0.62 % User time : 0.006 s
% 0.16/0.62 % System time : 0.006 s
% 0.16/0.62 % Total time : 0.013 s
% 0.16/0.62 % Maximum resident set size: 4608 pages
% 0.16/0.62 % E exiting
%------------------------------------------------------------------------------