TSTP Solution File: KRS113+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS113+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 13:00:25 EST 2010
% Result : Unsatisfiable 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 5 unt; 0 def)
% Number of atoms : 250 ( 14 equ)
% Maximal formula atoms : 35 ( 4 avg)
% Number of connectives : 325 ( 127 ~; 124 |; 66 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 115 ( 2 sgn 70 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X4,X5] :
( ( rr(X3,X4)
& rr(X3,X5) )
=> X4 = X5 )
& ? [X6] :
( rr(X3,X6)
& ca_Vx2(X6) )
& ? [X6] :
( rs(X3,X6)
& cp(X6) )
& cpxcomp(X3) ) ),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_2) ).
fof(3,axiom,
! [X3] :
( cp(X3)
<=> ~ ? [X6] : ra_Px1(X3,X6) ),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_3) ).
fof(6,axiom,
! [X3,X6] :
( rinvS(X3,X6)
<=> rs(X6,X3) ),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_6) ).
fof(7,axiom,
cUnsatisfiable(i2003_11_14_17_21_22376),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_7) ).
fof(8,axiom,
! [X3] :
( cpxcomp(X3)
<=> ? [X4] : ra_Px1(X3,X4) ),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_4) ).
fof(9,axiom,
! [X3] :
( ca_Vx2(X3)
<=> ! [X6] :
( rinvS(X3,X6)
=> cp(X6) ) ),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_5) ).
fof(10,axiom,
! [X3,X6] :
( rs(X3,X6)
=> rr(X3,X6) ),
file('/tmp/tmpWAyIB4/sel_KRS113+1.p_1',axiom_8) ).
fof(31,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ! [X4,X5] :
( ~ rr(X3,X4)
| ~ rr(X3,X5)
| X4 = X5 )
& ? [X6] :
( rr(X3,X6)
& ca_Vx2(X6) )
& ? [X6] :
( rs(X3,X6)
& cp(X6) )
& cpxcomp(X3) ) )
& ( ? [X4,X5] :
( rr(X3,X4)
& rr(X3,X5)
& X4 != X5 )
| ! [X6] :
( ~ rr(X3,X6)
| ~ ca_Vx2(X6) )
| ! [X6] :
( ~ rs(X3,X6)
| ~ cp(X6) )
| ~ cpxcomp(X3)
| cUnsatisfiable(X3) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(32,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ! [X8,X9] :
( ~ rr(X7,X8)
| ~ rr(X7,X9)
| X8 = X9 )
& ? [X10] :
( rr(X7,X10)
& ca_Vx2(X10) )
& ? [X11] :
( rs(X7,X11)
& cp(X11) )
& cpxcomp(X7) ) )
& ( ? [X12,X13] :
( rr(X7,X12)
& rr(X7,X13)
& X12 != X13 )
| ! [X14] :
( ~ rr(X7,X14)
| ~ ca_Vx2(X14) )
| ! [X15] :
( ~ rs(X7,X15)
| ~ cp(X15) )
| ~ cpxcomp(X7)
| cUnsatisfiable(X7) ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ! [X8,X9] :
( ~ rr(X7,X8)
| ~ rr(X7,X9)
| X8 = X9 )
& rr(X7,esk1_1(X7))
& ca_Vx2(esk1_1(X7))
& rs(X7,esk2_1(X7))
& cp(esk2_1(X7))
& cpxcomp(X7) ) )
& ( ( rr(X7,esk3_1(X7))
& rr(X7,esk4_1(X7))
& esk3_1(X7) != esk4_1(X7) )
| ! [X14] :
( ~ rr(X7,X14)
| ~ ca_Vx2(X14) )
| ! [X15] :
( ~ rs(X7,X15)
| ~ cp(X15) )
| ~ cpxcomp(X7)
| cUnsatisfiable(X7) ) ),
inference(skolemize,[status(esa)],[32]) ).
fof(34,plain,
! [X7,X8,X9,X14,X15] :
( ( ~ rs(X7,X15)
| ~ cp(X15)
| ~ rr(X7,X14)
| ~ ca_Vx2(X14)
| ( rr(X7,esk3_1(X7))
& rr(X7,esk4_1(X7))
& esk3_1(X7) != esk4_1(X7) )
| ~ cpxcomp(X7)
| cUnsatisfiable(X7) )
& ( ( ( ~ rr(X7,X8)
| ~ rr(X7,X9)
| X8 = X9 )
& rr(X7,esk1_1(X7))
& ca_Vx2(esk1_1(X7))
& rs(X7,esk2_1(X7))
& cp(esk2_1(X7))
& cpxcomp(X7) )
| ~ cUnsatisfiable(X7) ) ),
inference(shift_quantors,[status(thm)],[33]) ).
fof(35,plain,
! [X7,X8,X9,X14,X15] :
( ( rr(X7,esk3_1(X7))
| ~ rr(X7,X14)
| ~ ca_Vx2(X14)
| ~ rs(X7,X15)
| ~ cp(X15)
| ~ cpxcomp(X7)
| cUnsatisfiable(X7) )
& ( rr(X7,esk4_1(X7))
| ~ rr(X7,X14)
| ~ ca_Vx2(X14)
| ~ rs(X7,X15)
| ~ cp(X15)
| ~ cpxcomp(X7)
| cUnsatisfiable(X7) )
& ( esk3_1(X7) != esk4_1(X7)
| ~ rr(X7,X14)
| ~ ca_Vx2(X14)
| ~ rs(X7,X15)
| ~ cp(X15)
| ~ cpxcomp(X7)
| cUnsatisfiable(X7) )
& ( ~ rr(X7,X8)
| ~ rr(X7,X9)
| X8 = X9
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( ca_Vx2(esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( rs(X7,esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cp(esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cpxcomp(X7)
| ~ cUnsatisfiable(X7) ) ),
inference(distribute,[status(thm)],[34]) ).
cnf(36,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(38,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(39,plain,
( ca_Vx2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(40,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(41,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(45,plain,
! [X3] :
( ( ~ cp(X3)
| ! [X6] : ~ ra_Px1(X3,X6) )
& ( ? [X6] : ra_Px1(X3,X6)
| cp(X3) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(46,plain,
! [X7] :
( ( ~ cp(X7)
| ! [X8] : ~ ra_Px1(X7,X8) )
& ( ? [X9] : ra_Px1(X7,X9)
| cp(X7) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X7] :
( ( ~ cp(X7)
| ! [X8] : ~ ra_Px1(X7,X8) )
& ( ra_Px1(X7,esk5_1(X7))
| cp(X7) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,plain,
! [X7,X8] :
( ( ~ ra_Px1(X7,X8)
| ~ cp(X7) )
& ( ra_Px1(X7,esk5_1(X7))
| cp(X7) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
cnf(50,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(58,plain,
! [X3,X6] :
( ( ~ rinvS(X3,X6)
| rs(X6,X3) )
& ( ~ rs(X6,X3)
| rinvS(X3,X6) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(59,plain,
! [X7,X8] :
( ( ~ rinvS(X7,X8)
| rs(X8,X7) )
& ( ~ rs(X8,X7)
| rinvS(X7,X8) ) ),
inference(variable_rename,[status(thm)],[58]) ).
cnf(60,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(62,plain,
cUnsatisfiable(i2003_11_14_17_21_22376),
inference(split_conjunct,[status(thm)],[7]) ).
fof(63,plain,
! [X3] :
( ( ~ cpxcomp(X3)
| ? [X4] : ra_Px1(X3,X4) )
& ( ! [X4] : ~ ra_Px1(X3,X4)
| cpxcomp(X3) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(64,plain,
! [X5] :
( ( ~ cpxcomp(X5)
| ? [X6] : ra_Px1(X5,X6) )
& ( ! [X7] : ~ ra_Px1(X5,X7)
| cpxcomp(X5) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X5] :
( ( ~ cpxcomp(X5)
| ra_Px1(X5,esk6_1(X5)) )
& ( ! [X7] : ~ ra_Px1(X5,X7)
| cpxcomp(X5) ) ),
inference(skolemize,[status(esa)],[64]) ).
fof(66,plain,
! [X5,X7] :
( ( ~ ra_Px1(X5,X7)
| cpxcomp(X5) )
& ( ~ cpxcomp(X5)
| ra_Px1(X5,esk6_1(X5)) ) ),
inference(shift_quantors,[status(thm)],[65]) ).
cnf(67,plain,
( ra_Px1(X1,esk6_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(69,plain,
! [X3] :
( ( ~ ca_Vx2(X3)
| ! [X6] :
( ~ rinvS(X3,X6)
| cp(X6) ) )
& ( ? [X6] :
( rinvS(X3,X6)
& ~ cp(X6) )
| ca_Vx2(X3) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(70,plain,
! [X7] :
( ( ~ ca_Vx2(X7)
| ! [X8] :
( ~ rinvS(X7,X8)
| cp(X8) ) )
& ( ? [X9] :
( rinvS(X7,X9)
& ~ cp(X9) )
| ca_Vx2(X7) ) ),
inference(variable_rename,[status(thm)],[69]) ).
fof(71,plain,
! [X7] :
( ( ~ ca_Vx2(X7)
| ! [X8] :
( ~ rinvS(X7,X8)
| cp(X8) ) )
& ( ( rinvS(X7,esk7_1(X7))
& ~ cp(esk7_1(X7)) )
| ca_Vx2(X7) ) ),
inference(skolemize,[status(esa)],[70]) ).
fof(72,plain,
! [X7,X8] :
( ( ~ rinvS(X7,X8)
| cp(X8)
| ~ ca_Vx2(X7) )
& ( ( rinvS(X7,esk7_1(X7))
& ~ cp(esk7_1(X7)) )
| ca_Vx2(X7) ) ),
inference(shift_quantors,[status(thm)],[71]) ).
fof(73,plain,
! [X7,X8] :
( ( ~ rinvS(X7,X8)
| cp(X8)
| ~ ca_Vx2(X7) )
& ( rinvS(X7,esk7_1(X7))
| ca_Vx2(X7) )
& ( ~ cp(esk7_1(X7))
| ca_Vx2(X7) ) ),
inference(distribute,[status(thm)],[72]) ).
cnf(76,plain,
( cp(X2)
| ~ ca_Vx2(X1)
| ~ rinvS(X1,X2) ),
inference(split_conjunct,[status(thm)],[73]) ).
fof(77,plain,
! [X3,X6] :
( ~ rs(X3,X6)
| rr(X3,X6) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(78,plain,
! [X7,X8] :
( ~ rs(X7,X8)
| rr(X7,X8) ),
inference(variable_rename,[status(thm)],[77]) ).
cnf(79,plain,
( rr(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[78]) ).
cnf(129,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[79,38,theory(equality)]) ).
cnf(130,plain,
( rinvS(esk2_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[60,38,theory(equality)]) ).
cnf(132,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[50,67,theory(equality)]) ).
cnf(134,plain,
( X1 = esk1_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[41,40,theory(equality)]) ).
cnf(141,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[132,36,theory(equality)]) ).
cnf(147,plain,
( cp(X1)
| ~ ca_Vx2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[76,130,theory(equality)]) ).
cnf(148,plain,
( ~ ca_Vx2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[147,141]) ).
cnf(149,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[134,129,theory(equality)]) ).
cnf(153,plain,
( ca_Vx2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[39,149,theory(equality)]) ).
cnf(155,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[153,148]) ).
cnf(156,plain,
$false,
inference(sr,[status(thm)],[62,155,theory(equality)]) ).
cnf(157,plain,
$false,
156,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS113+1.p
% --creating new selector for []
% -running prover on /tmp/tmpWAyIB4/sel_KRS113+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS113+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS113+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS113+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
%
%------------------------------------------------------------------------------