TSTP Solution File: KRS120+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS120+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:54 EST 2010
% Result : Unsatisfiable 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 68 ( 7 unt; 0 def)
% Number of atoms : 243 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 300 ( 125 ~; 114 |; 53 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 121 ( 4 sgn 72 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
cUnsatisfiable(i2003_11_14_17_21_48796),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_11) ).
fof(6,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ? [X2] :
( rf(X1,X2)
& ca_Ax2(X2) ) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_2) ).
fof(7,axiom,
! [X1] :
( cp1(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_3) ).
fof(8,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_0) ).
fof(10,axiom,
! [X1] :
( ca_Vx3(X1)
<=> ? [X2] :
( rf(X1,X2)
& cp1xcomp(X2) ) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_6) ).
fof(11,axiom,
! [X1] :
( cowlThing(X1)
=> ! [X7,X8] :
( ( rf(X1,X7)
& rf(X1,X8) )
=> X7 = X8 ) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_7) ).
fof(12,axiom,
! [X1] :
( cp1xcomp(X1)
<=> ? [X7] : ra_Px1(X1,X7) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_4) ).
fof(13,axiom,
! [X1] :
( ca_Ax2(X1)
<=> ( ? [X2] :
( rinvF(X1,X2)
& ca_Vx3(X2) )
& cp1(X1) ) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_5) ).
fof(14,axiom,
! [X1,X2] :
( rinvF(X1,X2)
<=> rf(X2,X1) ),
file('/tmp/tmpCblbMt/sel_KRS120+1.p_1',axiom_8) ).
fof(32,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
cnf(37,plain,
cUnsatisfiable(i2003_11_14_17_21_48796),
inference(split_conjunct,[status(thm)],[2]) ).
fof(47,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ? [X2] :
( rf(X1,X2)
& ca_Ax2(X2) ) )
& ( ! [X2] :
( ~ rf(X1,X2)
| ~ ca_Ax2(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(48,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ? [X4] :
( rf(X3,X4)
& ca_Ax2(X4) ) )
& ( ! [X5] :
( ~ rf(X3,X5)
| ~ ca_Ax2(X5) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[47]) ).
fof(49,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rf(X3,esk1_1(X3))
& ca_Ax2(esk1_1(X3)) ) )
& ( ! [X5] :
( ~ rf(X3,X5)
| ~ ca_Ax2(X5) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[48]) ).
fof(50,plain,
! [X3,X5] :
( ( ~ rf(X3,X5)
| ~ ca_Ax2(X5)
| cUnsatisfiable(X3) )
& ( ~ cUnsatisfiable(X3)
| ( rf(X3,esk1_1(X3))
& ca_Ax2(esk1_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[49]) ).
fof(51,plain,
! [X3,X5] :
( ( ~ rf(X3,X5)
| ~ ca_Ax2(X5)
| cUnsatisfiable(X3) )
& ( rf(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ca_Ax2(esk1_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[50]) ).
cnf(52,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(53,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(54,plain,
( cUnsatisfiable(X1)
| ~ ca_Ax2(X2)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(55,plain,
! [X1] :
( ( ~ cp1(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cp1(X1) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(56,plain,
! [X3] :
( ( ~ cp1(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cp1(X3) ) ),
inference(variable_rename,[status(thm)],[55]) ).
fof(57,plain,
! [X3] :
( ( ~ cp1(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk2_1(X3))
| cp1(X3) ) ),
inference(skolemize,[status(esa)],[56]) ).
fof(58,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cp1(X3) )
& ( ra_Px1(X3,esk2_1(X3))
| cp1(X3) ) ),
inference(shift_quantors,[status(thm)],[57]) ).
cnf(60,plain,
( ~ cp1(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(61,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[32]) ).
cnf(63,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[61]) ).
fof(68,plain,
! [X1] :
( ( ~ ca_Vx3(X1)
| ? [X2] :
( rf(X1,X2)
& cp1xcomp(X2) ) )
& ( ! [X2] :
( ~ rf(X1,X2)
| ~ cp1xcomp(X2) )
| ca_Vx3(X1) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(69,plain,
! [X3] :
( ( ~ ca_Vx3(X3)
| ? [X4] :
( rf(X3,X4)
& cp1xcomp(X4) ) )
& ( ! [X5] :
( ~ rf(X3,X5)
| ~ cp1xcomp(X5) )
| ca_Vx3(X3) ) ),
inference(variable_rename,[status(thm)],[68]) ).
fof(70,plain,
! [X3] :
( ( ~ ca_Vx3(X3)
| ( rf(X3,esk3_1(X3))
& cp1xcomp(esk3_1(X3)) ) )
& ( ! [X5] :
( ~ rf(X3,X5)
| ~ cp1xcomp(X5) )
| ca_Vx3(X3) ) ),
inference(skolemize,[status(esa)],[69]) ).
fof(71,plain,
! [X3,X5] :
( ( ~ rf(X3,X5)
| ~ cp1xcomp(X5)
| ca_Vx3(X3) )
& ( ~ ca_Vx3(X3)
| ( rf(X3,esk3_1(X3))
& cp1xcomp(esk3_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[70]) ).
fof(72,plain,
! [X3,X5] :
( ( ~ rf(X3,X5)
| ~ cp1xcomp(X5)
| ca_Vx3(X3) )
& ( rf(X3,esk3_1(X3))
| ~ ca_Vx3(X3) )
& ( cp1xcomp(esk3_1(X3))
| ~ ca_Vx3(X3) ) ),
inference(distribute,[status(thm)],[71]) ).
cnf(73,plain,
( cp1xcomp(esk3_1(X1))
| ~ ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(74,plain,
( rf(X1,esk3_1(X1))
| ~ ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(76,plain,
! [X1] :
( ~ cowlThing(X1)
| ! [X7,X8] :
( ~ rf(X1,X7)
| ~ rf(X1,X8)
| X7 = X8 ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(77,plain,
! [X9] :
( ~ cowlThing(X9)
| ! [X10,X11] :
( ~ rf(X9,X10)
| ~ rf(X9,X11)
| X10 = X11 ) ),
inference(variable_rename,[status(thm)],[76]) ).
fof(78,plain,
! [X9,X10,X11] :
( ~ rf(X9,X10)
| ~ rf(X9,X11)
| X10 = X11
| ~ cowlThing(X9) ),
inference(shift_quantors,[status(thm)],[77]) ).
cnf(79,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[78]) ).
fof(80,plain,
! [X1] :
( ( ~ cp1xcomp(X1)
| ? [X7] : ra_Px1(X1,X7) )
& ( ! [X7] : ~ ra_Px1(X1,X7)
| cp1xcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(81,plain,
! [X8] :
( ( ~ cp1xcomp(X8)
| ? [X9] : ra_Px1(X8,X9) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| cp1xcomp(X8) ) ),
inference(variable_rename,[status(thm)],[80]) ).
fof(82,plain,
! [X8] :
( ( ~ cp1xcomp(X8)
| ra_Px1(X8,esk4_1(X8)) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| cp1xcomp(X8) ) ),
inference(skolemize,[status(esa)],[81]) ).
fof(83,plain,
! [X8,X10] :
( ( ~ ra_Px1(X8,X10)
| cp1xcomp(X8) )
& ( ~ cp1xcomp(X8)
| ra_Px1(X8,esk4_1(X8)) ) ),
inference(shift_quantors,[status(thm)],[82]) ).
cnf(84,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cp1xcomp(X1) ),
inference(split_conjunct,[status(thm)],[83]) ).
fof(86,plain,
! [X1] :
( ( ~ ca_Ax2(X1)
| ( ? [X2] :
( rinvF(X1,X2)
& ca_Vx3(X2) )
& cp1(X1) ) )
& ( ! [X2] :
( ~ rinvF(X1,X2)
| ~ ca_Vx3(X2) )
| ~ cp1(X1)
| ca_Ax2(X1) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(87,plain,
! [X3] :
( ( ~ ca_Ax2(X3)
| ( ? [X4] :
( rinvF(X3,X4)
& ca_Vx3(X4) )
& cp1(X3) ) )
& ( ! [X5] :
( ~ rinvF(X3,X5)
| ~ ca_Vx3(X5) )
| ~ cp1(X3)
| ca_Ax2(X3) ) ),
inference(variable_rename,[status(thm)],[86]) ).
fof(88,plain,
! [X3] :
( ( ~ ca_Ax2(X3)
| ( rinvF(X3,esk5_1(X3))
& ca_Vx3(esk5_1(X3))
& cp1(X3) ) )
& ( ! [X5] :
( ~ rinvF(X3,X5)
| ~ ca_Vx3(X5) )
| ~ cp1(X3)
| ca_Ax2(X3) ) ),
inference(skolemize,[status(esa)],[87]) ).
fof(89,plain,
! [X3,X5] :
( ( ~ rinvF(X3,X5)
| ~ ca_Vx3(X5)
| ~ cp1(X3)
| ca_Ax2(X3) )
& ( ~ ca_Ax2(X3)
| ( rinvF(X3,esk5_1(X3))
& ca_Vx3(esk5_1(X3))
& cp1(X3) ) ) ),
inference(shift_quantors,[status(thm)],[88]) ).
fof(90,plain,
! [X3,X5] :
( ( ~ rinvF(X3,X5)
| ~ ca_Vx3(X5)
| ~ cp1(X3)
| ca_Ax2(X3) )
& ( rinvF(X3,esk5_1(X3))
| ~ ca_Ax2(X3) )
& ( ca_Vx3(esk5_1(X3))
| ~ ca_Ax2(X3) )
& ( cp1(X3)
| ~ ca_Ax2(X3) ) ),
inference(distribute,[status(thm)],[89]) ).
cnf(91,plain,
( cp1(X1)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(92,plain,
( ca_Vx3(esk5_1(X1))
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(93,plain,
( rinvF(X1,esk5_1(X1))
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[90]) ).
fof(95,plain,
! [X1,X2] :
( ( ~ rinvF(X1,X2)
| rf(X2,X1) )
& ( ~ rf(X2,X1)
| rinvF(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(96,plain,
! [X3,X4] :
( ( ~ rinvF(X3,X4)
| rf(X4,X3) )
& ( ~ rf(X4,X3)
| rinvF(X3,X4) ) ),
inference(variable_rename,[status(thm)],[95]) ).
cnf(98,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(151,plain,
( X2 = X3
| $false
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(rw,[status(thm)],[79,63,theory(equality)]),
[unfolding] ).
cnf(158,plain,
( ~ cp1(X1)
| ~ cp1xcomp(X1) ),
inference(spm,[status(thm)],[60,84,theory(equality)]) ).
cnf(159,plain,
( rf(esk5_1(X1),X1)
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[98,93,theory(equality)]) ).
cnf(160,plain,
( X1 = esk1_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[151,53,theory(equality)]) ).
cnf(167,plain,
( ~ cp1(esk3_1(X1))
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[158,73,theory(equality)]) ).
cnf(171,plain,
( ~ ca_Vx3(X1)
| ~ ca_Ax2(esk3_1(X1)) ),
inference(spm,[status(thm)],[167,91,theory(equality)]) ).
cnf(176,plain,
( cUnsatisfiable(esk5_1(X1))
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[54,159,theory(equality)]) ).
cnf(178,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[160,74,theory(equality)]) ).
cnf(180,plain,
( ca_Ax2(esk3_1(X1))
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[52,178,theory(equality)]) ).
cnf(189,plain,
( ~ ca_Vx3(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[180,171]) ).
cnf(191,plain,
( ~ ca_Vx3(esk5_1(X1))
| ~ ca_Ax2(X1) ),
inference(spm,[status(thm)],[189,176,theory(equality)]) ).
cnf(195,plain,
~ ca_Ax2(X1),
inference(csr,[status(thm)],[191,92]) ).
cnf(196,plain,
~ cUnsatisfiable(X1),
inference(spm,[status(thm)],[195,52,theory(equality)]) ).
cnf(198,plain,
$false,
inference(sr,[status(thm)],[37,196,theory(equality)]) ).
cnf(199,plain,
$false,
198,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS120+1.p
% --creating new selector for []
% -running prover on /tmp/tmpCblbMt/sel_KRS120+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS120+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS120+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS120+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
%
%------------------------------------------------------------------------------