TSTP Solution File: KRS097+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS097+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:03:36 EST 2010
% Result : Unsatisfiable 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 156 ( 16 equ)
% Maximal formula atoms : 35 ( 5 avg)
% Number of connectives : 216 ( 87 ~; 80 |; 48 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 1 sgn 34 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X5] : rr(X1,X5)
& ? [X2] :
( rr(X1,X2)
& cd(X2) )
& ~ ? [X5,X6] :
( rr(X1,X5)
& rr(X1,X6)
& X5 != X6 )
& ? [X2] :
( rr(X1,X2)
& cc(X2) ) ) ),
file('/tmp/tmpkm85rX/sel_KRS097+1.p_1',axiom_2) ).
fof(10,axiom,
! [X1] :
~ ( cd(X1)
& cc(X1) ),
file('/tmp/tmpkm85rX/sel_KRS097+1.p_1',axiom_6) ).
fof(12,axiom,
cUnsatisfiable(i2003_11_14_17_20_21603),
file('/tmp/tmpkm85rX/sel_KRS097+1.p_1',axiom_4) ).
fof(57,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X5] : rr(X1,X5)
& ? [X2] :
( rr(X1,X2)
& cd(X2) )
& ! [X5,X6] :
( ~ rr(X1,X5)
| ~ rr(X1,X6)
| X5 = X6 )
& ? [X2] :
( rr(X1,X2)
& cc(X2) ) ) )
& ( ! [X5] : ~ rr(X1,X5)
| ! [X2] :
( ~ rr(X1,X2)
| ~ cd(X2) )
| ? [X5,X6] :
( rr(X1,X5)
& rr(X1,X6)
& X5 != X6 )
| ! [X2] :
( ~ rr(X1,X2)
| ~ cc(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(58,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ? [X8] : rr(X7,X8)
& ? [X9] :
( rr(X7,X9)
& cd(X9) )
& ! [X10,X11] :
( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11 )
& ? [X12] :
( rr(X7,X12)
& cc(X12) ) ) )
& ( ! [X13] : ~ rr(X7,X13)
| ! [X14] :
( ~ rr(X7,X14)
| ~ cd(X14) )
| ? [X15,X16] :
( rr(X7,X15)
& rr(X7,X16)
& X15 != X16 )
| ! [X17] :
( ~ rr(X7,X17)
| ~ cc(X17) )
| cUnsatisfiable(X7) ) ),
inference(variable_rename,[status(thm)],[57]) ).
fof(59,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( rr(X7,esk1_1(X7))
& rr(X7,esk2_1(X7))
& cd(esk2_1(X7))
& ! [X10,X11] :
( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11 )
& rr(X7,esk3_1(X7))
& cc(esk3_1(X7)) ) )
& ( ! [X13] : ~ rr(X7,X13)
| ! [X14] :
( ~ rr(X7,X14)
| ~ cd(X14) )
| ( rr(X7,esk4_1(X7))
& rr(X7,esk5_1(X7))
& esk4_1(X7) != esk5_1(X7) )
| ! [X17] :
( ~ rr(X7,X17)
| ~ cc(X17) )
| cUnsatisfiable(X7) ) ),
inference(skolemize,[status(esa)],[58]) ).
fof(60,plain,
! [X7,X10,X11,X13,X14,X17] :
( ( ~ rr(X7,X17)
| ~ cc(X17)
| ~ rr(X7,X14)
| ~ cd(X14)
| ~ rr(X7,X13)
| ( rr(X7,esk4_1(X7))
& rr(X7,esk5_1(X7))
& esk4_1(X7) != esk5_1(X7) )
| cUnsatisfiable(X7) )
& ( ( ( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11 )
& rr(X7,esk1_1(X7))
& rr(X7,esk2_1(X7))
& cd(esk2_1(X7))
& rr(X7,esk3_1(X7))
& cc(esk3_1(X7)) )
| ~ cUnsatisfiable(X7) ) ),
inference(shift_quantors,[status(thm)],[59]) ).
fof(61,plain,
! [X7,X10,X11,X13,X14,X17] :
( ( rr(X7,esk4_1(X7))
| ~ rr(X7,X14)
| ~ cd(X14)
| ~ rr(X7,X13)
| ~ rr(X7,X17)
| ~ cc(X17)
| cUnsatisfiable(X7) )
& ( rr(X7,esk5_1(X7))
| ~ rr(X7,X14)
| ~ cd(X14)
| ~ rr(X7,X13)
| ~ rr(X7,X17)
| ~ cc(X17)
| cUnsatisfiable(X7) )
& ( esk4_1(X7) != esk5_1(X7)
| ~ rr(X7,X14)
| ~ cd(X14)
| ~ rr(X7,X13)
| ~ rr(X7,X17)
| ~ cc(X17)
| cUnsatisfiable(X7) )
& ( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cd(esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk3_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cc(esk3_1(X7))
| ~ cUnsatisfiable(X7) ) ),
inference(distribute,[status(thm)],[60]) ).
cnf(62,plain,
( cc(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(63,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(64,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(65,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(66,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(67,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(84,plain,
! [X1] :
( ~ cd(X1)
| ~ cc(X1) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(85,plain,
! [X2] :
( ~ cd(X2)
| ~ cc(X2) ),
inference(variable_rename,[status(thm)],[84]) ).
cnf(86,plain,
( ~ cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[85]) ).
cnf(90,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(172,plain,
( ~ cc(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[86,64,theory(equality)]) ).
cnf(176,plain,
( X1 = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
inference(spm,[status(thm)],[67,66,theory(equality)]) ).
cnf(188,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[176,65,theory(equality)]) ).
cnf(189,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[176,63,theory(equality)]) ).
cnf(192,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[188,189,theory(equality)]) ).
cnf(195,plain,
( ~ cUnsatisfiable(X1)
| ~ cc(esk3_1(X1)) ),
inference(spm,[status(thm)],[172,192,theory(equality)]) ).
cnf(196,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[195,62]) ).
cnf(197,plain,
$false,
inference(sr,[status(thm)],[90,196,theory(equality)]) ).
cnf(198,plain,
$false,
197,
[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/KRS097+1.p
% --creating new selector for []
% -running prover on /tmp/tmpkm85rX/sel_KRS097+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS097+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS097+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS097+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
%
%------------------------------------------------------------------------------