TSTP Solution File: KRS083+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS083+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:25 EST 2010
% Result : Unsatisfiable 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 6 unt; 0 def)
% Number of atoms : 254 ( 9 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 320 ( 126 ~; 118 |; 65 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 119 ( 2 sgn 69 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( rinvF(X5,X6)
& cd(X6) ) )
& ~ cc(X4)
& ? [X5] :
( rinvF(X4,X5)
& cd(X5) ) ) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_2) ).
fof(5,axiom,
! [X4] :
( cd(X4)
<=> ( ? [X5] :
( rf(X4,X5)
& ~ cc(X5) )
& cc(X4) ) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_3) ).
fof(6,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_0) ).
fof(8,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_6) ).
fof(10,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X7,X8] :
( ( rf(X4,X7)
& rf(X4,X8) )
=> X7 = X8 ) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_4) ).
fof(11,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_5) ).
fof(12,axiom,
cUnsatisfiable(i2003_11_14_17_19_32337),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_8) ).
fof(13,axiom,
! [X4,X5] :
( rf(X4,X5)
=> rr(X4,X5) ),
file('/tmp/tmp0vGvqA/sel_KRS083+1.p_1',axiom_9) ).
fof(26,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( rinvF(X5,X6)
& cd(X6) ) )
& ~ cc(X4)
& ? [X5] :
( rinvF(X4,X5)
& cd(X5) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(27,plain,
! [X4] :
( cd(X4)
<=> ( ? [X5] :
( rf(X4,X5)
& ~ cc(X5) )
& cc(X4) ) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(28,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(39,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ( ! [X5] :
( ~ rinvR(X4,X5)
| ? [X6] :
( rinvF(X5,X6)
& cd(X6) ) )
& ~ cc(X4)
& ? [X5] :
( rinvF(X4,X5)
& cd(X5) ) ) )
& ( ? [X5] :
( rinvR(X4,X5)
& ! [X6] :
( ~ rinvF(X5,X6)
| ~ cd(X6) ) )
| cc(X4)
| ! [X5] :
( ~ rinvF(X4,X5)
| ~ cd(X5) )
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(40,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ! [X8] :
( ~ rinvR(X7,X8)
| ? [X9] :
( rinvF(X8,X9)
& cd(X9) ) )
& ~ cc(X7)
& ? [X10] :
( rinvF(X7,X10)
& cd(X10) ) ) )
& ( ? [X11] :
( rinvR(X7,X11)
& ! [X12] :
( ~ rinvF(X11,X12)
| ~ cd(X12) ) )
| cc(X7)
| ! [X13] :
( ~ rinvF(X7,X13)
| ~ cd(X13) )
| cUnsatisfiable(X7) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ! [X8] :
( ~ rinvR(X7,X8)
| ( rinvF(X8,esk1_2(X7,X8))
& cd(esk1_2(X7,X8)) ) )
& ~ cc(X7)
& rinvF(X7,esk2_1(X7))
& cd(esk2_1(X7)) ) )
& ( ( rinvR(X7,esk3_1(X7))
& ! [X12] :
( ~ rinvF(esk3_1(X7),X12)
| ~ cd(X12) ) )
| cc(X7)
| ! [X13] :
( ~ rinvF(X7,X13)
| ~ cd(X13) )
| cUnsatisfiable(X7) ) ),
inference(skolemize,[status(esa)],[40]) ).
fof(42,plain,
! [X7,X8,X12,X13] :
( ( ~ rinvF(X7,X13)
| ~ cd(X13)
| ( ( ~ rinvF(esk3_1(X7),X12)
| ~ cd(X12) )
& rinvR(X7,esk3_1(X7)) )
| cc(X7)
| cUnsatisfiable(X7) )
& ( ( ( ~ rinvR(X7,X8)
| ( rinvF(X8,esk1_2(X7,X8))
& cd(esk1_2(X7,X8)) ) )
& ~ cc(X7)
& rinvF(X7,esk2_1(X7))
& cd(esk2_1(X7)) )
| ~ cUnsatisfiable(X7) ) ),
inference(shift_quantors,[status(thm)],[41]) ).
fof(43,plain,
! [X7,X8,X12,X13] :
( ( ~ rinvF(esk3_1(X7),X12)
| ~ cd(X12)
| cc(X7)
| ~ rinvF(X7,X13)
| ~ cd(X13)
| cUnsatisfiable(X7) )
& ( rinvR(X7,esk3_1(X7))
| cc(X7)
| ~ rinvF(X7,X13)
| ~ cd(X13)
| cUnsatisfiable(X7) )
& ( rinvF(X8,esk1_2(X7,X8))
| ~ rinvR(X7,X8)
| ~ cUnsatisfiable(X7) )
& ( cd(esk1_2(X7,X8))
| ~ rinvR(X7,X8)
| ~ cUnsatisfiable(X7) )
& ( ~ cc(X7)
| ~ cUnsatisfiable(X7) )
& ( rinvF(X7,esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cd(esk2_1(X7))
| ~ cUnsatisfiable(X7) ) ),
inference(distribute,[status(thm)],[42]) ).
cnf(44,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(45,plain,
( rinvF(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(47,plain,
( cd(esk1_2(X1,X2))
| ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(48,plain,
( rinvF(X2,esk1_2(X1,X2))
| ~ cUnsatisfiable(X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(51,plain,
! [X4] :
( ( ~ cd(X4)
| ( ? [X5] :
( rf(X4,X5)
& ~ cc(X5) )
& cc(X4) ) )
& ( ! [X5] :
( ~ rf(X4,X5)
| cc(X5) )
| ~ cc(X4)
| cd(X4) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(52,plain,
! [X6] :
( ( ~ cd(X6)
| ( ? [X7] :
( rf(X6,X7)
& ~ cc(X7) )
& cc(X6) ) )
& ( ! [X8] :
( ~ rf(X6,X8)
| cc(X8) )
| ~ cc(X6)
| cd(X6) ) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
! [X6] :
( ( ~ cd(X6)
| ( rf(X6,esk4_1(X6))
& ~ cc(esk4_1(X6))
& cc(X6) ) )
& ( ! [X8] :
( ~ rf(X6,X8)
| cc(X8) )
| ~ cc(X6)
| cd(X6) ) ),
inference(skolemize,[status(esa)],[52]) ).
fof(54,plain,
! [X6,X8] :
( ( ~ rf(X6,X8)
| cc(X8)
| ~ cc(X6)
| cd(X6) )
& ( ~ cd(X6)
| ( rf(X6,esk4_1(X6))
& ~ cc(esk4_1(X6))
& cc(X6) ) ) ),
inference(shift_quantors,[status(thm)],[53]) ).
fof(55,plain,
! [X6,X8] :
( ( ~ rf(X6,X8)
| cc(X8)
| ~ cc(X6)
| cd(X6) )
& ( rf(X6,esk4_1(X6))
| ~ cd(X6) )
& ( ~ cc(esk4_1(X6))
| ~ cd(X6) )
& ( cc(X6)
| ~ cd(X6) ) ),
inference(distribute,[status(thm)],[54]) ).
cnf(56,plain,
( cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(57,plain,
( ~ cd(X1)
| ~ cc(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(58,plain,
( rf(X1,esk4_1(X1))
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[55]) ).
fof(60,plain,
! [X5] :
( cowlThing(X5)
& ~ cowlNothing(X5) ),
inference(variable_rename,[status(thm)],[28]) ).
cnf(62,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[60]) ).
fof(67,plain,
! [X4,X5] :
( ( ~ rinvR(X4,X5)
| rr(X5,X4) )
& ( ~ rr(X5,X4)
| rinvR(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(68,plain,
! [X6,X7] :
( ( ~ rinvR(X6,X7)
| rr(X7,X6) )
& ( ~ rr(X7,X6)
| rinvR(X6,X7) ) ),
inference(variable_rename,[status(thm)],[67]) ).
cnf(69,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
inference(split_conjunct,[status(thm)],[68]) ).
fof(74,plain,
! [X4] :
( ~ cowlThing(X4)
| ! [X7,X8] :
( ~ rf(X4,X7)
| ~ rf(X4,X8)
| X7 = X8 ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(75,plain,
! [X9] :
( ~ cowlThing(X9)
| ! [X10,X11] :
( ~ rf(X9,X10)
| ~ rf(X9,X11)
| X10 = X11 ) ),
inference(variable_rename,[status(thm)],[74]) ).
fof(76,plain,
! [X9,X10,X11] :
( ~ rf(X9,X10)
| ~ rf(X9,X11)
| X10 = X11
| ~ cowlThing(X9) ),
inference(shift_quantors,[status(thm)],[75]) ).
cnf(77,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[76]) ).
fof(78,plain,
! [X4,X5] :
( ( ~ rinvF(X4,X5)
| rf(X5,X4) )
& ( ~ rf(X5,X4)
| rinvF(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(79,plain,
! [X6,X7] :
( ( ~ rinvF(X6,X7)
| rf(X7,X6) )
& ( ~ rf(X7,X6)
| rinvF(X6,X7) ) ),
inference(variable_rename,[status(thm)],[78]) ).
cnf(81,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(82,plain,
cUnsatisfiable(i2003_11_14_17_19_32337),
inference(split_conjunct,[status(thm)],[12]) ).
fof(83,plain,
! [X4,X5] :
( ~ rf(X4,X5)
| rr(X4,X5) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(84,plain,
! [X6,X7] :
( ~ rf(X6,X7)
| rr(X6,X7) ),
inference(variable_rename,[status(thm)],[83]) ).
cnf(85,plain,
( rr(X1,X2)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[84]) ).
cnf(122,plain,
( X2 = X3
| $false
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(rw,[status(thm)],[77,62,theory(equality)]),
[unfolding] ).
cnf(124,plain,
( cc(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[56,44,theory(equality)]) ).
cnf(127,plain,
( rf(esk2_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[81,45,theory(equality)]) ).
cnf(129,plain,
( X1 = esk4_1(X2)
| ~ rf(X2,X1)
| ~ cd(X2) ),
inference(spm,[status(thm)],[122,58,theory(equality)]) ).
cnf(138,plain,
( rr(esk2_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[85,127,theory(equality)]) ).
cnf(144,plain,
( rinvR(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[69,138,theory(equality)]) ).
cnf(147,plain,
( cd(esk1_2(X1,esk2_1(X1)))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[47,144,theory(equality)]) ).
cnf(148,plain,
( rinvF(esk2_1(X1),esk1_2(X1,esk2_1(X1)))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[48,144,theory(equality)]) ).
cnf(168,plain,
( rf(esk1_2(X1,esk2_1(X1)),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[81,148,theory(equality)]) ).
cnf(178,plain,
( esk2_1(X1) = esk4_1(esk1_2(X1,esk2_1(X1)))
| ~ cd(esk1_2(X1,esk2_1(X1)))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[129,168,theory(equality)]) ).
cnf(306,plain,
( esk4_1(esk1_2(X1,esk2_1(X1))) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[178,147]) ).
cnf(307,plain,
( ~ cd(esk1_2(X1,esk2_1(X1)))
| ~ cc(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[57,306,theory(equality)]) ).
cnf(336,plain,
( ~ cd(esk1_2(X1,esk2_1(X1)))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[307,124]) ).
cnf(337,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[336,147]) ).
cnf(338,plain,
$false,
inference(sr,[status(thm)],[82,337,theory(equality)]) ).
cnf(339,plain,
$false,
338,
[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/KRS083+1.p
% --creating new selector for []
% -running prover on /tmp/tmp0vGvqA/sel_KRS083+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS083+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS083+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS083+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
%
%------------------------------------------------------------------------------