%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN724+1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 13:59:15 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 158 ( 0 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 199 ( 71 ~; 88 |; 34 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( r(X1)
=> s(X1) )
<=> ! [X1] :
( ( r(X1)
& s(X1) )
<=> r(X1) ) ),
file('/tmp/tmpUyL33g/sel_SYN724+1.p_1',thm31) ).
fof(2,negated_conjecture,
~ ( ! [X1] :
( r(X1)
=> s(X1) )
<=> ! [X1] :
( ( r(X1)
& s(X1) )
<=> r(X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ? [X1] :
( r(X1)
& ~ s(X1) )
| ? [X1] :
( ( ~ r(X1)
| ~ s(X1)
| ~ r(X1) )
& ( ( r(X1)
& s(X1) )
| r(X1) ) ) )
& ( ! [X1] :
( ~ r(X1)
| s(X1) )
| ! [X1] :
( ( ~ r(X1)
| ~ s(X1)
| r(X1) )
& ( ~ r(X1)
| ( r(X1)
& s(X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ? [X2] :
( r(X2)
& ~ s(X2) )
| ? [X3] :
( ( ~ r(X3)
| ~ s(X3)
| ~ r(X3) )
& ( ( r(X3)
& s(X3) )
| r(X3) ) ) )
& ( ! [X4] :
( ~ r(X4)
| s(X4) )
| ! [X5] :
( ( ~ r(X5)
| ~ s(X5)
| r(X5) )
& ( ~ r(X5)
| ( r(X5)
& s(X5) ) ) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ( r(esk1_0)
& ~ s(esk1_0) )
| ( ( ~ r(esk2_0)
| ~ s(esk2_0)
| ~ r(esk2_0) )
& ( ( r(esk2_0)
& s(esk2_0) )
| r(esk2_0) ) ) )
& ( ! [X4] :
( ~ r(X4)
| s(X4) )
| ! [X5] :
( ( ~ r(X5)
| ~ s(X5)
| r(X5) )
& ( ~ r(X5)
| ( r(X5)
& s(X5) ) ) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X4,X5] :
( ( ( ( ~ r(X5)
| ~ s(X5)
| r(X5) )
& ( ~ r(X5)
| ( r(X5)
& s(X5) ) ) )
| ~ r(X4)
| s(X4) )
& ( ( r(esk1_0)
& ~ s(esk1_0) )
| ( ( ~ r(esk2_0)
| ~ s(esk2_0)
| ~ r(esk2_0) )
& ( ( r(esk2_0)
& s(esk2_0) )
| r(esk2_0) ) ) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X4,X5] :
( ( ~ r(X5)
| ~ s(X5)
| r(X5)
| ~ r(X4)
| s(X4) )
& ( r(X5)
| ~ r(X5)
| ~ r(X4)
| s(X4) )
& ( s(X5)
| ~ r(X5)
| ~ r(X4)
| s(X4) )
& ( ~ r(esk2_0)
| ~ s(esk2_0)
| ~ r(esk2_0)
| r(esk1_0) )
& ( r(esk2_0)
| r(esk2_0)
| r(esk1_0) )
& ( s(esk2_0)
| r(esk2_0)
| r(esk1_0) )
& ( ~ r(esk2_0)
| ~ s(esk2_0)
| ~ r(esk2_0)
| ~ s(esk1_0) )
& ( r(esk2_0)
| r(esk2_0)
| ~ s(esk1_0) )
& ( s(esk2_0)
| r(esk2_0)
| ~ s(esk1_0) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
( r(esk2_0)
| r(esk2_0)
| ~ s(esk1_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( ~ s(esk1_0)
| ~ r(esk2_0)
| ~ s(esk2_0)
| ~ r(esk2_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( r(esk1_0)
| r(esk2_0)
| r(esk2_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
( r(esk1_0)
| ~ r(esk2_0)
| ~ s(esk2_0)
| ~ r(esk2_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(14,negated_conjecture,
( s(X1)
| s(X2)
| ~ r(X1)
| ~ r(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(19,negated_conjecture,
( r(esk1_0)
| ~ s(esk2_0) ),
inference(csr,[status(thm)],[13,12]) ).
cnf(20,negated_conjecture,
( s(X1)
| s(esk1_0)
| r(esk2_0)
| ~ r(X1) ),
inference(spm,[status(thm)],[14,12,theory(equality)]) ).
cnf(21,negated_conjecture,
( ~ s(esk1_0)
| ~ s(esk2_0) ),
inference(csr,[status(thm)],[10,9]) ).
cnf(22,negated_conjecture,
( s(X1)
| r(esk2_0)
| ~ r(X1) ),
inference(csr,[status(thm)],[20,9]) ).
cnf(23,negated_conjecture,
( r(esk2_0)
| ~ r(esk1_0) ),
inference(spm,[status(thm)],[9,22,theory(equality)]) ).
cnf(26,negated_conjecture,
r(esk2_0),
inference(csr,[status(thm)],[23,12]) ).
cnf(27,negated_conjecture,
( s(X1)
| s(esk2_0)
| ~ r(X1) ),
inference(spm,[status(thm)],[14,26,theory(equality)]) ).
cnf(31,negated_conjecture,
s(esk2_0),
inference(spm,[status(thm)],[27,26,theory(equality)]) ).
cnf(33,negated_conjecture,
( ~ s(esk1_0)
| $false ),
inference(rw,[status(thm)],[21,31,theory(equality)]) ).
cnf(34,negated_conjecture,
~ s(esk1_0),
inference(cn,[status(thm)],[33,theory(equality)]) ).
cnf(35,negated_conjecture,
( r(esk1_0)
| $false ),
inference(rw,[status(thm)],[19,31,theory(equality)]) ).
cnf(36,negated_conjecture,
r(esk1_0),
inference(cn,[status(thm)],[35,theory(equality)]) ).
cnf(37,negated_conjecture,
( s(X1)
| s(esk1_0)
| ~ r(X1) ),
inference(spm,[status(thm)],[14,36,theory(equality)]) ).
cnf(38,negated_conjecture,
( s(X1)
| ~ r(X1) ),
inference(sr,[status(thm)],[37,34,theory(equality)]) ).
cnf(39,negated_conjecture,
~ r(esk1_0),
inference(spm,[status(thm)],[34,38,theory(equality)]) ).
cnf(40,negated_conjecture,
$false,
inference(rw,[status(thm)],[39,36,theory(equality)]) ).
cnf(41,negated_conjecture,
$false,
inference(cn,[status(thm)],[40,theory(equality)]) ).
cnf(42,negated_conjecture,
$false,
41,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN724+1.p
% --creating new selector for []
% -running prover on /tmp/tmpUyL33g/sel_SYN724+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN724+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN724+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN724+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
%
%------------------------------------------------------------------------------