%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS072+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:09 EST 2010
% Result : Unsatisfiable 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 167 ( 14 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 231 ( 94 ~; 82 |; 51 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 65 ( 1 sgn 38 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rinvR(X4,X5)
& ! [X6,X7] :
( ( rr(X5,X6)
& rr(X5,X7) )
=> X6 = X7 )
& ? [X8] :
( rr(X5,X8)
& cp1(X8) ) )
& cp2(X4) ) ),
file('/tmp/tmp6QG4Cg/sel_KRS072+1.p_1',axiom_2) ).
fof(5,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp3(X4)
| cp2(X4)
| cp4(X4)
| cp5(X4) ) ),
file('/tmp/tmp6QG4Cg/sel_KRS072+1.p_1',axiom_3) ).
fof(9,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/tmp/tmp6QG4Cg/sel_KRS072+1.p_1',axiom_7) ).
fof(12,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/tmp/tmp6QG4Cg/sel_KRS072+1.p_1',axiom_8) ).
fof(36,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ( ? [X5] :
( rinvR(X4,X5)
& ! [X6,X7] :
( ~ rr(X5,X6)
| ~ rr(X5,X7)
| X6 = X7 )
& ? [X8] :
( rr(X5,X8)
& cp1(X8) ) )
& cp2(X4) ) )
& ( ! [X5] :
( ~ rinvR(X4,X5)
| ? [X6,X7] :
( rr(X5,X6)
& rr(X5,X7)
& X6 != X7 )
| ! [X8] :
( ~ rr(X5,X8)
| ~ cp1(X8) ) )
| ~ cp2(X4)
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(37,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( ? [X10] :
( rinvR(X9,X10)
& ! [X11,X12] :
( ~ rr(X10,X11)
| ~ rr(X10,X12)
| X11 = X12 )
& ? [X13] :
( rr(X10,X13)
& cp1(X13) ) )
& cp2(X9) ) )
& ( ! [X14] :
( ~ rinvR(X9,X14)
| ? [X15,X16] :
( rr(X14,X15)
& rr(X14,X16)
& X15 != X16 )
| ! [X17] :
( ~ rr(X14,X17)
| ~ cp1(X17) ) )
| ~ cp2(X9)
| cUnsatisfiable(X9) ) ),
inference(variable_rename,[status(thm)],[36]) ).
fof(38,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( rinvR(X9,esk1_1(X9))
& ! [X11,X12] :
( ~ rr(esk1_1(X9),X11)
| ~ rr(esk1_1(X9),X12)
| X11 = X12 )
& rr(esk1_1(X9),esk2_1(X9))
& cp1(esk2_1(X9))
& cp2(X9) ) )
& ( ! [X14] :
( ~ rinvR(X9,X14)
| ( rr(X14,esk3_2(X9,X14))
& rr(X14,esk4_2(X9,X14))
& esk3_2(X9,X14) != esk4_2(X9,X14) )
| ! [X17] :
( ~ rr(X14,X17)
| ~ cp1(X17) ) )
| ~ cp2(X9)
| cUnsatisfiable(X9) ) ),
inference(skolemize,[status(esa)],[37]) ).
fof(39,plain,
! [X9,X11,X12,X14,X17] :
( ( ~ rr(X14,X17)
| ~ cp1(X17)
| ~ rinvR(X9,X14)
| ( rr(X14,esk3_2(X9,X14))
& rr(X14,esk4_2(X9,X14))
& esk3_2(X9,X14) != esk4_2(X9,X14) )
| ~ cp2(X9)
| cUnsatisfiable(X9) )
& ( ( ( ~ rr(esk1_1(X9),X11)
| ~ rr(esk1_1(X9),X12)
| X11 = X12 )
& rinvR(X9,esk1_1(X9))
& rr(esk1_1(X9),esk2_1(X9))
& cp1(esk2_1(X9))
& cp2(X9) )
| ~ cUnsatisfiable(X9) ) ),
inference(shift_quantors,[status(thm)],[38]) ).
fof(40,plain,
! [X9,X11,X12,X14,X17] :
( ( rr(X14,esk3_2(X9,X14))
| ~ rinvR(X9,X14)
| ~ rr(X14,X17)
| ~ cp1(X17)
| ~ cp2(X9)
| cUnsatisfiable(X9) )
& ( rr(X14,esk4_2(X9,X14))
| ~ rinvR(X9,X14)
| ~ rr(X14,X17)
| ~ cp1(X17)
| ~ cp2(X9)
| cUnsatisfiable(X9) )
& ( esk3_2(X9,X14) != esk4_2(X9,X14)
| ~ rinvR(X9,X14)
| ~ rr(X14,X17)
| ~ cp1(X17)
| ~ cp2(X9)
| cUnsatisfiable(X9) )
& ( ~ rr(esk1_1(X9),X11)
| ~ rr(esk1_1(X9),X12)
| X11 = X12
| ~ cUnsatisfiable(X9) )
& ( rinvR(X9,esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(esk1_1(X9),esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp1(esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp2(X9)
| ~ cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[39]) ).
cnf(41,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(42,plain,
( cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(43,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(44,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(45,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(esk1_1(X1),X3)
| ~ rr(esk1_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(49,plain,
! [X4] :
( ~ cp1(X4)
| ( ~ cp3(X4)
& ~ cp2(X4)
& ~ cp4(X4)
& ~ cp5(X4) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(50,plain,
! [X5] :
( ~ cp1(X5)
| ( ~ cp3(X5)
& ~ cp2(X5)
& ~ cp4(X5)
& ~ cp5(X5) ) ),
inference(variable_rename,[status(thm)],[49]) ).
fof(51,plain,
! [X5] :
( ( ~ cp3(X5)
| ~ cp1(X5) )
& ( ~ cp2(X5)
| ~ cp1(X5) )
& ( ~ cp4(X5)
| ~ cp1(X5) )
& ( ~ cp5(X5)
| ~ cp1(X5) ) ),
inference(distribute,[status(thm)],[50]) ).
cnf(54,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(66,plain,
! [X4,X5] :
( ( ~ rinvR(X4,X5)
| rr(X5,X4) )
& ( ~ rr(X5,X4)
| rinvR(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(67,plain,
! [X6,X7] :
( ( ~ rinvR(X6,X7)
| rr(X7,X6) )
& ( ~ rr(X7,X6)
| rinvR(X6,X7) ) ),
inference(variable_rename,[status(thm)],[66]) ).
cnf(69,plain,
( rr(X1,X2)
| ~ rinvR(X2,X1) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(81,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(115,plain,
( ~ cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[54,42,theory(equality)]) ).
cnf(116,plain,
( rr(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[69,44,theory(equality)]) ).
cnf(122,plain,
( ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(esk2_1(X1)) ),
inference(spm,[status(thm)],[115,41,theory(equality)]) ).
cnf(124,plain,
( X1 = X2
| ~ rr(esk1_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[45,116,theory(equality)]) ).
cnf(128,plain,
( esk2_1(X1) = X1
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[124,43,theory(equality)]) ).
cnf(132,plain,
~ cUnsatisfiable(X1),
inference(spm,[status(thm)],[122,128,theory(equality)]) ).
cnf(134,plain,
$false,
inference(sr,[status(thm)],[81,132,theory(equality)]) ).
cnf(135,plain,
$false,
134,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS072+1.p
% --creating new selector for []
% -running prover on /tmp/tmp6QG4Cg/sel_KRS072+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS072+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS072+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS072+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
%
%------------------------------------------------------------------------------