%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT052+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:08:13 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 76 ( 32 ~; 29 |; 13 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( dissimilar(X1,X2,X3)
<=> ( organization(X1)
& ~ ( is_aligned(X1,X2)
<=> is_aligned(X1,X3) ) ) ),
file('/tmp/tmprSTyf8/sel_MGT052+1.p_1',definition_2) ).
fof(2,conjecture,
! [X1,X3] : ~ dissimilar(X1,X3,X3),
file('/tmp/tmprSTyf8/sel_MGT052+1.p_1',background_assumption_1) ).
fof(3,negated_conjecture,
~ ! [X1,X3] : ~ dissimilar(X1,X3,X3),
inference(assume_negation,[status(cth)],[2]) ).
fof(4,negated_conjecture,
~ ! [X1,X3] : ~ dissimilar(X1,X3,X3),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(5,plain,
! [X1,X2,X3] :
( ( ~ dissimilar(X1,X2,X3)
| ( organization(X1)
& ( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) )
& ( is_aligned(X1,X2)
| is_aligned(X1,X3) ) ) )
& ( ~ organization(X1)
| ( ( ~ is_aligned(X1,X2)
| is_aligned(X1,X3) )
& ( ~ is_aligned(X1,X3)
| is_aligned(X1,X2) ) )
| dissimilar(X1,X2,X3) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(6,plain,
! [X4,X5,X6] :
( ( ~ dissimilar(X4,X5,X6)
| ( organization(X4)
& ( ~ is_aligned(X4,X5)
| ~ is_aligned(X4,X6) )
& ( is_aligned(X4,X5)
| is_aligned(X4,X6) ) ) )
& ( ~ organization(X4)
| ( ( ~ is_aligned(X4,X5)
| is_aligned(X4,X6) )
& ( ~ is_aligned(X4,X6)
| is_aligned(X4,X5) ) )
| dissimilar(X4,X5,X6) ) ),
inference(variable_rename,[status(thm)],[5]) ).
fof(7,plain,
! [X4,X5,X6] :
( ( organization(X4)
| ~ dissimilar(X4,X5,X6) )
& ( ~ is_aligned(X4,X5)
| ~ is_aligned(X4,X6)
| ~ dissimilar(X4,X5,X6) )
& ( is_aligned(X4,X5)
| is_aligned(X4,X6)
| ~ dissimilar(X4,X5,X6) )
& ( ~ is_aligned(X4,X5)
| is_aligned(X4,X6)
| ~ organization(X4)
| dissimilar(X4,X5,X6) )
& ( ~ is_aligned(X4,X6)
| is_aligned(X4,X5)
| ~ organization(X4)
| dissimilar(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(10,plain,
( is_aligned(X1,X3)
| is_aligned(X1,X2)
| ~ dissimilar(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,plain,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X3)
| ~ is_aligned(X1,X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
fof(13,negated_conjecture,
? [X1,X3] : dissimilar(X1,X3,X3),
inference(fof_nnf,[status(thm)],[4]) ).
fof(14,negated_conjecture,
? [X4,X5] : dissimilar(X4,X5,X5),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
inference(skolemize,[status(esa)],[14]) ).
cnf(16,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(18,negated_conjecture,
is_aligned(esk1_0,esk2_0),
inference(spm,[status(thm)],[10,16,theory(equality)]) ).
cnf(19,negated_conjecture,
~ is_aligned(esk1_0,esk2_0),
inference(spm,[status(thm)],[11,16,theory(equality)]) ).
cnf(26,negated_conjecture,
$false,
inference(rw,[status(thm)],[19,18,theory(equality)]) ).
cnf(27,negated_conjecture,
$false,
inference(cn,[status(thm)],[26,theory(equality)]) ).
cnf(28,negated_conjecture,
$false,
27,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT052+1.p
% --creating new selector for [MGT001+0.ax]
% -running prover on /tmp/tmprSTyf8/sel_MGT052+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT052+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT052+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT052+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
%
%------------------------------------------------------------------------------