%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS078+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:57:33 EST 2010
% Result : Unsatisfiable 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 219 ( 16 equ)
% Maximal formula atoms : 65 ( 8 avg)
% Number of connectives : 298 ( 106 ~; 117 |; 68 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-3 aty)
% Number of variables : 86 ( 1 sgn 49 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X5] :
( rr(X1,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( rs(X6,X7)
=> cp(X7) ) )
& ! [X8,X9] :
( ( rinvR(X5,X8)
& rinvR(X5,X9) )
=> X8 = X9 ) )
& ? [X5] :
( rs(X1,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) ),
file('/tmp/tmp9wE3rE/sel_KRS078+1.p_1',axiom_2) ).
fof(7,axiom,
! [X1,X5] :
( rinvR(X1,X5)
<=> rr(X5,X1) ),
file('/tmp/tmp9wE3rE/sel_KRS078+1.p_1',axiom_3) ).
fof(11,axiom,
cUnsatisfiable(i2003_11_14_17_19_13721),
file('/tmp/tmp9wE3rE/sel_KRS078+1.p_1',axiom_4) ).
fof(20,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X5] :
( rr(X1,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( rs(X6,X7)
=> cp(X7) ) )
& ! [X8,X9] :
( ( rinvR(X5,X8)
& rinvR(X5,X9) )
=> X8 = X9 ) )
& ? [X5] :
( rs(X1,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(38,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X5] :
( rr(X1,X5)
& ? [X6] :
( rinvR(X5,X6)
& ! [X7] :
( ~ rs(X6,X7)
| cp(X7) ) )
& ! [X8,X9] :
( ~ rinvR(X5,X8)
| ~ rinvR(X5,X9)
| X8 = X9 ) )
& ? [X5] :
( rs(X1,X5)
& ~ cq(X5)
& ~ cp(X5) ) ) )
& ( ! [X5] :
( ~ rr(X1,X5)
| ! [X6] :
( ~ rinvR(X5,X6)
| ? [X7] :
( rs(X6,X7)
& ~ cp(X7) ) )
| ? [X8,X9] :
( rinvR(X5,X8)
& rinvR(X5,X9)
& X8 != X9 ) )
| ! [X5] :
( ~ rs(X1,X5)
| cq(X5)
| cp(X5) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(39,plain,
! [X10] :
( ( ~ cUnsatisfiable(X10)
| ( ? [X11] :
( rr(X10,X11)
& ? [X12] :
( rinvR(X11,X12)
& ! [X13] :
( ~ rs(X12,X13)
| cp(X13) ) )
& ! [X14,X15] :
( ~ rinvR(X11,X14)
| ~ rinvR(X11,X15)
| X14 = X15 ) )
& ? [X16] :
( rs(X10,X16)
& ~ cq(X16)
& ~ cp(X16) ) ) )
& ( ! [X17] :
( ~ rr(X10,X17)
| ! [X18] :
( ~ rinvR(X17,X18)
| ? [X19] :
( rs(X18,X19)
& ~ cp(X19) ) )
| ? [X20,X21] :
( rinvR(X17,X20)
& rinvR(X17,X21)
& X20 != X21 ) )
| ! [X22] :
( ~ rs(X10,X22)
| cq(X22)
| cp(X22) )
| cUnsatisfiable(X10) ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
! [X10] :
( ( ~ cUnsatisfiable(X10)
| ( rr(X10,esk1_1(X10))
& rinvR(esk1_1(X10),esk2_1(X10))
& ! [X13] :
( ~ rs(esk2_1(X10),X13)
| cp(X13) )
& ! [X14,X15] :
( ~ rinvR(esk1_1(X10),X14)
| ~ rinvR(esk1_1(X10),X15)
| X14 = X15 )
& rs(X10,esk3_1(X10))
& ~ cq(esk3_1(X10))
& ~ cp(esk3_1(X10)) ) )
& ( ! [X17] :
( ~ rr(X10,X17)
| ! [X18] :
( ~ rinvR(X17,X18)
| ( rs(X18,esk4_3(X10,X17,X18))
& ~ cp(esk4_3(X10,X17,X18)) ) )
| ( rinvR(X17,esk5_2(X10,X17))
& rinvR(X17,esk6_2(X10,X17))
& esk5_2(X10,X17) != esk6_2(X10,X17) ) )
| ! [X22] :
( ~ rs(X10,X22)
| cq(X22)
| cp(X22) )
| cUnsatisfiable(X10) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X10,X13,X14,X15,X17,X18,X22] :
( ( ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| ~ rinvR(X17,X18)
| ( rs(X18,esk4_3(X10,X17,X18))
& ~ cp(esk4_3(X10,X17,X18)) )
| ~ rr(X10,X17)
| ( rinvR(X17,esk5_2(X10,X17))
& rinvR(X17,esk6_2(X10,X17))
& esk5_2(X10,X17) != esk6_2(X10,X17) )
| cUnsatisfiable(X10) )
& ( ( ( ~ rinvR(esk1_1(X10),X14)
| ~ rinvR(esk1_1(X10),X15)
| X14 = X15 )
& ( ~ rs(esk2_1(X10),X13)
| cp(X13) )
& rinvR(esk1_1(X10),esk2_1(X10))
& rr(X10,esk1_1(X10))
& rs(X10,esk3_1(X10))
& ~ cq(esk3_1(X10))
& ~ cp(esk3_1(X10)) )
| ~ cUnsatisfiable(X10) ) ),
inference(shift_quantors,[status(thm)],[40]) ).
fof(42,plain,
! [X10,X13,X14,X15,X17,X18,X22] :
( ( rinvR(X17,esk5_2(X10,X17))
| rs(X18,esk4_3(X10,X17,X18))
| ~ rinvR(X17,X18)
| ~ rr(X10,X17)
| ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| cUnsatisfiable(X10) )
& ( rinvR(X17,esk6_2(X10,X17))
| rs(X18,esk4_3(X10,X17,X18))
| ~ rinvR(X17,X18)
| ~ rr(X10,X17)
| ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| cUnsatisfiable(X10) )
& ( esk5_2(X10,X17) != esk6_2(X10,X17)
| rs(X18,esk4_3(X10,X17,X18))
| ~ rinvR(X17,X18)
| ~ rr(X10,X17)
| ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| cUnsatisfiable(X10) )
& ( rinvR(X17,esk5_2(X10,X17))
| ~ cp(esk4_3(X10,X17,X18))
| ~ rinvR(X17,X18)
| ~ rr(X10,X17)
| ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| cUnsatisfiable(X10) )
& ( rinvR(X17,esk6_2(X10,X17))
| ~ cp(esk4_3(X10,X17,X18))
| ~ rinvR(X17,X18)
| ~ rr(X10,X17)
| ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| cUnsatisfiable(X10) )
& ( esk5_2(X10,X17) != esk6_2(X10,X17)
| ~ cp(esk4_3(X10,X17,X18))
| ~ rinvR(X17,X18)
| ~ rr(X10,X17)
| ~ rs(X10,X22)
| cq(X22)
| cp(X22)
| cUnsatisfiable(X10) )
& ( ~ rinvR(esk1_1(X10),X14)
| ~ rinvR(esk1_1(X10),X15)
| X14 = X15
| ~ cUnsatisfiable(X10) )
& ( ~ rs(esk2_1(X10),X13)
| cp(X13)
| ~ cUnsatisfiable(X10) )
& ( rinvR(esk1_1(X10),esk2_1(X10))
| ~ cUnsatisfiable(X10) )
& ( rr(X10,esk1_1(X10))
| ~ cUnsatisfiable(X10) )
& ( rs(X10,esk3_1(X10))
| ~ cUnsatisfiable(X10) )
& ( ~ cq(esk3_1(X10))
| ~ cUnsatisfiable(X10) )
& ( ~ cp(esk3_1(X10))
| ~ cUnsatisfiable(X10) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(43,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(45,plain,
( rs(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(46,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(47,plain,
( rinvR(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(48,plain,
( cp(X2)
| ~ cUnsatisfiable(X1)
| ~ rs(esk2_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(49,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rinvR(esk1_1(X1),X3)
| ~ rinvR(esk1_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(56,plain,
! [X1,X5] :
( ( ~ rinvR(X1,X5)
| rr(X5,X1) )
& ( ~ rr(X5,X1)
| rinvR(X1,X5) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(57,plain,
! [X6,X7] :
( ( ~ rinvR(X6,X7)
| rr(X7,X6) )
& ( ~ rr(X7,X6)
| rinvR(X6,X7) ) ),
inference(variable_rename,[status(thm)],[56]) ).
cnf(58,plain,
( rinvR(X1,X2)
| ~ rr(X2,X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(69,plain,
cUnsatisfiable(i2003_11_14_17_19_13721),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(93,plain,
( rinvR(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[58,46,theory(equality)]) ).
cnf(99,plain,
( X1 = X2
| ~ cUnsatisfiable(X2)
| ~ rinvR(esk1_1(X2),X1) ),
inference(spm,[status(thm)],[49,93,theory(equality)]) ).
cnf(100,plain,
( esk2_1(X1) = X1
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[99,47,theory(equality)]) ).
cnf(102,plain,
( cp(X1)
| ~ rs(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[48,100,theory(equality)]) ).
cnf(103,plain,
( cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[102,45,theory(equality)]) ).
cnf(104,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[103,43]) ).
cnf(105,plain,
$false,
inference(sr,[status(thm)],[69,104,theory(equality)]) ).
cnf(106,plain,
$false,
105,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS078+1.p
% --creating new selector for []
% -running prover on /tmp/tmp9wE3rE/sel_KRS078+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS078+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS078+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS078+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
%
%------------------------------------------------------------------------------