TSTP Solution File: LCL636+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL636+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 18:35:17 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 622 ( 0 equ)
% Maximal formula atoms : 114 ( 28 avg)
% Number of connectives : 1039 ( 439 ~; 369 |; 231 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 106 ( 0 sgn 92 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ p2(X2)
& ~ p102(X2)
& p101(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ~ p102(X2)
& p101(X2) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2) )
| p2(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ p101(X2) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2) )
| p1(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ p100(X2) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) )
& ~ p101(X1)
& p100(X1) ) ),
file('/tmp/tmp1WGW8r/sel_LCL636+1.001.p_1',main) ).
fof(2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ p2(X2)
& ~ p102(X2)
& p101(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ~ p102(X2)
& p101(X2) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2) )
| p2(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ p101(X2) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2) )
| p1(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ p100(X2) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) )
& ~ p101(X1)
& p100(X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ p2(X2)
& ~ p102(X2)
& p101(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ~ p102(X2)
& p101(X2) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2) )
| p2(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ p101(X2) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2) )
| p1(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ p100(X2) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) )
& ~ p101(X1)
& p100(X1) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ? [X1] :
( r1(X2,X1)
& ~ p2(X1)
& ~ p102(X1)
& p101(X1) )
& ? [X1] :
( r1(X2,X1)
& p2(X1)
& ~ p102(X1)
& p101(X1) ) )
| p101(X2)
| ~ p100(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ( ( ? [X2] :
( r1(X1,X2)
& ~ p2(X2)
& ~ p102(X2)
& p101(X2) )
& ? [X2] :
( r1(X1,X2)
& p2(X2)
& ~ p102(X2)
& p101(X2) ) )
| p101(X1)
| ~ p100(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2) )
| p2(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ p101(X2) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2) )
| p1(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ p100(X2) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) )
& ~ p101(X1)
& p100(X1) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
? [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| p2(X4) )
& ! [X5] :
( ~ r1(X3,X5)
| ( ( ( ? [X6] :
( r1(X5,X6)
& ~ p2(X6)
& ~ p102(X6)
& p101(X6) )
& ? [X7] :
( r1(X5,X7)
& p2(X7)
& ~ p102(X7)
& p101(X7) ) )
| p101(X5)
| ~ p100(X5) )
& ( ( ( ! [X8] :
( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8) )
| p2(X5) )
& ( ! [X9] :
( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9) )
| ~ p2(X5) ) )
| ~ p101(X5) )
& ( ( ( ! [X10] :
( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10) )
| p1(X5) )
& ( ! [X11] :
( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11) )
| ~ p1(X5) ) )
| ~ p100(X5) )
& ( p101(X5)
| ~ p102(X5) )
& ( p100(X5)
| ~ p101(X5) ) ) )
& ( ( ? [X12] :
( r1(X3,X12)
& ~ p2(X12)
& ~ p102(X12)
& p101(X12) )
& ? [X13] :
( r1(X3,X13)
& p2(X13)
& ~ p102(X13)
& p101(X13) ) )
| p101(X3)
| ~ p100(X3) )
& ( ( ( ! [X14] :
( ~ r1(X3,X14)
| ~ p2(X14)
| ~ p101(X14) )
| p2(X3) )
& ( ! [X15] :
( ~ r1(X3,X15)
| p2(X15)
| ~ p101(X15) )
| ~ p2(X3) ) )
| ~ p101(X3) )
& ( ( ( ! [X16] :
( ~ r1(X3,X16)
| ~ p1(X16)
| ~ p100(X16) )
| p1(X3) )
& ( ! [X17] :
( ~ r1(X3,X17)
| p1(X17)
| ~ p100(X17) )
| ~ p1(X3) ) )
| ~ p100(X3) )
& ( p101(X3)
| ~ p102(X3) )
& ( p100(X3)
| ~ p101(X3) )
& ~ p101(X3)
& p100(X3) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X4] :
( ~ r1(esk1_0,X4)
| p2(X4) )
& ! [X5] :
( ~ r1(esk1_0,X5)
| ( ( ( r1(X5,esk2_1(X5))
& ~ p2(esk2_1(X5))
& ~ p102(esk2_1(X5))
& p101(esk2_1(X5))
& r1(X5,esk3_1(X5))
& p2(esk3_1(X5))
& ~ p102(esk3_1(X5))
& p101(esk3_1(X5)) )
| p101(X5)
| ~ p100(X5) )
& ( ( ( ! [X8] :
( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8) )
| p2(X5) )
& ( ! [X9] :
( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9) )
| ~ p2(X5) ) )
| ~ p101(X5) )
& ( ( ( ! [X10] :
( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10) )
| p1(X5) )
& ( ! [X11] :
( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11) )
| ~ p1(X5) ) )
| ~ p100(X5) )
& ( p101(X5)
| ~ p102(X5) )
& ( p100(X5)
| ~ p101(X5) ) ) )
& ( ( r1(esk1_0,esk4_0)
& ~ p2(esk4_0)
& ~ p102(esk4_0)
& p101(esk4_0)
& r1(esk1_0,esk5_0)
& p2(esk5_0)
& ~ p102(esk5_0)
& p101(esk5_0) )
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ( ( ! [X14] :
( ~ r1(esk1_0,X14)
| ~ p2(X14)
| ~ p101(X14) )
| p2(esk1_0) )
& ( ! [X15] :
( ~ r1(esk1_0,X15)
| p2(X15)
| ~ p101(X15) )
| ~ p2(esk1_0) ) )
| ~ p101(esk1_0) )
& ( ( ( ! [X16] :
( ~ r1(esk1_0,X16)
| ~ p1(X16)
| ~ p100(X16) )
| p1(esk1_0) )
& ( ! [X17] :
( ~ r1(esk1_0,X17)
| p1(X17)
| ~ p100(X17) )
| ~ p1(esk1_0) ) )
| ~ p100(esk1_0) )
& ( p101(esk1_0)
| ~ p102(esk1_0) )
& ( p100(esk1_0)
| ~ p101(esk1_0) )
& ~ p101(esk1_0)
& p100(esk1_0) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X4,X5,X8,X9,X10,X11,X14,X15,X16,X17] :
( ( ( ( ~ r1(esk1_0,X17)
| p1(X17)
| ~ p100(X17)
| ~ p1(esk1_0) )
& ( ~ r1(esk1_0,X16)
| ~ p1(X16)
| ~ p100(X16)
| p1(esk1_0) ) )
| ~ p100(esk1_0) )
& ( ( ( ~ r1(esk1_0,X15)
| p2(X15)
| ~ p101(X15)
| ~ p2(esk1_0) )
& ( ~ r1(esk1_0,X14)
| ~ p2(X14)
| ~ p101(X14)
| p2(esk1_0) ) )
| ~ p101(esk1_0) )
& ( ( ( ( ( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11)
| ~ p1(X5) )
& ( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10)
| p1(X5) ) )
| ~ p100(X5) )
& ( ( ( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9)
| ~ p2(X5) )
& ( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8)
| p2(X5) ) )
| ~ p101(X5) )
& ( ( r1(X5,esk2_1(X5))
& ~ p2(esk2_1(X5))
& ~ p102(esk2_1(X5))
& p101(esk2_1(X5))
& r1(X5,esk3_1(X5))
& p2(esk3_1(X5))
& ~ p102(esk3_1(X5))
& p101(esk3_1(X5)) )
| p101(X5)
| ~ p100(X5) )
& ( p101(X5)
| ~ p102(X5) )
& ( p100(X5)
| ~ p101(X5) ) )
| ~ r1(esk1_0,X5) )
& ( ( r1(esk1_0,esk4_0)
& ~ p2(esk4_0)
& ~ p102(esk4_0)
& p101(esk4_0)
& r1(esk1_0,esk5_0)
& p2(esk5_0)
& ~ p102(esk5_0)
& p101(esk5_0) )
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk1_0)
| ~ p102(esk1_0) )
& ( p100(esk1_0)
| ~ p101(esk1_0) )
& ~ p101(esk1_0)
& p100(esk1_0)
& ( ~ r1(esk1_0,X4)
| p2(X4) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
fof(8,negated_conjecture,
! [X4,X5,X8,X9,X10,X11,X14,X15,X16,X17] :
( ( ~ r1(esk1_0,X17)
| p1(X17)
| ~ p100(X17)
| ~ p1(esk1_0)
| ~ p100(esk1_0) )
& ( ~ r1(esk1_0,X16)
| ~ p1(X16)
| ~ p100(X16)
| p1(esk1_0)
| ~ p100(esk1_0) )
& ( ~ r1(esk1_0,X15)
| p2(X15)
| ~ p101(X15)
| ~ p2(esk1_0)
| ~ p101(esk1_0) )
& ( ~ r1(esk1_0,X14)
| ~ p2(X14)
| ~ p101(X14)
| p2(esk1_0)
| ~ p101(esk1_0) )
& ( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11)
| ~ p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10)
| p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9)
| ~ p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8)
| p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( r1(X5,esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p2(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( r1(X5,esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p2(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(X5)
| ~ p102(X5)
| ~ r1(esk1_0,X5) )
& ( p100(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( r1(esk1_0,esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ p2(esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ p102(esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( r1(esk1_0,esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p2(esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ p102(esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk1_0)
| ~ p102(esk1_0) )
& ( p100(esk1_0)
| ~ p101(esk1_0) )
& ~ p101(esk1_0)
& p100(esk1_0)
& ( ~ r1(esk1_0,X4)
| p2(X4) ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(10,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(11,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(20,negated_conjecture,
( p101(esk1_0)
| ~ p100(esk1_0)
| ~ p2(esk4_0) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(21,negated_conjecture,
( p101(esk1_0)
| r1(esk1_0,esk4_0)
| ~ p100(esk1_0) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(51,negated_conjecture,
( p101(esk1_0)
| ~ p2(esk4_0)
| $false ),
inference(rw,[status(thm)],[20,10,theory(equality)]) ).
cnf(52,negated_conjecture,
( p101(esk1_0)
| ~ p2(esk4_0) ),
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(53,negated_conjecture,
~ p2(esk4_0),
inference(sr,[status(thm)],[52,11,theory(equality)]) ).
cnf(60,negated_conjecture,
( p101(esk1_0)
| r1(esk1_0,esk4_0)
| $false ),
inference(rw,[status(thm)],[21,10,theory(equality)]) ).
cnf(61,negated_conjecture,
( p101(esk1_0)
| r1(esk1_0,esk4_0) ),
inference(cn,[status(thm)],[60,theory(equality)]) ).
cnf(62,negated_conjecture,
r1(esk1_0,esk4_0),
inference(sr,[status(thm)],[61,11,theory(equality)]) ).
cnf(63,negated_conjecture,
p2(esk4_0),
inference(spm,[status(thm)],[9,62,theory(equality)]) ).
cnf(64,negated_conjecture,
$false,
inference(sr,[status(thm)],[63,53,theory(equality)]) ).
cnf(65,negated_conjecture,
$false,
64,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL636+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmp1WGW8r/sel_LCL636+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL636+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL636+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL636+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
%
%------------------------------------------------------------------------------