%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT020-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 : n020.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:03 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 9 unt; 11 nHn; 45 RR)
% Number of literals : 134 ( 9 equ; 85 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_times_in_order_28,axiom,
( ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_times_in_order_28) ).
cnf(mp_initial_time_27,axiom,
( ~ environment(X1)
| greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_initial_time_27) ).
cnf(mp_greater_or_equal_30,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_30) ).
cnf(mp_earliest_time_point_24,axiom,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater_or_equal(X2,initial_FM_EP(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point_24) ).
cnf(mp_positive_function_difference_25,axiom,
( ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater_or_equal(X4,X2)
| ~ greater_or_equal(X2,X3)
| ~ environment(X1)
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_positive_function_difference_25) ).
cnf(a8_31,hypothesis,
( ~ environment(X1)
| greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a8_31) ).
cnf(mp_time_point_occurs_26,axiom,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occurs_26) ).
cnf(prove_l2_35,negated_conjecture,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2_35) ).
cnf(prove_l2_34,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2_34) ).
cnf(prove_l2_33,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l2_33) ).
cnf(l3_22,axiom,
( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_22) ).
cnf(mp_earliest_time_point_23,axiom,
( ~ in_environment(X1,initial_FM_EP(X1))
| ~ environment(X1)
| subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_earliest_time_point_23) ).
cnf(c_0_12,plain,
( ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_times_in_order_28]) ).
cnf(c_0_13,plain,
( ~ environment(X1)
| greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
inference(fof_simplification,[status(thm)],[mp_initial_time_27]) ).
cnf(c_0_14,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_30]) ).
cnf(c_0_15,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater_or_equal(X2,initial_FM_EP(X1)) ),
inference(fof_simplification,[status(thm)],[mp_earliest_time_point_24]) ).
cnf(c_0_16,plain,
( ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater_or_equal(X4,X2)
| ~ greater_or_equal(X2,X3)
| ~ environment(X1)
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
inference(fof_simplification,[status(thm)],[mp_positive_function_difference_25]) ).
cnf(c_0_17,hypothesis,
( ~ environment(X1)
| greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
inference(fof_simplification,[status(thm)],[a8_31]) ).
cnf(c_0_18,plain,
( ~ in_environment(X1,X3)
| ~ greater(X3,X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_12 ).
cnf(c_0_19,plain,
( ~ environment(X1)
| greater_or_equal(initial_FM_EP(X1),start_time(X1)) ),
c_0_13 ).
cnf(c_0_20,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_14 ).
cnf(c_0_21,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| greater_or_equal(X2,initial_FM_EP(X1)) ),
c_0_15 ).
cnf(c_0_22,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_time_point_occurs_26]) ).
cnf(c_0_23,plain,
( ~ greater(disbanding_rate(first_movers,X3),disbanding_rate(efficient_producers,X3))
| ~ subpopulations(first_movers,efficient_producers,X1,X4)
| ~ greater_or_equal(X4,X2)
| ~ greater_or_equal(X2,X3)
| ~ environment(X1)
| greater(disbanding_rate(first_movers,X4),disbanding_rate(efficient_producers,X4))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2))) ),
c_0_16 ).
cnf(c_0_24,hypothesis,
( ~ environment(X1)
| greater(disbanding_rate(first_movers,initial_FM_EP(X1)),disbanding_rate(efficient_producers,initial_FM_EP(X1))) ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
inference(fof_simplification,[status(thm)],[prove_l2_35]) ).
cnf(c_0_26,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(X2,initial_FM_EP(X1))
| in_environment(X1,initial_FM_EP(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| greater(X1,initial_FM_EP(X2))
| X1 = initial_FM_EP(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_22 ).
cnf(c_0_29,hypothesis,
( ~ environment(X3)
| ~ environment(X4)
| ~ subpopulations(first_movers,efficient_producers,X4,X1)
| ~ greater_or_equal(X1,X2)
| ~ greater_or_equal(X2,initial_FM_EP(X3))
| decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_l2_34 ).
cnf(c_0_31,negated_conjecture,
environment(sk1),
prove_l2_33 ).
cnf(c_0_32,negated_conjecture,
~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)),
c_0_25 ).
cnf(c_0_33,plain,
( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(fof_simplification,[status(thm)],[l3_22]) ).
cnf(c_0_34,plain,
( ~ in_environment(X1,initial_FM_EP(X1))
| ~ environment(X1)
| subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) ),
inference(fof_simplification,[status(thm)],[mp_earliest_time_point_23]) ).
cnf(c_0_35,plain,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| in_environment(X2,initial_FM_EP(X2))
| X1 = initial_FM_EP(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( ~ environment(X2)
| ~ greater_or_equal(sk2,X1)
| ~ greater_or_equal(X1,initial_FM_EP(X2))
| decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_37,plain,
( ~ decreases(difference(disbanding_rate(first_movers,X2),disbanding_rate(efficient_producers,X2)))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
c_0_33 ).
cnf(c_0_38,plain,
( ~ in_environment(X1,initial_FM_EP(X1))
| ~ environment(X1)
| subpopulations(first_movers,efficient_producers,X1,initial_FM_EP(X1)) ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
( in_environment(sk1,initial_FM_EP(sk1))
| initial_FM_EP(sk1) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
( ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ greater_or_equal(sk2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1))
| initial_FM_EP(sk1) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
( ~ greater_or_equal(sk2,initial_FM_EP(sk1))
| initial_FM_EP(sk1) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
initial_FM_EP(sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_21]),c_0_30]),c_0_31])]) ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT020-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:22:03 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1687954 completed with status 0
% 0.14/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1687960 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 14
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 14
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 14
% 0.14/0.44 % Processed clauses : 61
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 3
% 0.14/0.44 % ...remaining for further processing : 58
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 12
% 0.14/0.44 % Backward-rewritten : 16
% 0.14/0.44 % Generated clauses : 78
% 0.14/0.44 % ...of the previous two non-redundant : 66
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 2
% 0.14/0.44 % Paramodulations : 78
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 65
% 0.14/0.44 % ...of those cached : 62
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 30
% 0.14/0.44 % Positive orientable unit clauses : 3
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 2
% 0.14/0.44 % Non-unit-clauses : 25
% 0.14/0.44 % Current number of unprocessed clauses: 17
% 0.14/0.44 % ...number of literals in the above : 98
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 28
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 373
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 132
% 0.14/0.44 % Non-unit clause-clause subsumptions : 17
% 0.14/0.44 % Unit Clause-clause subsumption calls : 22
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 1
% 0.14/0.44 % BW rewrite match successes : 1
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 2732
% 0.14/0.44 % Search garbage collected termcells : 57
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.005 s
% 0.14/0.44 % System time : 0.006 s
% 0.14/0.44 % Total time : 0.011 s
% 0.14/0.44 % Maximum resident set size: 3644 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.033 s
% 0.14/0.44 % System time : 0.018 s
% 0.14/0.44 % Total time : 0.051 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------