%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT040-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 : Satisfiable 0.15s 0.43s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_43ERROR: Could not build tree for root c_0_52ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_25,plain,
( ~ greater_or_equal(end_time(X1),appear(an_organisation,X1))
| ~ environment(X1)
| in_environment(X1,appear(an_organisation,X1)) ),
c_0_21,
[final] ).
cnf(c_0_26,plain,
( ~ environment(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| empty(X1) ),
c_0_22,
[final] ).
cnf(c_0_28,axiom,
propagation_strategy(first_movers),
mp_organizational_sets1_28,
[final] ).
cnf(c_0_29,axiom,
propagation_strategy(efficient_producers),
mp_organizational_sets2_29,
[final] ).
cnf(c_0_33,plain,
( ~ environment(X1)
| in_environment(X1,appear(an_organisation,X1))
| empty(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_34,plain,
( ~ observational_period(X1)
| environment(sk1(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_35,plain,
( ~ empty(X2)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1)
| extreme(X1) ),
c_0_30,
[final] ).
cnf(c_0_36,plain,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,sk1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_37,hypothesis,
( ~ in_environment(X1,appear(an_organisation,X1))
| ~ environment(X1)
| appear(an_organisation,X1) = appear(first_movers,X1) ),
c_0_32,
[final] ).
cnf(c_0_38,plain,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(sk1(X1),appear(an_organisation,sk1(X1)))
| empty(sk1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[final] ).
cnf(c_0_41,plain,
( ~ observational_period(X1)
| ~ empty(sk1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]),
[final] ).
cnf(c_0_42,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| empty(sk1(X1))
| appear(an_organisation,sk1(X1)) = appear(first_movers,sk1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]),
[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) ),
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) ),
c_0_40,
[final] ).
cnf(c_0_47,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1)
| appear(an_organisation,sk1(X1)) = appear(first_movers,sk1(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_48,plain,
( ~ greater(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| selection_favors(first_movers,efficient_producers,end_time(X1))
| in_environment(X1,critical_point(X1)) ),
c_0_43,
[final] ).
cnf(c_0_49,plain,
( ~ environment(X1)
| greater(critical_point(X1),end_time(X1))
| in_environment(X1,critical_point(X1)) ),
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(sk1(X1)),appear(first_movers,sk1(X1))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_47]),c_0_34]),c_0_41]),
[final] ).
cnf(c_0_52,plain,
( ~ environment(X1)
| ~ greater_or_equal(end_time(X1),appear(efficient_producers,X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]),
[final] ).
cnf(c_0_53,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(sk1(X1),end_time(sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(sk1(X1)))
| extreme(X1)
| greater_or_equal(end_time(sk1(X1)),appear(efficient_producers,sk1(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]),
[final] ).
cnf(c_0_57,plain,
( ~ environment(X1)
| in_environment(X1,end_time(X1)) ),
c_0_54,
[final] ).
cnf(c_0_59,plain,
( ~ in_environment(X2,critical_point(X2))
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ rapid_change(X1)
| ~ observational_period(X1) ),
c_0_55,
[final] ).
cnf(c_0_60,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(sk1(X1)))
| in_environment(sk1(X1),critical_point(sk1(X1)))
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_34]),
[final] ).
cnf(c_0_61,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_58,
[final] ).
cnf(c_0_64,hypothesis,
( ~ observational_period(X1)
| ~ observational_period(X2)
| ~ in_environment(X2,sk1(X1))
| ~ rapid_change(X2)
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(sk1(X1)))
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_34]),
[final] ).
cnf(c_0_65,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_61]),
[final] ).
cnf(c_0_66,hypothesis,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(sk1(X1),appear(first_movers,sk1(X1)))
| extreme(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_47]),c_0_41]),
[final] ).
cnf(c_0_67,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) ),
c_0_62,
[final] ).
cnf(c_0_71,hypothesis,
( ~ observational_period(X1)
| ~ observational_period(sk1(X1))
| ~ environment(critical_point(sk1(X1)))
| ~ empty(critical_point(sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(sk1(X1)))
| extreme(X1)
| extreme(sk1(X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_60]),
[final] ).
cnf(c_0_72,hypothesis,
( ~ observational_period(X1)
| ~ rapid_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(sk1(X1)))
| extreme(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_36]),
[final] ).
cnf(c_0_73,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(sk1(X1),end_time(sk1(X1)))
| ~ greater_or_equal(appear(efficient_producers,sk1(X1)),end_time(sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| selection_favors(first_movers,efficient_producers,end_time(sk1(X1)))
| extreme(X1)
| end_time(sk1(X1)) = appear(efficient_producers,sk1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_51]),c_0_34]),
[final] ).
cnf(c_0_74,plain,
( ~ observational_period(X1)
| ~ observational_period(sk1(X1))
| ~ environment(appear(an_organisation,sk1(X1)))
| ~ empty(appear(an_organisation,sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(sk1(X1))
| empty(sk1(X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_38]),
[final] ).
cnf(c_0_75,hypothesis,
( ~ observational_period(X1)
| ~ observational_period(sk1(X1))
| ~ environment(appear(first_movers,sk1(X1)))
| ~ empty(appear(first_movers,sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| extreme(X1)
| extreme(sk1(X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_66]),
[final] ).
cnf(c_0_76,plain,
( ~ environment(X1)
| ~ greater_or_equal(critical_point(X1),X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| selection_favors(first_movers,efficient_producers,end_time(X1))
| in_environment(X1,critical_point(X1))
| critical_point(X1) = X2 ),
inference(spm,[status(thm)],[c_0_48,c_0_61]),
[final] ).
cnf(c_0_77,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_67,c_0_61]),
[final] ).
cnf(c_0_78,plain,
( ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_79,plain,
( ~ observational_period(X1)
| ~ environment(X1)
| ~ environment(end_time(X1))
| ~ empty(end_time(X1))
| extreme(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_57]),
[final] ).
cnf(c_0_80,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk2),
c_0_69,
[final] ).
cnf(c_0_81,negated_conjecture,
~ extreme(sk2),
c_0_70,
[final] ).
cnf(c_0_82,negated_conjecture,
rapid_change(sk2),
prove_t9_42,
[final] ).
cnf(c_0_83,negated_conjecture,
observational_period(sk2),
prove_t9_41,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT040-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.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:22:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % sh5l with pid 2238571 completed with status 1
% 0.15/0.43 % Result found by sh5l
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 2238578 completed with status 1
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.43 % Preprocessing time : 0.002 s
% 0.15/0.43
% 0.15/0.43 % No proof found!
% 0.15/0.43 % SZS status Satisfiable
% 0.15/0.43 % SZS output start Saturation
% See solution above
% 0.15/0.43 % Parsed axioms : 22
% 0.15/0.43 % Removed by relevancy pruning/SinE : 0
% 0.15/0.43 % Initial clauses : 22
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 22
% 0.15/0.43 % Processed clauses : 46
% 0.15/0.43 % ...of these trivial : 0
% 0.15/0.43 % ...subsumed : 3
% 0.15/0.43 % ...remaining for further processing : 43
% 0.15/0.43 % Other redundant clauses eliminated : 0
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 1
% 0.15/0.43 % Backward-rewritten : 0
% 0.15/0.43 % Generated clauses : 25
% 0.15/0.43 % ...of the previous two non-redundant : 24
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 10
% 0.15/0.43 % Paramodulations : 25
% 0.15/0.43 % Factorizations : 0
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 0
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 6
% 0.15/0.43 % ...of those cached : 4
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 42
% 0.15/0.43 % Positive orientable unit clauses : 4
% 0.15/0.43 % Positive unorientable unit clauses: 0
% 0.15/0.43 % Negative unit clauses : 2
% 0.15/0.43 % Non-unit-clauses : 36
% 0.15/0.43 % Current number of unprocessed clauses: 0
% 0.15/0.43 % ...number of literals in the above : 0
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 1
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 779
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 73
% 0.15/0.43 % Non-unit clause-clause subsumptions : 14
% 0.15/0.43 % Unit Clause-clause subsumption calls : 0
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 0
% 0.15/0.43 % BW rewrite match successes : 0
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 2237
% 0.15/0.43 % Search garbage collected termcells : 72
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.009 s
% 0.15/0.43 % System time : 0.002 s
% 0.15/0.43 % Total time : 0.011 s
% 0.15/0.43 % Maximum resident set size: 3652 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.011 s
% 0.15/0.43 % System time : 0.007 s
% 0.15/0.43 % Total time : 0.018 s
% 0.15/0.43 % Maximum resident set size: 4608 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------