TSTP Solution File: KRS115+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS115+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:33 EST 2010
% Result : Unsatisfiable 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 67 ( 6 unt; 0 def)
% Number of atoms : 240 ( 17 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 295 ( 122 ~; 115 |; 48 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 136 ( 3 sgn 81 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( rr(X1,X2)
=> rf1(X1,X2) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_10) ).
fof(2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf2(X1,X2)
& cp2(X2) )
& ? [X2] :
( rf1(X1,X2)
& cp1(X2) )
& ? [X2] :
( rr(X1,X2)
& cowlThing(X2) ) ) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_2) ).
fof(3,axiom,
! [X1] :
( cp1(X1)
=> cp2xcomp(X1) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_3) ).
fof(4,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_0) ).
fof(6,axiom,
! [X1] :
( cowlThing(X1)
=> ! [X3,X4] :
( ( rf1(X1,X3)
& rf1(X1,X4) )
=> X3 = X4 ) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_6) ).
fof(7,axiom,
! [X1] :
( cowlThing(X1)
=> ! [X3,X4] :
( ( rf2(X1,X3)
& rf2(X1,X4) )
=> X3 = X4 ) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_7) ).
fof(8,axiom,
! [X1] :
( cp2(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_4) ).
fof(9,axiom,
! [X1] :
( cp2xcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_5) ).
fof(10,axiom,
cUnsatisfiable(i2003_11_14_17_21_30578),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_8) ).
fof(11,axiom,
! [X1,X2] :
( rr(X1,X2)
=> rf2(X1,X2) ),
file('/tmp/tmpIVw2T8/sel_KRS115+1.p_1',axiom_9) ).
fof(28,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(30,plain,
! [X1,X2] :
( ~ rr(X1,X2)
| rf1(X1,X2) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(31,plain,
! [X3,X4] :
( ~ rr(X3,X4)
| rf1(X3,X4) ),
inference(variable_rename,[status(thm)],[30]) ).
cnf(32,plain,
( rf1(X1,X2)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[31]) ).
fof(33,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rf2(X1,X2)
& cp2(X2) )
& ? [X2] :
( rf1(X1,X2)
& cp1(X2) )
& ? [X2] :
( rr(X1,X2)
& cowlThing(X2) ) ) )
& ( ! [X2] :
( ~ rf2(X1,X2)
| ~ cp2(X2) )
| ! [X2] :
( ~ rf1(X1,X2)
| ~ cp1(X2) )
| ! [X2] :
( ~ rr(X1,X2)
| ~ cowlThing(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(34,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rf2(X3,X4)
& cp2(X4) )
& ? [X5] :
( rf1(X3,X5)
& cp1(X5) )
& ? [X6] :
( rr(X3,X6)
& cowlThing(X6) ) ) )
& ( ! [X7] :
( ~ rf2(X3,X7)
| ~ cp2(X7) )
| ! [X8] :
( ~ rf1(X3,X8)
| ~ cp1(X8) )
| ! [X9] :
( ~ rr(X3,X9)
| ~ cowlThing(X9) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[33]) ).
fof(35,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rf2(X3,esk1_1(X3))
& cp2(esk1_1(X3))
& rf1(X3,esk2_1(X3))
& cp1(esk2_1(X3))
& rr(X3,esk3_1(X3))
& cowlThing(esk3_1(X3)) ) )
& ( ! [X7] :
( ~ rf2(X3,X7)
| ~ cp2(X7) )
| ! [X8] :
( ~ rf1(X3,X8)
| ~ cp1(X8) )
| ! [X9] :
( ~ rr(X3,X9)
| ~ cowlThing(X9) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[34]) ).
fof(36,plain,
! [X3,X7,X8,X9] :
( ( ~ rr(X3,X9)
| ~ cowlThing(X9)
| ~ rf1(X3,X8)
| ~ cp1(X8)
| ~ rf2(X3,X7)
| ~ cp2(X7)
| cUnsatisfiable(X3) )
& ( ~ cUnsatisfiable(X3)
| ( rf2(X3,esk1_1(X3))
& cp2(esk1_1(X3))
& rf1(X3,esk2_1(X3))
& cp1(esk2_1(X3))
& rr(X3,esk3_1(X3))
& cowlThing(esk3_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[35]) ).
fof(37,plain,
! [X3,X7,X8,X9] :
( ( ~ rr(X3,X9)
| ~ cowlThing(X9)
| ~ rf1(X3,X8)
| ~ cp1(X8)
| ~ rf2(X3,X7)
| ~ cp2(X7)
| cUnsatisfiable(X3) )
& ( rf2(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cp2(esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rf1(X3,esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cp1(esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rr(X3,esk3_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cowlThing(esk3_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[36]) ).
cnf(39,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(40,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(41,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(42,plain,
( cp2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(43,plain,
( rf2(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(45,plain,
! [X1] :
( ~ cp1(X1)
| cp2xcomp(X1) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(46,plain,
! [X2] :
( ~ cp1(X2)
| cp2xcomp(X2) ),
inference(variable_rename,[status(thm)],[45]) ).
cnf(47,plain,
( cp2xcomp(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(48,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[28]) ).
cnf(50,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[48]) ).
fof(55,plain,
! [X1] :
( ~ cowlThing(X1)
| ! [X3,X4] :
( ~ rf1(X1,X3)
| ~ rf1(X1,X4)
| X3 = X4 ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(56,plain,
! [X5] :
( ~ cowlThing(X5)
| ! [X6,X7] :
( ~ rf1(X5,X6)
| ~ rf1(X5,X7)
| X6 = X7 ) ),
inference(variable_rename,[status(thm)],[55]) ).
fof(57,plain,
! [X5,X6,X7] :
( ~ rf1(X5,X6)
| ~ rf1(X5,X7)
| X6 = X7
| ~ cowlThing(X5) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf1(X1,X3)
| ~ rf1(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(59,plain,
! [X1] :
( ~ cowlThing(X1)
| ! [X3,X4] :
( ~ rf2(X1,X3)
| ~ rf2(X1,X4)
| X3 = X4 ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(60,plain,
! [X5] :
( ~ cowlThing(X5)
| ! [X6,X7] :
( ~ rf2(X5,X6)
| ~ rf2(X5,X7)
| X6 = X7 ) ),
inference(variable_rename,[status(thm)],[59]) ).
fof(61,plain,
! [X5,X6,X7] :
( ~ rf2(X5,X6)
| ~ rf2(X5,X7)
| X6 = X7
| ~ cowlThing(X5) ),
inference(shift_quantors,[status(thm)],[60]) ).
cnf(62,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf2(X1,X3)
| ~ rf2(X1,X2) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,plain,
! [X1] :
( ( ~ cp2(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cp2(X1) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(64,plain,
! [X3] :
( ( ~ cp2(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cp2(X3) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X3] :
( ( ~ cp2(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk4_1(X3))
| cp2(X3) ) ),
inference(skolemize,[status(esa)],[64]) ).
fof(66,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cp2(X3) )
& ( ra_Px1(X3,esk4_1(X3))
| cp2(X3) ) ),
inference(shift_quantors,[status(thm)],[65]) ).
cnf(68,plain,
( ~ cp2(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(69,plain,
! [X1] :
( ( ~ cp2xcomp(X1)
| ? [X3] : ra_Px1(X1,X3) )
& ( ! [X3] : ~ ra_Px1(X1,X3)
| cp2xcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(70,plain,
! [X4] :
( ( ~ cp2xcomp(X4)
| ? [X5] : ra_Px1(X4,X5) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cp2xcomp(X4) ) ),
inference(variable_rename,[status(thm)],[69]) ).
fof(71,plain,
! [X4] :
( ( ~ cp2xcomp(X4)
| ra_Px1(X4,esk5_1(X4)) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cp2xcomp(X4) ) ),
inference(skolemize,[status(esa)],[70]) ).
fof(72,plain,
! [X4,X6] :
( ( ~ ra_Px1(X4,X6)
| cp2xcomp(X4) )
& ( ~ cp2xcomp(X4)
| ra_Px1(X4,esk5_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[71]) ).
cnf(73,plain,
( ra_Px1(X1,esk5_1(X1))
| ~ cp2xcomp(X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(75,plain,
cUnsatisfiable(i2003_11_14_17_21_30578),
inference(split_conjunct,[status(thm)],[10]) ).
fof(76,plain,
! [X1,X2] :
( ~ rr(X1,X2)
| rf2(X1,X2) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(77,plain,
! [X3,X4] :
( ~ rr(X3,X4)
| rf2(X3,X4) ),
inference(variable_rename,[status(thm)],[76]) ).
cnf(78,plain,
( rf2(X1,X2)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(128,plain,
( X2 = X3
| $false
| ~ rf1(X1,X3)
| ~ rf1(X1,X2) ),
inference(rw,[status(thm)],[58,50,theory(equality)]),
[unfolding] ).
cnf(129,plain,
( X2 = X3
| $false
| ~ rf2(X1,X3)
| ~ rf2(X1,X2) ),
inference(rw,[status(thm)],[62,50,theory(equality)]),
[unfolding] ).
cnf(131,plain,
( cp2xcomp(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[47,40,theory(equality)]) ).
cnf(135,plain,
( rf1(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[32,39,theory(equality)]) ).
cnf(136,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[78,39,theory(equality)]) ).
cnf(138,plain,
( ~ cp2(X1)
| ~ cp2xcomp(X1) ),
inference(spm,[status(thm)],[68,73,theory(equality)]) ).
cnf(139,plain,
( X1 = esk2_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[128,41,theory(equality)]) ).
cnf(140,plain,
( X1 = esk1_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[129,43,theory(equality)]) ).
cnf(143,plain,
( ~ cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[138,131,theory(equality)]) ).
cnf(147,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[139,135,theory(equality)]) ).
cnf(148,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[140,136,theory(equality)]) ).
cnf(155,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[147,148,theory(equality)]) ).
cnf(159,plain,
( ~ cp2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[143,155,theory(equality)]) ).
cnf(160,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[159,42]) ).
cnf(161,plain,
$false,
inference(sr,[status(thm)],[75,160,theory(equality)]) ).
cnf(162,plain,
$false,
161,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS115+1.p
% --creating new selector for []
% -running prover on /tmp/tmpIVw2T8/sel_KRS115+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS115+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS115+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS115+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
%
%------------------------------------------------------------------------------