TSTP Solution File: SWV486+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV486+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 : Sun Dec 26 13:02:57 EST 2010
% Result : Theorem 0.62s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 12
% Syntax : Number of formulae : 108 ( 22 unt; 0 def)
% Number of atoms : 369 ( 85 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 445 ( 184 ~; 188 |; 54 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 191 ( 0 sgn 111 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',int_leq) ).
fof(2,axiom,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ! [X3] :
( ( int_less(int_zero,X3)
& X1 = plus(X2,X3) )
=> ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X2) )
=> a(plus(X4,X3),X4) = qr(plus(X4,X3),X4) ) )
& ! [X3] :
( ( int_less(int_zero,X3)
& X2 = plus(X1,X3) )
=> ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X1) )
=> a(X4,plus(X4,X3)) = real_zero ) ) ) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',qih) ).
fof(3,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X4] :
( plus(X1,X4) = X2
& int_less(int_zero,X4) ) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',plus_and_inverse) ).
fof(4,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',plus_commutative) ).
fof(6,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',plus_zero) ).
fof(7,conjecture,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',lt) ).
fof(8,axiom,
! [X1,X2,X4] :
( ( int_less(X1,X2)
& int_less(X2,X4) )
=> int_less(X1,X4) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',int_less_transitive) ).
fof(9,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',one_successor_of_zero) ).
fof(11,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',int_less_irreflexive) ).
fof(12,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',int_less_total) ).
fof(13,axiom,
! [X5,X6,X7,X8] :
( ( int_less(X5,X6)
& int_leq(X7,X8) )
=> int_leq(plus(X5,X7),plus(X6,X8)) ),
file('/tmp/tmpRaSz-1/sel_SWV486+1.p_1',plus_and_order1) ).
fof(14,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero ),
inference(assume_negation,[status(cth)],[7]) ).
fof(15,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X3] :
( ( int_less(int_zero,X3)
& X1 = plus(X2,X3) )
=> ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X2) )
=> a(plus(X4,X3),X4) = qr(plus(X4,X3),X4) ) )
& ! [X3] :
( ( int_less(int_zero,X3)
& X2 = plus(X1,X3) )
=> ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X1) )
=> a(X4,plus(X4,X3)) = real_zero ) ) ) ),
introduced(definition) ).
fof(16,plain,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> epred1_2(X1,X2) ),
inference(apply_def,[status(esa)],[2,15,theory(equality)]) ).
fof(17,plain,
! [X1,X2] :
( ( ~ int_leq(X1,X2)
| int_less(X1,X2)
| X1 = X2 )
& ( ( ~ int_less(X1,X2)
& X1 != X2 )
| int_leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(18,plain,
! [X3,X4] :
( ( ~ int_leq(X3,X4)
| int_less(X3,X4)
| X3 = X4 )
& ( ( ~ int_less(X3,X4)
& X3 != X4 )
| int_leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[17]) ).
fof(19,plain,
! [X3,X4] :
( ( ~ int_leq(X3,X4)
| int_less(X3,X4)
| X3 = X4 )
& ( ~ int_less(X3,X4)
| int_leq(X3,X4) )
& ( X3 != X4
| int_leq(X3,X4) ) ),
inference(distribute,[status(thm)],[18]) ).
cnf(20,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(22,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(23,plain,
! [X1,X2] :
( ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| epred1_2(X1,X2) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(24,plain,
! [X3,X4] :
( ~ int_leq(int_one,X3)
| ~ int_leq(X3,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,n)
| epred1_2(X3,X4) ),
inference(variable_rename,[status(thm)],[23]) ).
cnf(25,plain,
( epred1_2(X1,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(26,plain,
! [X1,X2] :
( ( ~ int_less(X1,X2)
| ? [X4] :
( plus(X1,X4) = X2
& int_less(int_zero,X4) ) )
& ( ! [X4] :
( plus(X1,X4) != X2
| ~ int_less(int_zero,X4) )
| int_less(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(27,plain,
! [X5,X6] :
( ( ~ int_less(X5,X6)
| ? [X7] :
( plus(X5,X7) = X6
& int_less(int_zero,X7) ) )
& ( ! [X8] :
( plus(X5,X8) != X6
| ~ int_less(int_zero,X8) )
| int_less(X5,X6) ) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,plain,
! [X5,X6] :
( ( ~ int_less(X5,X6)
| ( plus(X5,esk1_2(X5,X6)) = X6
& int_less(int_zero,esk1_2(X5,X6)) ) )
& ( ! [X8] :
( plus(X5,X8) != X6
| ~ int_less(int_zero,X8) )
| int_less(X5,X6) ) ),
inference(skolemize,[status(esa)],[27]) ).
fof(29,plain,
! [X5,X6,X8] :
( ( plus(X5,X8) != X6
| ~ int_less(int_zero,X8)
| int_less(X5,X6) )
& ( ~ int_less(X5,X6)
| ( plus(X5,esk1_2(X5,X6)) = X6
& int_less(int_zero,esk1_2(X5,X6)) ) ) ),
inference(shift_quantors,[status(thm)],[28]) ).
fof(30,plain,
! [X5,X6,X8] :
( ( plus(X5,X8) != X6
| ~ int_less(int_zero,X8)
| int_less(X5,X6) )
& ( plus(X5,esk1_2(X5,X6)) = X6
| ~ int_less(X5,X6) )
& ( int_less(int_zero,esk1_2(X5,X6))
| ~ int_less(X5,X6) ) ),
inference(distribute,[status(thm)],[29]) ).
cnf(31,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(32,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(34,plain,
! [X3,X4] : plus(X3,X4) = plus(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(35,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[34]) ).
fof(37,plain,
! [X2] : plus(X2,int_zero) = X2,
inference(variable_rename,[status(thm)],[6]) ).
cnf(38,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,negated_conjecture,
? [X1,X2] :
( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n)
& a(X1,X2) != real_zero ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(40,negated_conjecture,
? [X3,X4] :
( int_leq(int_one,X3)
& int_less(X3,X4)
& int_leq(X4,n)
& a(X3,X4) != real_zero ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,negated_conjecture,
( int_leq(int_one,esk2_0)
& int_less(esk2_0,esk3_0)
& int_leq(esk3_0,n)
& a(esk2_0,esk3_0) != real_zero ),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
int_leq(esk3_0,n),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,negated_conjecture,
int_less(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(45,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[41]) ).
fof(46,plain,
! [X1,X2,X4] :
( ~ int_less(X1,X2)
| ~ int_less(X2,X4)
| int_less(X1,X4) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(47,plain,
! [X5,X6,X7] :
( ~ int_less(X5,X6)
| ~ int_less(X6,X7)
| int_less(X5,X7) ),
inference(variable_rename,[status(thm)],[46]) ).
cnf(48,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[47]) ).
fof(49,plain,
! [X1] :
( ( ~ int_less(int_zero,X1)
| int_leq(int_one,X1) )
& ( ~ int_leq(int_one,X1)
| int_less(int_zero,X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(50,plain,
! [X2] :
( ( ~ int_less(int_zero,X2)
| int_leq(int_one,X2) )
& ( ~ int_leq(int_one,X2)
| int_less(int_zero,X2) ) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(52,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(54,plain,
! [X1,X2] :
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(55,plain,
! [X3,X4] :
( ~ int_less(X3,X4)
| X3 != X4 ),
inference(variable_rename,[status(thm)],[54]) ).
cnf(56,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[55]) ).
fof(57,plain,
! [X3,X4] :
( int_less(X3,X4)
| int_leq(X4,X3) ),
inference(variable_rename,[status(thm)],[12]) ).
cnf(58,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(59,plain,
! [X5,X6,X7,X8] :
( ~ int_less(X5,X6)
| ~ int_leq(X7,X8)
| int_leq(plus(X5,X7),plus(X6,X8)) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(60,plain,
! [X9,X10,X11,X12] :
( ~ int_less(X9,X10)
| ~ int_leq(X11,X12)
| int_leq(plus(X9,X11),plus(X10,X12)) ),
inference(variable_rename,[status(thm)],[59]) ).
cnf(61,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_leq(X2,X4)
| ~ int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(62,plain,
! [X2,X1] :
( ~ epred1_2(X1,X2)
| ( ! [X3] :
( ~ int_less(int_zero,X3)
| X1 != plus(X2,X3)
| ! [X4] :
( ~ int_leq(int_one,X4)
| ~ int_leq(X4,X2)
| a(plus(X4,X3),X4) = qr(plus(X4,X3),X4) ) )
& ! [X3] :
( ~ int_less(int_zero,X3)
| X2 != plus(X1,X3)
| ! [X4] :
( ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1)
| a(X4,plus(X4,X3)) = real_zero ) ) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(63,plain,
! [X5,X6] :
( ~ epred1_2(X6,X5)
| ( ! [X7] :
( ~ int_less(int_zero,X7)
| X6 != plus(X5,X7)
| ! [X8] :
( ~ int_leq(int_one,X8)
| ~ int_leq(X8,X5)
| a(plus(X8,X7),X8) = qr(plus(X8,X7),X8) ) )
& ! [X9] :
( ~ int_less(int_zero,X9)
| X5 != plus(X6,X9)
| ! [X10] :
( ~ int_leq(int_one,X10)
| ~ int_leq(X10,X6)
| a(X10,plus(X10,X9)) = real_zero ) ) ) ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,plain,
! [X5,X6,X7,X8,X9,X10] :
( ( ( ~ int_leq(int_one,X10)
| ~ int_leq(X10,X6)
| a(X10,plus(X10,X9)) = real_zero
| ~ int_less(int_zero,X9)
| X5 != plus(X6,X9) )
& ( ~ int_leq(int_one,X8)
| ~ int_leq(X8,X5)
| a(plus(X8,X7),X8) = qr(plus(X8,X7),X8)
| ~ int_less(int_zero,X7)
| X6 != plus(X5,X7) ) )
| ~ epred1_2(X6,X5) ),
inference(shift_quantors,[status(thm)],[63]) ).
fof(65,plain,
! [X5,X6,X7,X8,X9,X10] :
( ( ~ int_leq(int_one,X10)
| ~ int_leq(X10,X6)
| a(X10,plus(X10,X9)) = real_zero
| ~ int_less(int_zero,X9)
| X5 != plus(X6,X9)
| ~ epred1_2(X6,X5) )
& ( ~ int_leq(int_one,X8)
| ~ int_leq(X8,X5)
| a(plus(X8,X7),X8) = qr(plus(X8,X7),X8)
| ~ int_less(int_zero,X7)
| X6 != plus(X5,X7)
| ~ epred1_2(X6,X5) ) ),
inference(distribute,[status(thm)],[64]) ).
cnf(67,plain,
( a(X4,plus(X4,X3)) = real_zero
| ~ epred1_2(X1,X2)
| X2 != plus(X1,X3)
| ~ int_less(int_zero,X3)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(70,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[20,theory(equality)]) ).
cnf(71,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[56,theory(equality)]) ).
cnf(75,negated_conjecture,
( esk3_0 = n
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[22,43,theory(equality)]) ).
cnf(77,plain,
( X1 = X2
| int_less(X1,X2)
| int_less(X2,X1) ),
inference(spm,[status(thm)],[22,58,theory(equality)]) ).
cnf(79,negated_conjecture,
( int_less(X1,esk3_0)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[48,44,theory(equality)]) ).
cnf(82,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[38,35,theory(equality)]) ).
cnf(94,plain,
( int_leq(plus(X1,X2),plus(X4,X3))
| ~ int_less(X1,X3)
| ~ int_leq(X2,X4) ),
inference(spm,[status(thm)],[61,35,theory(equality)]) ).
cnf(104,plain,
( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
| X3 != X4
| ~ epred1_2(X2,X4)
| ~ int_less(int_zero,esk1_2(X2,X3))
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(X2,X3) ),
inference(spm,[status(thm)],[67,32,theory(equality)]) ).
cnf(107,plain,
( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
| ~ epred1_2(X2,X3)
| ~ int_less(int_zero,esk1_2(X2,X3))
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(X2,X3) ),
inference(er,[status(thm)],[104,theory(equality)]) ).
cnf(121,negated_conjecture,
( int_less(X1,n)
| n = esk3_0
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[48,75,theory(equality)]) ).
cnf(126,negated_conjecture,
~ int_less(esk3_0,esk2_0),
inference(spm,[status(thm)],[71,79,theory(equality)]) ).
cnf(175,plain,
( int_less(X1,X2)
| X2 = X3
| int_less(X2,X3)
| ~ int_less(X1,X3) ),
inference(spm,[status(thm)],[48,77,theory(equality)]) ).
cnf(205,negated_conjecture,
( n = esk3_0
| ~ int_less(n,esk3_0) ),
inference(spm,[status(thm)],[71,121,theory(equality)]) ).
cnf(341,plain,
( int_leq(plus(X1,X2),X4)
| ~ int_less(X1,esk1_2(X3,X4))
| ~ int_leq(X2,X3)
| ~ int_less(X3,X4) ),
inference(spm,[status(thm)],[94,32,theory(equality)]) ).
cnf(659,plain,
( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
| ~ epred1_2(X2,X3)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[107,31]) ).
cnf(663,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1) ),
inference(spm,[status(thm)],[659,32,theory(equality)]) ).
cnf(665,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1)
| $false ),
inference(rw,[status(thm)],[663,70,theory(equality)]) ).
cnf(666,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[665,theory(equality)]) ).
cnf(1145,negated_conjecture,
( X1 = esk3_0
| int_less(X1,esk3_0)
| int_less(esk2_0,X1) ),
inference(spm,[status(thm)],[175,44,theory(equality)]) ).
cnf(1225,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[205,1145,theory(equality)]) ).
cnf(3388,plain,
( int_leq(plus(int_zero,X1),X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(spm,[status(thm)],[341,31,theory(equality)]) ).
cnf(3397,plain,
( int_leq(X1,X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(rw,[status(thm)],[3388,82,theory(equality)]) ).
cnf(3406,negated_conjecture,
( int_leq(X1,esk3_0)
| ~ int_leq(X1,esk2_0) ),
inference(spm,[status(thm)],[3397,44,theory(equality)]) ).
cnf(3452,negated_conjecture,
( int_leq(X1,n)
| n = esk3_0
| ~ int_leq(X1,esk2_0) ),
inference(spm,[status(thm)],[3397,1225,theory(equality)]) ).
cnf(3631,negated_conjecture,
( int_less(int_zero,esk3_0)
| ~ int_leq(int_one,esk2_0) ),
inference(spm,[status(thm)],[51,3406,theory(equality)]) ).
cnf(3636,negated_conjecture,
( int_less(int_zero,esk3_0)
| $false ),
inference(rw,[status(thm)],[3631,45,theory(equality)]) ).
cnf(3637,negated_conjecture,
int_less(int_zero,esk3_0),
inference(cn,[status(thm)],[3636,theory(equality)]) ).
cnf(7661,plain,
( ~ epred1_2(esk2_0,esk3_0)
| ~ int_less(esk2_0,esk3_0)
| ~ int_leq(int_one,esk2_0) ),
inference(spm,[status(thm)],[42,666,theory(equality)]) ).
cnf(7662,plain,
( ~ epred1_2(esk2_0,esk3_0)
| $false
| ~ int_leq(int_one,esk2_0) ),
inference(rw,[status(thm)],[7661,44,theory(equality)]) ).
cnf(7663,plain,
( ~ epred1_2(esk2_0,esk3_0)
| $false
| $false ),
inference(rw,[status(thm)],[7662,45,theory(equality)]) ).
cnf(7664,plain,
~ epred1_2(esk2_0,esk3_0),
inference(cn,[status(thm)],[7663,theory(equality)]) ).
cnf(7665,plain,
( ~ int_leq(esk3_0,n)
| ~ int_leq(esk2_0,n)
| ~ int_leq(int_one,esk3_0)
| ~ int_leq(int_one,esk2_0) ),
inference(spm,[status(thm)],[7664,25,theory(equality)]) ).
cnf(7666,plain,
( $false
| ~ int_leq(esk2_0,n)
| ~ int_leq(int_one,esk3_0)
| ~ int_leq(int_one,esk2_0) ),
inference(rw,[status(thm)],[7665,43,theory(equality)]) ).
cnf(7667,plain,
( $false
| ~ int_leq(esk2_0,n)
| ~ int_leq(int_one,esk3_0)
| $false ),
inference(rw,[status(thm)],[7666,45,theory(equality)]) ).
cnf(7668,plain,
( ~ int_leq(esk2_0,n)
| ~ int_leq(int_one,esk3_0) ),
inference(cn,[status(thm)],[7667,theory(equality)]) ).
cnf(7674,negated_conjecture,
( n = esk3_0
| ~ int_leq(int_one,esk3_0)
| ~ int_leq(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[7668,3452,theory(equality)]) ).
cnf(7692,negated_conjecture,
( n = esk3_0
| ~ int_leq(int_one,esk3_0)
| $false ),
inference(rw,[status(thm)],[7674,70,theory(equality)]) ).
cnf(7693,negated_conjecture,
( n = esk3_0
| ~ int_leq(int_one,esk3_0) ),
inference(cn,[status(thm)],[7692,theory(equality)]) ).
cnf(7696,negated_conjecture,
( n = esk3_0
| ~ int_less(int_zero,esk3_0) ),
inference(spm,[status(thm)],[7693,52,theory(equality)]) ).
cnf(7716,negated_conjecture,
( n = esk3_0
| $false ),
inference(rw,[status(thm)],[7696,3637,theory(equality)]) ).
cnf(7717,negated_conjecture,
n = esk3_0,
inference(cn,[status(thm)],[7716,theory(equality)]) ).
cnf(7736,plain,
( ~ int_leq(esk2_0,esk3_0)
| ~ int_leq(int_one,esk3_0) ),
inference(rw,[status(thm)],[7668,7717,theory(equality)]) ).
cnf(7928,plain,
( int_less(esk3_0,esk2_0)
| ~ int_leq(int_one,esk3_0) ),
inference(spm,[status(thm)],[7736,58,theory(equality)]) ).
cnf(7942,plain,
~ int_leq(int_one,esk3_0),
inference(sr,[status(thm)],[7928,126,theory(equality)]) ).
cnf(7955,plain,
~ int_less(int_zero,esk3_0),
inference(spm,[status(thm)],[7942,52,theory(equality)]) ).
cnf(7972,plain,
$false,
inference(rw,[status(thm)],[7955,3637,theory(equality)]) ).
cnf(7973,plain,
$false,
inference(cn,[status(thm)],[7972,theory(equality)]) ).
cnf(7974,plain,
$false,
7973,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV486+1.p
% --creating new selector for []
% -running prover on /tmp/tmpRaSz-1/sel_SWV486+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV486+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV486+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV486+1.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
%
%------------------------------------------------------------------------------