%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT038+1 : TPTP v9.3.1. Bugfixed v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:51 PM UTC 2026
% Result : CounterSatisfiable 0.11s 0.44s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_8ERROR: Could not build tree for root c_0_37ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_12,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
cnf(c_0_13,hypothesis,
( ~ environment(X1)
| greater(appear(efficient_producers,X1),appear(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
cnf(c_0_15,plain,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
cnf(c_0_16,plain,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(first_movers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
cnf(c_0_17,hypothesis,
( ~ environment(X2)
| ~ greater(X1,appear(efficient_producers,X2))
| greater(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]),
[final] ).
cnf(c_0_18,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(esk2_1(X1),appear(efficient_producers,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_20,plain,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(X2,appear(first_movers,X1))
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
cnf(c_0_21,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk2_1(X1),appear(first_movers,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[final] ).
cnf(c_0_22,plain,
( ~ contracts_from(X2,X1)
| ~ finite_set(X1)
| greater(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_23,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| contracts_from(esk2_1(X1),first_movers) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
cnf(c_0_24,plain,
finite_set(first_movers),
inference(split_conjunct,[status(thm)],[mp7_first_movers_exist]),
[final] ).
cnf(c_0_25,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| in_environment(X1,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
cnf(c_0_26,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk2_1(X2))
| greater(X1,appear(efficient_producers,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]),
[final] ).
cnf(c_0_27,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk1_2(first_movers,esk2_1(X1)),esk2_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[final] ).
cnf(c_0_28,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk2_1(X2))
| greater(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]),
[final] ).
cnf(c_0_29,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(X2,esk2_1(X1))
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]),
[final] ).
cnf(c_0_31,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk1_2(first_movers,esk2_1(X1)),appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]),
[final] ).
cnf(c_0_32,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(esk1_2(first_movers,esk2_1(X1)),appear(first_movers,X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]),
[final] ).
cnf(c_0_33,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| in_environment(X1,esk1_2(first_movers,esk2_1(X1))) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]),
[final] ).
cnf(c_0_34,plain,
( ~ contracts_from(X2,X1)
| ~ finite_set(X1)
| cardinality_at_time(s,esk1_2(X1,X2)) = zero ),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
cnf(c_0_35,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| in_environment(X1,appear(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]),
[final] ).
cnf(c_0_37,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| greater(X1,appear(efficient_producers,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_31]),
[final] ).
cnf(c_0_38,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| greater(X1,appear(first_movers,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_32]),
[final] ).
cnf(c_0_39,hypothesis,
( ~ environment(X2)
| ~ stable(X2)
| ~ greater(X1,esk1_2(first_movers,esk2_1(X2)))
| greater(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]),
[final] ).
cnf(c_0_40,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(X2,esk1_2(first_movers,esk2_1(X1)))
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]),
[final] ).
cnf(c_0_41,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| cardinality_at_time(s,esk1_2(first_movers,esk2_1(X1))) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_24])]),
[final] ).
cnf(c_0_42,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| ~ greater(X2,appear(efficient_producers,X1))
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_35]),
[final] ).
cnf(c_0_43,negated_conjecture,
( cardinality_at_time(first_movers,X1) != zero
| ~ greater(X1,appear(first_movers,esk3_0))
| ~ in_environment(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_44,negated_conjecture,
stable(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_45,negated_conjecture,
environment(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT038+1 : TPTP v9.3.1. Bugfixed v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:23:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3950937 completed with status 1
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % new_bool_3 with pid 3950946 completed with status 1
% 0.11/0.44 % Result found by new_bool_3
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44 % Presaturation interreduction done
% 0.11/0.44
% 0.11/0.44 % No proof found!
% 0.11/0.44 % SZS status CounterSatisfiable
% 0.11/0.44 % SZS output start Saturation
% See solution above
% 0.11/0.44 % Parsed axioms : 8
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 12
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 12
% 0.11/0.44 % Processed clauses : 46
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 4
% 0.11/0.44 % ...remaining for further processing : 42
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 22
% 0.11/0.44 % ...of the previous two non-redundant : 22
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 22
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 2
% 0.11/0.44 % ...of those cached : 1
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 30
% 0.11/0.44 % Positive orientable unit clauses : 3
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 0
% 0.11/0.44 % Non-unit-clauses : 27
% 0.11/0.44 % Current number of unprocessed clauses: 0
% 0.11/0.44 % ...number of literals in the above : 0
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 12
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 70
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 50
% 0.11/0.44 % Non-unit clause-clause subsumptions : 4
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 0
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 1648
% 0.11/0.44 % Search garbage collected termcells : 203
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.003 s
% 0.11/0.44 % System time : 0.005 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3640 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.014 s
% 0.11/0.44 % System time : 0.014 s
% 0.11/0.44 % Total time : 0.028 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------