%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT041-2 : 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 : n014.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:52 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.54s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 13 unt; 4 nHn; 26 RR)
% Number of literals : 54 ( 0 equ; 31 neg)
% Maximal clause size : 4 ( 2 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 : 24 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_t10_8,negated_conjecture,
( ~ organisation_at_time(X1,X2)
| efficient_producer(X1)
| first_mover(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10_8) ).
cnf(a16_7,hypothesis,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_7) ).
cnf(a14_2,hypothesis,
( ~ 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_2) ).
cnf(a16_4,hypothesis,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_4) ).
cnf(a16_5,hypothesis,
founding_time(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_5) ).
cnf(a15_3,hypothesis,
( ~ 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_3) ).
cnf(mp_not_high_and_low_1,axiom,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
cnf(a16_6,hypothesis,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_6) ).
cnf(c_0_8,negated_conjecture,
( ~ organisation_at_time(X1,X2)
| efficient_producer(X1)
| first_mover(X1) ),
inference(fof_simplification,[status(thm)],[prove_t10_8]) ).
cnf(c_0_9,hypothesis,
~ has_elaborated_routines(sk1,sk2),
inference(fof_simplification,[status(thm)],[a16_7]) ).
cnf(c_0_10,hypothesis,
( ~ founding_time(X1,X2)
| ~ efficient_producer(X1)
| ~ organisation_at_time(X1,X2)
| has_elaborated_routines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a14_2]) ).
cnf(c_0_11,negated_conjecture,
( ~ organisation_at_time(X1,X2)
| efficient_producer(X1)
| first_mover(X1) ),
c_0_8 ).
cnf(c_0_12,hypothesis,
organisation_at_time(sk1,sk2),
a16_4 ).
cnf(c_0_13,hypothesis,
~ has_elaborated_routines(sk1,sk2),
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) ),
c_0_10 ).
cnf(c_0_15,hypothesis,
founding_time(sk1,sk2),
a16_5 ).
cnf(c_0_16,hypothesis,
( ~ founding_time(X1,X2)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2)
| number_of_routines(X1,X2,low) ),
inference(fof_simplification,[status(thm)],[a15_3]) ).
cnf(c_0_17,hypothesis,
( efficient_producer(sk1)
| first_mover(sk1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,hypothesis,
~ efficient_producer(sk1),
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])]) ).
cnf(c_0_19,plain,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
inference(fof_simplification,[status(thm)],[mp_not_high_and_low_1]) ).
cnf(c_0_20,hypothesis,
( ~ founding_time(X1,X2)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2)
| number_of_routines(X1,X2,low) ),
c_0_16 ).
cnf(c_0_21,hypothesis,
first_mover(sk1),
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) ),
c_0_19 ).
cnf(c_0_23,hypothesis,
number_of_routines(sk1,sk2,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(sk1,sk2,high),
a16_6 ).
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.05 % Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n014.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 01:23:35 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 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.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % new_bool_3 with pid 2856625 completed with status 0
% 0.26/0.54 % Result found by new_bool_3
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.54 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.26/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54 % SubtermCWHack with pid 2856628 completed with status 0
% 0.26/0.54 % Result found by SubtermCWHack
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.54 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.26/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54 % Preprocessing time : 0.001 s
% 0.26/0.54
% 0.26/0.54 % Proof found!
% 0.26/0.54 % SZS status Unsatisfiable
% 0.26/0.54 % SZS output start CNFRefutation
% See solution above
% 0.26/0.54 % Parsed axioms : 8
% 0.26/0.54 % Removed by relevancy pruning/SinE : 0
% 0.26/0.54 % Initial clauses : 8
% 0.26/0.54 % Removed in clause preprocessing : 0
% 0.26/0.54 % Initial clauses in saturation : 8
% 0.26/0.54 % Processed clauses : 12
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 0
% 0.26/0.54 % ...remaining for further processing : 12
% 0.26/0.54 % Other redundant clauses eliminated : 0
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 0
% 0.26/0.54 % Backward-rewritten : 0
% 0.26/0.54 % Generated clauses : 5
% 0.26/0.54 % ...of the previous two non-redundant : 4
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 0
% 0.26/0.54 % Paramodulations : 4
% 0.26/0.54 % Factorizations : 0
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 0
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 5
% 0.26/0.54 % ...of those cached : 1
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 11
% 0.26/0.54 % Positive orientable unit clauses : 5
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 2
% 0.26/0.54 % Non-unit-clauses : 4
% 0.26/0.54 % Current number of unprocessed clauses: 0
% 0.26/0.54 % ...number of literals in the above : 0
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 1
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.54 % Non-unit clause-clause subsumptions : 0
% 0.26/0.54 % Unit Clause-clause subsumption calls : 4
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 1
% 0.26/0.54 % BW rewrite match successes : 0
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 260
% 0.26/0.54 % Search garbage collected termcells : 19
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.002 s
% 0.26/0.54 % System time : 0.002 s
% 0.26/0.54 % Total time : 0.004 s
% 0.26/0.54 % Maximum resident set size: 3632 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.003 s
% 0.26/0.54 % System time : 0.006 s
% 0.26/0.54 % Total time : 0.009 s
% 0.26/0.54 % Maximum resident set size: 4608 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------