%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWB018+2 : TPTP v5.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 : Tue Feb 15 23:49:11 EST 2011
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 51 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 17 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 37 ( 4 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( iext(uri_owl_sameAs,X1,X2)
<=> X1 = X2 ),
file('/tmp/tmpCE-uRo/sel_SWB018+2.p_1',owl_eqdis_sameas) ).
fof(2,axiom,
! [X1,X3] :
( iext(uri_rdf_type,X1,X3)
<=> icext(X3,X1) ),
file('/tmp/tmpCE-uRo/sel_SWB018+2.p_1',rdfs_cext_def) ).
fof(3,conjecture,
iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
file('/tmp/tmpCE-uRo/sel_SWB018+2.p_1',testcase_conclusion_fullish_018_Modified_Logical_Vocabulary_Semantics) ).
fof(4,axiom,
! [X4,X3,X1,X2] :
( ( iext(uri_rdfs_domain,X4,X3)
& iext(X4,X1,X2) )
=> icext(X3,X1) ),
file('/tmp/tmpCE-uRo/sel_SWB018+2.p_1',rdfs_domain_main) ).
fof(5,axiom,
( iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person)
& iext(uri_owl_sameAs,uri_ex_w,uri_ex_u) ),
file('/tmp/tmpCE-uRo/sel_SWB018+2.p_1',testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics) ).
fof(6,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
inference(assume_negation,[status(cth)],[3]) ).
fof(7,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(8,plain,
! [X1,X2] :
( ( ~ iext(uri_owl_sameAs,X1,X2)
| X1 = X2 )
& ( X1 != X2
| iext(uri_owl_sameAs,X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(9,plain,
! [X3,X4] :
( ( ~ iext(uri_owl_sameAs,X3,X4)
| X3 = X4 )
& ( X3 != X4
| iext(uri_owl_sameAs,X3,X4) ) ),
inference(variable_rename,[status(thm)],[8]) ).
cnf(10,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(12,plain,
! [X1,X3] :
( ( ~ iext(uri_rdf_type,X1,X3)
| icext(X3,X1) )
& ( ~ icext(X3,X1)
| iext(uri_rdf_type,X1,X3) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(13,plain,
! [X4,X5] :
( ( ~ iext(uri_rdf_type,X4,X5)
| icext(X5,X4) )
& ( ~ icext(X5,X4)
| iext(uri_rdf_type,X4,X5) ) ),
inference(variable_rename,[status(thm)],[12]) ).
cnf(14,plain,
( iext(uri_rdf_type,X1,X2)
| ~ icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(16,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
inference(split_conjunct,[status(thm)],[7]) ).
fof(17,plain,
! [X4,X3,X1,X2] :
( ~ iext(uri_rdfs_domain,X4,X3)
| ~ iext(X4,X1,X2)
| icext(X3,X1) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(18,plain,
! [X5,X6,X7,X8] :
( ~ iext(uri_rdfs_domain,X5,X6)
| ~ iext(X5,X7,X8)
| icext(X6,X7) ),
inference(variable_rename,[status(thm)],[17]) ).
cnf(19,plain,
( icext(X1,X2)
| ~ iext(X3,X2,X4)
| ~ iext(uri_rdfs_domain,X3,X1) ),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(21,plain,
iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(22,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[10,theory(equality)]) ).
cnf(25,plain,
( icext(uri_ex_Person,X1)
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(spm,[status(thm)],[19,21,theory(equality)]) ).
cnf(27,plain,
icext(uri_ex_Person,X1),
inference(spm,[status(thm)],[25,22,theory(equality)]) ).
cnf(28,plain,
iext(uri_rdf_type,X1,uri_ex_Person),
inference(spm,[status(thm)],[14,27,theory(equality)]) ).
cnf(30,negated_conjecture,
$false,
inference(rw,[status(thm)],[16,28,theory(equality)]) ).
cnf(31,negated_conjecture,
$false,
inference(cn,[status(thm)],[30,theory(equality)]) ).
cnf(32,negated_conjecture,
$false,
31,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWB/SWB018+2.p
% --creating new selector for []
% -running prover on /tmp/tmpCE-uRo/sel_SWB018+2.p_1 with time limit 29
% -prover status Theorem
% Problem SWB018+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWB/SWB018+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWB/SWB018+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
%
%------------------------------------------------------------------------------