TSTP Solution File: LCL650+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL650+1.001 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 19:09:13 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 51 ( 10 unt; 0 def)
% Number of atoms : 501 ( 0 equ)
% Maximal formula atoms : 64 ( 9 avg)
% Number of connectives : 810 ( 360 ~; 309 |; 141 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 192 ( 0 sgn 105 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(X1)
& p1(X1) ) ) ) ) ) ),
file('/tmp/tmpCcj_3_/sel_LCL650+1.001.p_1',main) ).
fof(2,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(X1)
& p1(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(X1)
& p1(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
? [X1] :
( ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ( p8(X1)
| p6(X1)
| p4(X1)
| p2(X1) ) ) ) ) )
& ? [X2] :
( r1(X1,X2)
& ~ p5(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| ( ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ( p3(X1)
| p1(X1) )
& ( ~ p1(X1)
| ~ p3(X1) ) ) ) ) )
& ? [X1] :
( r1(X2,X1)
& ~ p4(X1) )
& ! [X1] :
( ~ r1(X2,X1)
| ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ( p2(X1)
| p3(X1) )
& ( ~ p3(X1)
| ~ p2(X1) ) ) ) )
& ? [X2] :
( r1(X1,X2)
& ~ p3(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ( p1(X1)
| p2(X1) )
& ( ~ p2(X1)
| ~ p1(X1) ) ) ) ) ) ) ) )
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ( ~ p4(X1)
| ~ p3(X1)
| ~ p2(X1)
| ~ p1(X1) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
? [X3] :
( ? [X4] :
( r1(X3,X4)
& ? [X5] :
( r1(X4,X5)
& ? [X6] :
( r1(X5,X6)
& ? [X7] :
( r1(X6,X7)
& ( p8(X7)
| p6(X7)
| p4(X7)
| p2(X7) ) ) ) ) )
& ? [X8] :
( r1(X3,X8)
& ~ p5(X8) )
& ! [X9] :
( ~ r1(X3,X9)
| ( ! [X10] :
( ~ r1(X9,X10)
| ! [X11] :
( ~ r1(X10,X11)
| ! [X12] :
( ~ r1(X11,X12)
| ( ( p3(X12)
| p1(X12) )
& ( ~ p1(X12)
| ~ p3(X12) ) ) ) ) )
& ? [X13] :
( r1(X9,X13)
& ~ p4(X13) )
& ! [X14] :
( ~ r1(X9,X14)
| ( ! [X15] :
( ~ r1(X14,X15)
| ! [X16] :
( ~ r1(X15,X16)
| ( ( p2(X16)
| p3(X16) )
& ( ~ p3(X16)
| ~ p2(X16) ) ) ) )
& ? [X17] :
( r1(X14,X17)
& ~ p3(X17) )
& ! [X18] :
( ~ r1(X14,X18)
| ! [X19] :
( ~ r1(X18,X19)
| ( ( p1(X19)
| p2(X19) )
& ( ~ p2(X19)
| ~ p1(X19) ) ) ) ) ) ) ) )
& ? [X20] :
( r1(X3,X20)
& ? [X21] :
( r1(X20,X21)
& ? [X22] :
( r1(X21,X22)
& ? [X23] :
( r1(X22,X23)
& ( ~ p4(X23)
| ~ p3(X23)
| ~ p2(X23)
| ~ p1(X23) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& r1(esk3_0,esk4_0)
& r1(esk4_0,esk5_0)
& ( p8(esk5_0)
| p6(esk5_0)
| p4(esk5_0)
| p2(esk5_0) )
& r1(esk1_0,esk6_0)
& ~ p5(esk6_0)
& ! [X9] :
( ~ r1(esk1_0,X9)
| ( ! [X10] :
( ~ r1(X9,X10)
| ! [X11] :
( ~ r1(X10,X11)
| ! [X12] :
( ~ r1(X11,X12)
| ( ( p3(X12)
| p1(X12) )
& ( ~ p1(X12)
| ~ p3(X12) ) ) ) ) )
& r1(X9,esk7_1(X9))
& ~ p4(esk7_1(X9))
& ! [X14] :
( ~ r1(X9,X14)
| ( ! [X15] :
( ~ r1(X14,X15)
| ! [X16] :
( ~ r1(X15,X16)
| ( ( p2(X16)
| p3(X16) )
& ( ~ p3(X16)
| ~ p2(X16) ) ) ) )
& r1(X14,esk8_2(X9,X14))
& ~ p3(esk8_2(X9,X14))
& ! [X18] :
( ~ r1(X14,X18)
| ! [X19] :
( ~ r1(X18,X19)
| ( ( p1(X19)
| p2(X19) )
& ( ~ p2(X19)
| ~ p1(X19) ) ) ) ) ) ) ) )
& r1(esk1_0,esk9_0)
& r1(esk9_0,esk10_0)
& r1(esk10_0,esk11_0)
& r1(esk11_0,esk12_0)
& ( ~ p4(esk12_0)
| ~ p3(esk12_0)
| ~ p2(esk12_0)
| ~ p1(esk12_0) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X9,X10,X11,X12,X14,X15,X16,X18,X19] :
( ( ( ( ( ( ~ r1(X18,X19)
| ( ( p1(X19)
| p2(X19) )
& ( ~ p2(X19)
| ~ p1(X19) ) )
| ~ r1(X14,X18) )
& ( ~ r1(X15,X16)
| ( ( p2(X16)
| p3(X16) )
& ( ~ p3(X16)
| ~ p2(X16) ) )
| ~ r1(X14,X15) )
& r1(X14,esk8_2(X9,X14))
& ~ p3(esk8_2(X9,X14)) )
| ~ r1(X9,X14) )
& ( ~ r1(X11,X12)
| ( ( p3(X12)
| p1(X12) )
& ( ~ p1(X12)
| ~ p3(X12) ) )
| ~ r1(X10,X11)
| ~ r1(X9,X10) )
& r1(X9,esk7_1(X9))
& ~ p4(esk7_1(X9)) )
| ~ r1(esk1_0,X9) )
& r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& r1(esk3_0,esk4_0)
& r1(esk4_0,esk5_0)
& ( p8(esk5_0)
| p6(esk5_0)
| p4(esk5_0)
| p2(esk5_0) )
& r1(esk1_0,esk6_0)
& ~ p5(esk6_0)
& r1(esk1_0,esk9_0)
& r1(esk9_0,esk10_0)
& r1(esk10_0,esk11_0)
& r1(esk11_0,esk12_0)
& ( ~ p4(esk12_0)
| ~ p3(esk12_0)
| ~ p2(esk12_0)
| ~ p1(esk12_0) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
fof(8,negated_conjecture,
! [X9,X10,X11,X12,X14,X15,X16,X18,X19] :
( ( p1(X19)
| p2(X19)
| ~ r1(X18,X19)
| ~ r1(X14,X18)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( ~ p2(X19)
| ~ p1(X19)
| ~ r1(X18,X19)
| ~ r1(X14,X18)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( p2(X16)
| p3(X16)
| ~ r1(X15,X16)
| ~ r1(X14,X15)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( ~ p3(X16)
| ~ p2(X16)
| ~ r1(X15,X16)
| ~ r1(X14,X15)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( r1(X14,esk8_2(X9,X14))
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( ~ p3(esk8_2(X9,X14))
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( p3(X12)
| p1(X12)
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(X9,X10)
| ~ r1(esk1_0,X9) )
& ( ~ p1(X12)
| ~ p3(X12)
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(X9,X10)
| ~ r1(esk1_0,X9) )
& ( r1(X9,esk7_1(X9))
| ~ r1(esk1_0,X9) )
& ( ~ p4(esk7_1(X9))
| ~ r1(esk1_0,X9) )
& r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& r1(esk3_0,esk4_0)
& r1(esk4_0,esk5_0)
& ( p8(esk5_0)
| p6(esk5_0)
| p4(esk5_0)
| p2(esk5_0) )
& r1(esk1_0,esk6_0)
& ~ p5(esk6_0)
& r1(esk1_0,esk9_0)
& r1(esk9_0,esk10_0)
& r1(esk10_0,esk11_0)
& r1(esk11_0,esk12_0)
& ( ~ p4(esk12_0)
| ~ p3(esk12_0)
| ~ p2(esk12_0)
| ~ p1(esk12_0) ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(17,negated_conjecture,
r1(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(18,negated_conjecture,
r1(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(19,negated_conjecture,
r1(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(20,negated_conjecture,
r1(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(23,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ p3(X4)
| ~ p1(X4) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(24,negated_conjecture,
( p1(X4)
| p3(X4)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(27,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ p2(X4)
| ~ p3(X4) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(28,negated_conjecture,
( p3(X4)
| p2(X4)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(29,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ p1(X4)
| ~ p2(X4) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(30,negated_conjecture,
( p2(X4)
| p1(X4)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(32,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ r1(esk2_0,X3) ),
inference(spm,[status(thm)],[27,20,theory(equality)]) ).
cnf(33,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ r1(esk2_0,X3) ),
inference(spm,[status(thm)],[29,20,theory(equality)]) ).
cnf(34,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ r1(esk2_0,X3) ),
inference(spm,[status(thm)],[23,20,theory(equality)]) ).
cnf(49,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ r1(esk2_0,X3) ),
inference(spm,[status(thm)],[28,20,theory(equality)]) ).
cnf(52,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ r1(esk2_0,X3) ),
inference(spm,[status(thm)],[30,20,theory(equality)]) ).
cnf(55,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ r1(esk2_0,X3) ),
inference(spm,[status(thm)],[24,20,theory(equality)]) ).
cnf(62,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk3_0,X2) ),
inference(spm,[status(thm)],[32,19,theory(equality)]) ).
cnf(64,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[62,18,theory(equality)]) ).
cnf(65,negated_conjecture,
( ~ p3(esk5_0)
| ~ p2(esk5_0) ),
inference(spm,[status(thm)],[64,17,theory(equality)]) ).
cnf(70,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk3_0,X2) ),
inference(spm,[status(thm)],[49,19,theory(equality)]) ).
cnf(72,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[70,18,theory(equality)]) ).
cnf(73,negated_conjecture,
( p3(esk5_0)
| p2(esk5_0) ),
inference(spm,[status(thm)],[72,17,theory(equality)]) ).
cnf(84,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk3_0,X2) ),
inference(spm,[status(thm)],[33,19,theory(equality)]) ).
cnf(86,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(X2,X1)
| ~ r1(esk3_0,X2) ),
inference(spm,[status(thm)],[34,19,theory(equality)]) ).
cnf(88,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[84,18,theory(equality)]) ).
cnf(90,negated_conjecture,
( ~ p1(esk5_0)
| ~ p2(esk5_0) ),
inference(spm,[status(thm)],[88,17,theory(equality)]) ).
cnf(91,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[86,18,theory(equality)]) ).
cnf(93,negated_conjecture,
( ~ p1(esk5_0)
| ~ p3(esk5_0) ),
inference(spm,[status(thm)],[91,17,theory(equality)]) ).
cnf(95,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk3_0,X2) ),
inference(spm,[status(thm)],[52,19,theory(equality)]) ).
cnf(97,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[95,18,theory(equality)]) ).
cnf(99,negated_conjecture,
( p1(esk5_0)
| p2(esk5_0) ),
inference(spm,[status(thm)],[97,17,theory(equality)]) ).
cnf(101,negated_conjecture,
( p2(esk5_0)
| ~ p3(esk5_0) ),
inference(spm,[status(thm)],[93,99,theory(equality)]) ).
cnf(102,negated_conjecture,
p2(esk5_0),
inference(csr,[status(thm)],[101,73]) ).
cnf(104,negated_conjecture,
( ~ p1(esk5_0)
| $false ),
inference(rw,[status(thm)],[90,102,theory(equality)]) ).
cnf(105,negated_conjecture,
~ p1(esk5_0),
inference(cn,[status(thm)],[104,theory(equality)]) ).
cnf(107,negated_conjecture,
( ~ p3(esk5_0)
| $false ),
inference(rw,[status(thm)],[65,102,theory(equality)]) ).
cnf(108,negated_conjecture,
~ p3(esk5_0),
inference(cn,[status(thm)],[107,theory(equality)]) ).
cnf(123,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(X2,X1)
| ~ r1(esk3_0,X2) ),
inference(spm,[status(thm)],[55,19,theory(equality)]) ).
cnf(125,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[123,18,theory(equality)]) ).
cnf(127,negated_conjecture,
( p1(esk5_0)
| p3(esk5_0) ),
inference(spm,[status(thm)],[125,17,theory(equality)]) ).
cnf(128,negated_conjecture,
p3(esk5_0),
inference(sr,[status(thm)],[127,105,theory(equality)]) ).
cnf(129,negated_conjecture,
$false,
inference(sr,[status(thm)],[128,108,theory(equality)]) ).
cnf(130,negated_conjecture,
$false,
129,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL650+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpCcj_3_/sel_LCL650+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL650+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL650+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL650+1.001.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------