TSTP Solution File: MGT032+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:09:55 EDT 2022
% Result : Theorem 0.20s 1.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 85 ( 34 ~; 28 |; 16 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t1,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X5) )
=> selection_favors(efficient_producers,first_movers,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_t1) ).
fof(mp1_high_growth_rates,axiom,
! [X1,X2,X3,X4] :
( ( environment(X1)
& subpopulations(X2,X3,X1,X4)
& greater(growth_rate(X3,X4),growth_rate(X2,X4)) )
=> selection_favors(X3,X2,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp1_high_growth_rates) ).
fof(l1,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X5) )
=> greater(growth_rate(efficient_producers,X4),growth_rate(first_movers,X4)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X4] :
( ( subpopulations(first_movers,efficient_producers,X1,X4)
& greater_or_equal(X4,X5) )
=> selection_favors(efficient_producers,first_movers,X4) ) ) ),
inference(assume_negation,[status(cth)],[prove_t1]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| ~ greater(growth_rate(X7,X8),growth_rate(X6,X8))
| selection_favors(X7,X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp1_high_growth_rates])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( environment(esk2_0)
& stable(esk2_0)
& ( subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X7))
| ~ in_environment(esk2_0,X7) )
& ( greater_or_equal(esk3_1(X7),X7)
| ~ in_environment(esk2_0,X7) )
& ( ~ selection_favors(efficient_producers,first_movers,esk3_1(X7))
| ~ in_environment(esk2_0,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])]) ).
fof(c_0_6,hypothesis,
! [X6,X8] :
( ( in_environment(X6,esk1_1(X6))
| ~ environment(X6)
| ~ stable(X6) )
& ( ~ subpopulations(first_movers,efficient_producers,X6,X8)
| ~ greater_or_equal(X8,esk1_1(X6))
| greater(growth_rate(efficient_producers,X8),growth_rate(first_movers,X8))
| ~ environment(X6)
| ~ stable(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l1])])])])])])]) ).
cnf(c_0_7,plain,
( selection_favors(X1,X2,X3)
| ~ greater(growth_rate(X1,X3),growth_rate(X2,X3))
| ~ subpopulations(X2,X1,X4,X3)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))
| ~ in_environment(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
environment(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ in_environment(esk2_0,X1)
| ~ selection_favors(efficient_producers,first_movers,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,hypothesis,
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X2,esk1_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( greater_or_equal(esk3_1(X1),X1)
| ~ in_environment(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( ~ in_environment(esk2_0,X1)
| ~ greater(growth_rate(efficient_producers,esk3_1(X1)),growth_rate(first_movers,esk3_1(X1))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ in_environment(esk2_0,esk1_1(X1))
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,esk3_1(esk1_1(X1)))
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
stable(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ in_environment(esk2_0,esk1_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_15]),c_0_9])]) ).
cnf(c_0_17,hypothesis,
( in_environment(X1,esk1_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:11:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.40 # Preprocessing time : 0.014 s
% 0.20/1.40
% 0.20/1.40 # Proof found!
% 0.20/1.40 # SZS status Theorem
% 0.20/1.40 # SZS output start CNFRefutation
% See solution above
% 0.20/1.40 # Proof object total steps : 19
% 0.20/1.40 # Proof object clause steps : 12
% 0.20/1.40 # Proof object formula steps : 7
% 0.20/1.40 # Proof object conjectures : 11
% 0.20/1.40 # Proof object clause conjectures : 8
% 0.20/1.40 # Proof object formula conjectures : 3
% 0.20/1.40 # Proof object initial clauses used : 8
% 0.20/1.40 # Proof object initial formulas used : 3
% 0.20/1.40 # Proof object generating inferences : 4
% 0.20/1.40 # Proof object simplifying inferences : 10
% 0.20/1.40 # Training examples: 0 positive, 0 negative
% 0.20/1.40 # Parsed axioms : 3
% 0.20/1.40 # Removed by relevancy pruning/SinE : 0
% 0.20/1.40 # Initial clauses : 8
% 0.20/1.40 # Removed in clause preprocessing : 0
% 0.20/1.40 # Initial clauses in saturation : 8
% 0.20/1.40 # Processed clauses : 11
% 0.20/1.40 # ...of these trivial : 0
% 0.20/1.40 # ...subsumed : 0
% 0.20/1.40 # ...remaining for further processing : 11
% 0.20/1.40 # Other redundant clauses eliminated : 0
% 0.20/1.40 # Clauses deleted for lack of memory : 0
% 0.20/1.40 # Backward-subsumed : 0
% 0.20/1.40 # Backward-rewritten : 0
% 0.20/1.40 # Generated clauses : 4
% 0.20/1.40 # ...of the previous two non-trivial : 3
% 0.20/1.40 # Contextual simplify-reflections : 2
% 0.20/1.40 # Paramodulations : 4
% 0.20/1.40 # Factorizations : 0
% 0.20/1.40 # Equation resolutions : 0
% 0.20/1.40 # Current number of processed clauses : 11
% 0.20/1.40 # Positive orientable unit clauses : 2
% 0.20/1.40 # Positive unorientable unit clauses: 0
% 0.20/1.40 # Negative unit clauses : 1
% 0.20/1.40 # Non-unit-clauses : 8
% 0.20/1.40 # Current number of unprocessed clauses: 0
% 0.20/1.40 # ...number of literals in the above : 0
% 0.20/1.40 # Current number of archived formulas : 0
% 0.20/1.40 # Current number of archived clauses : 0
% 0.20/1.40 # Clause-clause subsumption calls (NU) : 19
% 0.20/1.40 # Rec. Clause-clause subsumption calls : 7
% 0.20/1.40 # Non-unit clause-clause subsumptions : 2
% 0.20/1.40 # Unit Clause-clause subsumption calls : 0
% 0.20/1.40 # Rewrite failures with RHS unbound : 0
% 0.20/1.40 # BW rewrite match attempts : 0
% 0.20/1.40 # BW rewrite match successes : 0
% 0.20/1.40 # Condensation attempts : 0
% 0.20/1.40 # Condensation successes : 0
% 0.20/1.40 # Termbank termtop insertions : 726
% 0.20/1.40
% 0.20/1.40 # -------------------------------------------------
% 0.20/1.40 # User time : 0.011 s
% 0.20/1.40 # System time : 0.004 s
% 0.20/1.40 # Total time : 0.015 s
% 0.20/1.40 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------