TSTP Solution File: SWV492+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV492+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:25:23 EDT 2024
% Result : Theorem 111.69s 14.54s
% Output : CNFRefutation 111.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 13
% Syntax : Number of formulae : 197 ( 23 unt; 0 def)
% Number of atoms : 596 ( 192 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 577 ( 178 ~; 307 |; 62 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 201 ( 3 sgn 83 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( plus(X1,X3) = X2
& int_less(int_zero,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(int_less_transitive,axiom,
! [X1,X2,X3] :
( ( int_less(X1,X2)
& int_less(X2,X3) )
=> int_less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(plus_and_order1,axiom,
! [X4,X5,X6,X7] :
( ( int_less(X4,X5)
& int_leq(X6,X7) )
=> int_leq(plus(X4,X6),plus(X5,X7)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_order1) ).
fof(plus_commutative,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_commutative) ).
fof(lti,conjecture,
( ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero )
& ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X2,n)
& X1 = X2 )
=> a(X1,X2) != real_zero ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lti) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_zero) ).
fof(qih,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qih) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total) ).
fof(real_constants,axiom,
real_zero != real_one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_constants) ).
fof(one_successor_of_zero,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(c_0_12,plain,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
inference(fof_simplification,[status(thm)],[int_less_irreflexive]) ).
fof(c_0_13,plain,
! [X25,X26,X28,X29,X30] :
( ( plus(X25,esk1_2(X25,X26)) = X26
| ~ int_less(X25,X26) )
& ( int_less(int_zero,esk1_2(X25,X26))
| ~ int_less(X25,X26) )
& ( plus(X28,X30) != X29
| ~ int_less(int_zero,X30)
| int_less(X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])])]) ).
fof(c_0_14,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
introduced(definition) ).
fof(c_0_15,plain,
! [X14,X15] :
( ~ int_less(X14,X15)
| X14 != X15 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X11,X12,X13] :
( ~ int_less(X11,X12)
| ~ int_less(X12,X13)
| int_less(X11,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])])]) ).
cnf(c_0_17,plain,
( int_less(X1,X3)
| plus(X1,X2) != X3
| ~ int_less(int_zero,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( int_less(X1,X3)
| ~ int_less(X1,X2)
| ~ int_less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( int_less(X1,plus(X1,X2))
| ~ int_less(int_zero,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X38,X39,X40,X41,X42,X43,X44] :
( ( ~ int_less(int_zero,X40)
| X39 != plus(X38,X40)
| ~ int_leq(int_one,X41)
| ~ int_leq(X41,X38)
| a(plus(X41,X40),X41) = qr(plus(X41,X40),X41)
| ~ epred1_2(X39,X38) )
& ( ~ int_leq(int_one,X42)
| ~ int_leq(X42,X38)
| a(X42,X42) = real_one
| ~ epred1_2(X39,X38) )
& ( ~ int_less(int_zero,X43)
| X38 != plus(X39,X43)
| ~ int_leq(int_one,X44)
| ~ int_leq(X44,X39)
| a(X44,plus(X44,X43)) = real_zero
| ~ epred1_2(X39,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
fof(c_0_23,plain,
! [X21,X22,X23,X24] :
( ~ int_less(X21,X22)
| ~ int_leq(X23,X24)
| int_leq(plus(X21,X23),plus(X22,X24)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])])]) ).
fof(c_0_24,plain,
! [X18,X19] : plus(X18,X19) = plus(X19,X18),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
fof(c_0_25,negated_conjecture,
~ ( ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero )
& ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X2,n)
& X1 = X2 )
=> a(X1,X2) != real_zero ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[lti])]) ).
cnf(c_0_26,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( int_less(X1,plus(X2,X3))
| ~ int_less(int_zero,X3)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( a(X4,plus(X4,X1)) = real_zero
| ~ int_less(int_zero,X1)
| X2 != plus(X3,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X3)
| ~ epred1_2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_29,plain,
! [X9,X10] :
( ( ~ int_leq(X9,X10)
| int_less(X9,X10)
| X9 = X10 )
& ( ~ int_less(X9,X10)
| int_leq(X9,X10) )
& ( X9 != X10
| int_leq(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])]) ).
cnf(c_0_30,plain,
( int_leq(plus(X1,X3),plus(X2,X4))
| ~ int_less(X1,X2)
| ~ int_leq(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X20] : plus(X20,int_zero) = X20,
inference(variable_rename,[status(thm)],[plus_zero]) ).
fof(c_0_33,negated_conjecture,
( ( int_leq(int_one,esk4_0)
| int_leq(int_one,esk2_0) )
& ( int_leq(esk5_0,n)
| int_leq(int_one,esk2_0) )
& ( esk4_0 = esk5_0
| int_leq(int_one,esk2_0) )
& ( a(esk4_0,esk5_0) = real_zero
| int_leq(int_one,esk2_0) )
& ( int_leq(int_one,esk4_0)
| int_less(esk2_0,esk3_0) )
& ( int_leq(esk5_0,n)
| int_less(esk2_0,esk3_0) )
& ( esk4_0 = esk5_0
| int_less(esk2_0,esk3_0) )
& ( a(esk4_0,esk5_0) = real_zero
| int_less(esk2_0,esk3_0) )
& ( int_leq(int_one,esk4_0)
| int_leq(esk3_0,n) )
& ( int_leq(esk5_0,n)
| int_leq(esk3_0,n) )
& ( esk4_0 = esk5_0
| int_leq(esk3_0,n) )
& ( a(esk4_0,esk5_0) = real_zero
| int_leq(esk3_0,n) )
& ( int_leq(int_one,esk4_0)
| a(esk2_0,esk3_0) != real_zero )
& ( int_leq(esk5_0,n)
| a(esk2_0,esk3_0) != real_zero )
& ( esk4_0 = esk5_0
| a(esk2_0,esk3_0) != real_zero )
& ( a(esk4_0,esk5_0) = real_zero
| a(esk2_0,esk3_0) != real_zero ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])]) ).
cnf(c_0_34,plain,
( ~ int_less(plus(X1,X2),X1)
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_36,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,plain,
( a(X1,plus(X1,X2)) = real_zero
| ~ epred1_2(X3,plus(X3,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_39,hypothesis,
! [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(thm)],[qih,c_0_14]) ).
cnf(c_0_40,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_less(X1,X4)
| ~ int_leq(X2,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( int_less(X1,X2)
| X1 = X2
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( esk4_0 = esk5_0
| int_leq(esk3_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_44,plain,
! [X16,X17] :
( int_less(X16,X17)
| int_leq(X17,X16) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
cnf(c_0_45,plain,
( ~ int_less(X1,X2)
| ~ int_less(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_46,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)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_36]) ).
cnf(c_0_47,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_38]) ).
fof(c_0_48,hypothesis,
! [X32,X33] :
( ~ int_leq(int_one,X32)
| ~ int_leq(X32,n)
| ~ int_leq(int_one,X33)
| ~ int_leq(X33,n)
| epred1_2(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])]) ).
cnf(c_0_49,plain,
( int_leq(plus(X1,X2),X3)
| ~ int_less(X1,esk1_2(X4,X3))
| ~ int_less(X4,X3)
| ~ int_leq(X2,X4) ),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_50,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_51,negated_conjecture,
( esk4_0 = esk5_0
| n = esk3_0
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_52,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_53,plain,
( int_less(X1,X2)
| int_leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,plain,
( ~ int_less(plus(X1,X2),X3)
| ~ int_less(int_zero,X2)
| ~ int_less(X3,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_27]) ).
cnf(c_0_55,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_35]),c_0_47])]) ).
cnf(c_0_56,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,plain,
( int_leq(X1,X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_36]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( n = esk3_0
| esk4_0 = esk5_0
| int_less(X1,n)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( esk4_0 = esk5_0
| int_less(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_60,plain,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_61,plain,
( int_leq(X1,X2)
| int_leq(X2,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
( ~ int_less(X1,X2)
| ~ int_less(X2,X3)
| ~ int_less(X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_35]),c_0_36]) ).
cnf(c_0_63,negated_conjecture,
( int_leq(esk5_0,n)
| int_less(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_64,negated_conjecture,
( int_leq(esk5_0,n)
| int_leq(esk3_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_65,negated_conjecture,
( esk4_0 = esk5_0
| a(esk2_0,esk3_0) != real_zero ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_66,hypothesis,
( a(X1,X2) = real_zero
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_67,negated_conjecture,
( esk4_0 = esk5_0
| int_leq(int_one,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_68,negated_conjecture,
( esk4_0 = esk5_0
| n = esk3_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_69,plain,
( a(X1,X1) = real_one
| int_leq(X1,int_one)
| ~ epred1_2(X2,X3)
| ~ int_leq(X1,X3) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_70,plain,
( int_leq(X1,X2)
| int_leq(X3,X1)
| ~ int_leq(X3,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_53]) ).
cnf(c_0_71,negated_conjecture,
( int_leq(esk5_0,n)
| ~ int_less(esk3_0,X1)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_72,negated_conjecture,
( n = esk3_0
| int_less(esk3_0,n)
| int_leq(esk5_0,n) ),
inference(spm,[status(thm)],[c_0_42,c_0_64]) ).
cnf(c_0_73,negated_conjecture,
( int_leq(int_one,esk4_0)
| int_leq(esk3_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_74,negated_conjecture,
( esk4_0 = esk5_0
| ~ int_leq(esk2_0,n) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_43]),c_0_67]),c_0_59]) ).
cnf(c_0_75,negated_conjecture,
( n = esk3_0
| esk4_0 = esk5_0
| int_leq(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_52,c_0_68]) ).
cnf(c_0_76,hypothesis,
( a(X1,X1) = real_one
| int_leq(X1,int_one)
| ~ int_leq(X2,n)
| ~ int_leq(X3,n)
| ~ int_leq(int_one,X3)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_56]),c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( int_leq(esk5_0,n)
| a(esk2_0,esk3_0) != real_zero ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_78,negated_conjecture,
( int_leq(esk5_0,n)
| int_leq(int_one,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_79,negated_conjecture,
( n = esk3_0
| int_leq(esk5_0,n)
| ~ int_less(n,esk2_0) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,negated_conjecture,
( n = esk3_0
| int_less(esk3_0,n)
| int_leq(int_one,esk4_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
( n = esk3_0
| esk4_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,negated_conjecture,
( esk4_0 = esk5_0
| int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_59]) ).
cnf(c_0_83,hypothesis,
( a(X1,X1) = real_one
| int_leq(X1,int_one)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X1,n) ),
inference(spm,[status(thm)],[c_0_76,c_0_47]) ).
cnf(c_0_84,negated_conjecture,
( int_leq(esk5_0,n)
| ~ int_leq(esk2_0,n) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_66]),c_0_64]),c_0_78]),c_0_63]) ).
cnf(c_0_85,negated_conjecture,
( n = esk3_0
| int_leq(esk2_0,n)
| int_leq(esk5_0,n) ),
inference(spm,[status(thm)],[c_0_79,c_0_53]) ).
fof(c_0_86,plain,
real_zero != real_one,
inference(fof_simplification,[status(thm)],[real_constants]) ).
cnf(c_0_87,negated_conjecture,
( n = esk3_0
| int_less(X1,n)
| int_leq(int_one,esk4_0)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_80]) ).
cnf(c_0_88,negated_conjecture,
( int_leq(int_one,esk4_0)
| int_less(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_89,negated_conjecture,
( a(esk4_0,esk5_0) = real_zero
| int_less(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_90,negated_conjecture,
esk4_0 = esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_81]),c_0_82]) ).
cnf(c_0_91,hypothesis,
( a(X1,X1) = real_one
| int_leq(X1,int_one)
| ~ int_leq(X1,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_47]),c_0_70]) ).
cnf(c_0_92,negated_conjecture,
( n = esk3_0
| int_leq(esk5_0,n) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
fof(c_0_93,plain,
real_zero != real_one,
inference(fof_nnf,[status(thm)],[c_0_86]) ).
cnf(c_0_94,negated_conjecture,
( a(esk4_0,esk5_0) = real_zero
| int_leq(esk3_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_95,negated_conjecture,
( int_leq(int_one,esk4_0)
| a(esk2_0,esk3_0) != real_zero ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_96,negated_conjecture,
( int_leq(int_one,esk4_0)
| int_leq(int_one,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_97,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,n)
| int_leq(int_one,esk4_0) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_98,negated_conjecture,
( a(esk5_0,esk5_0) = real_zero
| int_less(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_99,negated_conjecture,
( a(esk5_0,esk5_0) = real_one
| n = esk3_0
| int_leq(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,plain,
real_zero != real_one,
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_101,negated_conjecture,
( a(esk5_0,esk5_0) = real_zero
| int_leq(esk3_0,n) ),
inference(rw,[status(thm)],[c_0_94,c_0_90]) ).
cnf(c_0_102,negated_conjecture,
( a(esk4_0,esk5_0) = real_zero
| a(esk2_0,esk3_0) != real_zero ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_103,negated_conjecture,
( a(esk4_0,esk5_0) = real_zero
| int_leq(int_one,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_104,negated_conjecture,
( int_leq(int_one,esk5_0)
| a(esk2_0,esk3_0) != real_zero ),
inference(rw,[status(thm)],[c_0_95,c_0_90]) ).
cnf(c_0_105,negated_conjecture,
( int_leq(esk3_0,n)
| int_leq(int_one,esk5_0) ),
inference(rw,[status(thm)],[c_0_73,c_0_90]) ).
cnf(c_0_106,negated_conjecture,
( int_leq(int_one,esk5_0)
| int_leq(int_one,esk2_0) ),
inference(rw,[status(thm)],[c_0_96,c_0_90]) ).
cnf(c_0_107,negated_conjecture,
( int_less(esk2_0,esk3_0)
| int_leq(int_one,esk5_0) ),
inference(rw,[status(thm)],[c_0_88,c_0_90]) ).
cnf(c_0_108,negated_conjecture,
( n = esk3_0
| int_leq(int_one,esk4_0)
| int_leq(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_52,c_0_97]) ).
cnf(c_0_109,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,esk3_0)
| int_leq(esk5_0,int_one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]) ).
cnf(c_0_110,negated_conjecture,
( n = esk3_0
| int_leq(esk5_0,int_one)
| int_leq(esk3_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_99]),c_0_100]) ).
cnf(c_0_111,negated_conjecture,
( a(esk5_0,esk5_0) = real_zero
| a(esk2_0,esk3_0) != real_zero ),
inference(rw,[status(thm)],[c_0_102,c_0_90]) ).
cnf(c_0_112,negated_conjecture,
( a(esk5_0,esk5_0) = real_zero
| int_leq(int_one,esk2_0) ),
inference(rw,[status(thm)],[c_0_103,c_0_90]) ).
cnf(c_0_113,hypothesis,
( int_leq(int_one,esk5_0)
| ~ int_leq(esk2_0,n) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_66]),c_0_105]),c_0_106]),c_0_107]) ).
cnf(c_0_114,negated_conjecture,
( n = esk3_0
| int_leq(esk2_0,n)
| int_leq(int_one,esk5_0) ),
inference(rw,[status(thm)],[c_0_108,c_0_90]) ).
cnf(c_0_115,negated_conjecture,
( int_leq(esk5_0,n)
| int_leq(esk3_0,X1)
| int_leq(X1,n) ),
inference(spm,[status(thm)],[c_0_70,c_0_64]) ).
cnf(c_0_116,negated_conjecture,
( n = esk3_0
| int_leq(esk5_0,int_one)
| ~ int_less(esk3_0,X1)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_109]) ).
cnf(c_0_117,negated_conjecture,
( n = esk3_0
| int_less(esk3_0,n)
| int_leq(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_42,c_0_110]) ).
cnf(c_0_118,hypothesis,
( a(esk5_0,esk5_0) = real_zero
| ~ int_leq(esk2_0,n) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_66]),c_0_101]),c_0_112]),c_0_98]) ).
cnf(c_0_119,negated_conjecture,
( n = esk3_0
| int_leq(int_one,esk5_0) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_120,negated_conjecture,
( int_less(X1,esk3_0)
| int_leq(esk5_0,n)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_63]) ).
cnf(c_0_121,negated_conjecture,
( esk3_0 = X1
| int_less(esk3_0,X1)
| int_leq(esk5_0,n)
| int_leq(X1,n) ),
inference(spm,[status(thm)],[c_0_42,c_0_115]) ).
cnf(c_0_122,negated_conjecture,
( n = esk3_0
| int_leq(esk5_0,int_one)
| ~ int_less(n,esk2_0) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_123,hypothesis,
( n = esk3_0
| int_leq(esk5_0,int_one)
| ~ int_leq(esk2_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_99]),c_0_100]) ).
cnf(c_0_124,negated_conjecture,
( n = esk3_0
| esk5_0 = int_one
| int_less(int_one,esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_119]) ).
cnf(c_0_125,negated_conjecture,
( esk3_0 = esk2_0
| int_leq(esk5_0,n) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_26]),c_0_84]) ).
cnf(c_0_126,negated_conjecture,
( n = esk3_0
| int_leq(esk5_0,int_one) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_53]),c_0_123]) ).
cnf(c_0_127,negated_conjecture,
( esk5_0 = int_one
| n = esk3_0
| ~ int_less(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_45,c_0_124]) ).
cnf(c_0_128,negated_conjecture,
( int_leq(int_one,esk4_0)
| int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_88]) ).
cnf(c_0_129,negated_conjecture,
( a(esk5_0,esk5_0) = real_one
| esk3_0 = esk2_0
| int_leq(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_91,c_0_125]) ).
cnf(c_0_130,negated_conjecture,
( n = esk3_0
| esk5_0 = int_one ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_126]),c_0_127]) ).
cnf(c_0_131,negated_conjecture,
( int_leq(esk2_0,esk3_0)
| int_leq(int_one,esk5_0) ),
inference(rw,[status(thm)],[c_0_128,c_0_90]) ).
cnf(c_0_132,hypothesis,
( esk3_0 = esk2_0
| int_leq(esk5_0,int_one)
| ~ int_leq(esk2_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_129]),c_0_100]) ).
cnf(c_0_133,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk2_0,esk3_0)
| int_leq(esk5_0,int_one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_129]),c_0_100]) ).
cnf(c_0_134,hypothesis,
( esk5_0 = int_one
| int_leq(int_one,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_130]),c_0_131]) ).
cnf(c_0_135,negated_conjecture,
( esk5_0 = int_one
| esk3_0 = esk2_0
| int_leq(esk5_0,int_one)
| ~ int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_132,c_0_130]) ).
cnf(c_0_136,negated_conjecture,
( esk3_0 = esk2_0
| int_leq(esk5_0,int_one)
| int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_133]) ).
cnf(c_0_137,hypothesis,
( esk5_0 = int_one
| int_less(int_one,esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_134]) ).
cnf(c_0_138,negated_conjecture,
( esk3_0 = esk2_0
| esk5_0 = int_one
| int_leq(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_139,hypothesis,
( esk5_0 = int_one
| ~ int_less(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_45,c_0_137]) ).
cnf(c_0_140,negated_conjecture,
( esk3_0 = esk2_0
| esk5_0 = int_one ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_138]),c_0_139]) ).
cnf(c_0_141,negated_conjecture,
( esk5_0 = int_one
| int_leq(esk5_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_140]),c_0_26]) ).
cnf(c_0_142,hypothesis,
( a(esk5_0,esk5_0) = real_one
| esk5_0 = int_one
| int_leq(esk5_0,int_one) ),
inference(spm,[status(thm)],[c_0_91,c_0_141]) ).
cnf(c_0_143,hypothesis,
( esk5_0 = int_one
| int_leq(esk5_0,int_one)
| ~ int_leq(esk2_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_142]),c_0_100]) ).
cnf(c_0_144,plain,
( a(int_one,int_one) = real_one
| ~ epred1_2(X1,X2)
| ~ int_leq(int_one,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_47]) ).
cnf(c_0_145,negated_conjecture,
( esk5_0 = int_one
| int_leq(esk5_0,int_one)
| ~ int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_143,c_0_130]) ).
fof(c_0_146,plain,
! [X31] :
( ( ~ int_less(int_zero,X31)
| int_leq(int_one,X31) )
& ( ~ int_leq(int_one,X31)
| int_less(int_zero,X31) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])])]) ).
cnf(c_0_147,hypothesis,
( a(int_one,int_one) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2) ),
inference(spm,[status(thm)],[c_0_144,c_0_56]) ).
cnf(c_0_148,negated_conjecture,
( esk5_0 = int_one
| int_leq(esk5_0,int_one) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_140]),c_0_47])]) ).
cnf(c_0_149,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_150,hypothesis,
( a(int_one,int_one) = real_one
| n = esk3_0
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_119]),c_0_92]) ).
cnf(c_0_151,negated_conjecture,
esk5_0 = int_one,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_148]),c_0_139]) ).
cnf(c_0_152,plain,
( int_leq(int_one,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_149,c_0_36]) ).
cnf(c_0_153,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_154,negated_conjecture,
( a(int_one,int_one) = real_one
| n = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_92]),c_0_119]) ).
cnf(c_0_155,negated_conjecture,
( a(int_one,int_one) = real_zero
| int_leq(esk3_0,n) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_151]),c_0_151]) ).
cnf(c_0_156,plain,
( esk1_2(X1,X2) = int_one
| int_less(int_one,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_152]) ).
cnf(c_0_157,negated_conjecture,
( int_less(int_zero,esk3_0)
| int_leq(esk5_0,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_153]),c_0_78]) ).
cnf(c_0_158,negated_conjecture,
( n = esk3_0
| int_leq(esk3_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_100]) ).
cnf(c_0_159,negated_conjecture,
( esk1_2(int_zero,esk3_0) = int_one
| int_less(int_one,esk1_2(int_zero,esk3_0))
| int_leq(esk5_0,n) ),
inference(spm,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_160,plain,
( esk1_2(int_zero,X1) = X1
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_50]) ).
cnf(c_0_161,negated_conjecture,
( n = esk3_0
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_42,c_0_158]) ).
cnf(c_0_162,negated_conjecture,
( a(int_one,int_one) = real_zero
| int_less(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_151]),c_0_151]) ).
cnf(c_0_163,negated_conjecture,
( esk3_0 = int_one
| int_less(int_one,esk3_0)
| int_leq(esk5_0,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_157]) ).
cnf(c_0_164,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(X1,int_one)
| ~ int_leq(X1,n)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2) ),
inference(spm,[status(thm)],[c_0_147,c_0_61]) ).
cnf(c_0_165,negated_conjecture,
( n = esk3_0
| int_less(X1,n)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_161]) ).
cnf(c_0_166,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_162]),c_0_100]) ).
cnf(c_0_167,hypothesis,
( a(int_one,int_one) = real_zero
| ~ int_leq(esk2_0,n) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_151]),c_0_151]) ).
cnf(c_0_168,negated_conjecture,
( esk3_0 = int_one
| int_less(X1,esk3_0)
| int_leq(esk5_0,n)
| ~ int_less(X1,int_one) ),
inference(spm,[status(thm)],[c_0_20,c_0_163]) ).
cnf(c_0_169,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(n,int_one)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(spm,[status(thm)],[c_0_164,c_0_47]) ).
cnf(c_0_170,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_165,c_0_166]) ).
cnf(c_0_171,negated_conjecture,
( n = esk3_0
| ~ int_leq(esk2_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_167]),c_0_100]) ).
cnf(c_0_172,negated_conjecture,
( esk3_0 = int_one
| int_leq(int_one,n)
| int_leq(esk5_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_121]),c_0_26]) ).
cnf(c_0_173,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(n,int_one) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_47]),c_0_61]) ).
cnf(c_0_174,negated_conjecture,
n = esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_170]),c_0_171]) ).
cnf(c_0_175,negated_conjecture,
( esk3_0 = int_one
| int_leq(int_one,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_151])]) ).
cnf(c_0_176,plain,
( int_leq(X1,int_zero)
| int_leq(int_one,X1) ),
inference(spm,[status(thm)],[c_0_149,c_0_53]) ).
cnf(c_0_177,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(esk3_0,int_one) ),
inference(rw,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_178,hypothesis,
( int_leq(n,int_one)
| ~ int_leq(esk2_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_167]),c_0_100]) ).
cnf(c_0_179,negated_conjecture,
( esk3_0 = int_one
| n = int_one
| int_less(int_one,n) ),
inference(spm,[status(thm)],[c_0_42,c_0_175]) ).
cnf(c_0_180,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(X1,int_zero)
| ~ int_leq(X1,n)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2) ),
inference(spm,[status(thm)],[c_0_147,c_0_176]) ).
cnf(c_0_181,negated_conjecture,
( int_less(esk2_0,esk3_0)
| int_leq(esk3_0,int_one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_177]),c_0_100]) ).
cnf(c_0_182,hypothesis,
( int_leq(esk3_0,int_one)
| ~ int_leq(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_174]),c_0_174]) ).
cnf(c_0_183,negated_conjecture,
( n = int_one
| esk3_0 = int_one
| ~ int_less(n,int_one) ),
inference(spm,[status(thm)],[c_0_45,c_0_179]) ).
cnf(c_0_184,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(n,int_zero)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(spm,[status(thm)],[c_0_180,c_0_47]) ).
cnf(c_0_185,negated_conjecture,
int_leq(esk3_0,int_one),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_181]),c_0_182]) ).
cnf(c_0_186,negated_conjecture,
( esk3_0 = int_one
| ~ int_less(esk3_0,int_one) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_174]),c_0_174])]) ).
cnf(c_0_187,hypothesis,
( a(int_one,int_one) = real_one
| int_leq(n,int_zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_47]),c_0_176]) ).
cnf(c_0_188,negated_conjecture,
esk3_0 = int_one,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_185]),c_0_186]) ).
cnf(c_0_189,plain,
~ int_leq(int_one,int_zero),
inference(spm,[status(thm)],[c_0_26,c_0_153]) ).
cnf(c_0_190,hypothesis,
( int_leq(n,int_zero)
| ~ int_leq(esk2_0,n) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_167]),c_0_100]) ).
cnf(c_0_191,negated_conjecture,
( a(int_one,int_one) = real_zero
| int_less(esk2_0,int_one) ),
inference(rw,[status(thm)],[c_0_162,c_0_188]) ).
cnf(c_0_192,hypothesis,
a(int_one,int_one) = real_one,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_187,c_0_174]),c_0_188]),c_0_189]) ).
cnf(c_0_193,hypothesis,
( int_leq(esk3_0,int_zero)
| ~ int_leq(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_190,c_0_174]),c_0_174]) ).
cnf(c_0_194,negated_conjecture,
int_less(esk2_0,int_one),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_100]) ).
cnf(c_0_195,hypothesis,
~ int_leq(esk2_0,int_one),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_193,c_0_188]),c_0_188]),c_0_189]) ).
cnf(c_0_196,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_194]),c_0_195]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWV492+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31 % CPULimit : 300
% 0.16/0.31 % WCLimit : 300
% 0.16/0.31 % DateTime : Sun May 19 09:16:07 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 111.69/14.54 # Version: 3.1.0
% 111.69/14.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 111.69/14.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 111.69/14.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 111.69/14.54 # Starting new_bool_3 with 300s (1) cores
% 111.69/14.54 # Starting new_bool_1 with 300s (1) cores
% 111.69/14.54 # Starting sh5l with 300s (1) cores
% 111.69/14.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11431 completed with status 0
% 111.69/14.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 111.69/14.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 111.69/14.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 111.69/14.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 111.69/14.54 # No SInE strategy applied
% 111.69/14.54 # Search class: FGHSS-FFMM22-SFFFFFNN
% 111.69/14.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 111.69/14.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 111.69/14.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 111.69/14.54 # Starting new_bool_3 with 136s (1) cores
% 111.69/14.54 # Starting new_bool_1 with 136s (1) cores
% 111.69/14.54 # Starting sh5l with 136s (1) cores
% 111.69/14.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11440 completed with status 0
% 111.69/14.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 111.69/14.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 111.69/14.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 111.69/14.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 111.69/14.54 # No SInE strategy applied
% 111.69/14.54 # Search class: FGHSS-FFMM22-SFFFFFNN
% 111.69/14.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 111.69/14.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 111.69/14.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 111.69/14.54 # Preprocessing time : 0.001 s
% 111.69/14.54 # Presaturation interreduction done
% 111.69/14.54
% 111.69/14.54 # Proof found!
% 111.69/14.54 # SZS status Theorem
% 111.69/14.54 # SZS output start CNFRefutation
% See solution above
% 111.69/14.54 # Parsed axioms : 13
% 111.69/14.54 # Removed by relevancy pruning/SinE : 0
% 111.69/14.54 # Initial clauses : 36
% 111.69/14.54 # Removed in clause preprocessing : 0
% 111.69/14.54 # Initial clauses in saturation : 36
% 111.69/14.54 # Processed clauses : 35720
% 111.69/14.54 # ...of these trivial : 88
% 111.69/14.54 # ...subsumed : 28786
% 111.69/14.54 # ...remaining for further processing : 6846
% 111.69/14.54 # Other redundant clauses eliminated : 5
% 111.69/14.54 # Clauses deleted for lack of memory : 0
% 111.69/14.54 # Backward-subsumed : 822
% 111.69/14.54 # Backward-rewritten : 3190
% 111.69/14.54 # Generated clauses : 1049125
% 111.69/14.54 # ...of the previous two non-redundant : 937683
% 111.69/14.54 # ...aggressively subsumed : 0
% 111.69/14.54 # Contextual simplify-reflections : 152
% 111.69/14.54 # Paramodulations : 1048920
% 111.69/14.54 # Factorizations : 200
% 111.69/14.54 # NegExts : 0
% 111.69/14.54 # Equation resolutions : 5
% 111.69/14.54 # Disequality decompositions : 0
% 111.69/14.54 # Total rewrite steps : 222976
% 111.69/14.54 # ...of those cached : 222776
% 111.69/14.54 # Propositional unsat checks : 1
% 111.69/14.54 # Propositional check models : 0
% 111.69/14.54 # Propositional check unsatisfiable : 0
% 111.69/14.54 # Propositional clauses : 0
% 111.69/14.54 # Propositional clauses after purity: 0
% 111.69/14.54 # Propositional unsat core size : 0
% 111.69/14.54 # Propositional preprocessing time : 0.000
% 111.69/14.54 # Propositional encoding time : 0.303
% 111.69/14.54 # Propositional solver time : 0.043
% 111.69/14.54 # Success case prop preproc time : 0.000
% 111.69/14.54 # Success case prop encoding time : 0.000
% 111.69/14.54 # Success case prop solver time : 0.000
% 111.69/14.54 # Current number of processed clauses : 2793
% 111.69/14.54 # Positive orientable unit clauses : 15
% 111.69/14.54 # Positive unorientable unit clauses: 1
% 111.69/14.54 # Negative unit clauses : 6
% 111.69/14.54 # Non-unit-clauses : 2771
% 111.69/14.54 # Current number of unprocessed clauses: 888916
% 111.69/14.54 # ...number of literals in the above : 5281233
% 111.69/14.54 # Current number of archived formulas : 0
% 111.69/14.54 # Current number of archived clauses : 4048
% 111.69/14.54 # Clause-clause subsumption calls (NU) : 2957238
% 111.69/14.54 # Rec. Clause-clause subsumption calls : 782685
% 111.69/14.54 # Non-unit clause-clause subsumptions : 27258
% 111.69/14.54 # Unit Clause-clause subsumption calls : 8803
% 111.69/14.54 # Rewrite failures with RHS unbound : 0
% 111.69/14.54 # BW rewrite match attempts : 17
% 111.69/14.54 # BW rewrite match successes : 14
% 111.69/14.54 # Condensation attempts : 0
% 111.69/14.54 # Condensation successes : 0
% 111.69/14.54 # Termbank termtop insertions : 19064860
% 111.69/14.54 # Search garbage collected termcells : 453
% 111.69/14.54
% 111.69/14.54 # -------------------------------------------------
% 111.69/14.54 # User time : 13.427 s
% 111.69/14.54 # System time : 0.516 s
% 111.69/14.54 # Total time : 13.943 s
% 111.69/14.54 # Maximum resident set size: 1784 pages
% 111.69/14.54
% 111.69/14.54 # -------------------------------------------------
% 111.69/14.54 # User time : 68.466 s
% 111.69/14.54 # System time : 0.909 s
% 111.69/14.54 # Total time : 69.374 s
% 111.69/14.54 # Maximum resident set size: 1748 pages
% 111.69/14.54 % E---3.1 exiting
% 111.69/14.54 % E exiting
%------------------------------------------------------------------------------