%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS089+1 : TPTP v5.0.0. Released v3.1.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 : Sat Dec 25 13:02:55 EST 2010
% Result : Unsatisfiable 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 50 ( 11 unt; 0 def)
% Number of atoms : 165 ( 64 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 183 ( 68 ~; 74 |; 37 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 88 ( 12 sgn 28 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cowlThing(X1)
=> ? [X2] :
( rp(X1,X2)
& X2 = ispy ) ),
file('/tmp/tmpHbckjv/sel_KRS089+1.p_1',axiom_3) ).
fof(6,axiom,
! [X1] :
( cUnsatisfiable(X1)
=> ? [X6,X7,X8] :
( rr(X1,X6)
& rr(X1,X7)
& rr(X1,X8)
& X6 != X7
& X6 != X8
& X7 != X8 ) ),
file('/tmp/tmpHbckjv/sel_KRS089+1.p_1',axiom_2) ).
fof(8,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpHbckjv/sel_KRS089+1.p_1',axiom_0) ).
fof(11,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('/tmp/tmpHbckjv/sel_KRS089+1.p_1',axiom_7) ).
fof(12,axiom,
! [X1,X2] :
( rp(X1,X2)
<=> rinvP(X2,X1) ),
file('/tmp/tmpHbckjv/sel_KRS089+1.p_1',axiom_4) ).
fof(13,axiom,
! [X9,X10,X11] :
( ( rinvP(ispy,X9)
& rinvP(ispy,X10)
& rinvP(ispy,X11) )
=> ( X9 = X10
| X9 = X11
| X10 = X11 ) ),
file('/tmp/tmpHbckjv/sel_KRS089+1.p_1',axiom_5) ).
fof(20,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(22,plain,
! [X1] :
( ~ cowlThing(X1)
| ? [X2] :
( rp(X1,X2)
& X2 = ispy ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(23,plain,
! [X3] :
( ~ cowlThing(X3)
| ? [X4] :
( rp(X3,X4)
& X4 = ispy ) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,plain,
! [X3] :
( ~ cowlThing(X3)
| ( rp(X3,esk1_1(X3))
& esk1_1(X3) = ispy ) ),
inference(skolemize,[status(esa)],[23]) ).
fof(25,plain,
! [X3] :
( ( rp(X3,esk1_1(X3))
| ~ cowlThing(X3) )
& ( esk1_1(X3) = ispy
| ~ cowlThing(X3) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(26,plain,
( esk1_1(X1) = ispy
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(27,plain,
( rp(X1,esk1_1(X1))
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(38,plain,
! [X1] :
( ~ cUnsatisfiable(X1)
| ? [X6,X7,X8] :
( rr(X1,X6)
& rr(X1,X7)
& rr(X1,X8)
& X6 != X7
& X6 != X8
& X7 != X8 ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(39,plain,
! [X9] :
( ~ cUnsatisfiable(X9)
| ? [X10,X11,X12] :
( rr(X9,X10)
& rr(X9,X11)
& rr(X9,X12)
& X10 != X11
& X10 != X12
& X11 != X12 ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
! [X9] :
( ~ cUnsatisfiable(X9)
| ( rr(X9,esk2_1(X9))
& rr(X9,esk3_1(X9))
& rr(X9,esk4_1(X9))
& esk2_1(X9) != esk3_1(X9)
& esk2_1(X9) != esk4_1(X9)
& esk3_1(X9) != esk4_1(X9) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X9] :
( ( rr(X9,esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk3_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk4_1(X9))
| ~ cUnsatisfiable(X9) )
& ( esk2_1(X9) != esk3_1(X9)
| ~ cUnsatisfiable(X9) )
& ( esk2_1(X9) != esk4_1(X9)
| ~ cUnsatisfiable(X9) )
& ( esk3_1(X9) != esk4_1(X9)
| ~ cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(42,plain,
( ~ cUnsatisfiable(X1)
| esk3_1(X1) != esk4_1(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) != esk4_1(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(51,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(53,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(61,plain,
cUnsatisfiable(i2003_11_14_17_19_53168),
inference(split_conjunct,[status(thm)],[11]) ).
fof(62,plain,
! [X1,X2] :
( ( ~ rp(X1,X2)
| rinvP(X2,X1) )
& ( ~ rinvP(X2,X1)
| rp(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(63,plain,
! [X3,X4] :
( ( ~ rp(X3,X4)
| rinvP(X4,X3) )
& ( ~ rinvP(X4,X3)
| rp(X3,X4) ) ),
inference(variable_rename,[status(thm)],[62]) ).
cnf(65,plain,
( rinvP(X1,X2)
| ~ rp(X2,X1) ),
inference(split_conjunct,[status(thm)],[63]) ).
fof(66,plain,
! [X9,X10,X11] :
( ~ rinvP(ispy,X9)
| ~ rinvP(ispy,X10)
| ~ rinvP(ispy,X11)
| X9 = X10
| X9 = X11
| X10 = X11 ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(67,plain,
! [X12,X13,X14] :
( ~ rinvP(ispy,X12)
| ~ rinvP(ispy,X13)
| ~ rinvP(ispy,X14)
| X12 = X13
| X12 = X14
| X13 = X14 ),
inference(variable_rename,[status(thm)],[66]) ).
cnf(68,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| ~ rinvP(ispy,X2)
| ~ rinvP(ispy,X1)
| ~ rinvP(ispy,X3) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(88,plain,
( esk1_1(X1) = ispy
| $false ),
inference(rw,[status(thm)],[26,53,theory(equality)]),
[unfolding] ).
cnf(89,plain,
( rp(X1,esk1_1(X1))
| $false ),
inference(rw,[status(thm)],[27,53,theory(equality)]),
[unfolding] ).
cnf(90,plain,
rp(X1,ispy),
inference(rw,[status(thm)],[89,88,theory(equality)]),
[unfolding] ).
cnf(91,plain,
rinvP(ispy,X1),
inference(spm,[status(thm)],[65,90,theory(equality)]) ).
cnf(94,plain,
( X1 = X2
| X1 = X3
| X2 = X3
| $false
| ~ rinvP(ispy,X2)
| ~ rinvP(ispy,X1) ),
inference(rw,[status(thm)],[68,91,theory(equality)]) ).
cnf(95,plain,
( X1 = X2
| X1 = X3
| X2 = X3
| $false
| $false
| ~ rinvP(ispy,X1) ),
inference(rw,[status(thm)],[94,91,theory(equality)]) ).
cnf(96,plain,
( X1 = X2
| X1 = X3
| X2 = X3
| $false
| $false
| $false ),
inference(rw,[status(thm)],[95,91,theory(equality)]) ).
cnf(97,plain,
( X1 = X2
| X1 = X3
| X2 = X3 ),
inference(cn,[status(thm)],[96,theory(equality)]) ).
cnf(147,plain,
( X3 = X2
| X3 = esk3_1(X1)
| X2 != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[44,97,theory(equality)]) ).
cnf(153,plain,
( X3 = X2
| X3 = esk4_1(X1)
| X2 != esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[43,97,theory(equality)]) ).
cnf(203,plain,
( X1 = esk3_1(X2)
| X1 = esk2_1(X2)
| ~ cUnsatisfiable(X2) ),
inference(er,[status(thm)],[147,theory(equality)]) ).
cnf(291,plain,
( X1 = esk4_1(X2)
| X1 = esk2_1(X2)
| ~ cUnsatisfiable(X2) ),
inference(er,[status(thm)],[153,theory(equality)]) ).
cnf(321,plain,
( X2 = esk2_1(X1)
| X2 != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[42,291,theory(equality)]) ).
cnf(330,plain,
( X2 = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[321,203]) ).
cnf(343,plain,
( X1 = X3
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[330,330,theory(equality)]) ).
cnf(348,plain,
X1 = X2,
inference(spm,[status(thm)],[343,61,theory(equality)]) ).
cnf(408,plain,
cUnsatisfiable(X1),
inference(spm,[status(thm)],[61,348,theory(equality)]) ).
cnf(420,plain,
~ cUnsatisfiable(X1),
inference(sr,[status(thm)],[44,348,theory(equality)]) ).
cnf(430,plain,
$false,
inference(rw,[status(thm)],[420,408,theory(equality)]) ).
cnf(431,plain,
$false,
inference(cn,[status(thm)],[430,theory(equality)]) ).
cnf(432,plain,
$false,
431,
[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/KRS/KRS089+1.p
% --creating new selector for []
% -running prover on /tmp/tmpHbckjv/sel_KRS089+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS089+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS089+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS089+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Unsatisfiable
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------