TSTP Solution File: KRS127+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS127+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:01:24 EST 2010
% Result : Unsatisfiable 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 5 unt; 0 def)
% Number of atoms : 180 ( 14 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 235 ( 93 ~; 89 |; 48 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 84 ( 2 sgn 49 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rr(X1,X2)
& cc(X2) )
& ? [X2] :
( rr(X1,X2)
& cd(X2) )
& ! [X3,X4] :
( ( rr(X1,X3)
& rr(X1,X4) )
=> X3 = X4 ) ) ),
file('/tmp/tmp7G4dty/sel_KRS127+1.p_1',axiom_2) ).
fof(2,axiom,
cUnsatisfiable(i2003_11_14_17_22_27794),
file('/tmp/tmp7G4dty/sel_KRS127+1.p_1',axiom_6) ).
fof(8,axiom,
! [X1] :
( cc(X1)
=> cdxcomp(X1) ),
file('/tmp/tmp7G4dty/sel_KRS127+1.p_1',axiom_3) ).
fof(12,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmp7G4dty/sel_KRS127+1.p_1',axiom_4) ).
fof(13,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/tmp/tmp7G4dty/sel_KRS127+1.p_1',axiom_5) ).
fof(22,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rr(X1,X2)
& cc(X2) )
& ? [X2] :
( rr(X1,X2)
& cd(X2) )
& ! [X3,X4] :
( ~ rr(X1,X3)
| ~ rr(X1,X4)
| X3 = X4 ) ) )
& ( ! [X2] :
( ~ rr(X1,X2)
| ~ cc(X2) )
| ! [X2] :
( ~ rr(X1,X2)
| ~ cd(X2) )
| ? [X3,X4] :
( rr(X1,X3)
& rr(X1,X4)
& X3 != X4 )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(23,plain,
! [X5] :
( ( ~ cUnsatisfiable(X5)
| ( ? [X6] :
( rr(X5,X6)
& cc(X6) )
& ? [X7] :
( rr(X5,X7)
& cd(X7) )
& ! [X8,X9] :
( ~ rr(X5,X8)
| ~ rr(X5,X9)
| X8 = X9 ) ) )
& ( ! [X10] :
( ~ rr(X5,X10)
| ~ cc(X10) )
| ! [X11] :
( ~ rr(X5,X11)
| ~ cd(X11) )
| ? [X12,X13] :
( rr(X5,X12)
& rr(X5,X13)
& X12 != X13 )
| cUnsatisfiable(X5) ) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,plain,
! [X5] :
( ( ~ cUnsatisfiable(X5)
| ( rr(X5,esk1_1(X5))
& cc(esk1_1(X5))
& rr(X5,esk2_1(X5))
& cd(esk2_1(X5))
& ! [X8,X9] :
( ~ rr(X5,X8)
| ~ rr(X5,X9)
| X8 = X9 ) ) )
& ( ! [X10] :
( ~ rr(X5,X10)
| ~ cc(X10) )
| ! [X11] :
( ~ rr(X5,X11)
| ~ cd(X11) )
| ( rr(X5,esk3_1(X5))
& rr(X5,esk4_1(X5))
& esk3_1(X5) != esk4_1(X5) )
| cUnsatisfiable(X5) ) ),
inference(skolemize,[status(esa)],[23]) ).
fof(25,plain,
! [X5,X8,X9,X10,X11] :
( ( ~ rr(X5,X11)
| ~ cd(X11)
| ~ rr(X5,X10)
| ~ cc(X10)
| ( rr(X5,esk3_1(X5))
& rr(X5,esk4_1(X5))
& esk3_1(X5) != esk4_1(X5) )
| cUnsatisfiable(X5) )
& ( ( ( ~ rr(X5,X8)
| ~ rr(X5,X9)
| X8 = X9 )
& rr(X5,esk1_1(X5))
& cc(esk1_1(X5))
& rr(X5,esk2_1(X5))
& cd(esk2_1(X5)) )
| ~ cUnsatisfiable(X5) ) ),
inference(shift_quantors,[status(thm)],[24]) ).
fof(26,plain,
! [X5,X8,X9,X10,X11] :
( ( rr(X5,esk3_1(X5))
| ~ rr(X5,X11)
| ~ cd(X11)
| ~ rr(X5,X10)
| ~ cc(X10)
| cUnsatisfiable(X5) )
& ( rr(X5,esk4_1(X5))
| ~ rr(X5,X11)
| ~ cd(X11)
| ~ rr(X5,X10)
| ~ cc(X10)
| cUnsatisfiable(X5) )
& ( esk3_1(X5) != esk4_1(X5)
| ~ rr(X5,X11)
| ~ cd(X11)
| ~ rr(X5,X10)
| ~ cc(X10)
| cUnsatisfiable(X5) )
& ( ~ rr(X5,X8)
| ~ rr(X5,X9)
| X8 = X9
| ~ cUnsatisfiable(X5) )
& ( rr(X5,esk1_1(X5))
| ~ cUnsatisfiable(X5) )
& ( cc(esk1_1(X5))
| ~ cUnsatisfiable(X5) )
& ( rr(X5,esk2_1(X5))
| ~ cUnsatisfiable(X5) )
& ( cd(esk2_1(X5))
| ~ cUnsatisfiable(X5) ) ),
inference(distribute,[status(thm)],[25]) ).
cnf(27,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(28,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(29,plain,
( cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(30,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(31,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(35,plain,
cUnsatisfiable(i2003_11_14_17_22_27794),
inference(split_conjunct,[status(thm)],[2]) ).
fof(52,plain,
! [X1] :
( ~ cc(X1)
| cdxcomp(X1) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(53,plain,
! [X2] :
( ~ cc(X2)
| cdxcomp(X2) ),
inference(variable_rename,[status(thm)],[52]) ).
cnf(54,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(64,plain,
! [X1] :
( ( ~ cd(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cd(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(65,plain,
! [X3] :
( ( ~ cd(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cd(X3) ) ),
inference(variable_rename,[status(thm)],[64]) ).
fof(66,plain,
! [X3] :
( ( ~ cd(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk5_1(X3))
| cd(X3) ) ),
inference(skolemize,[status(esa)],[65]) ).
fof(67,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cd(X3) )
& ( ra_Px1(X3,esk5_1(X3))
| cd(X3) ) ),
inference(shift_quantors,[status(thm)],[66]) ).
cnf(69,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(70,plain,
! [X1] :
( ( ~ cdxcomp(X1)
| ? [X3] : ra_Px1(X1,X3) )
& ( ! [X3] : ~ ra_Px1(X1,X3)
| cdxcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(71,plain,
! [X4] :
( ( ~ cdxcomp(X4)
| ? [X5] : ra_Px1(X4,X5) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cdxcomp(X4) ) ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,plain,
! [X4] :
( ( ~ cdxcomp(X4)
| ra_Px1(X4,esk6_1(X4)) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cdxcomp(X4) ) ),
inference(skolemize,[status(esa)],[71]) ).
fof(73,plain,
! [X4,X6] :
( ( ~ ra_Px1(X4,X6)
| cdxcomp(X4) )
& ( ~ cdxcomp(X4)
| ra_Px1(X4,esk6_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[72]) ).
cnf(74,plain,
( ra_Px1(X1,esk6_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(98,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[69,74,theory(equality)]) ).
cnf(99,plain,
( X1 = esk1_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[31,30,theory(equality)]) ).
cnf(105,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(spm,[status(thm)],[98,54,theory(equality)]) ).
cnf(107,plain,
( ~ cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[105,29,theory(equality)]) ).
cnf(108,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[99,28,theory(equality)]) ).
cnf(109,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[27,108,theory(equality)]) ).
cnf(111,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[109,107]) ).
cnf(112,plain,
$false,
inference(sr,[status(thm)],[35,111,theory(equality)]) ).
cnf(113,plain,
$false,
112,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS127+1.p
% --creating new selector for []
% -running prover on /tmp/tmp7G4dty/sel_KRS127+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS127+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS127+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS127+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
%
%------------------------------------------------------------------------------