%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT031-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:26 PM UTC 2026
% Result : Satisfiable 0.14s 0.41s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_20ERROR: Could not build tree for root c_0_26ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_17,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_15,
[final] ).
cnf(c_0_18,plain,
( ~ environment(X1)
| greater_or_equal(appear(first_movers,X1),appear(an_organisation,X1)) ),
c_0_16,
[final] ).
cnf(c_0_23,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_17,c_0_18]),
[final] ).
cnf(c_0_24,negated_conjecture,
environment(sk2),
prove_l13_32,
[final] ).
cnf(c_0_25,negated_conjecture,
appear(an_organisation,sk2) != appear(first_movers,sk2),
c_0_19,
[final] ).
cnf(c_0_26,hypothesis,
( ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| X2 = first_movers
| X2 = efficient_producers ),
c_0_20,
[final] ).
cnf(c_0_27,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| greater(cardinality_at_time(sk1(X2,X1),X2),zero) ),
c_0_21,
[final] ).
cnf(c_0_29,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_22,
[final] ).
cnf(c_0_30,negated_conjecture,
greater(appear(first_movers,sk2),appear(an_organisation,sk2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[final] ).
cnf(c_0_32,plain,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| subpopulation(sk1(X2,X1),X1,X2) ),
c_0_28,
[final] ).
cnf(c_0_35,negated_conjecture,
( ~ greater(X1,appear(first_movers,sk2))
| greater(X1,appear(an_organisation,sk2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_37,hypothesis,
( ~ environment(X2)
| ~ greater(number_of_organizations(X2,X1),zero)
| sk1(X1,X2) = first_movers
| sk1(X1,X2) = efficient_producers ),
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[final] ).
cnf(c_0_38,plain,
( ~ environment(X1)
| greater(number_of_organizations(e,appear(an_organisation,X1)),zero) ),
c_0_33,
[final] ).
cnf(c_0_39,hypothesis,
( ~ environment(X1)
| greater(appear(efficient_producers,e),appear(first_movers,X1)) ),
c_0_34,
[final] ).
cnf(c_0_40,negated_conjecture,
( ~ greater(X1,X2)
| ~ greater(X2,appear(first_movers,sk2))
| greater(X1,appear(an_organisation,sk2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_35]),
[final] ).
cnf(c_0_45,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_37,c_0_38]),
[final] ).
cnf(c_0_46,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_29,c_0_27]),
[final] ).
cnf(c_0_47,plain,
( ~ environment(X2)
| ~ greater(X1,number_of_organizations(e,appear(an_organisation,X2)))
| greater(X1,zero) ),
inference(spm,[status(thm)],[c_0_29,c_0_38]),
[final] ).
cnf(c_0_48,hypothesis,
( ~ environment(X2)
| ~ greater(X1,appear(efficient_producers,e))
| greater(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_39]),
[final] ).
cnf(c_0_49,hypothesis,
( ~ greater(X1,appear(efficient_producers,e))
| greater(X1,appear(an_organisation,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_24])]),
[final] ).
cnf(c_0_50,plain,
( ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(appear(first_movers,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
c_0_41,
[final] ).
cnf(c_0_51,plain,
( ~ greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ greater(appear(efficient_producers,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
c_0_42,
[final] ).
cnf(c_0_52,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
c_0_43,
[final] ).
cnf(c_0_53,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_54,negated_conjecture,
in_environment(sk2,appear(an_organisation,sk2)),
prove_l13_33,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT031-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.09/0.34 % Computer : n005.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:21:47 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2236121 completed with status 1
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2236126 completed with status 1
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41 % Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 % No proof found!
% 0.14/0.41 % SZS status Satisfiable
% 0.14/0.41 % SZS output start Saturation
% See solution above
% 0.14/0.41 % Parsed axioms : 15
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 15
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 15
% 0.14/0.41 % Processed clauses : 42
% 0.14/0.41 % ...of these trivial : 0
% 0.14/0.41 % ...subsumed : 0
% 0.14/0.41 % ...remaining for further processing : 42
% 0.14/0.41 % Other redundant clauses eliminated : 1
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 1
% 0.14/0.41 % Backward-rewritten : 0
% 0.14/0.41 % Generated clauses : 13
% 0.14/0.41 % ...of the previous two non-redundant : 12
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 12
% 0.14/0.41 % Factorizations : 0
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 1
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 1
% 0.14/0.41 % ...of those cached : 0
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 25
% 0.14/0.41 % Positive orientable unit clauses : 4
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 1
% 0.14/0.41 % Non-unit-clauses : 20
% 0.14/0.41 % Current number of unprocessed clauses: 0
% 0.14/0.41 % ...number of literals in the above : 0
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 16
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 50
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 35
% 0.14/0.41 % Non-unit clause-clause subsumptions : 1
% 0.14/0.41 % Unit Clause-clause subsumption calls : 0
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 0
% 0.14/0.41 % BW rewrite match successes : 0
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 1065
% 0.14/0.41 % Search garbage collected termcells : 45
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.004 s
% 0.14/0.41 % System time : 0.004 s
% 0.14/0.41 % Total time : 0.008 s
% 0.14/0.41 % Maximum resident set size: 3608 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.020 s
% 0.14/0.41 % System time : 0.014 s
% 0.14/0.41 % Total time : 0.034 s
% 0.14/0.41 % Maximum resident set size: 4864 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------