%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT031-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:27:34 PM UTC 2026
% Result : Satisfiable 0.10s 0.45s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_35ERROR: Could not build tree for root c_0_58ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_18,hypothesis,
( ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| X2 = first_movers
| X2 = efficient_producers ),
c_0_15,
[final] ).
cnf(c_0_19,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| subpopulation(sk1(X2,X1),X1,X2) ),
c_0_16,
[final] ).
cnf(c_0_20,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| greater(cardinality_at_time(sk1(X2,X1),X2),zero) ),
c_0_17,
[final] ).
cnf(c_0_22,hypothesis,
( ~ environment(X2)
| ~ greater(number_of_organizations(X2,X1),zero)
| sk1(X1,X2) = first_movers
| sk1(X1,X2) = efficient_producers ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[final] ).
cnf(c_0_23,plain,
( ~ environment(X1)
| greater(number_of_organizations(e,appear(an_organisation,X1)),zero) ),
c_0_21,
[final] ).
cnf(c_0_24,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| sk1(appear(an_organisation,X1),e) = efficient_producers
| sk1(appear(an_organisation,X1),e) = first_movers ),
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[final] ).
cnf(c_0_26,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| sk1(appear(an_organisation,X1),e) = first_movers ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_23]),
[final] ).
cnf(c_0_27,plain,
( ~ greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ greater(appear(efficient_producers,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
c_0_25,
[final] ).
cnf(c_0_28,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero)
| greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_23]),
[final] ).
cnf(c_0_32,hypothesis,
( ~ environment(X1)
| ~ environment(X2)
| ~ environment(e)
| ~ greater(appear(efficient_producers,X2),appear(an_organisation,X1))
| ~ in_environment(X2,appear(an_organisation,X1))
| greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
cnf(c_0_33,negated_conjecture,
in_environment(sk2,appear(an_organisation,sk2)),
prove_l13_33,
[final] ).
cnf(c_0_34,negated_conjecture,
environment(sk2),
prove_l13_32,
[final] ).
cnf(c_0_36,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_29,
[final] ).
cnf(c_0_37,plain,
( ~ environment(X1)
| greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1)) ),
c_0_30,
[final] ).
cnf(c_0_39,plain,
( ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(appear(first_movers,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
c_0_31,
[final] ).
cnf(c_0_40,negated_conjecture,
( ~ environment(e)
| ~ greater(appear(efficient_producers,sk2),appear(an_organisation,sk2))
| greater(cardinality_at_time(first_movers,appear(an_organisation,sk2)),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[final] ).
cnf(c_0_41,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_35,
[final] ).
cnf(c_0_42,plain,
( ~ environment(X1)
| greater(appear(first_movers,X1),appear(an_organisation,X1))
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]),
[final] ).
cnf(c_0_44,negated_conjecture,
( ~ environment(X1)
| ~ environment(e)
| ~ greater(appear(first_movers,X1),appear(an_organisation,sk2))
| ~ greater(appear(efficient_producers,sk2),appear(an_organisation,sk2))
| ~ in_environment(X1,appear(an_organisation,sk2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[final] ).
cnf(c_0_46,plain,
( ~ environment(X1)
| ~ greater(X2,appear(first_movers,X1))
| greater(X2,appear(an_organisation,X1))
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_50,plain,
( ~ environment(X3)
| ~ greater(number_of_organizations(X3,X2),zero)
| ~ greater(X1,cardinality_at_time(sk1(X2,X3),X2))
| greater(X1,zero) ),
inference(spm,[status(thm)],[c_0_41,c_0_20]),
[final] ).
cnf(c_0_51,negated_conjecture,
( ~ environment(e)
| ~ greater(appear(first_movers,sk2),appear(an_organisation,sk2))
| ~ greater(appear(efficient_producers,sk2),appear(an_organisation,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_34])]),
[final] ).
cnf(c_0_52,negated_conjecture,
appear(an_organisation,sk2) != appear(first_movers,sk2),
c_0_45,
[final] ).
cnf(c_0_53,plain,
( ~ environment(X1)
| ~ greater(X2,X3)
| ~ greater(X3,appear(first_movers,X1))
| greater(X2,appear(an_organisation,X1))
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_46]),
[final] ).
cnf(c_0_54,hypothesis,
( ~ environment(X1)
| greater(appear(efficient_producers,e),appear(first_movers,X1)) ),
c_0_47,
[final] ).
cnf(c_0_58,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| ~ greater(X2,cardinality_at_time(first_movers,appear(an_organisation,X1)))
| greater(X2,zero)
| greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_26]),c_0_23]),
[final] ).
cnf(c_0_59,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| ~ greater(X2,cardinality_at_time(efficient_producers,appear(an_organisation,X1)))
| greater(X2,zero)
| sk1(appear(an_organisation,X1),e) = first_movers ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_24]),c_0_23]),
[final] ).
cnf(c_0_60,negated_conjecture,
( ~ environment(e)
| ~ greater(appear(efficient_producers,sk2),appear(first_movers,sk2))
| ~ greater(appear(first_movers,sk2),appear(an_organisation,sk2)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_46]),c_0_34])]),c_0_52]),
[final] ).
cnf(c_0_61,negated_conjecture,
( ~ environment(e)
| ~ greater(X1,cardinality_at_time(first_movers,appear(an_organisation,sk2)))
| ~ greater(appear(efficient_producers,sk2),appear(an_organisation,sk2))
| greater(X1,zero) ),
inference(spm,[status(thm)],[c_0_41,c_0_40]),
[final] ).
cnf(c_0_62,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| ~ greater(X2,cardinality_at_time(efficient_producers,appear(an_organisation,X1)))
| greater(X2,zero)
| greater(cardinality_at_time(first_movers,appear(an_organisation,X1)),zero) ),
inference(spm,[status(thm)],[c_0_41,c_0_28]),
[final] ).
cnf(c_0_63,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| greater(cardinality_at_time(efficient_producers,appear(an_organisation,X1)),zero)
| subpopulation(first_movers,e,appear(an_organisation,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_23]),
[final] ).
cnf(c_0_64,hypothesis,
( ~ environment(X1)
| ~ environment(e)
| subpopulation(efficient_producers,e,appear(an_organisation,X1))
| sk1(appear(an_organisation,X1),e) = first_movers ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_23]),
[final] ).
cnf(c_0_65,hypothesis,
( ~ environment(X1)
| ~ greater(X2,appear(efficient_producers,e))
| greater(X2,appear(an_organisation,X1))
| appear(an_organisation,X1) = appear(first_movers,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ~ environment(e)
| efficient_producers != first_movers ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_42]),c_0_34])]),c_0_52]),
[final] ).
cnf(c_0_67,plain,
( ~ environment(X2)
| ~ greater(X1,number_of_organizations(e,appear(an_organisation,X2)))
| greater(X1,zero) ),
inference(spm,[status(thm)],[c_0_41,c_0_23]),
[final] ).
cnf(c_0_68,hypothesis,
( ~ environment(X2)
| ~ greater(X1,appear(efficient_producers,e))
| greater(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_54]),
[final] ).
cnf(c_0_69,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
c_0_56,
[final] ).
cnf(c_0_70,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_57]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT031-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.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.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 01:22:54 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4044395 completed with status 1
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 4044399 completed with status 1
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45
% 0.10/0.45 % No proof found!
% 0.10/0.45 % SZS status Satisfiable
% 0.10/0.45 % SZS output start Saturation
% See solution above
% 0.10/0.45 % Parsed axioms : 15
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 15
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 15
% 0.10/0.45 % Processed clauses : 45
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 0
% 0.10/0.45 % ...remaining for further processing : 45
% 0.10/0.45 % Other redundant clauses eliminated : 1
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 6
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 33
% 0.10/0.45 % ...of the previous two non-redundant : 32
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 9
% 0.10/0.45 % Paramodulations : 31
% 0.10/0.45 % Factorizations : 1
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 1
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 6
% 0.10/0.45 % ...of those cached : 5
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 38
% 0.10/0.45 % Positive orientable unit clauses : 3
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 1
% 0.10/0.45 % Non-unit-clauses : 34
% 0.10/0.45 % Current number of unprocessed clauses: 0
% 0.10/0.45 % ...number of literals in the above : 0
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 6
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 479
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 100
% 0.10/0.45 % Non-unit clause-clause subsumptions : 15
% 0.10/0.45 % Unit Clause-clause subsumption calls : 0
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 0
% 0.10/0.45 % BW rewrite match successes : 0
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 1743
% 0.10/0.45 % Search garbage collected termcells : 45
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.006 s
% 0.10/0.45 % System time : 0.001 s
% 0.10/0.45 % Total time : 0.007 s
% 0.10/0.45 % Maximum resident set size: 3592 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.023 s
% 0.10/0.45 % System time : 0.009 s
% 0.10/0.45 % Total time : 0.032 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------