%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS112+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:21 EST 2010
% Result : Unsatisfiable 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 5 unt; 0 def)
% Number of atoms : 291 ( 15 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 360 ( 146 ~; 141 |; 62 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 154 ( 2 sgn 93 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( rs(X1,X2)
=> rf(X1,X2) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_14) ).
fof(2,axiom,
! [X1,X2] :
( rs(X1,X2)
=> rf1(X1,X2) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_15) ).
fof(3,axiom,
! [X1,X2] :
( rinvF1(X1,X2)
<=> rf1(X2,X1) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_10) ).
fof(6,axiom,
cUnsatisfiable(i2003_11_14_17_21_19256),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_13) ).
fof(9,axiom,
! [X1] :
( cp(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_3) ).
fof(12,axiom,
! [X1] :
( ca_Vx3(X1)
<=> ? [X2] :
( rs(X1,X2)
& cowlThing(X2) ) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_6) ).
fof(13,axiom,
! [X1,X2,X3] :
( ( rf(X1,X2)
& rf(X1,X3) )
=> X2 = X3 ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_7) ).
fof(14,axiom,
! [X1] :
( cpxcomp(X1)
<=> ? [X7] : ra_Px1(X1,X7) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_4) ).
fof(15,axiom,
! [X1] :
( ca_Ax2(X1)
<=> ( cpxcomp(X1)
& ! [X2] :
( rinvF1(X1,X2)
=> ca_Vx3(X2) ) ) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_5) ).
fof(16,axiom,
! [X1,X2,X3] :
( ( rf1(X1,X2)
& rf1(X1,X3) )
=> X2 = X3 ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_8) ).
fof(31,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf1(X1,X2)
& ca_Ax2(X2) )
& ? [X2] :
( rf(X1,X2)
& cp(X2) ) ) ),
file('/tmp/tmp7EWuHl/sel_KRS112+1.p_1',axiom_2) ).
fof(42,plain,
! [X1,X2] :
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(43,plain,
! [X3,X4] :
( ~ rs(X3,X4)
| rf(X3,X4) ),
inference(variable_rename,[status(thm)],[42]) ).
cnf(44,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,plain,
! [X1,X2] :
( ~ rs(X1,X2)
| rf1(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(46,plain,
! [X3,X4] :
( ~ rs(X3,X4)
| rf1(X3,X4) ),
inference(variable_rename,[status(thm)],[45]) ).
cnf(47,plain,
( rf1(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(48,plain,
! [X1,X2] :
( ( ~ rinvF1(X1,X2)
| rf1(X2,X1) )
& ( ~ rf1(X2,X1)
| rinvF1(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(49,plain,
! [X3,X4] :
( ( ~ rinvF1(X3,X4)
| rf1(X4,X3) )
& ( ~ rf1(X4,X3)
| rinvF1(X3,X4) ) ),
inference(variable_rename,[status(thm)],[48]) ).
cnf(50,plain,
( rinvF1(X1,X2)
| ~ rf1(X2,X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(59,plain,
cUnsatisfiable(i2003_11_14_17_21_19256),
inference(split_conjunct,[status(thm)],[6]) ).
fof(66,plain,
! [X1] :
( ( ~ cp(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cp(X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(67,plain,
! [X3] :
( ( ~ cp(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cp(X3) ) ),
inference(variable_rename,[status(thm)],[66]) ).
fof(68,plain,
! [X3] :
( ( ~ cp(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk1_1(X3))
| cp(X3) ) ),
inference(skolemize,[status(esa)],[67]) ).
fof(69,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cp(X3) )
& ( ra_Px1(X3,esk1_1(X3))
| cp(X3) ) ),
inference(shift_quantors,[status(thm)],[68]) ).
cnf(71,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(78,plain,
! [X1] :
( ( ~ ca_Vx3(X1)
| ? [X2] :
( rs(X1,X2)
& cowlThing(X2) ) )
& ( ! [X2] :
( ~ rs(X1,X2)
| ~ cowlThing(X2) )
| ca_Vx3(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(79,plain,
! [X3] :
( ( ~ ca_Vx3(X3)
| ? [X4] :
( rs(X3,X4)
& cowlThing(X4) ) )
& ( ! [X5] :
( ~ rs(X3,X5)
| ~ cowlThing(X5) )
| ca_Vx3(X3) ) ),
inference(variable_rename,[status(thm)],[78]) ).
fof(80,plain,
! [X3] :
( ( ~ ca_Vx3(X3)
| ( rs(X3,esk2_1(X3))
& cowlThing(esk2_1(X3)) ) )
& ( ! [X5] :
( ~ rs(X3,X5)
| ~ cowlThing(X5) )
| ca_Vx3(X3) ) ),
inference(skolemize,[status(esa)],[79]) ).
fof(81,plain,
! [X3,X5] :
( ( ~ rs(X3,X5)
| ~ cowlThing(X5)
| ca_Vx3(X3) )
& ( ~ ca_Vx3(X3)
| ( rs(X3,esk2_1(X3))
& cowlThing(esk2_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[80]) ).
fof(82,plain,
! [X3,X5] :
( ( ~ rs(X3,X5)
| ~ cowlThing(X5)
| ca_Vx3(X3) )
& ( rs(X3,esk2_1(X3))
| ~ ca_Vx3(X3) )
& ( cowlThing(esk2_1(X3))
| ~ ca_Vx3(X3) ) ),
inference(distribute,[status(thm)],[81]) ).
cnf(84,plain,
( rs(X1,esk2_1(X1))
| ~ ca_Vx3(X1) ),
inference(split_conjunct,[status(thm)],[82]) ).
fof(86,plain,
! [X1,X2,X3] :
( ~ rf(X1,X2)
| ~ rf(X1,X3)
| X2 = X3 ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(87,plain,
! [X4,X5,X6] :
( ~ rf(X4,X5)
| ~ rf(X4,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[86]) ).
cnf(88,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(89,plain,
! [X1] :
( ( ~ cpxcomp(X1)
| ? [X7] : ra_Px1(X1,X7) )
& ( ! [X7] : ~ ra_Px1(X1,X7)
| cpxcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(90,plain,
! [X8] :
( ( ~ cpxcomp(X8)
| ? [X9] : ra_Px1(X8,X9) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| cpxcomp(X8) ) ),
inference(variable_rename,[status(thm)],[89]) ).
fof(91,plain,
! [X8] :
( ( ~ cpxcomp(X8)
| ra_Px1(X8,esk3_1(X8)) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| cpxcomp(X8) ) ),
inference(skolemize,[status(esa)],[90]) ).
fof(92,plain,
! [X8,X10] :
( ( ~ ra_Px1(X8,X10)
| cpxcomp(X8) )
& ( ~ cpxcomp(X8)
| ra_Px1(X8,esk3_1(X8)) ) ),
inference(shift_quantors,[status(thm)],[91]) ).
cnf(93,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[92]) ).
fof(95,plain,
! [X1] :
( ( ~ ca_Ax2(X1)
| ( cpxcomp(X1)
& ! [X2] :
( ~ rinvF1(X1,X2)
| ca_Vx3(X2) ) ) )
& ( ~ cpxcomp(X1)
| ? [X2] :
( rinvF1(X1,X2)
& ~ ca_Vx3(X2) )
| ca_Ax2(X1) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(96,plain,
! [X3] :
( ( ~ ca_Ax2(X3)
| ( cpxcomp(X3)
& ! [X4] :
( ~ rinvF1(X3,X4)
| ca_Vx3(X4) ) ) )
& ( ~ cpxcomp(X3)
| ? [X5] :
( rinvF1(X3,X5)
& ~ ca_Vx3(X5) )
| ca_Ax2(X3) ) ),
inference(variable_rename,[status(thm)],[95]) ).
fof(97,plain,
! [X3] :
( ( ~ ca_Ax2(X3)
| ( cpxcomp(X3)
& ! [X4] :
( ~ rinvF1(X3,X4)
| ca_Vx3(X4) ) ) )
& ( ~ cpxcomp(X3)
| ( rinvF1(X3,esk4_1(X3))
& ~ ca_Vx3(esk4_1(X3)) )
| ca_Ax2(X3) ) ),
inference(skolemize,[status(esa)],[96]) ).
fof(98,plain,
! [X3,X4] :
( ( ( ( ~ rinvF1(X3,X4)
| ca_Vx3(X4) )
& cpxcomp(X3) )
| ~ ca_Ax2(X3) )
& ( ~ cpxcomp(X3)
| ( rinvF1(X3,esk4_1(X3))
& ~ ca_Vx3(esk4_1(X3)) )
| ca_Ax2(X3) ) ),
inference(shift_quantors,[status(thm)],[97]) ).
fof(99,plain,
! [X3,X4] :
( ( ~ rinvF1(X3,X4)
| ca_Vx3(X4)
| ~ ca_Ax2(X3) )
& ( cpxcomp(X3)
| ~ ca_Ax2(X3) )
& ( rinvF1(X3,esk4_1(X3))
| ~ cpxcomp(X3)
| ca_Ax2(X3) )
& ( ~ ca_Vx3(esk4_1(X3))
| ~ cpxcomp(X3)
| ca_Ax2(X3) ) ),
inference(distribute,[status(thm)],[98]) ).
cnf(102,plain,
( cpxcomp(X1)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[99]) ).
cnf(103,plain,
( ca_Vx3(X2)
| ~ ca_Ax2(X1)
| ~ rinvF1(X1,X2) ),
inference(split_conjunct,[status(thm)],[99]) ).
fof(104,plain,
! [X1,X2,X3] :
( ~ rf1(X1,X2)
| ~ rf1(X1,X3)
| X2 = X3 ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(105,plain,
! [X4,X5,X6] :
( ~ rf1(X4,X5)
| ~ rf1(X4,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[104]) ).
cnf(106,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
inference(split_conjunct,[status(thm)],[105]) ).
fof(150,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rf1(X1,X2)
& ca_Ax2(X2) )
& ? [X2] :
( rf(X1,X2)
& cp(X2) ) ) )
& ( ! [X2] :
( ~ rf1(X1,X2)
| ~ ca_Ax2(X2) )
| ! [X2] :
( ~ rf(X1,X2)
| ~ cp(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(151,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rf1(X3,X4)
& ca_Ax2(X4) )
& ? [X5] :
( rf(X3,X5)
& cp(X5) ) ) )
& ( ! [X6] :
( ~ rf1(X3,X6)
| ~ ca_Ax2(X6) )
| ! [X7] :
( ~ rf(X3,X7)
| ~ cp(X7) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[150]) ).
fof(152,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rf1(X3,esk5_1(X3))
& ca_Ax2(esk5_1(X3))
& rf(X3,esk6_1(X3))
& cp(esk6_1(X3)) ) )
& ( ! [X6] :
( ~ rf1(X3,X6)
| ~ ca_Ax2(X6) )
| ! [X7] :
( ~ rf(X3,X7)
| ~ cp(X7) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[151]) ).
fof(153,plain,
! [X3,X6,X7] :
( ( ~ rf(X3,X7)
| ~ cp(X7)
| ~ rf1(X3,X6)
| ~ ca_Ax2(X6)
| cUnsatisfiable(X3) )
& ( ~ cUnsatisfiable(X3)
| ( rf1(X3,esk5_1(X3))
& ca_Ax2(esk5_1(X3))
& rf(X3,esk6_1(X3))
& cp(esk6_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[152]) ).
fof(154,plain,
! [X3,X6,X7] :
( ( ~ rf(X3,X7)
| ~ cp(X7)
| ~ rf1(X3,X6)
| ~ ca_Ax2(X6)
| cUnsatisfiable(X3) )
& ( rf1(X3,esk5_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ca_Ax2(esk5_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rf(X3,esk6_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cp(esk6_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[153]) ).
cnf(155,plain,
( cp(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(156,plain,
( rf(X1,esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(157,plain,
( ca_Ax2(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(158,plain,
( rf1(X1,esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[154]) ).
cnf(195,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[71,93,theory(equality)]) ).
cnf(198,plain,
( X1 = esk6_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[88,156,theory(equality)]) ).
cnf(201,plain,
( X1 = esk5_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[106,158,theory(equality)]) ).
cnf(202,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(X2)
| ~ rf1(X1,X2) ),
inference(spm,[status(thm)],[103,50,theory(equality)]) ).
cnf(206,plain,
( ~ cpxcomp(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[195,155,theory(equality)]) ).
cnf(209,plain,
( X1 = esk6_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rs(X2,X1) ),
inference(spm,[status(thm)],[198,44,theory(equality)]) ).
cnf(210,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Ax2(esk6_1(X1)) ),
inference(spm,[status(thm)],[206,102,theory(equality)]) ).
cnf(213,plain,
( X1 = esk5_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rs(X2,X1) ),
inference(spm,[status(thm)],[201,47,theory(equality)]) ).
cnf(214,plain,
( esk2_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[209,84,theory(equality)]) ).
cnf(216,plain,
( esk2_1(X1) = esk5_1(X1)
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[213,84,theory(equality)]) ).
cnf(218,plain,
( esk5_1(X1) = esk6_1(X1)
| ~ ca_Vx3(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[214,216,theory(equality)]) ).
cnf(220,plain,
( ca_Vx3(X1)
| ~ ca_Ax2(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[202,158,theory(equality)]) ).
cnf(225,plain,
( ca_Ax2(esk6_1(X1))
| ~ cUnsatisfiable(X1)
| ~ ca_Vx3(X1) ),
inference(spm,[status(thm)],[157,218,theory(equality)]) ).
cnf(227,plain,
( ca_Vx3(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[220,157]) ).
cnf(229,plain,
( ca_Ax2(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[225,227]) ).
cnf(230,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[229,210]) ).
cnf(231,plain,
$false,
inference(sr,[status(thm)],[59,230,theory(equality)]) ).
cnf(232,plain,
$false,
231,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS112+1.p
% --creating new selector for []
% -running prover on /tmp/tmp7EWuHl/sel_KRS112+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS112+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS112+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS112+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
%
%------------------------------------------------------------------------------