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