%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT036+2 : 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:40 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 13 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 239 ( 98 ~; 92 |; 36 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 125 ( 9 sgn 76 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
file('/tmp/tmpamW4J7/sel_MGT036+2.p_1',prove_t5) ).
fof(2,axiom,
! [X1,X3,X4,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& ~ greater(zero,growth_rate(X3,X2))
& greater(resilience(X4),resilience(X3)) )
=> ~ greater(zero,growth_rate(X4,X2)) ),
file('/tmp/tmpamW4J7/sel_MGT036+2.p_1',a13) ).
fof(3,axiom,
! [X1,X3,X4,X2] :
( ( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> greater_or_equal(growth_rate(X3,X2),zero) )
<=> ~ greater(zero,growth_rate(X3,X2)) ),
file('/tmp/tmpamW4J7/sel_MGT036+2.p_1',mp_growth_rate_relationships) ).
fof(4,axiom,
! [X1,X3,X4,X2] :
( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> subpopulations(X4,X3,X1,X2) ),
file('/tmp/tmpamW4J7/sel_MGT036+2.p_1',mp_symmetry_of_subpopulations) ).
fof(5,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/tmp/tmpamW4J7/sel_MGT036+2.p_1',a2) ).
fof(6,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
file('/tmp/tmpamW4J7/sel_MGT036+2.p_1',mp_time_point_occur) ).
fof(7,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/tmpamW4J7/sel_MGT036+2.p_1',d2) ).
fof(8,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(9,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> ~ outcompetes(first_movers,efficient_producers,X2) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(10,plain,
! [X1,X3,X4,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& ~ greater(zero,growth_rate(X3,X2))
& greater(resilience(X4),resilience(X3)) )
=> ~ greater(zero,growth_rate(X4,X2)) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(11,plain,
! [X1,X3,X4,X2] :
( ( ( environment(X1)
& subpopulations(X3,X4,X1,X2) )
=> greater_or_equal(growth_rate(X3,X2),zero) )
<=> ~ greater(zero,growth_rate(X3,X2)) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(12,negated_conjecture,
? [X1,X2] :
( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& outcompetes(first_movers,efficient_producers,X2) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(13,negated_conjecture,
? [X3,X4] :
( environment(X3)
& subpopulations(first_movers,efficient_producers,X3,X4)
& outcompetes(first_movers,efficient_producers,X4) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& outcompetes(first_movers,efficient_producers,esk2_0) ),
inference(skolemize,[status(esa)],[13]) ).
cnf(15,negated_conjecture,
outcompetes(first_movers,efficient_producers,esk2_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[14]) ).
fof(18,plain,
! [X1,X3,X4,X2] :
( ~ environment(X1)
| ~ in_environment(X1,X2)
| greater(zero,growth_rate(X3,X2))
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(19,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ in_environment(X5,X8)
| greater(zero,growth_rate(X6,X8))
| ~ greater(resilience(X7),resilience(X6))
| ~ greater(zero,growth_rate(X7,X8)) ),
inference(variable_rename,[status(thm)],[18]) ).
cnf(20,plain,
( greater(zero,growth_rate(X3,X2))
| ~ greater(zero,growth_rate(X1,X2))
| ~ greater(resilience(X1),resilience(X3))
| ~ in_environment(X4,X2)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,plain,
! [X1,X3,X4,X2] :
( ( ( environment(X1)
& subpopulations(X3,X4,X1,X2)
& ~ greater_or_equal(growth_rate(X3,X2),zero) )
| ~ greater(zero,growth_rate(X3,X2)) )
& ( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ subpopulations(X3,X4,X1,X2)
| greater_or_equal(growth_rate(X3,X2),zero) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(22,plain,
! [X5,X6,X7,X8] :
( ( ( environment(X5)
& subpopulations(X6,X7,X5,X8)
& ~ greater_or_equal(growth_rate(X6,X8),zero) )
| ~ greater(zero,growth_rate(X6,X8)) )
& ( greater(zero,growth_rate(X6,X8))
| ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| greater_or_equal(growth_rate(X6,X8),zero) ) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,plain,
! [X5,X6,X7,X8] :
( ( environment(X5)
| ~ greater(zero,growth_rate(X6,X8)) )
& ( subpopulations(X6,X7,X5,X8)
| ~ greater(zero,growth_rate(X6,X8)) )
& ( ~ greater_or_equal(growth_rate(X6,X8),zero)
| ~ greater(zero,growth_rate(X6,X8)) )
& ( greater(zero,growth_rate(X6,X8))
| ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| greater_or_equal(growth_rate(X6,X8),zero) ) ),
inference(distribute,[status(thm)],[22]) ).
cnf(25,plain,
( ~ greater(zero,growth_rate(X1,X2))
| ~ greater_or_equal(growth_rate(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(27,plain,
( environment(X3)
| ~ greater(zero,growth_rate(X1,X2)) ),
inference(split_conjunct,[status(thm)],[23]) ).
fof(28,plain,
! [X1,X3,X4,X2] :
( ~ environment(X1)
| ~ subpopulations(X3,X4,X1,X2)
| subpopulations(X4,X3,X1,X2) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(29,plain,
! [X5,X6,X7,X8] :
( ~ environment(X5)
| ~ subpopulations(X6,X7,X5,X8)
| subpopulations(X7,X6,X5,X8) ),
inference(variable_rename,[status(thm)],[28]) ).
cnf(30,plain,
( subpopulations(X1,X2,X3,X4)
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3) ),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(split_conjunct,[status(thm)],[5]) ).
fof(32,plain,
! [X1,X2] :
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| in_environment(X1,X2) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(33,plain,
! [X3,X4] :
( ~ environment(X3)
| ~ subpopulations(first_movers,efficient_producers,X3,X4)
| in_environment(X3,X4) ),
inference(variable_rename,[status(thm)],[32]) ).
cnf(34,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,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)],[7]) ).
fof(36,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)],[35]) ).
fof(37,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)],[36]) ).
cnf(38,plain,
( greater(zero,growth_rate(X1,X4))
| ~ subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ outcompetes(X2,X1,X4) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(39,plain,
( greater_or_equal(growth_rate(X2,X4),zero)
| ~ subpopulations(X1,X2,X3,X4)
| ~ environment(X3)
| ~ outcompetes(X2,X1,X4) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(41,plain,
( greater(zero,growth_rate(X3,X2))
| ~ greater(zero,growth_rate(X1,X2))
| ~ greater(resilience(X1),resilience(X3))
| ~ in_environment(X4,X2) ),
inference(csr,[status(thm)],[20,27]) ).
cnf(42,negated_conjecture,
( subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)
| ~ environment(esk1_0) ),
inference(spm,[status(thm)],[30,16,theory(equality)]) ).
cnf(44,negated_conjecture,
( subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[42,17,theory(equality)]) ).
cnf(45,negated_conjecture,
subpopulations(efficient_producers,first_movers,esk1_0,esk2_0),
inference(cn,[status(thm)],[44,theory(equality)]) ).
cnf(61,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| ~ outcompetes(first_movers,efficient_producers,esk2_0)
| ~ environment(esk1_0) ),
inference(spm,[status(thm)],[38,45,theory(equality)]) ).
cnf(67,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| $false
| ~ environment(esk1_0) ),
inference(rw,[status(thm)],[61,15,theory(equality)]) ).
cnf(68,negated_conjecture,
( greater(zero,growth_rate(efficient_producers,esk2_0))
| $false
| $false ),
inference(rw,[status(thm)],[67,17,theory(equality)]) ).
cnf(69,negated_conjecture,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(cn,[status(thm)],[68,theory(equality)]) ).
cnf(75,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[27,69,theory(equality)]) ).
cnf(76,negated_conjecture,
( greater(zero,growth_rate(X1,esk2_0))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X2,esk2_0) ),
inference(spm,[status(thm)],[41,69,theory(equality)]) ).
cnf(80,plain,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2)
| $false ),
inference(rw,[status(thm)],[39,75,theory(equality)]) ).
cnf(81,plain,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2) ),
inference(cn,[status(thm)],[80,theory(equality)]) ).
cnf(86,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| $false ),
inference(rw,[status(thm)],[34,75,theory(equality)]) ).
cnf(87,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(cn,[status(thm)],[86,theory(equality)]) ).
cnf(104,negated_conjecture,
( greater(zero,growth_rate(X1,esk2_0))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ subpopulations(first_movers,efficient_producers,X2,esk2_0) ),
inference(spm,[status(thm)],[76,87,theory(equality)]) ).
cnf(106,negated_conjecture,
( greater_or_equal(growth_rate(first_movers,esk2_0),zero)
| ~ outcompetes(first_movers,efficient_producers,esk2_0) ),
inference(spm,[status(thm)],[81,45,theory(equality)]) ).
cnf(109,negated_conjecture,
( greater_or_equal(growth_rate(first_movers,esk2_0),zero)
| $false ),
inference(rw,[status(thm)],[106,15,theory(equality)]) ).
cnf(110,negated_conjecture,
greater_or_equal(growth_rate(first_movers,esk2_0),zero),
inference(cn,[status(thm)],[109,theory(equality)]) ).
cnf(118,negated_conjecture,
~ greater(zero,growth_rate(first_movers,esk2_0)),
inference(spm,[status(thm)],[25,110,theory(equality)]) ).
cnf(125,negated_conjecture,
( greater(zero,growth_rate(X1,esk2_0))
| ~ greater(resilience(efficient_producers),resilience(X1)) ),
inference(spm,[status(thm)],[104,16,theory(equality)]) ).
cnf(130,plain,
greater(zero,growth_rate(first_movers,esk2_0)),
inference(spm,[status(thm)],[125,31,theory(equality)]) ).
cnf(131,plain,
$false,
inference(sr,[status(thm)],[130,118,theory(equality)]) ).
cnf(132,plain,
$false,
131,
[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+2.p
% --creating new selector for []
% -running prover on /tmp/tmpamW4J7/sel_MGT036+2.p_1 with time limit 29
% -prover status Theorem
% Problem MGT036+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT036+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT036+2.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
%
%------------------------------------------------------------------------------