%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN732+1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 13:56:13 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 38 ( 14 ~; 6 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 35 ( 2 sgn 22 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( ! [X2] : p(X2,X1)
=> ! [X3] : q(X3,X1) )
=> ? [X4] :
( ? [X5] : p(X5,X4)
=> ? [X6] :
( p(X4,X6)
| q(X6,X4) ) ) ),
file('/tmp/tmp9nQEr7/sel_SYN732+1.p_1',x3411) ).
fof(2,negated_conjecture,
~ ( ! [X1] :
( ! [X2] : p(X2,X1)
=> ! [X3] : q(X3,X1) )
=> ? [X4] :
( ? [X5] : p(X5,X4)
=> ? [X6] :
( p(X4,X6)
| q(X6,X4) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ! [X1] :
( ? [X2] : ~ p(X2,X1)
| ! [X3] : q(X3,X1) )
& ! [X4] :
( ? [X5] : p(X5,X4)
& ! [X6] :
( ~ p(X4,X6)
& ~ q(X6,X4) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ! [X7] :
( ? [X8] : ~ p(X8,X7)
| ! [X9] : q(X9,X7) )
& ! [X10] :
( ? [X11] : p(X11,X10)
& ! [X12] :
( ~ p(X10,X12)
& ~ q(X12,X10) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X7] :
( ~ p(esk1_1(X7),X7)
| ! [X9] : q(X9,X7) )
& ! [X10] :
( p(esk2_1(X10),X10)
& ! [X12] :
( ~ p(X10,X12)
& ~ q(X12,X10) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X7,X9,X10,X12] :
( ~ p(X10,X12)
& ~ q(X12,X10)
& p(esk2_1(X10),X10)
& ( q(X9,X7)
| ~ p(esk1_1(X7),X7) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(8,negated_conjecture,
p(esk2_1(X1),X1),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
~ p(X1,X2),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
$false,
inference(sr,[status(thm)],[8,10,theory(equality)]) ).
cnf(12,negated_conjecture,
$false,
11,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN732+1.p
% --creating new selector for []
% -running prover on /tmp/tmp9nQEr7/sel_SYN732+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN732+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN732+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN732+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
%
%------------------------------------------------------------------------------