%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS073+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 13:01:32 EST 2010
% Result : Unsatisfiable 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 203 ( 8 equ)
% Maximal formula atoms : 35 ( 4 avg)
% Number of connectives : 260 ( 99 ~; 102 |; 49 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 101 ( 1 sgn 58 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1,X2] :
( rs(X1,X2)
=> rf(X1,X2) ),
file('/tmp/tmpnUYJcl/sel_KRS073+1.p_1',axiom_11) ).
fof(4,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf(X1,X2)
& ! [X5] :
( rinvS(X2,X5)
=> cp(X5) )
& ! [X5] :
( rinvF(X2,X5)
=> ? [X6] :
( rs(X5,X6)
& cp(X6) ) ) )
& ~ cp(X1) ) ),
file('/tmp/tmpnUYJcl/sel_KRS073+1.p_1',axiom_2) ).
fof(5,axiom,
! [X1,X2,X5] :
( ( rf(X1,X2)
& rf(X1,X5) )
=> X2 = X5 ),
file('/tmp/tmpnUYJcl/sel_KRS073+1.p_1',axiom_3) ).
fof(9,axiom,
! [X1,X2] :
( rinvS(X1,X2)
<=> rs(X2,X1) ),
file('/tmp/tmpnUYJcl/sel_KRS073+1.p_1',axiom_7) ).
fof(11,axiom,
! [X1,X2] :
( rinvF(X1,X2)
<=> rf(X2,X1) ),
file('/tmp/tmpnUYJcl/sel_KRS073+1.p_1',axiom_5) ).
fof(13,axiom,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('/tmp/tmpnUYJcl/sel_KRS073+1.p_1',axiom_9) ).
fof(31,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf(X1,X2)
& ! [X5] :
( rinvS(X2,X5)
=> cp(X5) )
& ! [X5] :
( rinvF(X2,X5)
=> ? [X6] :
( rs(X5,X6)
& cp(X6) ) ) )
& ~ cp(X1) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(37,plain,
! [X1,X2] :
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(38,plain,
! [X3,X4] :
( ~ rs(X3,X4)
| rf(X3,X4) ),
inference(variable_rename,[status(thm)],[37]) ).
cnf(39,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[38]) ).
fof(43,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rf(X1,X2)
& ! [X5] :
( ~ rinvS(X2,X5)
| cp(X5) )
& ! [X5] :
( ~ rinvF(X2,X5)
| ? [X6] :
( rs(X5,X6)
& cp(X6) ) ) )
& ~ cp(X1) ) )
& ( ! [X2] :
( ~ rf(X1,X2)
| ? [X5] :
( rinvS(X2,X5)
& ~ cp(X5) )
| ? [X5] :
( rinvF(X2,X5)
& ! [X6] :
( ~ rs(X5,X6)
| ~ cp(X6) ) ) )
| cp(X1)
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(44,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ? [X8] :
( rf(X7,X8)
& ! [X9] :
( ~ rinvS(X8,X9)
| cp(X9) )
& ! [X10] :
( ~ rinvF(X8,X10)
| ? [X11] :
( rs(X10,X11)
& cp(X11) ) ) )
& ~ cp(X7) ) )
& ( ! [X12] :
( ~ rf(X7,X12)
| ? [X13] :
( rinvS(X12,X13)
& ~ cp(X13) )
| ? [X14] :
( rinvF(X12,X14)
& ! [X15] :
( ~ rs(X14,X15)
| ~ cp(X15) ) ) )
| cp(X7)
| cUnsatisfiable(X7) ) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( rf(X7,esk1_1(X7))
& ! [X9] :
( ~ rinvS(esk1_1(X7),X9)
| cp(X9) )
& ! [X10] :
( ~ rinvF(esk1_1(X7),X10)
| ( rs(X10,esk2_2(X7,X10))
& cp(esk2_2(X7,X10)) ) )
& ~ cp(X7) ) )
& ( ! [X12] :
( ~ rf(X7,X12)
| ( rinvS(X12,esk3_2(X7,X12))
& ~ cp(esk3_2(X7,X12)) )
| ( rinvF(X12,esk4_2(X7,X12))
& ! [X15] :
( ~ rs(esk4_2(X7,X12),X15)
| ~ cp(X15) ) ) )
| cp(X7)
| cUnsatisfiable(X7) ) ),
inference(skolemize,[status(esa)],[44]) ).
fof(46,plain,
! [X7,X9,X10,X12,X15] :
( ( ( ( ~ rs(esk4_2(X7,X12),X15)
| ~ cp(X15) )
& rinvF(X12,esk4_2(X7,X12)) )
| ~ rf(X7,X12)
| ( rinvS(X12,esk3_2(X7,X12))
& ~ cp(esk3_2(X7,X12)) )
| cp(X7)
| cUnsatisfiable(X7) )
& ( ( ( ~ rinvF(esk1_1(X7),X10)
| ( rs(X10,esk2_2(X7,X10))
& cp(esk2_2(X7,X10)) ) )
& ( ~ rinvS(esk1_1(X7),X9)
| cp(X9) )
& rf(X7,esk1_1(X7))
& ~ cp(X7) )
| ~ cUnsatisfiable(X7) ) ),
inference(shift_quantors,[status(thm)],[45]) ).
fof(47,plain,
! [X7,X9,X10,X12,X15] :
( ( rinvS(X12,esk3_2(X7,X12))
| ~ rf(X7,X12)
| ~ rs(esk4_2(X7,X12),X15)
| ~ cp(X15)
| cp(X7)
| cUnsatisfiable(X7) )
& ( ~ cp(esk3_2(X7,X12))
| ~ rf(X7,X12)
| ~ rs(esk4_2(X7,X12),X15)
| ~ cp(X15)
| cp(X7)
| cUnsatisfiable(X7) )
& ( rinvS(X12,esk3_2(X7,X12))
| ~ rf(X7,X12)
| rinvF(X12,esk4_2(X7,X12))
| cp(X7)
| cUnsatisfiable(X7) )
& ( ~ cp(esk3_2(X7,X12))
| ~ rf(X7,X12)
| rinvF(X12,esk4_2(X7,X12))
| cp(X7)
| cUnsatisfiable(X7) )
& ( rs(X10,esk2_2(X7,X10))
| ~ rinvF(esk1_1(X7),X10)
| ~ cUnsatisfiable(X7) )
& ( cp(esk2_2(X7,X10))
| ~ rinvF(esk1_1(X7),X10)
| ~ cUnsatisfiable(X7) )
& ( ~ rinvS(esk1_1(X7),X9)
| cp(X9)
| ~ cUnsatisfiable(X7) )
& ( rf(X7,esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( ~ cp(X7)
| ~ cUnsatisfiable(X7) ) ),
inference(distribute,[status(thm)],[46]) ).
cnf(48,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(49,plain,
( rf(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(50,plain,
( cp(X2)
| ~ cUnsatisfiable(X1)
| ~ rinvS(esk1_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(52,plain,
( rs(X2,esk2_2(X1,X2))
| ~ cUnsatisfiable(X1)
| ~ rinvF(esk1_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[47]) ).
fof(57,plain,
! [X1,X2,X5] :
( ~ rf(X1,X2)
| ~ rf(X1,X5)
| X2 = X5 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(58,plain,
! [X6,X7,X8] :
( ~ rf(X6,X7)
| ~ rf(X6,X8)
| X7 = X8 ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(71,plain,
! [X1,X2] :
( ( ~ rinvS(X1,X2)
| rs(X2,X1) )
& ( ~ rs(X2,X1)
| rinvS(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(72,plain,
! [X3,X4] :
( ( ~ rinvS(X3,X4)
| rs(X4,X3) )
& ( ~ rs(X4,X3)
| rinvS(X3,X4) ) ),
inference(variable_rename,[status(thm)],[71]) ).
cnf(73,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(78,plain,
! [X1,X2] :
( ( ~ rinvF(X1,X2)
| rf(X2,X1) )
& ( ~ rf(X2,X1)
| rinvF(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(79,plain,
! [X3,X4] :
( ( ~ rinvF(X3,X4)
| rf(X4,X3) )
& ( ~ rf(X4,X3)
| rinvF(X3,X4) ) ),
inference(variable_rename,[status(thm)],[78]) ).
cnf(80,plain,
( rinvF(X1,X2)
| ~ rf(X2,X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(85,plain,
cUnsatisfiable(i2003_11_14_17_18_54369),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(143,plain,
( cp(X1)
| ~ cUnsatisfiable(X2)
| ~ rs(X1,esk1_1(X2)) ),
inference(spm,[status(thm)],[50,73,theory(equality)]) ).
cnf(144,plain,
( X1 = esk1_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[59,49,theory(equality)]) ).
cnf(146,plain,
( rf(X1,esk2_2(X2,X1))
| ~ rinvF(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[39,52,theory(equality)]) ).
cnf(157,plain,
( esk2_2(X1,X2) = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rinvF(esk1_1(X1),X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[144,146,theory(equality)]) ).
cnf(158,plain,
( esk2_2(X1,X2) = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X1)
| ~ rf(X2,esk1_1(X1)) ),
inference(spm,[status(thm)],[157,80,theory(equality)]) ).
cnf(160,plain,
( esk2_2(X1,X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[158,49,theory(equality)]) ).
cnf(161,plain,
( rs(X1,esk1_1(X1))
| ~ rinvF(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[52,160,theory(equality)]) ).
cnf(166,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1)
| ~ rf(X1,esk1_1(X1)) ),
inference(spm,[status(thm)],[161,80,theory(equality)]) ).
cnf(168,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[166,49]) ).
cnf(173,plain,
( cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[143,168,theory(equality)]) ).
cnf(174,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[173,48]) ).
cnf(175,plain,
$false,
inference(sr,[status(thm)],[85,174,theory(equality)]) ).
cnf(176,plain,
$false,
175,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS073+1.p
% --creating new selector for []
% -running prover on /tmp/tmpnUYJcl/sel_KRS073+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS073+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS073+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS073+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
%
%------------------------------------------------------------------------------