TSTP Solution File: MGT058+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT058+1 : TPTP v5.0.0. Released v2.4.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:13:04 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 6
% Syntax : Number of formulae : 73 ( 13 unt; 0 def)
% Number of atoms : 302 ( 44 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 339 ( 110 ~; 129 |; 83 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 52 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( greater_or_equal(X1,X2)
<=> ( greater(X1,X2)
| X1 = X2 ) ),
file('/tmp/tmpAuPzpH/sel_MGT058+1.p_1',definition_greater_or_equal) ).
fof(4,axiom,
! [X1,X2] :
( smaller_or_equal(X1,X2)
<=> ( smaller(X1,X2)
| X1 = X2 ) ),
file('/tmp/tmpAuPzpH/sel_MGT058+1.p_1',definition_smaller_or_equal) ).
fof(5,axiom,
! [X1,X2] :
( smaller(X1,X2)
<=> greater(X2,X1) ),
file('/tmp/tmpAuPzpH/sel_MGT058+1.p_1',definition_smaller) ).
fof(7,conjecture,
! [X1] :
( ( organization(X1)
& ? [X4] : age(X1,X4) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X1)
& robust_position(X1) ) ),
file('/tmp/tmpAuPzpH/sel_MGT058+1.p_1',lemma_10) ).
fof(8,axiom,
! [X1] :
( robust_position(X1)
<=> ! [X5] :
( ( smaller_or_equal(age(X1,X5),tau)
=> ~ positional_advantage(X1,X5) )
& ( greater(age(X1,X5),tau)
=> positional_advantage(X1,X5) ) ) ),
file('/tmp/tmpAuPzpH/sel_MGT058+1.p_1',definition_4) ).
fof(9,axiom,
! [X1] :
( fragile_position(X1)
<=> ! [X5] :
( ( smaller_or_equal(age(X1,X5),sigma)
=> positional_advantage(X1,X5) )
& ( greater(age(X1,X5),sigma)
=> ~ positional_advantage(X1,X5) ) ) ),
file('/tmp/tmpAuPzpH/sel_MGT058+1.p_1',definition_3) ).
fof(10,negated_conjecture,
~ ! [X1] :
( ( organization(X1)
& ? [X4] : age(X1,X4) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero) )
=> ~ ( fragile_position(X1)
& robust_position(X1) ) ),
inference(assume_negation,[status(cth)],[7]) ).
fof(11,plain,
! [X1] :
( robust_position(X1)
<=> ! [X5] :
( ( smaller_or_equal(age(X1,X5),tau)
=> ~ positional_advantage(X1,X5) )
& ( greater(age(X1,X5),tau)
=> positional_advantage(X1,X5) ) ) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(12,plain,
! [X1] :
( fragile_position(X1)
<=> ! [X5] :
( ( smaller_or_equal(age(X1,X5),sigma)
=> positional_advantage(X1,X5) )
& ( greater(age(X1,X5),sigma)
=> ~ positional_advantage(X1,X5) ) ) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(13,plain,
! [X1,X2] :
( ( ~ greater_or_equal(X1,X2)
| greater(X1,X2)
| X1 = X2 )
& ( ( ~ greater(X1,X2)
& X1 != X2 )
| greater_or_equal(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(14,plain,
! [X3,X4] :
( ( ~ greater_or_equal(X3,X4)
| greater(X3,X4)
| X3 = X4 )
& ( ( ~ greater(X3,X4)
& X3 != X4 )
| greater_or_equal(X3,X4) ) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,plain,
! [X3,X4] :
( ( ~ greater_or_equal(X3,X4)
| greater(X3,X4)
| X3 = X4 )
& ( ~ greater(X3,X4)
| greater_or_equal(X3,X4) )
& ( X3 != X4
| greater_or_equal(X3,X4) ) ),
inference(distribute,[status(thm)],[14]) ).
cnf(18,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(25,plain,
! [X1,X2] :
( ( ~ smaller_or_equal(X1,X2)
| smaller(X1,X2)
| X1 = X2 )
& ( ( ~ smaller(X1,X2)
& X1 != X2 )
| smaller_or_equal(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(26,plain,
! [X3,X4] :
( ( ~ smaller_or_equal(X3,X4)
| smaller(X3,X4)
| X3 = X4 )
& ( ( ~ smaller(X3,X4)
& X3 != X4 )
| smaller_or_equal(X3,X4) ) ),
inference(variable_rename,[status(thm)],[25]) ).
fof(27,plain,
! [X3,X4] :
( ( ~ smaller_or_equal(X3,X4)
| smaller(X3,X4)
| X3 = X4 )
& ( ~ smaller(X3,X4)
| smaller_or_equal(X3,X4) )
& ( X3 != X4
| smaller_or_equal(X3,X4) ) ),
inference(distribute,[status(thm)],[26]) ).
cnf(28,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(29,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(split_conjunct,[status(thm)],[27]) ).
fof(31,plain,
! [X1,X2] :
( ( ~ smaller(X1,X2)
| greater(X2,X1) )
& ( ~ greater(X2,X1)
| smaller(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(32,plain,
! [X3,X4] :
( ( ~ smaller(X3,X4)
| greater(X4,X3) )
& ( ~ greater(X4,X3)
| smaller(X3,X4) ) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(37,negated_conjecture,
? [X1] :
( organization(X1)
& ? [X4] : age(X1,X4) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero)
& fragile_position(X1)
& robust_position(X1) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(38,negated_conjecture,
? [X5] :
( organization(X5)
& ? [X6] : age(X5,X6) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero)
& fragile_position(X5)
& robust_position(X5) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,negated_conjecture,
( organization(esk1_0)
& age(esk1_0,esk2_0) = zero
& greater_or_equal(sigma,zero)
& greater_or_equal(tau,zero)
& fragile_position(esk1_0)
& robust_position(esk1_0) ),
inference(skolemize,[status(esa)],[38]) ).
cnf(40,negated_conjecture,
robust_position(esk1_0),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(41,negated_conjecture,
fragile_position(esk1_0),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(42,negated_conjecture,
greater_or_equal(tau,zero),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(43,negated_conjecture,
greater_or_equal(sigma,zero),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(44,negated_conjecture,
age(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[39]) ).
fof(46,plain,
! [X1] :
( ( ~ robust_position(X1)
| ! [X5] :
( ( ~ smaller_or_equal(age(X1,X5),tau)
| ~ positional_advantage(X1,X5) )
& ( ~ greater(age(X1,X5),tau)
| positional_advantage(X1,X5) ) ) )
& ( ? [X5] :
( ( smaller_or_equal(age(X1,X5),tau)
& positional_advantage(X1,X5) )
| ( greater(age(X1,X5),tau)
& ~ positional_advantage(X1,X5) ) )
| robust_position(X1) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(47,plain,
! [X6] :
( ( ~ robust_position(X6)
| ! [X7] :
( ( ~ smaller_or_equal(age(X6,X7),tau)
| ~ positional_advantage(X6,X7) )
& ( ~ greater(age(X6,X7),tau)
| positional_advantage(X6,X7) ) ) )
& ( ? [X8] :
( ( smaller_or_equal(age(X6,X8),tau)
& positional_advantage(X6,X8) )
| ( greater(age(X6,X8),tau)
& ~ positional_advantage(X6,X8) ) )
| robust_position(X6) ) ),
inference(variable_rename,[status(thm)],[46]) ).
fof(48,plain,
! [X6] :
( ( ~ robust_position(X6)
| ! [X7] :
( ( ~ smaller_or_equal(age(X6,X7),tau)
| ~ positional_advantage(X6,X7) )
& ( ~ greater(age(X6,X7),tau)
| positional_advantage(X6,X7) ) ) )
& ( ( smaller_or_equal(age(X6,esk3_1(X6)),tau)
& positional_advantage(X6,esk3_1(X6)) )
| ( greater(age(X6,esk3_1(X6)),tau)
& ~ positional_advantage(X6,esk3_1(X6)) )
| robust_position(X6) ) ),
inference(skolemize,[status(esa)],[47]) ).
fof(49,plain,
! [X6,X7] :
( ( ( ( ~ smaller_or_equal(age(X6,X7),tau)
| ~ positional_advantage(X6,X7) )
& ( ~ greater(age(X6,X7),tau)
| positional_advantage(X6,X7) ) )
| ~ robust_position(X6) )
& ( ( smaller_or_equal(age(X6,esk3_1(X6)),tau)
& positional_advantage(X6,esk3_1(X6)) )
| ( greater(age(X6,esk3_1(X6)),tau)
& ~ positional_advantage(X6,esk3_1(X6)) )
| robust_position(X6) ) ),
inference(shift_quantors,[status(thm)],[48]) ).
fof(50,plain,
! [X6,X7] :
( ( ~ smaller_or_equal(age(X6,X7),tau)
| ~ positional_advantage(X6,X7)
| ~ robust_position(X6) )
& ( ~ greater(age(X6,X7),tau)
| positional_advantage(X6,X7)
| ~ robust_position(X6) )
& ( greater(age(X6,esk3_1(X6)),tau)
| smaller_or_equal(age(X6,esk3_1(X6)),tau)
| robust_position(X6) )
& ( ~ positional_advantage(X6,esk3_1(X6))
| smaller_or_equal(age(X6,esk3_1(X6)),tau)
| robust_position(X6) )
& ( greater(age(X6,esk3_1(X6)),tau)
| positional_advantage(X6,esk3_1(X6))
| robust_position(X6) )
& ( ~ positional_advantage(X6,esk3_1(X6))
| positional_advantage(X6,esk3_1(X6))
| robust_position(X6) ) ),
inference(distribute,[status(thm)],[49]) ).
cnf(56,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(57,plain,
! [X1] :
( ( ~ fragile_position(X1)
| ! [X5] :
( ( ~ smaller_or_equal(age(X1,X5),sigma)
| positional_advantage(X1,X5) )
& ( ~ greater(age(X1,X5),sigma)
| ~ positional_advantage(X1,X5) ) ) )
& ( ? [X5] :
( ( smaller_or_equal(age(X1,X5),sigma)
& ~ positional_advantage(X1,X5) )
| ( greater(age(X1,X5),sigma)
& positional_advantage(X1,X5) ) )
| fragile_position(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(58,plain,
! [X6] :
( ( ~ fragile_position(X6)
| ! [X7] :
( ( ~ smaller_or_equal(age(X6,X7),sigma)
| positional_advantage(X6,X7) )
& ( ~ greater(age(X6,X7),sigma)
| ~ positional_advantage(X6,X7) ) ) )
& ( ? [X8] :
( ( smaller_or_equal(age(X6,X8),sigma)
& ~ positional_advantage(X6,X8) )
| ( greater(age(X6,X8),sigma)
& positional_advantage(X6,X8) ) )
| fragile_position(X6) ) ),
inference(variable_rename,[status(thm)],[57]) ).
fof(59,plain,
! [X6] :
( ( ~ fragile_position(X6)
| ! [X7] :
( ( ~ smaller_or_equal(age(X6,X7),sigma)
| positional_advantage(X6,X7) )
& ( ~ greater(age(X6,X7),sigma)
| ~ positional_advantage(X6,X7) ) ) )
& ( ( smaller_or_equal(age(X6,esk4_1(X6)),sigma)
& ~ positional_advantage(X6,esk4_1(X6)) )
| ( greater(age(X6,esk4_1(X6)),sigma)
& positional_advantage(X6,esk4_1(X6)) )
| fragile_position(X6) ) ),
inference(skolemize,[status(esa)],[58]) ).
fof(60,plain,
! [X6,X7] :
( ( ( ( ~ smaller_or_equal(age(X6,X7),sigma)
| positional_advantage(X6,X7) )
& ( ~ greater(age(X6,X7),sigma)
| ~ positional_advantage(X6,X7) ) )
| ~ fragile_position(X6) )
& ( ( smaller_or_equal(age(X6,esk4_1(X6)),sigma)
& ~ positional_advantage(X6,esk4_1(X6)) )
| ( greater(age(X6,esk4_1(X6)),sigma)
& positional_advantage(X6,esk4_1(X6)) )
| fragile_position(X6) ) ),
inference(shift_quantors,[status(thm)],[59]) ).
fof(61,plain,
! [X6,X7] :
( ( ~ smaller_or_equal(age(X6,X7),sigma)
| positional_advantage(X6,X7)
| ~ fragile_position(X6) )
& ( ~ greater(age(X6,X7),sigma)
| ~ positional_advantage(X6,X7)
| ~ fragile_position(X6) )
& ( greater(age(X6,esk4_1(X6)),sigma)
| smaller_or_equal(age(X6,esk4_1(X6)),sigma)
| fragile_position(X6) )
& ( positional_advantage(X6,esk4_1(X6))
| smaller_or_equal(age(X6,esk4_1(X6)),sigma)
| fragile_position(X6) )
& ( greater(age(X6,esk4_1(X6)),sigma)
| ~ positional_advantage(X6,esk4_1(X6))
| fragile_position(X6) )
& ( positional_advantage(X6,esk4_1(X6))
| ~ positional_advantage(X6,esk4_1(X6))
| fragile_position(X6) ) ),
inference(distribute,[status(thm)],[60]) ).
cnf(67,plain,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(69,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[28,theory(equality)]) ).
cnf(72,negated_conjecture,
( sigma = zero
| greater(sigma,zero) ),
inference(spm,[status(thm)],[18,43,theory(equality)]) ).
cnf(73,negated_conjecture,
( tau = zero
| greater(tau,zero) ),
inference(spm,[status(thm)],[18,42,theory(equality)]) ).
cnf(74,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| ~ fragile_position(esk1_0)
| ~ smaller_or_equal(zero,sigma) ),
inference(spm,[status(thm)],[67,44,theory(equality)]) ).
cnf(75,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| $false
| ~ smaller_or_equal(zero,sigma) ),
inference(rw,[status(thm)],[74,41,theory(equality)]) ).
cnf(76,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| ~ smaller_or_equal(zero,sigma) ),
inference(cn,[status(thm)],[75,theory(equality)]) ).
cnf(83,negated_conjecture,
( ~ positional_advantage(esk1_0,esk2_0)
| ~ robust_position(esk1_0)
| ~ smaller_or_equal(zero,tau) ),
inference(spm,[status(thm)],[56,44,theory(equality)]) ).
cnf(84,negated_conjecture,
( ~ positional_advantage(esk1_0,esk2_0)
| $false
| ~ smaller_or_equal(zero,tau) ),
inference(rw,[status(thm)],[83,40,theory(equality)]) ).
cnf(85,negated_conjecture,
( ~ positional_advantage(esk1_0,esk2_0)
| ~ smaller_or_equal(zero,tau) ),
inference(cn,[status(thm)],[84,theory(equality)]) ).
cnf(94,negated_conjecture,
( smaller(zero,sigma)
| zero = sigma ),
inference(spm,[status(thm)],[33,72,theory(equality)]) ).
cnf(99,negated_conjecture,
( smaller(zero,tau)
| zero = tau ),
inference(spm,[status(thm)],[33,73,theory(equality)]) ).
cnf(104,negated_conjecture,
( smaller_or_equal(zero,sigma)
| zero = sigma ),
inference(spm,[status(thm)],[29,94,theory(equality)]) ).
cnf(124,negated_conjecture,
( smaller_or_equal(zero,tau)
| zero = tau ),
inference(spm,[status(thm)],[29,99,theory(equality)]) ).
cnf(126,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| zero = sigma ),
inference(spm,[status(thm)],[76,104,theory(equality)]) ).
cnf(136,negated_conjecture,
( zero = sigma
| ~ smaller_or_equal(zero,tau) ),
inference(spm,[status(thm)],[85,126,theory(equality)]) ).
cnf(145,negated_conjecture,
( zero = sigma
| zero = tau ),
inference(spm,[status(thm)],[136,124,theory(equality)]) ).
cnf(146,negated_conjecture,
( zero = sigma
| tau != sigma ),
inference(ef,[status(thm)],[145,theory(equality)]) ).
cnf(155,negated_conjecture,
( tau = sigma
| zero = sigma
| ~ smaller_or_equal(tau,tau) ),
inference(spm,[status(thm)],[136,145,theory(equality)]) ).
cnf(157,negated_conjecture,
( tau = sigma
| zero = sigma
| $false ),
inference(rw,[status(thm)],[155,69,theory(equality)]) ).
cnf(158,negated_conjecture,
( tau = sigma
| zero = sigma ),
inference(cn,[status(thm)],[157,theory(equality)]) ).
cnf(170,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[146,158]) ).
cnf(182,negated_conjecture,
( sigma = tau
| smaller_or_equal(zero,tau) ),
inference(rw,[status(thm)],[124,170,theory(equality)]) ).
cnf(183,negated_conjecture,
( sigma = tau
| smaller_or_equal(sigma,tau) ),
inference(rw,[status(thm)],[182,170,theory(equality)]) ).
cnf(194,negated_conjecture,
( positional_advantage(esk1_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,170,theory(equality)]),69,theory(equality)]) ).
cnf(195,negated_conjecture,
positional_advantage(esk1_0,esk2_0),
inference(cn,[status(thm)],[194,theory(equality)]) ).
cnf(202,negated_conjecture,
( ~ positional_advantage(esk1_0,esk2_0)
| ~ smaller_or_equal(sigma,tau) ),
inference(rw,[status(thm)],[85,170,theory(equality)]) ).
cnf(219,negated_conjecture,
( $false
| ~ smaller_or_equal(sigma,tau) ),
inference(rw,[status(thm)],[202,195,theory(equality)]) ).
cnf(220,negated_conjecture,
~ smaller_or_equal(sigma,tau),
inference(cn,[status(thm)],[219,theory(equality)]) ).
cnf(222,negated_conjecture,
tau = sigma,
inference(sr,[status(thm)],[183,220,theory(equality)]) ).
cnf(225,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[220,222,theory(equality)]),69,theory(equality)]) ).
cnf(226,negated_conjecture,
$false,
inference(cn,[status(thm)],[225,theory(equality)]) ).
cnf(227,negated_conjecture,
$false,
226,
[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/MGT058+1.p
% --creating new selector for [MGT001+0.ax]
% -running prover on /tmp/tmpAuPzpH/sel_MGT058+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT058+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT058+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT058+1.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
%
%------------------------------------------------------------------------------