%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS101+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 12:59:36 EST 2010
% Result : Unsatisfiable 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 248 ( 36 equ)
% Maximal formula atoms : 87 ( 8 avg)
% Number of connectives : 355 ( 135 ~; 149 |; 65 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 88 ( 1 sgn 49 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X4] :
( rr(X3,X4)
=> cd(X4) )
& ! [X4] :
( rr(X3,X4)
=> ( ~ ? [X5,X6] :
( rs(X4,X5)
& rs(X4,X6)
& X5 != X6 )
| cc(X4) ) )
& ? [X4] :
( rr(X3,X4)
& ~ ! [X5,X6] :
( ( rs(X4,X5)
& rs(X4,X6) )
=> X5 = X6 ) ) ) ),
file('/tmp/tmpL4xgye/sel_KRS101+1.p_1',axiom_2) ).
fof(5,axiom,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
file('/tmp/tmpL4xgye/sel_KRS101+1.p_1',axiom_3) ).
fof(9,axiom,
cUnsatisfiable(i2003_11_14_17_20_36582),
file('/tmp/tmpL4xgye/sel_KRS101+1.p_1',axiom_4) ).
fof(18,plain,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(29,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ! [X4] :
( ~ rr(X3,X4)
| cd(X4) )
& ! [X4] :
( ~ rr(X3,X4)
| ! [X5,X6] :
( ~ rs(X4,X5)
| ~ rs(X4,X6)
| X5 = X6 )
| cc(X4) )
& ? [X4] :
( rr(X3,X4)
& ? [X5,X6] :
( rs(X4,X5)
& rs(X4,X6)
& X5 != X6 ) ) ) )
& ( ? [X4] :
( rr(X3,X4)
& ~ cd(X4) )
| ? [X4] :
( rr(X3,X4)
& ? [X5,X6] :
( rs(X4,X5)
& rs(X4,X6)
& X5 != X6 )
& ~ cc(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ! [X5,X6] :
( ~ rs(X4,X5)
| ~ rs(X4,X6)
| X5 = X6 ) )
| cUnsatisfiable(X3) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(30,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ! [X8] :
( ~ rr(X7,X8)
| cd(X8) )
& ! [X9] :
( ~ rr(X7,X9)
| ! [X10,X11] :
( ~ rs(X9,X10)
| ~ rs(X9,X11)
| X10 = X11 )
| cc(X9) )
& ? [X12] :
( rr(X7,X12)
& ? [X13,X14] :
( rs(X12,X13)
& rs(X12,X14)
& X13 != X14 ) ) ) )
& ( ? [X15] :
( rr(X7,X15)
& ~ cd(X15) )
| ? [X16] :
( rr(X7,X16)
& ? [X17,X18] :
( rs(X16,X17)
& rs(X16,X18)
& X17 != X18 )
& ~ cc(X16) )
| ! [X19] :
( ~ rr(X7,X19)
| ! [X20,X21] :
( ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21 ) )
| cUnsatisfiable(X7) ) ),
inference(variable_rename,[status(thm)],[29]) ).
fof(31,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ! [X8] :
( ~ rr(X7,X8)
| cd(X8) )
& ! [X9] :
( ~ rr(X7,X9)
| ! [X10,X11] :
( ~ rs(X9,X10)
| ~ rs(X9,X11)
| X10 = X11 )
| cc(X9) )
& rr(X7,esk1_1(X7))
& rs(esk1_1(X7),esk2_1(X7))
& rs(esk1_1(X7),esk3_1(X7))
& esk2_1(X7) != esk3_1(X7) ) )
& ( ( rr(X7,esk4_1(X7))
& ~ cd(esk4_1(X7)) )
| ( rr(X7,esk5_1(X7))
& rs(esk5_1(X7),esk6_1(X7))
& rs(esk5_1(X7),esk7_1(X7))
& esk6_1(X7) != esk7_1(X7)
& ~ cc(esk5_1(X7)) )
| ! [X19] :
( ~ rr(X7,X19)
| ! [X20,X21] :
( ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21 ) )
| cUnsatisfiable(X7) ) ),
inference(skolemize,[status(esa)],[30]) ).
fof(32,plain,
! [X7,X8,X9,X10,X11,X19,X20,X21] :
( ( ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| ( rr(X7,esk4_1(X7))
& ~ cd(esk4_1(X7)) )
| ( rr(X7,esk5_1(X7))
& rs(esk5_1(X7),esk6_1(X7))
& rs(esk5_1(X7),esk7_1(X7))
& esk6_1(X7) != esk7_1(X7)
& ~ cc(esk5_1(X7)) )
| cUnsatisfiable(X7) )
& ( ( ( ~ rs(X9,X10)
| ~ rs(X9,X11)
| X10 = X11
| cc(X9)
| ~ rr(X7,X9) )
& ( ~ rr(X7,X8)
| cd(X8) )
& rr(X7,esk1_1(X7))
& rs(esk1_1(X7),esk2_1(X7))
& rs(esk1_1(X7),esk3_1(X7))
& esk2_1(X7) != esk3_1(X7) )
| ~ cUnsatisfiable(X7) ) ),
inference(shift_quantors,[status(thm)],[31]) ).
fof(33,plain,
! [X7,X8,X9,X10,X11,X19,X20,X21] :
( ( rr(X7,esk5_1(X7))
| rr(X7,esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( rs(esk5_1(X7),esk6_1(X7))
| rr(X7,esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( rs(esk5_1(X7),esk7_1(X7))
| rr(X7,esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( esk6_1(X7) != esk7_1(X7)
| rr(X7,esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( ~ cc(esk5_1(X7))
| rr(X7,esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( rr(X7,esk5_1(X7))
| ~ cd(esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( rs(esk5_1(X7),esk6_1(X7))
| ~ cd(esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( rs(esk5_1(X7),esk7_1(X7))
| ~ cd(esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( esk6_1(X7) != esk7_1(X7)
| ~ cd(esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( ~ cc(esk5_1(X7))
| ~ cd(esk4_1(X7))
| ~ rs(X19,X20)
| ~ rs(X19,X21)
| X20 = X21
| ~ rr(X7,X19)
| cUnsatisfiable(X7) )
& ( ~ rs(X9,X10)
| ~ rs(X9,X11)
| X10 = X11
| cc(X9)
| ~ rr(X7,X9)
| ~ cUnsatisfiable(X7) )
& ( ~ rr(X7,X8)
| cd(X8)
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( rs(esk1_1(X7),esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( rs(esk1_1(X7),esk3_1(X7))
| ~ cUnsatisfiable(X7) )
& ( esk2_1(X7) != esk3_1(X7)
| ~ cUnsatisfiable(X7) ) ),
inference(distribute,[status(thm)],[32]) ).
cnf(34,plain,
( ~ cUnsatisfiable(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(35,plain,
( rs(esk1_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(36,plain,
( rs(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(37,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(38,plain,
( cd(X2)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(39,plain,
( cc(X2)
| X3 = X4
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2)
| ~ rs(X2,X4)
| ~ rs(X2,X3) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(50,plain,
! [X3] :
( ~ cc(X3)
| ~ cd(X3) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(51,plain,
! [X4] :
( ~ cc(X4)
| ~ cd(X4) ),
inference(variable_rename,[status(thm)],[50]) ).
cnf(52,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(63,plain,
cUnsatisfiable(i2003_11_14_17_20_36582),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(86,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[38,37,theory(equality)]) ).
cnf(87,plain,
( X1 = esk2_1(X2)
| cc(esk1_1(X2))
| ~ rs(esk1_1(X2),X1)
| ~ rr(X3,esk1_1(X2))
| ~ cUnsatisfiable(X3)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[39,36,theory(equality)]) ).
cnf(99,plain,
( esk3_1(X1) = esk2_1(X1)
| cc(esk1_1(X1))
| ~ rr(X2,esk1_1(X1))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[87,35,theory(equality)]) ).
cnf(100,plain,
( cc(esk1_1(X1))
| ~ rr(X2,esk1_1(X1))
| ~ cUnsatisfiable(X2)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[99,34]) ).
cnf(101,plain,
( cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[100,37,theory(equality)]) ).
cnf(102,plain,
( ~ cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[52,101,theory(equality)]) ).
cnf(103,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[102,86]) ).
cnf(104,plain,
$false,
inference(sr,[status(thm)],[63,103,theory(equality)]) ).
cnf(105,plain,
$false,
104,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS101+1.p
% --creating new selector for []
% -running prover on /tmp/tmpL4xgye/sel_KRS101+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS101+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS101+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS101+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
%
%------------------------------------------------------------------------------