TSTP Solution File: MGT045+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT045+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 21:07:34 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 66 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 25 ~; 22 |; 13 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(external_ties(X1,X5),external_ties(X1,X4)) ),
file('/tmp/tmpJgS_aU/sel_MGT045+1.p_1',assumption_8) ).
fof(4,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(position(X1,X5),position(X1,X4)) ),
file('/tmp/tmpJgS_aU/sel_MGT045+1.p_1',lemma_4) ).
fof(5,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( greater(external_ties(X1,X5),external_ties(X1,X4))
=> greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) = external_ties(X1,X4)
=> position(X1,X5) = position(X1,X4) ) ) ),
file('/tmp/tmpJgS_aU/sel_MGT045+1.p_1',assumption_6) ).
fof(6,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> greater(position(X1,X5),position(X1,X4)) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(13,plain,
! [X1,X4,X5] :
( ~ organization(X1)
| ~ greater(age(X1,X5),age(X1,X4))
| greater(external_ties(X1,X5),external_ties(X1,X4)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(14,plain,
! [X6,X7,X8] :
( ~ organization(X6)
| ~ greater(age(X6,X8),age(X6,X7))
| greater(external_ties(X6,X8),external_ties(X6,X7)) ),
inference(variable_rename,[status(thm)],[13]) ).
cnf(15,plain,
( greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,negated_conjecture,
? [X1,X4,X5] :
( organization(X1)
& greater(age(X1,X5),age(X1,X4))
& ~ greater(position(X1,X5),position(X1,X4)) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(17,negated_conjecture,
? [X6,X7,X8] :
( organization(X6)
& greater(age(X6,X8),age(X6,X7))
& ~ greater(position(X6,X8),position(X6,X7)) ),
inference(variable_rename,[status(thm)],[16]) ).
fof(18,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& ~ greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[17]) ).
cnf(19,negated_conjecture,
~ greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(20,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(21,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[18]) ).
fof(22,plain,
! [X1,X4,X5] :
( ~ organization(X1)
| ( ( ~ greater(external_ties(X1,X5),external_ties(X1,X4))
| greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) != external_ties(X1,X4)
| position(X1,X5) = position(X1,X4) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(23,plain,
! [X6,X7,X8] :
( ~ organization(X6)
| ( ( ~ greater(external_ties(X6,X8),external_ties(X6,X7))
| greater(position(X6,X8),position(X6,X7)) )
& ( external_ties(X6,X8) != external_ties(X6,X7)
| position(X6,X8) = position(X6,X7) ) ) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,plain,
! [X6,X7,X8] :
( ( ~ greater(external_ties(X6,X8),external_ties(X6,X7))
| greater(position(X6,X8),position(X6,X7))
| ~ organization(X6) )
& ( external_ties(X6,X8) != external_ties(X6,X7)
| position(X6,X8) = position(X6,X7)
| ~ organization(X6) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(26,plain,
( greater(position(X1,X2),position(X1,X3))
| ~ organization(X1)
| ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(30,negated_conjecture,
( greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))
| ~ organization(esk1_0) ),
inference(spm,[status(thm)],[15,20,theory(equality)]) ).
cnf(31,negated_conjecture,
( greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))
| $false ),
inference(rw,[status(thm)],[30,21,theory(equality)]) ).
cnf(32,negated_conjecture,
greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0)),
inference(cn,[status(thm)],[31,theory(equality)]) ).
cnf(35,negated_conjecture,
( greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))
| ~ organization(esk1_0) ),
inference(spm,[status(thm)],[26,32,theory(equality)]) ).
cnf(36,negated_conjecture,
( greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))
| $false ),
inference(rw,[status(thm)],[35,21,theory(equality)]) ).
cnf(37,negated_conjecture,
greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)),
inference(cn,[status(thm)],[36,theory(equality)]) ).
cnf(38,negated_conjecture,
$false,
inference(sr,[status(thm)],[37,19,theory(equality)]) ).
cnf(39,negated_conjecture,
$false,
38,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT045+1.p
% --creating new selector for [MGT001+0.ax]
% -running prover on /tmp/tmpJgS_aU/sel_MGT045+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT045+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT045+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT045+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
%
%------------------------------------------------------------------------------