TSTP Solution File: KRS074+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS074+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:36 EST 2010
% Result : Unsatisfiable 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 23 ( 6 avg)
% Number of connectives : 144 ( 53 ~; 49 |; 38 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 1 sgn 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rs(X1,X2)
& cp(X2)
& ? [X5] :
( rinvS(X2,X5)
& cp(X5) ) )
& ! [X2] :
( rs(X1,X2)
=> ~ cp(X2) ) ) ),
file('/tmp/tmpWNJcfe/sel_KRS074+1.p_1',axiom_2) ).
fof(13,axiom,
cUnsatisfiable(i2003_11_14_17_18_59896),
file('/tmp/tmpWNJcfe/sel_KRS074+1.p_1',axiom_9) ).
fof(31,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rs(X1,X2)
& cp(X2)
& ? [X5] :
( rinvS(X2,X5)
& cp(X5) ) )
& ! [X2] :
( rs(X1,X2)
=> ~ cp(X2) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(43,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rs(X1,X2)
& cp(X2)
& ? [X5] :
( rinvS(X2,X5)
& cp(X5) ) )
& ! [X2] :
( ~ rs(X1,X2)
| ~ cp(X2) ) ) )
& ( ! [X2] :
( ~ rs(X1,X2)
| ~ cp(X2)
| ! [X5] :
( ~ rinvS(X2,X5)
| ~ cp(X5) ) )
| ? [X2] :
( rs(X1,X2)
& cp(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(44,plain,
! [X6] :
( ( ~ cUnsatisfiable(X6)
| ( ? [X7] :
( rs(X6,X7)
& cp(X7)
& ? [X8] :
( rinvS(X7,X8)
& cp(X8) ) )
& ! [X9] :
( ~ rs(X6,X9)
| ~ cp(X9) ) ) )
& ( ! [X10] :
( ~ rs(X6,X10)
| ~ cp(X10)
| ! [X11] :
( ~ rinvS(X10,X11)
| ~ cp(X11) ) )
| ? [X12] :
( rs(X6,X12)
& cp(X12) )
| cUnsatisfiable(X6) ) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,plain,
! [X6] :
( ( ~ cUnsatisfiable(X6)
| ( rs(X6,esk1_1(X6))
& cp(esk1_1(X6))
& rinvS(esk1_1(X6),esk2_1(X6))
& cp(esk2_1(X6))
& ! [X9] :
( ~ rs(X6,X9)
| ~ cp(X9) ) ) )
& ( ! [X10] :
( ~ rs(X6,X10)
| ~ cp(X10)
| ! [X11] :
( ~ rinvS(X10,X11)
| ~ cp(X11) ) )
| ( rs(X6,esk3_1(X6))
& cp(esk3_1(X6)) )
| cUnsatisfiable(X6) ) ),
inference(skolemize,[status(esa)],[44]) ).
fof(46,plain,
! [X6,X9,X10,X11] :
( ( ~ rinvS(X10,X11)
| ~ cp(X11)
| ~ rs(X6,X10)
| ~ cp(X10)
| ( rs(X6,esk3_1(X6))
& cp(esk3_1(X6)) )
| cUnsatisfiable(X6) )
& ( ( ( ~ rs(X6,X9)
| ~ cp(X9) )
& rs(X6,esk1_1(X6))
& cp(esk1_1(X6))
& rinvS(esk1_1(X6),esk2_1(X6))
& cp(esk2_1(X6)) )
| ~ cUnsatisfiable(X6) ) ),
inference(shift_quantors,[status(thm)],[45]) ).
fof(47,plain,
! [X6,X9,X10,X11] :
( ( rs(X6,esk3_1(X6))
| ~ rinvS(X10,X11)
| ~ cp(X11)
| ~ rs(X6,X10)
| ~ cp(X10)
| cUnsatisfiable(X6) )
& ( cp(esk3_1(X6))
| ~ rinvS(X10,X11)
| ~ cp(X11)
| ~ rs(X6,X10)
| ~ cp(X10)
| cUnsatisfiable(X6) )
& ( ~ rs(X6,X9)
| ~ cp(X9)
| ~ cUnsatisfiable(X6) )
& ( rs(X6,esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( cp(esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( rinvS(esk1_1(X6),esk2_1(X6))
| ~ cUnsatisfiable(X6) )
& ( cp(esk2_1(X6))
| ~ cUnsatisfiable(X6) ) ),
inference(distribute,[status(thm)],[46]) ).
cnf(50,plain,
( cp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(51,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(52,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(83,plain,
cUnsatisfiable(i2003_11_14_17_18_59896),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(140,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk1_1(X1)) ),
inference(spm,[status(thm)],[52,51,theory(equality)]) ).
cnf(153,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[140,50]) ).
cnf(154,plain,
$false,
inference(sr,[status(thm)],[83,153,theory(equality)]) ).
cnf(155,plain,
$false,
154,
[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/KRS074+1.p
% --creating new selector for []
% -running prover on /tmp/tmpWNJcfe/sel_KRS074+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS074+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS074+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS074+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
%
%------------------------------------------------------------------------------