%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT048+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 : n009.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:54 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% 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_5,conjecture,
! [X1,X4,X5] :
( ( greater(age(X1,X5),age(X1,X4))
& organization(X1) )
=> smaller(capability(X1,X5),capability(X1,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_5) ).
fof(assumption_10,axiom,
! [X1,X4,X5] :
( organization(X1)
=> stock_of_knowledge(X1,X5) = stock_of_knowledge(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_10) ).
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_12,axiom,
! [X1,X4,X5] :
( ( greater(age(X1,X5),age(X1,X4))
& organization(X1) )
=> greater(internal_friction(X1,X5),internal_friction(X1,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_12) ).
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) )
=> smaller(capability(X1,X5),capability(X1,X4)) ),
inference(assume_negation,[status(cth)],[lemma_5]) ).
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,
! [X24,X25,X26] :
( stock_of_knowledge(X24,X26) = stock_of_knowledge(X24,X25)
| ~ organization(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_10])])]) ).
fof(c_0_9,negated_conjecture,
( ~ smaller(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,
! [X29,X30,X31] :
( ( ~ epred1_3(X31,X30,X29)
| capability(X29,X30) = capability(X29,X31)
| internal_friction(X29,X30) != internal_friction(X29,X31)
| stock_of_knowledge(X29,X30) != stock_of_knowledge(X29,X31) )
& ( ~ epred1_3(X31,X30,X29)
| smaller(capability(X29,X30),capability(X29,X31))
| ~ greater(internal_friction(X29,X30),internal_friction(X29,X31))
| ~ smaller_or_equal(stock_of_knowledge(X29,X30),stock_of_knowledge(X29,X31)) )
& ( ~ epred1_3(X31,X30,X29)
| greater(capability(X29,X30),capability(X29,X31))
| ~ smaller_or_equal(internal_friction(X29,X30),internal_friction(X29,X31))
| ~ greater(stock_of_knowledge(X29,X30),stock_of_knowledge(X29,X31)) ) ),
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)
| stock_of_knowledge(X1,X2) = stock_of_knowledge(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,
! [X27,X28] :
( ( smaller_or_equal(X27,X28)
| X27 != X28 )
& ( smaller_or_equal(X27,X28)
| ~ smaller(X27,X28) )
& ( X27 = X28
| smaller(X27,X28)
| ~ smaller_or_equal(X27,X28) ) ),
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)
| ~ greater(internal_friction(X1,X2),internal_friction(X1,X3))
| ~ smaller_or_equal(stock_of_knowledge(X1,X2),stock_of_knowledge(X1,X3))
| smaller(capability(X1,X2),capability(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
stock_of_knowledge(esk1_0,X1) = stock_of_knowledge(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,
! [X21,X22,X23] :
( greater(internal_friction(X21,X23),internal_friction(X21,X22))
| ~ greater(age(X21,X23),age(X21,X22))
| ~ organization(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_12])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ smaller_or_equal(stock_of_knowledge(esk1_0,X1),stock_of_knowledge(esk1_0,X3))
| ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| smaller(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(internal_friction(X1,X2),internal_friction(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,
~ smaller(capability(esk1_0,esk3_0),capability(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ greater(internal_friction(esk1_0,X1),internal_friction(esk1_0,X2))
| ~ epred1_3(X2,X1,esk1_0)
| smaller(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(internal_friction(esk1_0,esk3_0),internal_friction(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,
! [X13,X14,X15] :
( epred1_3(X14,X15,X13)
| ~ organization(X13) ),
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.02 % Problem : MGT048+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.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:23:44 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_1 with pid 547862 completed with status 0
% 0.14/0.45 % Result found by new_bool_1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 547867 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.001 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 10
% 0.14/0.45 % Removed by relevancy pruning/SinE : 1
% 0.14/0.45 % Initial clauses : 17
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 17
% 0.14/0.45 % Processed clauses : 123
% 0.14/0.45 % ...of these trivial : 0
% 0.14/0.45 % ...subsumed : 51
% 0.14/0.45 % ...remaining for further processing : 72
% 0.14/0.45 % Other redundant clauses eliminated : 1
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 4
% 0.14/0.45 % Backward-rewritten : 0
% 0.14/0.45 % Generated clauses : 467
% 0.14/0.45 % ...of the previous two non-redundant : 429
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 3
% 0.14/0.45 % Paramodulations : 457
% 0.14/0.45 % Factorizations : 8
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 2
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 36
% 0.14/0.45 % ...of those cached : 33
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 67
% 0.14/0.45 % Positive orientable unit clauses : 4
% 0.14/0.45 % Positive unorientable unit clauses: 1
% 0.14/0.45 % Negative unit clauses : 5
% 0.14/0.45 % Non-unit-clauses : 57
% 0.14/0.45 % Current number of unprocessed clauses: 323
% 0.14/0.45 % ...number of literals in the above : 1805
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 4
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 1041
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 780
% 0.14/0.45 % Non-unit clause-clause subsumptions : 49
% 0.14/0.45 % Unit Clause-clause subsumption calls : 22
% 0.14/0.45 % Rewrite failures with RHS unbound : 12
% 0.14/0.45 % BW rewrite match attempts : 0
% 0.14/0.45 % BW rewrite match successes : 0
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 9178
% 0.14/0.45 % Search garbage collected termcells : 256
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.008 s
% 0.14/0.45 % System time : 0.003 s
% 0.14/0.45 % Total time : 0.012 s
% 0.14/0.45 % Maximum resident set size: 3644 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.011 s
% 0.14/0.45 % System time : 0.007 s
% 0.14/0.45 % Total time : 0.018 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------