%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT033-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 : n016.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:27 PM UTC 2026
% Result : Satisfiable 0.10s 0.44s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_20ERROR: Could not build tree for root c_0_28ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_22,plain,
( ~ greater_or_equal(X4,X2)
| ~ greater_or_equal(X3,X4)
| ~ in_environment(X1,X3)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| in_environment(X1,X4) ),
c_0_20,
[final] ).
cnf(c_0_23,plain,
( ~ environment(X1)
| greater_or_equal(appear(first_movers,X1),start_time(X1)) ),
c_0_21,
[final] ).
cnf(c_0_25,plain,
( ~ environment(X2)
| ~ environment(X1)
| ~ in_environment(X1,X3)
| ~ in_environment(X1,start_time(X2))
| ~ greater_or_equal(X3,appear(first_movers,X2))
| in_environment(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[final] ).
cnf(c_0_26,plain,
( ~ environment(X1)
| in_environment(X1,start_time(X1)) ),
c_0_24,
[final] ).
cnf(c_0_28,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(first_movers,X1))
| in_environment(X1,appear(first_movers,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
cnf(c_0_30,negated_conjecture,
in_environment(sk2,sk3),
prove_t2_40,
[final] ).
cnf(c_0_31,negated_conjecture,
environment(sk2),
prove_t2_39,
[final] ).
cnf(c_0_33,plain,
( ~ in_environment(X1,appear(first_movers,X1))
| ~ environment(X1)
| in_environment(X1,appear(an_organisation,X1)) ),
c_0_27,
[final] ).
cnf(c_0_35,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_36,negated_conjecture,
in_environment(sk2,appear(an_organisation,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]),
[final] ).
cnf(c_0_40,hypothesis,
appear(first_movers,sk2) = appear(an_organisation,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31])]),
[final] ).
cnf(c_0_41,hypothesis,
( ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| X2 = first_movers
| X2 = efficient_producers ),
c_0_37,
[final] ).
cnf(c_0_42,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| greater(cardinality_at_time(sk1(X2,X1),X2),zero) ),
c_0_38,
[final] ).
cnf(c_0_43,hypothesis,
( ~ greater_or_equal(X2,appear(an_organisation,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
c_0_39,
[final] ).
cnf(c_0_44,negated_conjecture,
greater_or_equal(sk3,appear(an_organisation,sk2)),
inference(rw,[status(thm)],[c_0_29,c_0_40]),
[final] ).
cnf(c_0_46,hypothesis,
( ~ environment(X2)
| ~ environment(X3)
| ~ subpopulation(sk1(X1,X2),X3,X1)
| ~ greater(number_of_organizations(X2,X1),zero)
| sk1(X1,X2) = first_movers
| sk1(X1,X2) = efficient_producers ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_47,hypothesis,
greater(number_of_organizations(sk2,sk3),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_30]),c_0_31])]),
[final] ).
cnf(c_0_48,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| subpopulation(sk1(X2,X1),X1,X2) ),
c_0_45,
[final] ).
cnf(c_0_51,hypothesis,
subpopulation(sk1(sk3,sk2),sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_47]),c_0_31])]),
[final] ).
cnf(c_0_54,plain,
( ~ greater(appear(X3,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| cardinality_at_time(X3,X2) = zero ),
c_0_49,
[final] ).
cnf(c_0_55,negated_conjecture,
greater(appear(efficient_producers,sk2),sk3),
prove_t2_42,
[final] ).
cnf(c_0_56,hypothesis,
( sk1(sk3,sk2) = first_movers
| sk1(sk3,sk2) = efficient_producers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_31])]),
[final] ).
cnf(c_0_57,negated_conjecture,
~ selection_favors(first_movers,efficient_producers,sk3),
c_0_52,
[final] ).
cnf(c_0_58,plain,
( cardinality_at_time(X4,X3) != zero
| ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X4,X1,X3)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| selection_favors(X2,X4,X3) ),
c_0_53,
[final] ).
cnf(c_0_59,negated_conjecture,
cardinality_at_time(efficient_producers,sk3) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_30]),c_0_31])]),
[final] ).
cnf(c_0_63,negated_conjecture,
( ~ environment(X1)
| ~ subpopulation(first_movers,X1,sk3)
| ~ subpopulation(efficient_producers,X1,sk3)
| ~ greater(cardinality_at_time(first_movers,sk3),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
[final] ).
cnf(c_0_65,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
c_0_61,
[final] ).
cnf(c_0_66,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
c_0_62,
[final] ).
cnf(c_0_67,hypothesis,
greater_or_equal(appear(an_organisation,sk2),start_time(sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_40]),c_0_31])]),
[final] ).
cnf(c_0_68,hypothesis,
( ~ greater(appear(an_organisation,sk2),X1)
| ~ in_environment(sk2,X1)
| cardinality_at_time(first_movers,X1) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_40]),c_0_31])]),
[final] ).
cnf(c_0_73,negated_conjecture,
subpopulation(efficient_producers,sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_30]),c_0_31])]),
[final] ).
cnf(c_0_74,negated_conjecture,
subpopulation(first_movers,sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_30]),c_0_31])]),
[final] ).
cnf(c_0_75,plain,
( ~ environment(X1)
| subpopulation(efficient_producers,X1,start_time(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_26]),
[final] ).
cnf(c_0_76,plain,
( ~ environment(X1)
| subpopulation(first_movers,X1,start_time(X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_26]),
[final] ).
cnf(c_0_77,hypothesis,
( greater(zero,zero)
| sk1(sk3,sk2) = first_movers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_56]),c_0_59]),c_0_47]),c_0_31])]),
[final] ).
cnf(c_0_78,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ in_environment(X1,start_time(sk2))
| ~ greater_or_equal(X2,appear(an_organisation,sk2))
| in_environment(X1,appear(an_organisation,sk2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_67]),
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ greater(appear(an_organisation,sk2),appear(an_organisation,sk2))
| cardinality_at_time(first_movers,appear(an_organisation,sk2)) = zero ),
inference(spm,[status(thm)],[c_0_68,c_0_36]),
[final] ).
cnf(c_0_80,hypothesis,
( ~ greater(appear(an_organisation,sk2),start_time(sk2))
| cardinality_at_time(first_movers,start_time(sk2)) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_26]),c_0_31])]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ~ greater(appear(an_organisation,sk2),sk3)
| cardinality_at_time(first_movers,sk3) = zero ),
inference(spm,[status(thm)],[c_0_68,c_0_30]),
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ in_environment(X1,appear(an_organisation,sk2))
| ~ greater_or_equal(X2,sk3)
| in_environment(X1,sk3) ),
inference(rw,[status(thm)],[c_0_69,c_0_40]),
[final] ).
cnf(c_0_83,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_70,
[final] ).
cnf(c_0_84,plain,
( ~ greater(cardinality_at_time(X1,X2),zero)
| cardinality_at_time(X1,t) != zero ),
c_0_71,
[final] ).
cnf(c_0_85,negated_conjecture,
efficient_producers != first_movers,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_31]),c_0_73]),c_0_74])]),
[final] ).
cnf(c_0_86,negated_conjecture,
subpopulation(efficient_producers,sk2,appear(an_organisation,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_36]),c_0_31])]),
[final] ).
cnf(c_0_87,negated_conjecture,
subpopulation(first_movers,sk2,appear(an_organisation,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_36]),c_0_31])]),
[final] ).
cnf(c_0_88,negated_conjecture,
subpopulation(efficient_producers,sk2,start_time(sk2)),
inference(spm,[status(thm)],[c_0_75,c_0_31]),
[final] ).
cnf(c_0_89,negated_conjecture,
subpopulation(first_movers,sk2,start_time(sk2)),
inference(spm,[status(thm)],[c_0_76,c_0_31]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT033-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:26:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1270923 completed with status 1
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.10/0.44 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 1270930 completed with status 1
% 0.10/0.44 % Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44 % Presaturation interreduction done
% 0.10/0.44
% 0.10/0.44 % No proof found!
% 0.10/0.44 % SZS status Satisfiable
% 0.10/0.44 % SZS output start Saturation
% See solution above
% 0.10/0.44 % Parsed axioms : 20
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 20
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 20
% 0.10/0.44 % Processed clauses : 75
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 1
% 0.10/0.44 % ...remaining for further processing : 74
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 4
% 0.10/0.44 % Backward-rewritten : 3
% 0.10/0.44 % Generated clauses : 41
% 0.10/0.44 % ...of the previous two non-redundant : 37
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 40
% 0.10/0.44 % Factorizations : 1
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 43
% 0.10/0.44 % ...of those cached : 35
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 47
% 0.10/0.44 % Positive orientable unit clauses : 16
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 2
% 0.10/0.44 % Non-unit-clauses : 29
% 0.10/0.44 % Current number of unprocessed clauses: 0
% 0.10/0.44 % ...number of literals in the above : 0
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 27
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 206
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 38
% 0.10/0.44 % Non-unit clause-clause subsumptions : 2
% 0.10/0.44 % Unit Clause-clause subsumption calls : 31
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 7
% 0.10/0.44 % BW rewrite match successes : 1
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 1879
% 0.10/0.44 % Search garbage collected termcells : 67
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.002 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.008 s
% 0.10/0.44 % Maximum resident set size: 3652 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.016 s
% 0.10/0.44 % System time : 0.016 s
% 0.10/0.44 % Total time : 0.031 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------