%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN726+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:34 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 159 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 177 ( 59 ~; 72 |; 33 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 137 ( 7 sgn 82 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) )
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
file('/tmp/tmpj6lIK6/sel_SYN726+1.p_1',thm400) ).
fof(2,negated_conjecture,
~ ( ( ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) )
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,plain,
( epred1_0
=> ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) ) ),
introduced(definition) ).
fof(4,negated_conjecture,
~ ( ( epred1_0
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
inference(apply_def,[status(esa)],[2,3,theory(equality)]) ).
fof(5,negated_conjecture,
( epred1_0
& ? [X1,X2] : ~ p(X1,X2)
& ? [X1,X2] : ~ q(X1,X2) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( epred1_0
& ? [X3,X4] : ~ p(X3,X4)
& ? [X5,X6] : ~ q(X5,X6) ),
inference(variable_rename,[status(thm)],[5]) ).
fof(7,negated_conjecture,
( epred1_0
& ~ p(esk1_0,esk2_0)
& ~ q(esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[6]) ).
cnf(8,negated_conjecture,
~ q(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
~ p(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[7]) ).
fof(11,plain,
( ~ epred1_0
| ( ! [X1,X2,X3] :
( ~ p(X1,X2)
| ~ p(X2,X3)
| p(X1,X3) )
& ! [X1,X2,X3] :
( ~ q(X1,X2)
| ~ q(X2,X3)
| q(X1,X3) )
& ! [X1,X2] :
( ~ q(X1,X2)
| q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(12,plain,
( ~ epred1_0
| ( ! [X4,X5,X6] :
( ~ p(X4,X5)
| ~ p(X5,X6)
| p(X4,X6) )
& ! [X7,X8,X9] :
( ~ q(X7,X8)
| ~ q(X8,X9)
| q(X7,X9) )
& ! [X10,X11] :
( ~ q(X10,X11)
| q(X11,X10) )
& ! [X12,X13] :
( p(X12,X13)
| q(X12,X13) ) ) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(13,plain,
! [X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] :
( ( ( p(X12,X13)
| q(X12,X13) )
& ( ~ q(X10,X11)
| q(X11,X10) )
& ( ~ q(X7,X8)
| ~ q(X8,X9)
| q(X7,X9) )
& ( ~ p(X4,X5)
| ~ p(X5,X6)
| p(X4,X6) ) )
| ~ epred1_0 ),
inference(shift_quantors,[status(thm)],[12]) ).
fof(14,plain,
! [X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] :
( ( p(X12,X13)
| q(X12,X13)
| ~ epred1_0 )
& ( ~ q(X10,X11)
| q(X11,X10)
| ~ epred1_0 )
& ( ~ q(X7,X8)
| ~ q(X8,X9)
| q(X7,X9)
| ~ epred1_0 )
& ( ~ p(X4,X5)
| ~ p(X5,X6)
| p(X4,X6)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[13]) ).
cnf(15,plain,
( p(X1,X2)
| ~ epred1_0
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X2,X1) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(18,plain,
( q(X1,X2)
| p(X1,X2)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(19,plain,
( p(X1,X2)
| q(X1,X2)
| $false ),
inference(rw,[status(thm)],[18,10,theory(equality)]) ).
cnf(20,plain,
( p(X1,X2)
| q(X1,X2) ),
inference(cn,[status(thm)],[19,theory(equality)]) ).
cnf(21,plain,
q(esk1_0,esk2_0),
inference(spm,[status(thm)],[9,20,theory(equality)]) ).
cnf(22,plain,
( q(X1,X2)
| $false
| ~ q(X2,X1) ),
inference(rw,[status(thm)],[17,10,theory(equality)]) ).
cnf(23,plain,
( q(X1,X2)
| ~ q(X2,X1) ),
inference(cn,[status(thm)],[22,theory(equality)]) ).
cnf(24,plain,
( p(X1,X2)
| $false
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(rw,[status(thm)],[15,10,theory(equality)]) ).
cnf(25,plain,
( p(X1,X2)
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(cn,[status(thm)],[24,theory(equality)]) ).
cnf(26,plain,
( p(X1,X2)
| q(X3,X2)
| ~ p(X1,X3) ),
inference(spm,[status(thm)],[25,20,theory(equality)]) ).
cnf(27,plain,
( q(X1,X2)
| $false
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(rw,[status(thm)],[16,10,theory(equality)]) ).
cnf(28,plain,
( q(X1,X2)
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(cn,[status(thm)],[27,theory(equality)]) ).
cnf(29,plain,
q(esk2_0,esk1_0),
inference(spm,[status(thm)],[23,21,theory(equality)]) ).
cnf(31,plain,
( q(X1,X2)
| p(X3,X2)
| q(X3,X1) ),
inference(spm,[status(thm)],[26,20,theory(equality)]) ).
cnf(33,plain,
( q(X1,esk1_0)
| ~ q(X1,esk2_0) ),
inference(spm,[status(thm)],[28,29,theory(equality)]) ).
cnf(50,plain,
( q(esk1_0,X1)
| q(X1,esk2_0) ),
inference(spm,[status(thm)],[9,31,theory(equality)]) ).
cnf(60,plain,
( q(X1,esk1_0)
| q(X1,esk2_0) ),
inference(spm,[status(thm)],[23,50,theory(equality)]) ).
cnf(79,plain,
q(X1,esk1_0),
inference(csr,[status(thm)],[60,33]) ).
cnf(80,plain,
q(esk1_0,X1),
inference(spm,[status(thm)],[23,79,theory(equality)]) ).
cnf(97,plain,
( q(X1,X2)
| ~ q(X1,esk1_0) ),
inference(spm,[status(thm)],[28,80,theory(equality)]) ).
cnf(101,plain,
( q(X1,X2)
| $false ),
inference(rw,[status(thm)],[97,79,theory(equality)]) ).
cnf(102,plain,
q(X1,X2),
inference(cn,[status(thm)],[101,theory(equality)]) ).
cnf(111,negated_conjecture,
$false,
inference(rw,[status(thm)],[8,102,theory(equality)]) ).
cnf(112,negated_conjecture,
$false,
inference(cn,[status(thm)],[111,theory(equality)]) ).
cnf(113,negated_conjecture,
$false,
112,
[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/SYN726+1.p
% --creating new selector for []
% -running prover on /tmp/tmpj6lIK6/sel_SYN726+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN726+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN726+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN726+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
%
%------------------------------------------------------------------------------