%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT044+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 : n002.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:53 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 103 ( 20 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 106 ( 33 ~; 31 |; 24 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 7 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_3,conjecture,
! [X1,X4,X5] :
( ( greater(age(X1,X5),age(X1,X4))
& organization(X1) )
=> greater(capability(X1,X5),capability(X1,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3) ).
fof(assumption_9,axiom,
! [X1,X4,X5] :
( organization(X1)
=> internal_friction(X1,X5) = internal_friction(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_9) ).
fof(definition_smaller_or_equal,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( X1 = X2
| smaller(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
fof(assumption_7,axiom,
! [X1,X4,X5] :
( ( greater(age(X1,X5),age(X1,X4))
& organization(X1) )
=> greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_7) ).
fof(assumption_5,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( ( internal_friction(X1,X5) = internal_friction(X1,X4)
& stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) )
& ( ( greater(internal_friction(X1,X5),internal_friction(X1,X4))
& smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4))
& greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5) ).
fof(c_0_5,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
<=> ( ( ( internal_friction(X1,X5) = internal_friction(X1,X4)
& stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) )
& ( ( greater(internal_friction(X1,X5),internal_friction(X1,X4))
& smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4))
& greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X4,X5] :
( ( greater(age(X1,X5),age(X1,X4))
& organization(X1) )
=> greater(capability(X1,X5),capability(X1,X4)) ),
inference(assume_negation,[status(cth)],[lemma_3]) ).
fof(c_0_7,plain,
! [X1,X5,X4] :
( epred1_3(X4,X5,X1)
=> ( ( ( internal_friction(X1,X5) = internal_friction(X1,X4)
& stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4) )
=> capability(X1,X5) = capability(X1,X4) )
& ( ( greater(internal_friction(X1,X5),internal_friction(X1,X4))
& smaller_or_equal(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) )
=> smaller(capability(X1,X5),capability(X1,X4)) )
& ( ( smaller_or_equal(internal_friction(X1,X5),internal_friction(X1,X4))
& greater(stock_of_knowledge(X1,X5),stock_of_knowledge(X1,X4)) )
=> greater(capability(X1,X5),capability(X1,X4)) ) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X25,X26,X27] :
( internal_friction(X25,X27) = internal_friction(X25,X26)
| ~ organization(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_9])])]) ).
fof(c_0_9,negated_conjecture,
( ~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0))
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& organization(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,plain,
! [X31,X32,X33] :
( ( ~ epred1_3(X33,X32,X31)
| capability(X31,X32) = capability(X31,X33)
| internal_friction(X31,X32) != internal_friction(X31,X33)
| stock_of_knowledge(X31,X32) != stock_of_knowledge(X31,X33) )
& ( ~ epred1_3(X33,X32,X31)
| smaller(capability(X31,X32),capability(X31,X33))
| ~ greater(internal_friction(X31,X32),internal_friction(X31,X33))
| ~ smaller_or_equal(stock_of_knowledge(X31,X32),stock_of_knowledge(X31,X33)) )
& ( ~ epred1_3(X33,X32,X31)
| greater(capability(X31,X32),capability(X31,X33))
| ~ smaller_or_equal(internal_friction(X31,X32),internal_friction(X31,X33))
| ~ greater(stock_of_knowledge(X31,X32),stock_of_knowledge(X31,X33)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( ~ organization(X1)
| internal_friction(X1,X2) = internal_friction(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X6,X7] :
( ( smaller_or_equal(X6,X7)
| X6 != X7 )
& ( smaller_or_equal(X6,X7)
| ~ smaller(X6,X7) )
& ( X6 = X7
| smaller(X6,X7)
| ~ smaller_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_smaller_or_equal])])])]) ).
cnf(c_0_14,plain,
( ~ epred1_3(X3,X2,X1)
| ~ smaller_or_equal(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| greater(capability(X1,X2),capability(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
internal_friction(esk1_0,X1) = internal_friction(esk1_0,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( X1 != X2
| smaller_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X22,X23,X24] :
( greater(stock_of_knowledge(X22,X24),stock_of_knowledge(X22,X23))
| ~ greater(age(X22,X24),age(X22,X23))
| ~ organization(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_7])])]) ).
cnf(c_0_18,plain,
( ~ smaller_or_equal(internal_friction(esk1_0,X3),internal_friction(esk1_0,X2))
| ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| greater(capability(esk1_0,X1),capability(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,axiom,
! [X1,X4,X5] :
( organization(X1)
=> epred1_3(X4,X5,X1) ),
inference(apply_def,[status(thm)],[assumption_5,c_0_5]) ).
cnf(c_0_23,negated_conjecture,
~ greater(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ greater(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| greater(capability(esk1_0,X1),capability(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
greater(stock_of_knowledge(esk1_0,esk3_0),stock_of_knowledge(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12])]) ).
fof(c_0_26,plain,
! [X19,X20,X21] :
( epred1_3(X20,X21,X19)
| ~ organization(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_27,negated_conjecture,
~ epred1_3(esk2_0,esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( ~ organization(X1)
| epred1_3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT044+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.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:26:18 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2153532 completed with status 0
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSF-FFMF22-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2153541 completed with status 0
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSF-FFMF22-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45 % Presaturation interreduction done
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 10
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 20
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 20
% 0.10/0.45 % Processed clauses : 151
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 43
% 0.10/0.45 % ...remaining for further processing : 108
% 0.10/0.45 % Other redundant clauses eliminated : 2
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 5
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 324
% 0.10/0.45 % ...of the previous two non-redundant : 232
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 2
% 0.10/0.45 % Paramodulations : 317
% 0.10/0.45 % Factorizations : 4
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 3
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 100
% 0.10/0.45 % ...of those cached : 97
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 81
% 0.10/0.45 % Positive orientable unit clauses : 5
% 0.10/0.45 % Positive unorientable unit clauses: 1
% 0.10/0.45 % Negative unit clauses : 4
% 0.10/0.45 % Non-unit-clauses : 71
% 0.10/0.45 % Current number of unprocessed clauses: 120
% 0.10/0.45 % ...number of literals in the above : 671
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 25
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 3883
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 1796
% 0.10/0.45 % Non-unit clause-clause subsumptions : 43
% 0.10/0.45 % Unit Clause-clause subsumption calls : 31
% 0.10/0.45 % Rewrite failures with RHS unbound : 12
% 0.10/0.45 % BW rewrite match attempts : 0
% 0.10/0.45 % BW rewrite match successes : 0
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 10696
% 0.10/0.45 % Search garbage collected termcells : 274
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.021 s
% 0.10/0.45 % System time : 0.003 s
% 0.10/0.45 % Total time : 0.024 s
% 0.10/0.45 % Maximum resident set size: 3644 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.086 s
% 0.10/0.45 % System time : 0.012 s
% 0.10/0.45 % Total time : 0.099 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------