%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT038-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:51 PM UTC 2026
% Result : Satisfiable 0.14s 0.43s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_26ERROR: Could not build tree for root c_0_40ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_16,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| greater(sk2(X1),appear(efficient_producers,X1)) ),
c_0_12,
[final] ).
cnf(c_0_17,negated_conjecture,
stable(sk3),
prove_t7_27,
[final] ).
cnf(c_0_18,negated_conjecture,
environment(sk3),
prove_t7_26,
[final] ).
cnf(c_0_19,plain,
( ~ contracts_from(X2,X1)
| ~ finite_set(X1)
| greater(sk1(X2,X1),X2) ),
c_0_13,
[final] ).
cnf(c_0_20,hypothesis,
( ~ stable(X1)
| ~ environment(X1)
| contracts_from(sk2(X1),first_movers) ),
c_0_14,
[final] ).
cnf(c_0_21,axiom,
finite_set(first_movers),
mp7_first_movers_exist_17,
[final] ).
cnf(c_0_23,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_15,
[final] ).
cnf(c_0_24,negated_conjecture,
greater(sk2(sk3),appear(efficient_producers,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[final] ).
cnf(c_0_25,hypothesis,
( ~ environment(X1)
| ~ stable(X1)
| greater(sk1(sk2(X1),first_movers),sk2(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[final] ).
cnf(c_0_27,hypothesis,
( ~ environment(X1)
| greater(appear(efficient_producers,e),appear(first_movers,X1)) ),
c_0_22,
[final] ).
cnf(c_0_29,negated_conjecture,
( ~ greater(X1,sk2(sk3))
| greater(X1,appear(efficient_producers,sk3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[final] ).
cnf(c_0_30,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),sk2(sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18])]),
[final] ).
cnf(c_0_31,plain,
( ~ greater(X3,X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,X3) ),
c_0_26,
[final] ).
cnf(c_0_32,negated_conjecture,
greater(appear(efficient_producers,e),appear(first_movers,sk3)),
inference(spm,[status(thm)],[c_0_27,c_0_18]),
[final] ).
cnf(c_0_35,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3)),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_37,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,appear(first_movers,sk3))
| in_environment(X1,appear(efficient_producers,e)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[final] ).
cnf(c_0_38,plain,
( ~ stable(X1)
| ~ environment(X1)
| in_environment(X1,appear(first_movers,X1)) ),
c_0_33,
[final] ).
cnf(c_0_40,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,appear(efficient_producers,sk3))
| in_environment(X1,sk1(sk2(sk3),first_movers)) ),
inference(spm,[status(thm)],[c_0_31,c_0_35]),
[final] ).
cnf(c_0_41,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,sk2(sk3))
| in_environment(X1,sk1(sk2(sk3),first_movers)) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]),
[final] ).
cnf(c_0_42,negated_conjecture,
( ~ greater(X1,sk1(sk2(sk3),first_movers))
| greater(X1,appear(efficient_producers,sk3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_35]),
[final] ).
cnf(c_0_43,negated_conjecture,
( ~ greater(X1,sk1(sk2(sk3),first_movers))
| greater(X1,sk2(sk3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]),
[final] ).
cnf(c_0_44,negated_conjecture,
( ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,appear(efficient_producers,sk3))
| in_environment(X1,sk2(sk3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]),
[final] ).
cnf(c_0_45,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,e))
| greater(X1,appear(first_movers,sk3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_32]),
[final] ).
cnf(c_0_46,negated_conjecture,
( cardinality_at_time(first_movers,to) != zero
| ~ greater(X1,appear(first_movers,sk3))
| ~ in_environment(sk3,X1) ),
c_0_36,
[final] ).
cnf(c_0_47,negated_conjecture,
in_environment(sk3,appear(efficient_producers,e)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_17]),c_0_18])]),
[final] ).
cnf(c_0_48,negated_conjecture,
cardinality_at_time(s,t2) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_17]),c_0_18])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT038-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.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:22:47 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2239353 completed with status 1
% 0.14/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.43 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.14/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2239359 completed with status 1
% 0.14/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43 % Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 % No proof found!
% 0.14/0.43 % SZS status Satisfiable
% 0.14/0.43 % SZS output start Saturation
% See solution above
% 0.14/0.43 % Parsed axioms : 12
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 12
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 12
% 0.14/0.43 % Processed clauses : 40
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 40
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 2
% 0.14/0.43 % Generated clauses : 16
% 0.14/0.43 % ...of the previous two non-redundant : 16
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 16
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 9
% 0.14/0.43 % ...of those cached : 5
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 26
% 0.14/0.43 % Positive orientable unit clauses : 9
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 0
% 0.14/0.43 % Non-unit-clauses : 17
% 0.14/0.43 % Current number of unprocessed clauses: 0
% 0.14/0.43 % ...number of literals in the above : 0
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 14
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 19
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 12
% 0.14/0.43 % Non-unit clause-clause subsumptions : 0
% 0.14/0.43 % Unit Clause-clause subsumption calls : 8
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 1
% 0.14/0.43 % BW rewrite match successes : 1
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 935
% 0.14/0.43 % Search garbage collected termcells : 41
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.005 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.007 s
% 0.14/0.43 % Maximum resident set size: 3624 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.020 s
% 0.14/0.43 % System time : 0.011 s
% 0.14/0.43 % Total time : 0.031 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------