%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT040+1 : 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 : n019.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.16s 5.67s
% Output : Saturation 0.16s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_43ERROR: Could not build tree for root c_0_53ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_21,plain,
( ~ greater_or_equal(end_time(X1),appear(an_organisation,X1))
| ~ environment(X1)
| in_environment(X1,appear(an_organisation,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]),
[final] ).
cnf(c_0_22,plain,
( ~ environment(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
cnf(c_0_24,plain,
propagation_strategy(first_movers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets1]),
[final] ).
cnf(c_0_25,plain,
propagation_strategy(efficient_producers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets2]),
[final] ).
cnf(c_0_29,plain,
( ~ environment(X1)
| in_environment(X1,appear(an_organisation,X1))
| empty(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[final] ).
cnf(c_0_30,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_23,c_0_24]),c_0_25])]),
[final] ).
cnf(c_0_33,plain,
( ~ empty(X2)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1)
| extreme(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_34,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_24]),c_0_25])]),
[final] ).
cnf(c_0_35,hypothesis,
( ~ in_environment(X1,appear(an_organisation,X1))
| ~ environment(X1)
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_36,plain,
( ~ observational_period(X1)
| in_environment(esk2_1(X1),appear(an_organisation,esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| empty(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_41,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_33,c_0_34]),c_0_30]),
[final] ).
cnf(c_0_42,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| empty(esk2_1(X1))
| appear(an_organisation,esk2_1(X1)) = appear(first_movers,esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30]),
[final] ).
cnf(c_0_45,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_39]),
[final] ).
cnf(c_0_46,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_40]),
[final] ).
cnf(c_0_47,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1)
| appear(an_organisation,esk2_1(X1)) = appear(first_movers,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_48,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_43]),
[final] ).
cnf(c_0_49,plain,
( ~ environment(X1)
| greater(critical_point(X1),end_time(X1))
| in_environment(X1,critical_point(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_50,hypothesis,
( ~ environment(X2)
| ~ in_environment(X2,X1)
| ~ greater_or_equal(X1,appear(first_movers,X2))
| selection_favors(first_movers,efficient_producers,X1)
| greater_or_equal(X1,appear(efficient_producers,X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]),
[final] ).
cnf(c_0_51,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1)
| greater_or_equal(end_time(esk2_1(X1)),appear(first_movers,esk2_1(X1))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_47]),c_0_30]),c_0_41]),
[final] ).
cnf(c_0_53,plain,
( ~ environment(X1)
| ~ greater_or_equal(end_time(X1),appear(efficient_producers,X1))
| in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]),
[final] ).
cnf(c_0_54,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(esk2_1(X1)))
| extreme(X1)
| greater_or_equal(end_time(esk2_1(X1)),appear(efficient_producers,esk2_1(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_30]),
[final] ).
cnf(c_0_58,plain,
( ~ environment(X1)
| in_environment(X1,end_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_55]),
[final] ).
cnf(c_0_61,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_56]),
[final] ).
cnf(c_0_62,hypothesis,
( ~ observational_period(X1)
| in_environment(esk2_1(X1),critical_point(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(esk2_1(X1)))
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_30]),
[final] ).
cnf(c_0_63,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]),
[final] ).
cnf(c_0_66,hypothesis,
( ~ observational_period(X1)
| ~ observational_period(X2)
| ~ in_environment(X2,esk2_1(X1))
| ~ rapid_change(X2)
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(esk2_1(X1)))
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_30]),
[final] ).
cnf(c_0_67,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(appear(efficient_producers,X1),X2)
| ~ greater_or_equal(X2,appear(first_movers,X1))
| selection_favors(first_movers,efficient_producers,X2)
| appear(efficient_producers,X1) = X2 ),
inference(spm,[status(thm)],[c_0_45,c_0_63]),
[final] ).
cnf(c_0_68,hypothesis,
( ~ observational_period(X1)
| in_environment(esk2_1(X1),appear(first_movers,esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_47]),c_0_41]),
[final] ).
cnf(c_0_69,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_64]),
[final] ).
cnf(c_0_72,hypothesis,
( ~ observational_period(X1)
| ~ observational_period(esk2_1(X1))
| ~ environment(critical_point(esk2_1(X1)))
| ~ empty(critical_point(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(esk2_1(X1)))
| extreme(X1)
| extreme(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_62]),
[final] ).
cnf(c_0_73,hypothesis,
( ~ observational_period(X1)
| ~ rapid_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(esk2_1(X1)))
| extreme(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_34]),
[final] ).
cnf(c_0_74,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| ~ greater_or_equal(appear(efficient_producers,esk2_1(X1)),end_time(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(esk2_1(X1)))
| extreme(X1)
| end_time(esk2_1(X1)) = appear(efficient_producers,esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_51]),c_0_30]),
[final] ).
cnf(c_0_75,plain,
( ~ observational_period(X1)
| ~ observational_period(esk2_1(X1))
| ~ environment(appear(an_organisation,esk2_1(X1)))
| ~ empty(appear(an_organisation,esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(esk2_1(X1))
| empty(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_36]),
[final] ).
cnf(c_0_76,hypothesis,
( ~ observational_period(X1)
| ~ observational_period(esk2_1(X1))
| ~ environment(appear(first_movers,esk2_1(X1)))
| ~ empty(appear(first_movers,esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1)
| extreme(esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_68]),
[final] ).
cnf(c_0_77,plain,
( ~ environment(X1)
| ~ greater_or_equal(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| in_environment(X1,critical_point(X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| critical_point(X1) = X2 ),
inference(spm,[status(thm)],[c_0_48,c_0_63]),
[final] ).
cnf(c_0_78,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,critical_point(X1))
| ~ greater_or_equal(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| selection_favors(first_movers,efficient_producers,X2)
| critical_point(X1) = X2 ),
inference(spm,[status(thm)],[c_0_69,c_0_63]),
[final] ).
cnf(c_0_79,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_70,c_0_24]),c_0_25])]),
[final] ).
cnf(c_0_80,plain,
( ~ observational_period(X1)
| ~ environment(X1)
| ~ environment(end_time(X1))
| ~ empty(end_time(X1))
| extreme(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_58]),
[final] ).
cnf(c_0_81,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_71]),
[final] ).
cnf(c_0_82,negated_conjecture,
~ extreme(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_71]),
[final] ).
cnf(c_0_83,negated_conjecture,
rapid_change(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_71]),
[final] ).
cnf(c_0_84,negated_conjecture,
observational_period(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_71]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT040+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.59 % Computer : n019.cluster.edu
% 0.13/5.59 % Model : x86_64 x86_64
% 0.13/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.59 % Memory : 8046.5625MB
% 0.13/5.59 % OS : Linux 6.8.0-71-generic
% 0.13/5.59 % CPULimit : 300
% 0.13/5.59 % WCLimit : 300
% 0.13/5.59 % DateTime : Mon Sep 21 01:22:56 UTC 2026
% 0.13/5.59 % CPUTime :
% 0.13/5.60 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.64 Running first-order theorem proving
% 0.16/5.64 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.16/5.67 % Version: 3.5.1
% 0.16/5.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.67 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.67 % Starting sh5l with 300s (1) cores
% 0.16/5.67 % new_bool_3 with pid 1393133 completed with status 1
% 0.16/5.67 % Result found by new_bool_3
% 0.16/5.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.67 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/5.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.67 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.67 % SubtermCWHack with pid 1393138 completed with status 1
% 0.16/5.67 % Result found by SubtermCWHack
% 0.16/5.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.67 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.67 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.16/5.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.67 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.67 % Preprocessing time : 0.001 s
% 0.16/5.67
% 0.16/5.67 % No proof found!
% 0.16/5.67 % SZS status CounterSatisfiable
% 0.16/5.67 % SZS output start Saturation
% See solution above
% 0.16/5.67 % Parsed axioms : 16
% 0.16/5.67 % Removed by relevancy pruning/SinE : 0
% 0.16/5.67 % Initial clauses : 22
% 0.16/5.67 % Removed in clause preprocessing : 0
% 0.16/5.67 % Initial clauses in saturation : 22
% 0.16/5.67 % Processed clauses : 46
% 0.16/5.67 % ...of these trivial : 0
% 0.16/5.67 % ...subsumed : 3
% 0.16/5.67 % ...remaining for further processing : 43
% 0.16/5.67 % Other redundant clauses eliminated : 0
% 0.16/5.67 % Clauses deleted for lack of memory : 0
% 0.16/5.67 % Backward-subsumed : 1
% 0.16/5.67 % Backward-rewritten : 0
% 0.16/5.67 % Generated clauses : 25
% 0.16/5.67 % ...of the previous two non-redundant : 24
% 0.16/5.67 % ...aggressively subsumed : 0
% 0.16/5.67 % Contextual simplify-reflections : 10
% 0.16/5.67 % Paramodulations : 25
% 0.16/5.67 % Factorizations : 0
% 0.16/5.67 % NegExts : 0
% 0.16/5.67 % Equation resolutions : 0
% 0.16/5.67 % Disequality decompositions : 0
% 0.16/5.67 % Total rewrite steps : 6
% 0.16/5.67 % ...of those cached : 4
% 0.16/5.67 % Propositional unsat checks : 0
% 0.16/5.67 % Propositional check models : 0
% 0.16/5.67 % Propositional check unsatisfiable : 0
% 0.16/5.67 % Propositional clauses : 0
% 0.16/5.67 % Propositional clauses after purity: 0
% 0.16/5.67 % Propositional unsat core size : 0
% 0.16/5.67 % Propositional preprocessing time : 0.000
% 0.16/5.67 % Propositional encoding time : 0.000
% 0.16/5.67 % Propositional solver time : 0.000
% 0.16/5.67 % Success case prop preproc time : 0.000
% 0.16/5.67 % Success case prop encoding time : 0.000
% 0.16/5.67 % Success case prop solver time : 0.000
% 0.16/5.67 % Current number of processed clauses : 42
% 0.16/5.67 % Positive orientable unit clauses : 4
% 0.16/5.67 % Positive unorientable unit clauses: 0
% 0.16/5.67 % Negative unit clauses : 2
% 0.16/5.67 % Non-unit-clauses : 36
% 0.16/5.67 % Current number of unprocessed clauses: 0
% 0.16/5.67 % ...number of literals in the above : 0
% 0.16/5.67 % Current number of archived formulas : 0
% 0.16/5.67 % Current number of archived clauses : 1
% 0.16/5.67 % Clause-clause subsumption calls (NU) : 692
% 0.16/5.67 % Rec. Clause-clause subsumption calls : 68
% 0.16/5.67 % Non-unit clause-clause subsumptions : 14
% 0.16/5.67 % Unit Clause-clause subsumption calls : 0
% 0.16/5.67 % Rewrite failures with RHS unbound : 0
% 0.16/5.67 % BW rewrite match attempts : 0
% 0.16/5.67 % BW rewrite match successes : 0
% 0.16/5.67 % Condensation attempts : 0
% 0.16/5.67 % Condensation successes : 0
% 0.16/5.67 % Termbank termtop insertions : 3364
% 0.16/5.67 % Search garbage collected termcells : 389
% 0.16/5.67
% 0.16/5.67 % -------------------------------------------------
% 0.16/5.67 % User time : 0.006 s
% 0.16/5.67 % System time : 0.004 s
% 0.16/5.67 % Total time : 0.010 s
% 0.16/5.67 % Maximum resident set size: 3648 pages
% 0.16/5.67
% 0.16/5.67 % -------------------------------------------------
% 0.16/5.67 % User time : 0.007 s
% 0.16/5.67 % System time : 0.009 s
% 0.16/5.67 % Total time : 0.016 s
% 0.16/5.67 % Maximum resident set size: 4608 pages
% 0.16/5.67 % E exiting
%------------------------------------------------------------------------------