TSTP Solution File: KRS085+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS085+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:33 EST 2010
% Result : Unsatisfiable 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 23 ( 5 avg)
% Number of connectives : 184 ( 71 ~; 66 |; 41 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 66 ( 1 sgn 39 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& cp1(X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) ) ) )
& cp1(X4) ) ),
file('/tmp/tmpoOxRFp/sel_KRS085+1.p_1',axiom_2) ).
fof(7,axiom,
! [X4,X5,X6] :
( ( rr(X4,X5)
& rr(X5,X6) )
=> rr(X4,X6) ),
file('/tmp/tmpoOxRFp/sel_KRS085+1.p_1',axiom_6) ).
fof(8,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537),
file('/tmp/tmpoOxRFp/sel_KRS085+1.p_1',axiom_7) ).
fof(10,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/tmp/tmpoOxRFp/sel_KRS085+1.p_1',axiom_5) ).
fof(23,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& cp1(X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) ) ) )
& cp1(X4) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(32,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ( ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& cp1(X6)
& ! [X7] :
( ~ rinvR(X6,X7)
| ~ cp1(X7) ) ) )
& cp1(X4) ) )
& ( ! [X5] :
( ~ rr(X4,X5)
| ! [X6] :
( ~ rr(X5,X6)
| ~ cp1(X6)
| ? [X7] :
( rinvR(X6,X7)
& cp1(X7) ) ) )
| ~ cp1(X4)
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(33,plain,
! [X8] :
( ( ~ cUnsatisfiable(X8)
| ( ? [X9] :
( rr(X8,X9)
& ? [X10] :
( rr(X9,X10)
& cp1(X10)
& ! [X11] :
( ~ rinvR(X10,X11)
| ~ cp1(X11) ) ) )
& cp1(X8) ) )
& ( ! [X12] :
( ~ rr(X8,X12)
| ! [X13] :
( ~ rr(X12,X13)
| ~ cp1(X13)
| ? [X14] :
( rinvR(X13,X14)
& cp1(X14) ) ) )
| ~ cp1(X8)
| cUnsatisfiable(X8) ) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,plain,
! [X8] :
( ( ~ cUnsatisfiable(X8)
| ( rr(X8,esk1_1(X8))
& rr(esk1_1(X8),esk2_1(X8))
& cp1(esk2_1(X8))
& ! [X11] :
( ~ rinvR(esk2_1(X8),X11)
| ~ cp1(X11) )
& cp1(X8) ) )
& ( ! [X12] :
( ~ rr(X8,X12)
| ! [X13] :
( ~ rr(X12,X13)
| ~ cp1(X13)
| ( rinvR(X13,esk3_3(X8,X12,X13))
& cp1(esk3_3(X8,X12,X13)) ) ) )
| ~ cp1(X8)
| cUnsatisfiable(X8) ) ),
inference(skolemize,[status(esa)],[33]) ).
fof(35,plain,
! [X8,X11,X12,X13] :
( ( ~ rr(X12,X13)
| ~ cp1(X13)
| ( rinvR(X13,esk3_3(X8,X12,X13))
& cp1(esk3_3(X8,X12,X13)) )
| ~ rr(X8,X12)
| ~ cp1(X8)
| cUnsatisfiable(X8) )
& ( ( ( ~ rinvR(esk2_1(X8),X11)
| ~ cp1(X11) )
& rr(esk1_1(X8),esk2_1(X8))
& cp1(esk2_1(X8))
& rr(X8,esk1_1(X8))
& cp1(X8) )
| ~ cUnsatisfiable(X8) ) ),
inference(shift_quantors,[status(thm)],[34]) ).
fof(36,plain,
! [X8,X11,X12,X13] :
( ( rinvR(X13,esk3_3(X8,X12,X13))
| ~ rr(X12,X13)
| ~ cp1(X13)
| ~ rr(X8,X12)
| ~ cp1(X8)
| cUnsatisfiable(X8) )
& ( cp1(esk3_3(X8,X12,X13))
| ~ rr(X12,X13)
| ~ cp1(X13)
| ~ rr(X8,X12)
| ~ cp1(X8)
| cUnsatisfiable(X8) )
& ( ~ rinvR(esk2_1(X8),X11)
| ~ cp1(X11)
| ~ cUnsatisfiable(X8) )
& ( rr(esk1_1(X8),esk2_1(X8))
| ~ cUnsatisfiable(X8) )
& ( cp1(esk2_1(X8))
| ~ cUnsatisfiable(X8) )
& ( rr(X8,esk1_1(X8))
| ~ cUnsatisfiable(X8) )
& ( cp1(X8)
| ~ cUnsatisfiable(X8) ) ),
inference(distribute,[status(thm)],[35]) ).
cnf(37,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(40,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(41,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(X2)
| ~ rinvR(esk2_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(55,plain,
! [X4,X5,X6] :
( ~ rr(X4,X5)
| ~ rr(X5,X6)
| rr(X4,X6) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(56,plain,
! [X7,X8,X9] :
( ~ rr(X7,X8)
| ~ rr(X8,X9)
| rr(X7,X9) ),
inference(variable_rename,[status(thm)],[55]) ).
cnf(57,plain,
( rr(X1,X2)
| ~ rr(X3,X2)
| ~ rr(X1,X3) ),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(58,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(split_conjunct,[status(thm)],[8]) ).
fof(63,plain,
! [X4,X5] :
( ( ~ rinvR(X4,X5)
| rr(X5,X4) )
& ( ~ rr(X5,X4)
| rinvR(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(64,plain,
! [X6,X7] :
( ( ~ rinvR(X6,X7)
| rr(X7,X6) )
& ( ~ rr(X7,X6)
| rinvR(X6,X7) ) ),
inference(variable_rename,[status(thm)],[63]) ).
cnf(65,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(108,plain,
( rr(X1,esk2_1(X2))
| ~ rr(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[57,40,theory(equality)]) ).
cnf(110,plain,
( ~ cp1(X1)
| ~ cUnsatisfiable(X2)
| ~ rr(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[41,65,theory(equality)]) ).
cnf(118,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[108,38,theory(equality)]) ).
cnf(121,plain,
( ~ cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[110,118,theory(equality)]) ).
cnf(124,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[121,37]) ).
cnf(125,plain,
$false,
inference(sr,[status(thm)],[58,124,theory(equality)]) ).
cnf(126,plain,
$false,
125,
[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/KRS085+1.p
% --creating new selector for []
% -running prover on /tmp/tmpoOxRFp/sel_KRS085+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS085+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS085+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS085+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
%
%------------------------------------------------------------------------------