%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS107+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:01 EST 2010
% Result : Unsatisfiable 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 64 ( 5 unt; 0 def)
% Number of atoms : 245 ( 8 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 305 ( 124 ~; 117 |; 56 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 120 ( 2 sgn 70 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1,X2] :
( rrx4(X1,X2)
=> rrx(X1,X2) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_17) ).
fof(12,axiom,
! [X1] :
( ca_Ax2(X1)
<=> ( cc2(X1)
& cc1(X1) ) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_3) ).
fof(15,axiom,
! [X1] :
( ca_Cx1xcomp(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_6) ).
fof(16,axiom,
! [X1,X2,X3] :
( ( rrx(X1,X2)
& rrx(X1,X3) )
=> X2 = X3 ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_7) ).
fof(17,axiom,
! [X1] :
( ca_Cx1(X1)
<=> ? [X7] : ra_Px1(X1,X7) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_4) ).
fof(18,axiom,
! [X1] :
( ca_Cx1xcomp(X1)
<=> ? [X2] :
( rrx3(X1,X2)
& ca_Ax2(X2) ) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_5) ).
fof(27,axiom,
cUnsatisfiable(i2003_11_14_17_21_01226),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_12) ).
fof(36,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rrx3(X1,X2)
& cc1(X2) )
& ? [X2] :
( rrx4(X1,X2)
& cc2(X2) )
& ca_Cx1(X1) ) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_2) ).
fof(48,axiom,
! [X1,X2] :
( rrx3(X1,X2)
=> rrx(X1,X2) ),
file('/tmp/tmpQWWdGE/sel_KRS107+1.p_1',axiom_20) ).
fof(65,plain,
! [X1,X2] :
( ~ rrx4(X1,X2)
| rrx(X1,X2) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(66,plain,
! [X3,X4] :
( ~ rrx4(X3,X4)
| rrx(X3,X4) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(89,plain,
! [X1] :
( ( ~ ca_Ax2(X1)
| ( cc2(X1)
& cc1(X1) ) )
& ( ~ cc2(X1)
| ~ cc1(X1)
| ca_Ax2(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(90,plain,
! [X2] :
( ( ~ ca_Ax2(X2)
| ( cc2(X2)
& cc1(X2) ) )
& ( ~ cc2(X2)
| ~ cc1(X2)
| ca_Ax2(X2) ) ),
inference(variable_rename,[status(thm)],[89]) ).
fof(91,plain,
! [X2] :
( ( cc2(X2)
| ~ ca_Ax2(X2) )
& ( cc1(X2)
| ~ ca_Ax2(X2) )
& ( ~ cc2(X2)
| ~ cc1(X2)
| ca_Ax2(X2) ) ),
inference(distribute,[status(thm)],[90]) ).
cnf(92,plain,
( ca_Ax2(X1)
| ~ cc1(X1)
| ~ cc2(X1) ),
inference(split_conjunct,[status(thm)],[91]) ).
fof(101,plain,
! [X1] :
( ( ~ ca_Cx1xcomp(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| ca_Cx1xcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(102,plain,
! [X3] :
( ( ~ ca_Cx1xcomp(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| ca_Cx1xcomp(X3) ) ),
inference(variable_rename,[status(thm)],[101]) ).
fof(103,plain,
! [X3] :
( ( ~ ca_Cx1xcomp(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk1_1(X3))
| ca_Cx1xcomp(X3) ) ),
inference(skolemize,[status(esa)],[102]) ).
fof(104,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ ca_Cx1xcomp(X3) )
& ( ra_Px1(X3,esk1_1(X3))
| ca_Cx1xcomp(X3) ) ),
inference(shift_quantors,[status(thm)],[103]) ).
cnf(106,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[104]) ).
fof(107,plain,
! [X1,X2,X3] :
( ~ rrx(X1,X2)
| ~ rrx(X1,X3)
| X2 = X3 ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(108,plain,
! [X4,X5,X6] :
( ~ rrx(X4,X5)
| ~ rrx(X4,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[107]) ).
cnf(109,plain,
( X1 = X2
| ~ rrx(X3,X2)
| ~ rrx(X3,X1) ),
inference(split_conjunct,[status(thm)],[108]) ).
fof(110,plain,
! [X1] :
( ( ~ ca_Cx1(X1)
| ? [X7] : ra_Px1(X1,X7) )
& ( ! [X7] : ~ ra_Px1(X1,X7)
| ca_Cx1(X1) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(111,plain,
! [X8] :
( ( ~ ca_Cx1(X8)
| ? [X9] : ra_Px1(X8,X9) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| ca_Cx1(X8) ) ),
inference(variable_rename,[status(thm)],[110]) ).
fof(112,plain,
! [X8] :
( ( ~ ca_Cx1(X8)
| ra_Px1(X8,esk2_1(X8)) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| ca_Cx1(X8) ) ),
inference(skolemize,[status(esa)],[111]) ).
fof(113,plain,
! [X8,X10] :
( ( ~ ra_Px1(X8,X10)
| ca_Cx1(X8) )
& ( ~ ca_Cx1(X8)
| ra_Px1(X8,esk2_1(X8)) ) ),
inference(shift_quantors,[status(thm)],[112]) ).
cnf(114,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ ca_Cx1(X1) ),
inference(split_conjunct,[status(thm)],[113]) ).
fof(116,plain,
! [X1] :
( ( ~ ca_Cx1xcomp(X1)
| ? [X2] :
( rrx3(X1,X2)
& ca_Ax2(X2) ) )
& ( ! [X2] :
( ~ rrx3(X1,X2)
| ~ ca_Ax2(X2) )
| ca_Cx1xcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(117,plain,
! [X3] :
( ( ~ ca_Cx1xcomp(X3)
| ? [X4] :
( rrx3(X3,X4)
& ca_Ax2(X4) ) )
& ( ! [X5] :
( ~ rrx3(X3,X5)
| ~ ca_Ax2(X5) )
| ca_Cx1xcomp(X3) ) ),
inference(variable_rename,[status(thm)],[116]) ).
fof(118,plain,
! [X3] :
( ( ~ ca_Cx1xcomp(X3)
| ( rrx3(X3,esk3_1(X3))
& ca_Ax2(esk3_1(X3)) ) )
& ( ! [X5] :
( ~ rrx3(X3,X5)
| ~ ca_Ax2(X5) )
| ca_Cx1xcomp(X3) ) ),
inference(skolemize,[status(esa)],[117]) ).
fof(119,plain,
! [X3,X5] :
( ( ~ rrx3(X3,X5)
| ~ ca_Ax2(X5)
| ca_Cx1xcomp(X3) )
& ( ~ ca_Cx1xcomp(X3)
| ( rrx3(X3,esk3_1(X3))
& ca_Ax2(esk3_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[118]) ).
fof(120,plain,
! [X3,X5] :
( ( ~ rrx3(X3,X5)
| ~ ca_Ax2(X5)
| ca_Cx1xcomp(X3) )
& ( rrx3(X3,esk3_1(X3))
| ~ ca_Cx1xcomp(X3) )
& ( ca_Ax2(esk3_1(X3))
| ~ ca_Cx1xcomp(X3) ) ),
inference(distribute,[status(thm)],[119]) ).
cnf(123,plain,
( ca_Cx1xcomp(X1)
| ~ ca_Ax2(X2)
| ~ rrx3(X1,X2) ),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(149,plain,
cUnsatisfiable(i2003_11_14_17_21_01226),
inference(split_conjunct,[status(thm)],[27]) ).
fof(174,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rrx3(X1,X2)
& cc1(X2) )
& ? [X2] :
( rrx4(X1,X2)
& cc2(X2) )
& ca_Cx1(X1) ) )
& ( ! [X2] :
( ~ rrx3(X1,X2)
| ~ cc1(X2) )
| ! [X2] :
( ~ rrx4(X1,X2)
| ~ cc2(X2) )
| ~ ca_Cx1(X1)
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(175,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rrx3(X3,X4)
& cc1(X4) )
& ? [X5] :
( rrx4(X3,X5)
& cc2(X5) )
& ca_Cx1(X3) ) )
& ( ! [X6] :
( ~ rrx3(X3,X6)
| ~ cc1(X6) )
| ! [X7] :
( ~ rrx4(X3,X7)
| ~ cc2(X7) )
| ~ ca_Cx1(X3)
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[174]) ).
fof(176,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rrx3(X3,esk4_1(X3))
& cc1(esk4_1(X3))
& rrx4(X3,esk5_1(X3))
& cc2(esk5_1(X3))
& ca_Cx1(X3) ) )
& ( ! [X6] :
( ~ rrx3(X3,X6)
| ~ cc1(X6) )
| ! [X7] :
( ~ rrx4(X3,X7)
| ~ cc2(X7) )
| ~ ca_Cx1(X3)
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[175]) ).
fof(177,plain,
! [X3,X6,X7] :
( ( ~ rrx4(X3,X7)
| ~ cc2(X7)
| ~ rrx3(X3,X6)
| ~ cc1(X6)
| ~ ca_Cx1(X3)
| cUnsatisfiable(X3) )
& ( ~ cUnsatisfiable(X3)
| ( rrx3(X3,esk4_1(X3))
& cc1(esk4_1(X3))
& rrx4(X3,esk5_1(X3))
& cc2(esk5_1(X3))
& ca_Cx1(X3) ) ) ),
inference(shift_quantors,[status(thm)],[176]) ).
fof(178,plain,
! [X3,X6,X7] :
( ( ~ rrx4(X3,X7)
| ~ cc2(X7)
| ~ rrx3(X3,X6)
| ~ cc1(X6)
| ~ ca_Cx1(X3)
| cUnsatisfiable(X3) )
& ( rrx3(X3,esk4_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cc1(esk4_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rrx4(X3,esk5_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cc2(esk5_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ca_Cx1(X3)
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[177]) ).
cnf(179,plain,
( ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(180,plain,
( cc2(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(181,plain,
( rrx4(X1,esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(182,plain,
( cc1(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[178]) ).
cnf(183,plain,
( rrx3(X1,esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[178]) ).
fof(218,plain,
! [X1,X2] :
( ~ rrx3(X1,X2)
| rrx(X1,X2) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(219,plain,
! [X3,X4] :
( ~ rrx3(X3,X4)
| rrx(X3,X4) ),
inference(variable_rename,[status(thm)],[218]) ).
cnf(220,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
inference(split_conjunct,[status(thm)],[219]) ).
cnf(238,plain,
( ca_Ax2(esk4_1(X1))
| ~ cc2(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[92,182,theory(equality)]) ).
cnf(242,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[106,114,theory(equality)]) ).
cnf(244,plain,
( ca_Cx1xcomp(X1)
| ~ ca_Ax2(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[123,183,theory(equality)]) ).
cnf(247,plain,
( X1 = X2
| ~ rrx(X3,X1)
| ~ rrx3(X3,X2) ),
inference(spm,[status(thm)],[109,220,theory(equality)]) ).
cnf(252,plain,
( ~ ca_Cx1xcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[242,179,theory(equality)]) ).
cnf(255,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Ax2(esk4_1(X1)) ),
inference(csr,[status(thm)],[244,252]) ).
cnf(263,plain,
( X1 = esk4_1(X2)
| ~ rrx(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[247,183,theory(equality)]) ).
cnf(266,plain,
( X1 = esk4_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rrx4(X2,X1) ),
inference(spm,[status(thm)],[263,67,theory(equality)]) ).
cnf(270,plain,
( esk5_1(X1) = esk4_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[266,181,theory(equality)]) ).
cnf(273,plain,
( ca_Ax2(esk5_1(X1))
| ~ cUnsatisfiable(X1)
| ~ cc2(esk5_1(X1)) ),
inference(spm,[status(thm)],[238,270,theory(equality)]) ).
cnf(274,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Ax2(esk5_1(X1)) ),
inference(spm,[status(thm)],[255,270,theory(equality)]) ).
cnf(296,plain,
( ca_Ax2(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[273,180]) ).
cnf(297,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[296,274]) ).
cnf(298,plain,
$false,
inference(sr,[status(thm)],[149,297,theory(equality)]) ).
cnf(299,plain,
$false,
298,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS107+1.p
% --creating new selector for []
% -running prover on /tmp/tmpQWWdGE/sel_KRS107+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS107+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS107+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS107+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
%
%------------------------------------------------------------------------------