%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT041+2 : 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 : n003.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:28:00 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 73 ( 32 ~; 19 |; 20 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 32 ( 1 sgn 14 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t10,conjecture,
? [X1,X2] :
( ~ efficient_producer(X1)
& ~ first_mover(X1)
& organisation_at_time(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10) ).
fof(a16,hypothesis,
? [X1,X2] :
( ~ has_elaborated_routines(X1,X2)
& number_of_routines(X1,X2,high)
& founding_time(X1,X2)
& organisation_at_time(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16) ).
fof(a14,hypothesis,
! [X1,X2] :
( ( founding_time(X1,X2)
& efficient_producer(X1)
& organisation_at_time(X1,X2) )
=> has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14) ).
fof(a15,hypothesis,
! [X1,X2] :
( ( founding_time(X1,X2)
& first_mover(X1)
& organisation_at_time(X1,X2) )
=> number_of_routines(X1,X2,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15) ).
fof(mp_not_high_and_low,axiom,
! [X1,X2] :
~ ( number_of_routines(X1,X2,high)
& number_of_routines(X1,X2,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( ~ efficient_producer(X1)
& ~ first_mover(X1)
& organisation_at_time(X1,X2) ),
inference(assume_negation,[status(cth)],[prove_t10]) ).
fof(c_0_6,negated_conjecture,
~ ? [X1,X2] :
( ~ efficient_producer(X1)
& ~ first_mover(X1)
& organisation_at_time(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,hypothesis,
? [X1,X2] :
( ~ has_elaborated_routines(X1,X2)
& number_of_routines(X1,X2,high)
& founding_time(X1,X2)
& organisation_at_time(X1,X2) ),
inference(fof_simplification,[status(thm)],[a16]) ).
fof(c_0_8,negated_conjecture,
! [X11,X12] :
( efficient_producer(X11)
| first_mover(X11)
| ~ organisation_at_time(X11,X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,hypothesis,
( ~ has_elaborated_routines(esk1_0,esk2_0)
& number_of_routines(esk1_0,esk2_0,high)
& founding_time(esk1_0,esk2_0)
& organisation_at_time(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,hypothesis,
! [X5,X6] :
( has_elaborated_routines(X5,X6)
| ~ founding_time(X5,X6)
| ~ efficient_producer(X5)
| ~ organisation_at_time(X5,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a14])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ organisation_at_time(X1,X2)
| efficient_producer(X1)
| first_mover(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
organisation_at_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
~ has_elaborated_routines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( ~ founding_time(X1,X2)
| ~ efficient_producer(X1)
| ~ organisation_at_time(X1,X2)
| has_elaborated_routines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
founding_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,hypothesis,
! [X7,X8] :
( number_of_routines(X7,X8,low)
| ~ founding_time(X7,X8)
| ~ first_mover(X7)
| ~ organisation_at_time(X7,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a15])])]) ).
cnf(c_0_17,hypothesis,
( efficient_producer(esk1_0)
| first_mover(esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,hypothesis,
~ efficient_producer(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12])]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ number_of_routines(X3,X4,high)
| ~ number_of_routines(X3,X4,low) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_not_high_and_low])])]) ).
cnf(c_0_20,hypothesis,
( ~ founding_time(X1,X2)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2)
| number_of_routines(X1,X2,low) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
first_mover(esk1_0),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,hypothesis,
number_of_routines(esk1_0,esk2_0,low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]),c_0_12])]) ).
cnf(c_0_24,hypothesis,
number_of_routines(esk1_0,esk2_0,high),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 01:24:16 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3095410 completed with status 0
% 0.12/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 3095414 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 5
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 8
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 8
% 0.12/0.44 % Processed clauses : 12
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 0
% 0.12/0.44 % ...remaining for further processing : 12
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 0
% 0.12/0.44 % Generated clauses : 5
% 0.12/0.44 % ...of the previous two non-redundant : 4
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 4
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 5
% 0.12/0.44 % ...of those cached : 1
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 11
% 0.12/0.44 % Positive orientable unit clauses : 5
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 2
% 0.12/0.44 % Non-unit-clauses : 4
% 0.12/0.44 % Current number of unprocessed clauses: 0
% 0.12/0.44 % ...number of literals in the above : 0
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 1
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.44 % Non-unit clause-clause subsumptions : 0
% 0.12/0.44 % Unit Clause-clause subsumption calls : 4
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 1
% 0.12/0.44 % BW rewrite match successes : 0
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 598
% 0.12/0.44 % Search garbage collected termcells : 102
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.004 s
% 0.12/0.44 % System time : 0.002 s
% 0.12/0.44 % Total time : 0.006 s
% 0.12/0.44 % Maximum resident set size: 3632 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.008 s
% 0.12/0.44 % System time : 0.010 s
% 0.12/0.44 % Total time : 0.017 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------