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