TSTP Solution File: MGT036+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT036+3 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 21:10:44 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 124 ( 53 ~; 46 |; 22 &)
% ( 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 : 54 ( 0 sgn 32 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
? [X1,X2] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) ),
file('/tmp/tmp_ervMG/sel_MGT036+3.p_1',a13_star) ).
fof(2,axiom,
! [X1,X3,X4,X2] :
( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> ( ( greater_or_equal(growth_rate(X4,X2),zero)
& greater(zero,growth_rate(X3,X2)) )
<=> outcompetes(X4,X3,X2) ) ),
file('/tmp/tmp_ervMG/sel_MGT036+3.p_1',d2) ).
fof(3,axiom,
! [X1,X3,X4,X2] :
( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> subpopulations(X4,X3,X1,X2) ),
file('/tmp/tmp_ervMG/sel_MGT036+3.p_1',mp_symmetry_of_subpopulations) ).
fof(4,conjecture,
? [X1,X2] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& outcompetes(first_movers,efficient_producers,X2) ),
file('/tmp/tmp_ervMG/sel_MGT036+3.p_1',prove_t5_star) ).
fof(5,negated_conjecture,
~ ? [X1,X2] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& outcompetes(first_movers,efficient_producers,X2) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(6,plain,
? [X3,X4] :
( environment(X3)
& subpopulations(first_movers,efficient_producers,X3,X4)
& greater_or_equal(growth_rate(first_movers,X4),zero)
& greater(zero,growth_rate(efficient_producers,X4)) ),
inference(variable_rename,[status(thm)],[1]) ).
fof(7,plain,
( 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)],[6]) ).
cnf(8,plain,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,plain,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,plain,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,plain,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[7]) ).
fof(12,plain,
! [X1,X3,X4,X2] :
( ~ environment(X1)
| ~ subpopulations(X3,X4,X1,X2)
| ( ( ~ greater_or_equal(growth_rate(X4,X2),zero)
| ~ greater(zero,growth_rate(X3,X2))
| outcompetes(X4,X3,X2) )
& ( ~ outcompetes(X4,X3,X2)
| ( greater_or_equal(growth_rate(X4,X2),zero)
& greater(zero,growth_rate(X3,X2)) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(13,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| ( ( ~ greater_or_equal(growth_rate(X7,X8),zero)
| ~ greater(zero,growth_rate(X6,X8))
| outcompetes(X7,X6,X8) )
& ( ~ outcompetes(X7,X6,X8)
| ( greater_or_equal(growth_rate(X7,X8),zero)
& greater(zero,growth_rate(X6,X8)) ) ) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,plain,
! [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)],[13]) ).
cnf(17,plain,
( 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)],[14]) ).
fof(18,plain,
! [X1,X3,X4,X2] :
( ~ environment(X1)
| ~ subpopulations(X3,X4,X1,X2)
| subpopulations(X4,X3,X1,X2) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(19,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| subpopulations(X7,X6,X5,X8) ),
inference(variable_rename,[status(thm)],[18]) ).
cnf(20,plain,
( subpopulations(X1,X2,X3,X4)
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,negated_conjecture,
! [X1,X2] :
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(22,negated_conjecture,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| ~ outcompetes(first_movers,efficient_producers,X4) ),
inference(variable_rename,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(24,plain,
( subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)
| ~ environment(esk1_0) ),
inference(spm,[status(thm)],[20,10,theory(equality)]) ).
cnf(25,plain,
( subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[24,11,theory(equality)]) ).
cnf(26,plain,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[25,theory(equality)]) ).
cnf(33,plain,
( ~ outcompetes(first_movers,efficient_producers,esk2_0)
| ~ environment(esk1_0) ),
inference(spm,[status(thm)],[23,10,theory(equality)]) ).
cnf(34,plain,
( ~ outcompetes(first_movers,efficient_producers,esk2_0)
| $false ),
inference(rw,[status(thm)],[33,11,theory(equality)]) ).
cnf(35,plain,
~ outcompetes(first_movers,efficient_producers,esk2_0),
inference(cn,[status(thm)],[34,theory(equality)]) ).
cnf(36,plain,
( 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)],[17,8,theory(equality)]) ).
cnf(50,plain,
( outcompetes(first_movers,efficient_producers,esk2_0)
| ~ subpopulations(efficient_producers,first_movers,X1,esk2_0)
| ~ environment(X1) ),
inference(spm,[status(thm)],[36,9,theory(equality)]) ).
cnf(52,plain,
( ~ subpopulations(efficient_producers,first_movers,X1,esk2_0)
| ~ environment(X1) ),
inference(sr,[status(thm)],[50,35,theory(equality)]) ).
cnf(55,plain,
~ environment(esk1_0),
inference(spm,[status(thm)],[52,26,theory(equality)]) ).
cnf(56,plain,
$false,
inference(rw,[status(thm)],[55,11,theory(equality)]) ).
cnf(57,plain,
$false,
inference(cn,[status(thm)],[56,theory(equality)]) ).
cnf(58,plain,
$false,
57,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT036+3.p
% --creating new selector for []
% -running prover on /tmp/tmp_ervMG/sel_MGT036+3.p_1 with time limit 29
% -prover status Theorem
% Problem MGT036+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT036+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT036+3.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------