%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PUZ128+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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 : Sun Dec 26 00:56:53 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 54 ( 25 ~; 20 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 4 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
parent_of(polyneikes,thersandros),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',polyneikes_thersandros) ).
fof(2,axiom,
~ patricide(thersandros),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',thersandros_not_patricidal) ).
fof(3,axiom,
parent_of(oedipus,polyneikes),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',oedipus_polyneikes) ).
fof(4,conjecture,
? [X1,X2] :
( parent_of(iokaste,X1)
& patricide(X1)
& parent_of(X1,X2)
& ~ patricide(X2) ),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',iokaste_parent_particide_parent_not_patricide) ).
fof(5,axiom,
parent_of(iokaste,polyneikes),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',iokaste_polyneikes) ).
fof(6,axiom,
parent_of(iokaste,oedipus),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',iokaste_oedipus) ).
fof(7,axiom,
patricide(oedipus),
file('/tmp/tmpUvw250/sel_PUZ128+1.p_1',oedipus_patricidal) ).
fof(8,negated_conjecture,
~ ? [X1,X2] :
( parent_of(iokaste,X1)
& patricide(X1)
& parent_of(X1,X2)
& ~ patricide(X2) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(9,plain,
~ patricide(thersandros),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(10,negated_conjecture,
~ ? [X1,X2] :
( parent_of(iokaste,X1)
& patricide(X1)
& parent_of(X1,X2)
& ~ patricide(X2) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
cnf(11,plain,
parent_of(polyneikes,thersandros),
inference(split_conjunct,[status(thm)],[1]) ).
cnf(12,plain,
~ patricide(thersandros),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(13,plain,
parent_of(oedipus,polyneikes),
inference(split_conjunct,[status(thm)],[3]) ).
fof(14,negated_conjecture,
! [X1,X2] :
( ~ parent_of(iokaste,X1)
| ~ patricide(X1)
| ~ parent_of(X1,X2)
| patricide(X2) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(15,negated_conjecture,
! [X3,X4] :
( ~ parent_of(iokaste,X3)
| ~ patricide(X3)
| ~ parent_of(X3,X4)
| patricide(X4) ),
inference(variable_rename,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
( patricide(X1)
| ~ parent_of(X2,X1)
| ~ patricide(X2)
| ~ parent_of(iokaste,X2) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(17,plain,
parent_of(iokaste,polyneikes),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(18,plain,
parent_of(iokaste,oedipus),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(19,plain,
patricide(oedipus),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(22,negated_conjecture,
( patricide(thersandros)
| ~ patricide(polyneikes)
| ~ parent_of(iokaste,polyneikes) ),
inference(spm,[status(thm)],[16,11,theory(equality)]) ).
cnf(23,negated_conjecture,
( patricide(polyneikes)
| ~ patricide(oedipus)
| ~ parent_of(iokaste,oedipus) ),
inference(spm,[status(thm)],[16,13,theory(equality)]) ).
cnf(25,negated_conjecture,
( patricide(thersandros)
| ~ patricide(polyneikes)
| $false ),
inference(rw,[status(thm)],[22,17,theory(equality)]) ).
cnf(26,negated_conjecture,
( patricide(thersandros)
| ~ patricide(polyneikes) ),
inference(cn,[status(thm)],[25,theory(equality)]) ).
cnf(27,negated_conjecture,
~ patricide(polyneikes),
inference(sr,[status(thm)],[26,12,theory(equality)]) ).
cnf(28,negated_conjecture,
( patricide(polyneikes)
| $false
| ~ parent_of(iokaste,oedipus) ),
inference(rw,[status(thm)],[23,19,theory(equality)]) ).
cnf(29,negated_conjecture,
( patricide(polyneikes)
| $false
| $false ),
inference(rw,[status(thm)],[28,18,theory(equality)]) ).
cnf(30,negated_conjecture,
patricide(polyneikes),
inference(cn,[status(thm)],[29,theory(equality)]) ).
cnf(32,negated_conjecture,
$false,
inference(sr,[status(thm)],[30,27,theory(equality)]) ).
cnf(33,negated_conjecture,
$false,
32,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PUZ/PUZ128+1.p
% --creating new selector for []
% -running prover on /tmp/tmpUvw250/sel_PUZ128+1.p_1 with time limit 29
% -prover status Theorem
% Problem PUZ128+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PUZ/PUZ128+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PUZ/PUZ128+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
%
%------------------------------------------------------------------------------