%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT040-2 : 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 : n009.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 : Satisfiable 0.12s 0.41s
% Output : Saturation 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_40ERROR: Could not build tree for root c_0_59ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_22,axiom,
propagation_strategy(first_movers),
mp_organizational_sets1_28,
[final] ).
cnf(c_0_23,axiom,
propagation_strategy(efficient_producers),
mp_organizational_sets2_29,
[final] ).
cnf(c_0_28,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_21,c_0_22]),c_0_23])]),
[final] ).
cnf(c_0_29,negated_conjecture,
observational_period(sk2),
prove_t9_39,
[final] ).
cnf(c_0_31,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_24,c_0_22]),c_0_23])]),
[final] ).
cnf(c_0_32,plain,
( ~ in_environment(X1,X2)
| greater_or_equal(X2,appear(efficient_producers,X1))
| greater(appear(efficient_producers,X1),X2) ),
c_0_25,
[final] ).
cnf(c_0_33,plain,
( ~ environment(X1)
| in_environment(X1,end_time(X1)) ),
c_0_26,
[final] ).
cnf(c_0_36,plain,
( ~ empty(X2)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1)
| extreme(X1) ),
c_0_27,
[final] ).
cnf(c_0_37,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| in_environment(sk2,sk1(sk2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[final] ).
cnf(c_0_38,negated_conjecture,
~ extreme(sk2),
c_0_30,
[final] ).
cnf(c_0_39,negated_conjecture,
( environment(sk1(sk2))
| selection_favors(efficient_producers,first_movers,sk2) ),
inference(spm,[status(thm)],[c_0_31,c_0_29]),
[final] ).
cnf(c_0_41,plain,
( ~ environment(X1)
| greater(appear(efficient_producers,X1),end_time(X1))
| greater_or_equal(end_time(X1),appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[final] ).
cnf(c_0_42,plain,
( ~ environment(X1)
| greater(critical_point(X1),end_time(X1))
| in_environment(X1,critical_point(X1)) ),
c_0_34,
[final] ).
cnf(c_0_45,plain,
( ~ environment(X1)
| greater_or_equal(end_time(X1),appear(an_organisation,X1))
| empty(X1) ),
c_0_35,
[final] ).
cnf(c_0_46,negated_conjecture,
( ~ empty(sk1(sk2))
| selection_favors(efficient_producers,first_movers,sk2) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29])]),c_0_38]),c_0_39]),
[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_40,
[final] ).
cnf(c_0_49,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| greater(appear(efficient_producers,sk1(sk2)),end_time(sk1(sk2)))
| greater_or_equal(end_time(sk1(sk2)),appear(efficient_producers,sk1(sk2))) ),
inference(spm,[status(thm)],[c_0_41,c_0_39]),
[final] ).
cnf(c_0_50,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| in_environment(sk1(sk2),critical_point(sk1(sk2)))
| greater(critical_point(sk1(sk2)),end_time(sk1(sk2))) ),
inference(spm,[status(thm)],[c_0_42,c_0_39]),
[final] ).
cnf(c_0_51,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_43,
[final] ).
cnf(c_0_52,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_44,
[final] ).
cnf(c_0_53,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| greater_or_equal(end_time(sk1(sk2)),appear(an_organisation,sk1(sk2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_46]),
[final] ).
cnf(c_0_54,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| greater(appear(efficient_producers,sk2),sk1(sk2))
| greater_or_equal(sk1(sk2),appear(efficient_producers,sk2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_37]),
[final] ).
cnf(c_0_59,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| selection_favors(first_movers,efficient_producers,end_time(sk1(sk2)))
| in_environment(sk1(sk2),critical_point(sk1(sk2)))
| greater(appear(efficient_producers,sk1(sk2)),end_time(sk1(sk2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_39]),c_0_50]),
[final] ).
cnf(c_0_60,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| greater(end_time(sk1(sk2)),appear(efficient_producers,sk1(sk2)))
| greater(appear(efficient_producers,sk1(sk2)),end_time(sk1(sk2)))
| end_time(sk1(sk2)) = appear(efficient_producers,sk1(sk2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_49]),
[final] ).
cnf(c_0_61,hypothesis,
( ~ in_environment(sk1(sk2),critical_point(sk1(sk2)))
| ~ greater(critical_point(sk1(sk2)),end_time(sk1(sk2)))
| selection_favors(efficient_producers,first_movers,sk2)
| selection_favors(first_movers,efficient_producers,end_time(sk1(sk2)))
| greater(appear(efficient_producers,sk1(sk2)),end_time(sk1(sk2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_49]),c_0_39]),
[final] ).
cnf(c_0_62,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| greater(end_time(sk1(sk2)),appear(an_organisation,sk1(sk2)))
| end_time(sk1(sk2)) = appear(an_organisation,sk1(sk2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_53]),
[final] ).
cnf(c_0_63,negated_conjecture,
( ~ environment(sk2)
| ~ greater(critical_point(sk2),sk1(sk2))
| selection_favors(efficient_producers,first_movers,sk2)
| selection_favors(first_movers,efficient_producers,end_time(sk2))
| in_environment(sk2,critical_point(sk2))
| greater(appear(efficient_producers,sk2),sk1(sk2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_54]),
[final] ).
cnf(c_0_64,negated_conjecture,
( selection_favors(efficient_producers,first_movers,sk2)
| greater(sk1(sk2),appear(efficient_producers,sk2))
| greater(appear(efficient_producers,sk2),sk1(sk2))
| sk1(sk2) = appear(efficient_producers,sk2) ),
inference(spm,[status(thm)],[c_0_51,c_0_54]),
[final] ).
cnf(c_0_65,hypothesis,
( ~ environment(sk2)
| ~ in_environment(sk2,critical_point(sk2))
| ~ greater(critical_point(sk2),sk1(sk2))
| selection_favors(efficient_producers,first_movers,sk2)
| selection_favors(first_movers,efficient_producers,sk1(sk2))
| greater(appear(efficient_producers,sk2),sk1(sk2)) ),
inference(spm,[status(thm)],[c_0_52,c_0_54]),
[final] ).
cnf(c_0_66,plain,
( ~ observational_period(X1)
| ~ environment(X1)
| ~ environment(end_time(X1))
| ~ empty(end_time(X1))
| extreme(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_33]),
[final] ).
cnf(c_0_67,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_55,
[final] ).
cnf(c_0_68,plain,
( ~ in_environment(X2,critical_point(X2))
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ rapid_change(X1)
| ~ observational_period(X1) ),
c_0_56,
[final] ).
cnf(c_0_69,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_57,c_0_22]),c_0_23])]),
[final] ).
cnf(c_0_70,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk2),
c_0_58,
[final] ).
cnf(c_0_71,negated_conjecture,
rapid_change(sk2),
prove_t9_40,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT040-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.34 % Computer : n009.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Sep 21 01:22:42 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.41 % Version: 3.5.1
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 % Starting sh5l with 300s (1) cores
% 0.12/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 546186 completed with status 1
% 0.12/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.12/0.41 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 546191 completed with status 1
% 0.12/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41 % Preprocessing time : 0.001 s
% 0.12/0.41 % Presaturation interreduction done
% 0.12/0.41
% 0.12/0.41 % No proof found!
% 0.12/0.41 % SZS status Satisfiable
% 0.12/0.41 % SZS output start Saturation
% See solution above
% 0.12/0.41 % Parsed axioms : 20
% 0.12/0.41 % Removed by relevancy pruning/SinE : 0
% 0.12/0.41 % Initial clauses : 20
% 0.12/0.41 % Removed in clause preprocessing : 0
% 0.12/0.41 % Initial clauses in saturation : 20
% 0.12/0.41 % Processed clauses : 55
% 0.12/0.41 % ...of these trivial : 0
% 0.12/0.41 % ...subsumed : 1
% 0.12/0.41 % ...remaining for further processing : 54
% 0.12/0.41 % Other redundant clauses eliminated : 0
% 0.12/0.41 % Clauses deleted for lack of memory : 0
% 0.12/0.41 % Backward-subsumed : 0
% 0.12/0.41 % Backward-rewritten : 0
% 0.12/0.41 % Generated clauses : 16
% 0.12/0.41 % ...of the previous two non-redundant : 16
% 0.12/0.41 % ...aggressively subsumed : 0
% 0.12/0.41 % Contextual simplify-reflections : 5
% 0.12/0.41 % Paramodulations : 16
% 0.12/0.41 % Factorizations : 0
% 0.12/0.41 % NegExts : 0
% 0.12/0.41 % Equation resolutions : 0
% 0.12/0.41 % Disequality decompositions : 0
% 0.12/0.41 % Total rewrite steps : 7
% 0.12/0.41 % ...of those cached : 4
% 0.12/0.41 % Propositional unsat checks : 0
% 0.12/0.41 % Propositional check models : 0
% 0.12/0.41 % Propositional check unsatisfiable : 0
% 0.12/0.41 % Propositional clauses : 0
% 0.12/0.41 % Propositional clauses after purity: 0
% 0.12/0.41 % Propositional unsat core size : 0
% 0.12/0.41 % Propositional preprocessing time : 0.000
% 0.12/0.41 % Propositional encoding time : 0.000
% 0.12/0.41 % Propositional solver time : 0.000
% 0.12/0.41 % Success case prop preproc time : 0.000
% 0.12/0.41 % Success case prop encoding time : 0.000
% 0.12/0.41 % Success case prop solver time : 0.000
% 0.12/0.41 % Current number of processed clauses : 35
% 0.12/0.41 % Positive orientable unit clauses : 4
% 0.12/0.41 % Positive unorientable unit clauses: 0
% 0.12/0.41 % Negative unit clauses : 2
% 0.12/0.41 % Non-unit-clauses : 29
% 0.12/0.41 % Current number of unprocessed clauses: 0
% 0.12/0.41 % ...number of literals in the above : 0
% 0.12/0.41 % Current number of archived formulas : 0
% 0.12/0.41 % Current number of archived clauses : 19
% 0.12/0.41 % Clause-clause subsumption calls (NU) : 506
% 0.12/0.41 % Rec. Clause-clause subsumption calls : 93
% 0.12/0.41 % Non-unit clause-clause subsumptions : 6
% 0.12/0.41 % Unit Clause-clause subsumption calls : 0
% 0.12/0.41 % Rewrite failures with RHS unbound : 0
% 0.12/0.41 % BW rewrite match attempts : 0
% 0.12/0.41 % BW rewrite match successes : 0
% 0.12/0.41 % Condensation attempts : 0
% 0.12/0.41 % Condensation successes : 0
% 0.12/0.41 % Termbank termtop insertions : 1531
% 0.12/0.41 % Search garbage collected termcells : 66
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.006 s
% 0.12/0.41 % System time : 0.001 s
% 0.12/0.41 % Total time : 0.007 s
% 0.12/0.41 % Maximum resident set size: 3652 pages
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.019 s
% 0.12/0.41 % System time : 0.011 s
% 0.12/0.41 % Total time : 0.030 s
% 0.12/0.41 % Maximum resident set size: 4864 pages
% 0.12/0.41 % E exiting
%------------------------------------------------------------------------------