TSTP Solution File: KRS080+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS080+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:57:44 EST 2010
% Result : Unsatisfiable 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 5 unt; 0 def)
% Number of atoms : 678 ( 126 equ)
% Maximal formula atoms : 235 ( 11 avg)
% Number of connectives : 1036 ( 417 ~; 441 |; 173 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 42 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-1 aty)
% Number of variables : 153 ( 1 sgn 77 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
cUnsatisfiable(i2003_11_14_17_19_21224),
file('/tmp/tmpYTpLrE/sel_KRS080+1.p_1',axiom_7) ).
fof(8,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( rr(X3,X4)
& cp(X4)
& cp1(X4) )
& ? [X4] :
( rr(X3,X4)
& cp1(X4) )
& ? [X4] :
( rr(X3,X4)
& cp4(X4) )
& ! [X5,X6,X7,X8] :
( ( rr(X3,X5)
& rr(X3,X6)
& rr(X3,X7)
& rr(X3,X8) )
=> ( X5 = X6
| X5 = X7
| X5 = X8
| X6 = X7
| X6 = X8
| X7 = X8 ) )
& ? [X4] :
( rr(X3,X4)
& cp2(X4) )
& ? [X4] :
( rr(X3,X4)
& cp3(X4) )
& ? [X4] :
( rr(X3,X4)
& cp(X4)
& cp3(X4) )
& ? [X4] :
( rr(X3,X4)
& cp2(X4)
& cp(X4) ) ) ),
file('/tmp/tmpYTpLrE/sel_KRS080+1.p_1',axiom_2) ).
fof(9,axiom,
! [X3] :
( cp1(X3)
=> ~ ( cp2(X3)
| cp4(X3)
| cp5(X3)
| cp3(X3) ) ),
file('/tmp/tmpYTpLrE/sel_KRS080+1.p_1',axiom_3) ).
fof(14,axiom,
! [X3] :
( cp2(X3)
=> ~ ( cp4(X3)
| cp5(X3)
| cp3(X3) ) ),
file('/tmp/tmpYTpLrE/sel_KRS080+1.p_1',axiom_4) ).
fof(15,axiom,
! [X3] :
( cp3(X3)
=> ~ ( cp4(X3)
| cp5(X3) ) ),
file('/tmp/tmpYTpLrE/sel_KRS080+1.p_1',axiom_5) ).
cnf(28,plain,
cUnsatisfiable(i2003_11_14_17_19_21224),
inference(split_conjunct,[status(thm)],[2]) ).
fof(44,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rr(X3,X4)
& cp(X4)
& cp1(X4) )
& ? [X4] :
( rr(X3,X4)
& cp1(X4) )
& ? [X4] :
( rr(X3,X4)
& cp4(X4) )
& ! [X5,X6,X7,X8] :
( ~ rr(X3,X5)
| ~ rr(X3,X6)
| ~ rr(X3,X7)
| ~ rr(X3,X8)
| X5 = X6
| X5 = X7
| X5 = X8
| X6 = X7
| X6 = X8
| X7 = X8 )
& ? [X4] :
( rr(X3,X4)
& cp2(X4) )
& ? [X4] :
( rr(X3,X4)
& cp3(X4) )
& ? [X4] :
( rr(X3,X4)
& cp(X4)
& cp3(X4) )
& ? [X4] :
( rr(X3,X4)
& cp2(X4)
& cp(X4) ) ) )
& ( ! [X4] :
( ~ rr(X3,X4)
| ~ cp(X4)
| ~ cp1(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cp1(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cp4(X4) )
| ? [X5,X6,X7,X8] :
( rr(X3,X5)
& rr(X3,X6)
& rr(X3,X7)
& rr(X3,X8)
& X5 != X6
& X5 != X7
& X5 != X8
& X6 != X7
& X6 != X8
& X7 != X8 )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cp2(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cp3(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cp(X4)
| ~ cp3(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cp2(X4)
| ~ cp(X4) )
| cUnsatisfiable(X3) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(45,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( ? [X10] :
( rr(X9,X10)
& cp(X10)
& cp1(X10) )
& ? [X11] :
( rr(X9,X11)
& cp1(X11) )
& ? [X12] :
( rr(X9,X12)
& cp4(X12) )
& ! [X13,X14,X15,X16] :
( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| ~ rr(X9,X16)
| X13 = X14
| X13 = X15
| X13 = X16
| X14 = X15
| X14 = X16
| X15 = X16 )
& ? [X17] :
( rr(X9,X17)
& cp2(X17) )
& ? [X18] :
( rr(X9,X18)
& cp3(X18) )
& ? [X19] :
( rr(X9,X19)
& cp(X19)
& cp3(X19) )
& ? [X20] :
( rr(X9,X20)
& cp2(X20)
& cp(X20) ) ) )
& ( ! [X21] :
( ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21) )
| ! [X22] :
( ~ rr(X9,X22)
| ~ cp1(X22) )
| ! [X23] :
( ~ rr(X9,X23)
| ~ cp4(X23) )
| ? [X24,X25,X26,X27] :
( rr(X9,X24)
& rr(X9,X25)
& rr(X9,X26)
& rr(X9,X27)
& X24 != X25
& X24 != X26
& X24 != X27
& X25 != X26
& X25 != X27
& X26 != X27 )
| ! [X28] :
( ~ rr(X9,X28)
| ~ cp2(X28) )
| ! [X29] :
( ~ rr(X9,X29)
| ~ cp3(X29) )
| ! [X30] :
( ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30) )
| ! [X31] :
( ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31) )
| cUnsatisfiable(X9) ) ),
inference(variable_rename,[status(thm)],[44]) ).
fof(46,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( rr(X9,esk1_1(X9))
& cp(esk1_1(X9))
& cp1(esk1_1(X9))
& rr(X9,esk2_1(X9))
& cp1(esk2_1(X9))
& rr(X9,esk3_1(X9))
& cp4(esk3_1(X9))
& ! [X13,X14,X15,X16] :
( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| ~ rr(X9,X16)
| X13 = X14
| X13 = X15
| X13 = X16
| X14 = X15
| X14 = X16
| X15 = X16 )
& rr(X9,esk4_1(X9))
& cp2(esk4_1(X9))
& rr(X9,esk5_1(X9))
& cp3(esk5_1(X9))
& rr(X9,esk6_1(X9))
& cp(esk6_1(X9))
& cp3(esk6_1(X9))
& rr(X9,esk7_1(X9))
& cp2(esk7_1(X9))
& cp(esk7_1(X9)) ) )
& ( ! [X21] :
( ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21) )
| ! [X22] :
( ~ rr(X9,X22)
| ~ cp1(X22) )
| ! [X23] :
( ~ rr(X9,X23)
| ~ cp4(X23) )
| ( rr(X9,esk8_1(X9))
& rr(X9,esk9_1(X9))
& rr(X9,esk10_1(X9))
& rr(X9,esk11_1(X9))
& esk8_1(X9) != esk9_1(X9)
& esk8_1(X9) != esk10_1(X9)
& esk8_1(X9) != esk11_1(X9)
& esk9_1(X9) != esk10_1(X9)
& esk9_1(X9) != esk11_1(X9)
& esk10_1(X9) != esk11_1(X9) )
| ! [X28] :
( ~ rr(X9,X28)
| ~ cp2(X28) )
| ! [X29] :
( ~ rr(X9,X29)
| ~ cp3(X29) )
| ! [X30] :
( ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30) )
| ! [X31] :
( ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31) )
| cUnsatisfiable(X9) ) ),
inference(skolemize,[status(esa)],[45]) ).
fof(47,plain,
! [X9,X13,X14,X15,X16,X21,X22,X23,X28,X29,X30,X31] :
( ( ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ( rr(X9,esk8_1(X9))
& rr(X9,esk9_1(X9))
& rr(X9,esk10_1(X9))
& rr(X9,esk11_1(X9))
& esk8_1(X9) != esk9_1(X9)
& esk8_1(X9) != esk10_1(X9)
& esk8_1(X9) != esk11_1(X9)
& esk9_1(X9) != esk10_1(X9)
& esk9_1(X9) != esk11_1(X9)
& esk10_1(X9) != esk11_1(X9) )
| cUnsatisfiable(X9) )
& ( ( ( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| ~ rr(X9,X16)
| X13 = X14
| X13 = X15
| X13 = X16
| X14 = X15
| X14 = X16
| X15 = X16 )
& rr(X9,esk1_1(X9))
& cp(esk1_1(X9))
& cp1(esk1_1(X9))
& rr(X9,esk2_1(X9))
& cp1(esk2_1(X9))
& rr(X9,esk3_1(X9))
& cp4(esk3_1(X9))
& rr(X9,esk4_1(X9))
& cp2(esk4_1(X9))
& rr(X9,esk5_1(X9))
& cp3(esk5_1(X9))
& rr(X9,esk6_1(X9))
& cp(esk6_1(X9))
& cp3(esk6_1(X9))
& rr(X9,esk7_1(X9))
& cp2(esk7_1(X9))
& cp(esk7_1(X9)) )
| ~ cUnsatisfiable(X9) ) ),
inference(shift_quantors,[status(thm)],[46]) ).
fof(48,plain,
! [X9,X13,X14,X15,X16,X21,X22,X23,X28,X29,X30,X31] :
( ( rr(X9,esk8_1(X9))
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( rr(X9,esk9_1(X9))
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( rr(X9,esk10_1(X9))
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( rr(X9,esk11_1(X9))
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( esk8_1(X9) != esk9_1(X9)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( esk8_1(X9) != esk10_1(X9)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( esk8_1(X9) != esk11_1(X9)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( esk9_1(X9) != esk10_1(X9)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( esk9_1(X9) != esk11_1(X9)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( esk10_1(X9) != esk11_1(X9)
| ~ rr(X9,X23)
| ~ cp4(X23)
| ~ rr(X9,X22)
| ~ cp1(X22)
| ~ rr(X9,X21)
| ~ cp(X21)
| ~ cp1(X21)
| ~ rr(X9,X28)
| ~ cp2(X28)
| ~ rr(X9,X29)
| ~ cp3(X29)
| ~ rr(X9,X30)
| ~ cp(X30)
| ~ cp3(X30)
| ~ rr(X9,X31)
| ~ cp2(X31)
| ~ cp(X31)
| cUnsatisfiable(X9) )
& ( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| ~ rr(X9,X16)
| X13 = X14
| X13 = X15
| X13 = X16
| X14 = X15
| X14 = X16
| X15 = X16
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp(esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp1(esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp1(esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk3_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp4(esk3_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk4_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp2(esk4_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk5_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp3(esk5_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk6_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp(esk6_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp3(esk6_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk7_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp2(esk7_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp(esk7_1(X9))
| ~ cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[47]) ).
cnf(55,plain,
( cp3(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(56,plain,
( rr(X1,esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(57,plain,
( cp2(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(58,plain,
( rr(X1,esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(59,plain,
( cp4(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(60,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(63,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(65,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(66,plain,
( X2 = X3
| X4 = X3
| X4 = X2
| X5 = X3
| X5 = X2
| X5 = X4
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X1,X4)
| ~ rr(X1,X5) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(77,plain,
! [X3] :
( ~ cp1(X3)
| ( ~ cp2(X3)
& ~ cp4(X3)
& ~ cp5(X3)
& ~ cp3(X3) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(78,plain,
! [X4] :
( ~ cp1(X4)
| ( ~ cp2(X4)
& ~ cp4(X4)
& ~ cp5(X4)
& ~ cp3(X4) ) ),
inference(variable_rename,[status(thm)],[77]) ).
fof(79,plain,
! [X4] :
( ( ~ cp2(X4)
| ~ cp1(X4) )
& ( ~ cp4(X4)
| ~ cp1(X4) )
& ( ~ cp5(X4)
| ~ cp1(X4) )
& ( ~ cp3(X4)
| ~ cp1(X4) ) ),
inference(distribute,[status(thm)],[78]) ).
cnf(80,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(82,plain,
( ~ cp1(X1)
| ~ cp4(X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(83,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[79]) ).
fof(97,plain,
! [X3] :
( ~ cp2(X3)
| ( ~ cp4(X3)
& ~ cp5(X3)
& ~ cp3(X3) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(98,plain,
! [X4] :
( ~ cp2(X4)
| ( ~ cp4(X4)
& ~ cp5(X4)
& ~ cp3(X4) ) ),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,plain,
! [X4] :
( ( ~ cp4(X4)
| ~ cp2(X4) )
& ( ~ cp5(X4)
| ~ cp2(X4) )
& ( ~ cp3(X4)
| ~ cp2(X4) ) ),
inference(distribute,[status(thm)],[98]) ).
cnf(100,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[99]) ).
cnf(102,plain,
( ~ cp2(X1)
| ~ cp4(X1) ),
inference(split_conjunct,[status(thm)],[99]) ).
fof(103,plain,
! [X3] :
( ~ cp3(X3)
| ( ~ cp4(X3)
& ~ cp5(X3) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(104,plain,
! [X4] :
( ~ cp3(X4)
| ( ~ cp4(X4)
& ~ cp5(X4) ) ),
inference(variable_rename,[status(thm)],[103]) ).
fof(105,plain,
! [X4] :
( ( ~ cp4(X4)
| ~ cp3(X4) )
& ( ~ cp5(X4)
| ~ cp3(X4) ) ),
inference(distribute,[status(thm)],[104]) ).
cnf(107,plain,
( ~ cp3(X1)
| ~ cp4(X1) ),
inference(split_conjunct,[status(thm)],[105]) ).
cnf(126,plain,
( ~ cp2(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[102,59,theory(equality)]) ).
cnf(127,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[82,59,theory(equality)]) ).
cnf(128,plain,
( ~ cp3(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[107,59,theory(equality)]) ).
cnf(130,plain,
( ~ cp2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[83,63,theory(equality)]) ).
cnf(132,plain,
( ~ cp2(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[100,55,theory(equality)]) ).
cnf(133,plain,
( ~ cp1(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[80,55,theory(equality)]) ).
cnf(136,plain,
( X1 = X2
| X1 = X3
| X1 = esk1_1(X4)
| X2 = X3
| X2 = esk1_1(X4)
| X3 = esk1_1(X4)
| ~ rr(X4,X3)
| ~ rr(X4,X2)
| ~ rr(X4,X1)
| ~ cUnsatisfiable(X4) ),
inference(spm,[status(thm)],[66,65,theory(equality)]) ).
cnf(214,plain,
( esk3_1(X1) = esk1_1(X1)
| X2 = esk1_1(X1)
| X3 = esk1_1(X1)
| X2 = esk3_1(X1)
| X3 = esk3_1(X1)
| X3 = X2
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[136,60,theory(equality)]) ).
cnf(442,plain,
( esk3_1(X1) = esk1_1(X1)
| X2 = esk3_1(X1)
| esk4_1(X1) = esk3_1(X1)
| X2 = esk1_1(X1)
| esk4_1(X1) = esk1_1(X1)
| X2 = esk4_1(X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[214,58,theory(equality)]) ).
cnf(546,plain,
( esk4_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk1_1(X1)
| esk5_1(X1) = esk4_1(X1)
| esk5_1(X1) = esk1_1(X1)
| esk5_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[442,56,theory(equality)]) ).
cnf(557,plain,
( esk5_1(X1) = esk3_1(X1)
| esk5_1(X1) = esk1_1(X1)
| esk3_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk4_1(X1) = esk1_1(X1)
| ~ cp2(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[132,546,theory(equality)]) ).
cnf(560,plain,
( esk5_1(X1) = esk3_1(X1)
| esk5_1(X1) = esk1_1(X1)
| esk3_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk4_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[557,57]) ).
cnf(562,plain,
( cp3(esk3_1(X1))
| esk4_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk1_1(X1)
| esk5_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[55,560,theory(equality)]) ).
cnf(567,plain,
( esk5_1(X1) = esk1_1(X1)
| esk3_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk4_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[562,128]) ).
cnf(571,plain,
( esk3_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk4_1(X1) = esk1_1(X1)
| ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[133,567,theory(equality)]) ).
cnf(577,plain,
( esk3_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk3_1(X1)
| esk4_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[571,63]) ).
cnf(579,plain,
( cp2(esk3_1(X1))
| esk4_1(X1) = esk1_1(X1)
| esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[57,577,theory(equality)]) ).
cnf(586,plain,
( esk3_1(X1) = esk1_1(X1)
| esk4_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[579,126]) ).
cnf(587,plain,
( cp2(esk1_1(X1))
| esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[57,586,theory(equality)]) ).
cnf(589,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[587,130]) ).
cnf(593,plain,
( ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[127,589,theory(equality)]) ).
cnf(609,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[593,63]) ).
cnf(610,plain,
$false,
inference(sr,[status(thm)],[28,609,theory(equality)]) ).
cnf(611,plain,
$false,
610,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS080+1.p
% --creating new selector for []
% -running prover on /tmp/tmpYTpLrE/sel_KRS080+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS080+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS080+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS080+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
%
%------------------------------------------------------------------------------