%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT022+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 101 ( 39 ~; 33 |; 15 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_l4,conjecture,
! [X2,X5] :
( ( subpopulations(first_movers,efficient_producers,X2,X5)
& environment(X2) )
=> ( ( constant(resources(X2,X5))
=> ~ decreases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) )
& ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l4) ).
fof(a5,hypothesis,
! [X2,X3,X4,X5] :
( ( greater(resilience(X4),resilience(X3))
& subpopulations(X3,X4,X2,X5)
& environment(X2) )
=> ( ( constant(resources(X2,X5))
=> constant(difference(disbanding_rate(X3,X5),disbanding_rate(X4,X5))) )
& ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(X3,X5),disbanding_rate(X4,X5))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5) ).
fof(mp_constant_not_decrease,axiom,
! [X1] :
( constant(X1)
=> ~ decreases(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_constant_not_decrease) ).
fof(a2,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2) ).
fof(c_0_4,negated_conjecture,
~ ! [X2,X5] :
( ( subpopulations(first_movers,efficient_producers,X2,X5)
& environment(X2) )
=> ( ( constant(resources(X2,X5))
=> ~ decreases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) )
& ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) ) ) ),
inference(assume_negation,[status(cth)],[prove_l4]) ).
fof(c_0_5,hypothesis,
! [X7,X8,X9,X10] :
( ( ~ greater(resilience(X9),resilience(X8))
| ~ subpopulations(X8,X9,X7,X10)
| ~ environment(X7)
| constant(difference(disbanding_rate(X8,X10),disbanding_rate(X9,X10)))
| ~ constant(resources(X7,X10)) )
& ( ~ greater(resilience(X9),resilience(X8))
| ~ subpopulations(X8,X9,X7,X10)
| ~ environment(X7)
| increases(difference(disbanding_rate(X8,X10),disbanding_rate(X9,X10)))
| ~ decreases(resources(X7,X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X5] :
( ( subpopulations(first_movers,efficient_producers,X2,X5)
& environment(X2) )
=> ( ( constant(resources(X2,X5))
=> ~ decreases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) )
& ( decreases(resources(X2,X5))
=> increases(difference(disbanding_rate(first_movers,X5),disbanding_rate(efficient_producers,X5))) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X1] :
( constant(X1)
=> ~ decreases(X1) ),
inference(fof_simplification,[status(thm)],[mp_constant_not_decrease]) ).
cnf(c_0_8,hypothesis,
( ~ greater(resilience(X4),resilience(X3))
| ~ subpopulations(X3,X4,X1,X2)
| ~ environment(X1)
| ~ constant(resources(X1,X2))
| constant(difference(disbanding_rate(X3,X2),disbanding_rate(X4,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[a2]) ).
fof(c_0_10,negated_conjecture,
( ( ~ increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) )
& ( ~ increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| constant(resources(esk1_0,esk2_0)) )
& ( decreases(resources(esk1_0,esk2_0))
| decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) )
& ( decreases(resources(esk1_0,esk2_0))
| constant(resources(esk1_0,esk2_0)) )
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& environment(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_11,plain,
! [X6] :
( ~ decreases(X6)
| ~ constant(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,hypothesis,
( ~ constant(resources(X2,X1))
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| constant(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ decreases(X1)
| ~ constant(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ constant(resources(esk1_0,esk2_0))
| constant(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,hypothesis,
( ~ greater(resilience(X4),resilience(X3))
| ~ subpopulations(X3,X4,X1,X2)
| ~ environment(X1)
| ~ decreases(resources(X1,X2))
| increases(difference(disbanding_rate(X3,X2),disbanding_rate(X4,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ constant(resources(esk1_0,esk2_0))
| ~ decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( decreases(resources(esk1_0,esk2_0))
| decreases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( decreases(resources(esk1_0,esk2_0))
| constant(resources(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,hypothesis,
( ~ decreases(resources(X2,X1))
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| increases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
decreases(resources(esk1_0,esk2_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0)))
| constant(resources(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
increases(difference(disbanding_rate(first_movers,esk2_0),disbanding_rate(efficient_producers,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_14])]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
constant(resources(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT022+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n014.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:21:34 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.40 Running first-order theorem proving
% 0.14/0.40 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.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2851400 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2851406 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHNF-FFSS21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42 % Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 4
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 10
% 0.14/0.42 % Removed in clause preprocessing : 0
% 0.14/0.42 % Initial clauses in saturation : 10
% 0.14/0.42 % Processed clauses : 27
% 0.14/0.42 % ...of these trivial : 0
% 0.14/0.42 % ...subsumed : 0
% 0.14/0.42 % ...remaining for further processing : 27
% 0.14/0.42 % Other redundant clauses eliminated : 0
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 0
% 0.14/0.42 % Backward-rewritten : 6
% 0.14/0.42 % Generated clauses : 8
% 0.14/0.42 % ...of the previous two non-redundant : 10
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 1
% 0.14/0.42 % Paramodulations : 8
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 0
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 10
% 0.14/0.42 % ...of those cached : 6
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 11
% 0.14/0.42 % Positive orientable unit clauses : 6
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 0
% 0.14/0.42 % Non-unit-clauses : 5
% 0.14/0.42 % Current number of unprocessed clauses: 1
% 0.14/0.42 % ...number of literals in the above : 1
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 16
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 43
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 12
% 0.14/0.42 % Non-unit clause-clause subsumptions : 1
% 0.14/0.42 % Unit Clause-clause subsumption calls : 1
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 5
% 0.14/0.42 % BW rewrite match successes : 3
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 987
% 0.14/0.42 % Search garbage collected termcells : 144
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.004 s
% 0.14/0.42 % System time : 0.002 s
% 0.14/0.42 % Total time : 0.007 s
% 0.14/0.42 % Maximum resident set size: 3636 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.016 s
% 0.14/0.42 % System time : 0.009 s
% 0.14/0.42 % Total time : 0.024 s
% 0.14/0.42 % Maximum resident set size: 4864 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------