%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT040+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 : n018.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 : CounterSatisfiable 0.13s 0.43s
% Output : Saturation 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_17ERROR: Could not build tree for root c_0_52ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_25,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_26,plain,
( ~ in_environment(X1,X2)
| greater_or_equal(X2,appear(efficient_producers,X1))
| greater(appear(efficient_producers,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_28,plain,
propagation_strategy(first_movers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets1]),
[final] ).
cnf(c_0_29,plain,
propagation_strategy(efficient_producers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets2]),
[final] ).
cnf(c_0_30,plain,
( ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ greater(critical_point(X1),X2)
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,end_time(X1))
| in_environment(X1,critical_point(X1)) ),
inference(cn,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_39,plain,
( ~ in_environment(X2,X1)
| greater(X1,appear(efficient_producers,X2))
| greater(appear(efficient_producers,X2),X1)
| X1 = appear(efficient_producers,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_40,plain,
( ~ observational_period(X1)
| in_environment(X1,esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_41,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(critical_point(X1),X2)
| in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| greater(appear(efficient_producers,X1),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]),
[final] ).
cnf(c_0_42,plain,
( ~ environment(X1)
| greater(critical_point(X1),end_time(X1))
| in_environment(X1,critical_point(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_43,plain,
( ~ environment(X1)
| in_environment(X1,end_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_44,hypothesis,
( ~ greater(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,critical_point(X1))
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]),
[final] ).
cnf(c_0_46,plain,
( ~ environment(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_48,plain,
( ~ empty(X2)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1)
| extreme(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_49,plain,
( ~ observational_period(X1)
| environment(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_52,plain,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| greater(appear(efficient_producers,X1),esk2_1(X1))
| greater(esk2_1(X1),appear(efficient_producers,X1))
| esk2_1(X1) = appear(efficient_producers,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[final] ).
cnf(c_0_53,plain,
( ~ environment(X1)
| in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| greater(appear(efficient_producers,X1),end_time(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
[final] ).
cnf(c_0_54,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ in_environment(X1,critical_point(X1))
| ~ greater(critical_point(X1),X2)
| selection_favors(first_movers,efficient_producers,X2)
| greater(appear(efficient_producers,X1),X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_26]),
[final] ).
cnf(c_0_55,plain,
( ~ environment(X1)
| greater(appear(efficient_producers,X1),end_time(X1))
| greater(end_time(X1),appear(efficient_producers,X1))
| end_time(X1) = appear(efficient_producers,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_43]),
[final] ).
cnf(c_0_56,hypothesis,
( ~ greater(appear(efficient_producers,X1),X2)
| ~ greater_or_equal(X2,appear(first_movers,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_57,plain,
( ~ environment(X1)
| empty(X1)
| greater(end_time(X1),appear(an_organisation,X1))
| end_time(X1) = appear(an_organisation,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_46]),
[final] ).
cnf(c_0_58,plain,
( ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_59,plain,
( ~ observational_period(X1)
| ~ empty(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_40]),c_0_49]),
[final] ).
cnf(c_0_60,plain,
( ~ in_environment(X2,critical_point(X2))
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ rapid_change(X1)
| ~ observational_period(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]),
[final] ).
cnf(c_0_61,plain,
( ~ observational_period(X1)
| ~ environment(X1)
| ~ environment(end_time(X1))
| ~ empty(end_time(X1))
| extreme(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_43]),
[final] ).
cnf(c_0_62,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_51]),
[final] ).
cnf(c_0_63,negated_conjecture,
~ extreme(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_51]),
[final] ).
cnf(c_0_64,negated_conjecture,
rapid_change(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_51]),
[final] ).
cnf(c_0_65,negated_conjecture,
observational_period(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_51]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT040+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.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:24:44 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % sh5l with pid 668980 completed with status 1
% 0.13/0.43 % Result found by sh5l
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.43 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 668981 completed with status 1
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.43 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % No proof found!
% 0.13/0.43 % SZS status CounterSatisfiable
% 0.13/0.43 % SZS output start Saturation
% See solution above
% 0.13/0.43 % Parsed axioms : 14
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 20
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 20
% 0.13/0.43 % Processed clauses : 29
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 1
% 0.13/0.43 % ...remaining for further processing : 28
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 9
% 0.13/0.43 % ...of the previous two non-redundant : 9
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 2
% 0.13/0.43 % Paramodulations : 9
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 6
% 0.13/0.43 % ...of those cached : 4
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 28
% 0.13/0.43 % Positive orientable unit clauses : 4
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 2
% 0.13/0.43 % Non-unit-clauses : 22
% 0.13/0.43 % Current number of unprocessed clauses: 0
% 0.13/0.43 % ...number of literals in the above : 0
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 0
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 188
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 52
% 0.13/0.43 % Non-unit clause-clause subsumptions : 3
% 0.13/0.43 % Unit Clause-clause subsumption calls : 0
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 0
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 2361
% 0.13/0.43 % Search garbage collected termcells : 365
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.007 s
% 0.13/0.43 % System time : 0.001 s
% 0.13/0.43 % Total time : 0.008 s
% 0.13/0.43 % Maximum resident set size: 3644 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.009 s
% 0.13/0.43 % System time : 0.005 s
% 0.13/0.43 % Total time : 0.014 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------