TSTP Solution File: SWV491+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV491+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : 600s
% DateTime : Wed Jul 20 18:17:00 EDT 2022
% Result : Theorem 0.28s 5.47s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 100 ( 17 unt; 0 def)
% Number of atoms : 382 ( 111 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 434 ( 152 ~; 191 |; 58 &)
% ( 4 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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; 7 con; 0-2 aty)
% Number of variables : 196 ( 6 sgn 80 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',int_leq) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',int_less_total) ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( plus(X1,X3) = X2
& int_less(int_zero,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/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/sandbox2/solver/bin/../tmp/theBenchmark.p',int_less_transitive) ).
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',int_less_irreflexive) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p',plus_and_order1) ).
fof(plus_commutative,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',plus_commutative) ).
fof(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',plus_zero) ).
fof(diag,conjecture,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ( int_less(X1,X2)
=> a(X1,X2) = real_zero )
& ( int_less(X2,X1)
=> a(X1,X2) = real_zero )
& ( X1 = X2
=> a(X1,X2) = real_one ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',diag) ).
fof(one_successor_of_zero,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',one_successor_of_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) = real_zero ) )
& ! [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/sandbox2/solver/bin/../tmp/theBenchmark.p',qih) ).
fof(c_0_11,plain,
! [X3,X4,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)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( int_less(X3,X4)
| int_leq(X4,X3) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
fof(c_0_13,plain,
! [X4,X5,X4,X5,X7] :
( ( plus(X4,esk1_2(X4,X5)) = X5
| ~ int_less(X4,X5) )
& ( int_less(int_zero,esk1_2(X4,X5))
| ~ int_less(X4,X5) )
& ( plus(X4,X7) != X5
| ~ int_less(int_zero,X7)
| int_less(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])])]) ).
fof(c_0_14,plain,
! [X4,X5,X6] :
( ~ int_less(X4,X5)
| ~ int_less(X5,X6)
| int_less(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])]) ).
cnf(c_0_15,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,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) = real_zero ) )
& ! [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_18,plain,
! [X3,X4] :
( ~ int_less(X3,X4)
| X3 != X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_irreflexive])]) ).
cnf(c_0_19,plain,
( int_less(X1,X2)
| ~ int_less(int_zero,X3)
| plus(X1,X3) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X8,X9,X10,X11] :
( ~ int_less(X8,X9)
| ~ int_leq(X10,X11)
| int_leq(plus(X8,X10),plus(X9,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])]) ).
fof(c_0_21,plain,
! [X3,X4] : plus(X3,X4) = plus(X4,X3),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
cnf(c_0_22,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( X1 = X2
| int_less(X2,X1)
| int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_24,plain,
! [X2] : plus(X2,int_zero) = X2,
inference(variable_rename,[status(thm)],[plus_zero]) ).
fof(c_0_25,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ( int_less(X1,X2)
=> a(X1,X2) = real_zero )
& ( int_less(X2,X1)
=> a(X1,X2) = real_zero )
& ( X1 = X2
=> a(X1,X2) = real_one ) ) ),
inference(assume_negation,[status(cth)],[diag]) ).
fof(c_0_26,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) = real_zero ) )
& ! [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_17]) ).
cnf(c_0_27,plain,
( X1 != X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( int_less(X1,plus(X1,X2))
| ~ int_less(int_zero,X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_leq(X2,X4)
| ~ int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( X1 = X2
| int_less(X2,X1)
| int_less(X3,X2)
| ~ int_less(X3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X2,X2] :
( ( ~ int_less(int_zero,X2)
| int_leq(int_one,X2) )
& ( ~ int_leq(int_one,X2)
| int_less(int_zero,X2) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])])])]) ).
fof(c_0_34,negated_conjecture,
( int_leq(int_one,esk2_0)
& int_leq(esk2_0,n)
& int_leq(int_one,esk3_0)
& int_leq(esk3_0,n)
& ( esk2_0 = esk3_0
| int_less(esk3_0,esk2_0)
| int_less(esk2_0,esk3_0) )
& ( a(esk2_0,esk3_0) != real_one
| int_less(esk3_0,esk2_0)
| int_less(esk2_0,esk3_0) )
& ( esk2_0 = esk3_0
| a(esk2_0,esk3_0) != real_zero
| int_less(esk2_0,esk3_0) )
& ( a(esk2_0,esk3_0) != real_one
| a(esk2_0,esk3_0) != real_zero
| int_less(esk2_0,esk3_0) )
& ( esk2_0 = esk3_0
| int_less(esk3_0,esk2_0)
| a(esk2_0,esk3_0) != real_zero )
& ( a(esk2_0,esk3_0) != real_one
| int_less(esk3_0,esk2_0)
| a(esk2_0,esk3_0) != real_zero )
& ( esk2_0 = esk3_0
| a(esk2_0,esk3_0) != real_zero
| a(esk2_0,esk3_0) != real_zero )
& ( a(esk2_0,esk3_0) != real_one
| a(esk2_0,esk3_0) != real_zero
| a(esk2_0,esk3_0) != real_zero ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_35,plain,
! [X9,X10,X11,X12,X13,X14,X15] :
( ( ~ int_less(int_zero,X11)
| X10 != plus(X9,X11)
| ~ int_leq(int_one,X12)
| ~ int_leq(X12,X9)
| a(plus(X12,X11),X12) = real_zero
| ~ epred1_2(X10,X9) )
& ( ~ int_leq(int_one,X13)
| ~ int_leq(X13,X9)
| a(X13,X13) = real_one
| ~ epred1_2(X10,X9) )
& ( ~ int_less(int_zero,X14)
| X9 != plus(X10,X14)
| ~ int_leq(int_one,X15)
| ~ int_leq(X15,X10)
| a(X15,plus(X15,X14)) = real_zero
| ~ epred1_2(X10,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])])]) ).
cnf(c_0_36,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( int_less(X1,plus(X2,X3))
| ~ int_less(int_zero,X3)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_38,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_less(X1,X4)
| ~ int_leq(X2,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,plain,
( int_less(X1,plus(X2,X3))
| int_less(X2,X1)
| ~ int_less(int_zero,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_19]) ).
cnf(c_0_41,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_42,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,negated_conjecture,
int_leq(int_one,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( a(X3,plus(X3,X4)) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| X2 != plus(X1,X4)
| ~ int_less(int_zero,X4) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_47,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_17]) ).
cnf(c_0_48,plain,
( ~ int_less(plus(X1,X2),X1)
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_49,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,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_38,c_0_39]) ).
cnf(c_0_51,plain,
( int_less(int_zero,X1)
| int_less(X1,X2)
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
int_less(int_zero,esk3_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,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(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39])]),c_0_45]) ).
cnf(c_0_54,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_46]) ).
fof(c_0_55,hypothesis,
! [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)],[inference(fof_nnf,[status(thm)],[c_0_47])]) ).
cnf(c_0_56,plain,
( ~ int_less(plus(X1,X2),X2)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_30]) ).
cnf(c_0_57,plain,
( int_one = X1
| int_less(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_49]) ).
cnf(c_0_58,plain,
( int_leq(X1,X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_41]) ).
cnf(c_0_59,negated_conjecture,
( int_less(X1,esk3_0)
| int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( esk2_0 = esk3_0
| a(esk2_0,esk3_0) != real_zero
| a(esk2_0,esk3_0) != real_zero ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_61,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_53,c_0_39]),c_0_54])]) ).
cnf(c_0_62,hypothesis,
( 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)],[c_0_55]) ).
cnf(c_0_63,plain,
( int_less(X1,X2)
| plus(X3,X1) != X2
| ~ int_less(int_zero,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_64,plain,
( ~ int_less(X1,esk1_2(X2,X1))
| ~ int_less(int_zero,X2)
| ~ int_less(X2,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_39]) ).
cnf(c_0_65,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_57,c_0_45]) ).
cnf(c_0_66,negated_conjecture,
( int_less(int_zero,X1)
| int_leq(X2,esk3_0)
| ~ int_leq(X2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
int_leq(esk2_0,n),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_68,negated_conjecture,
( esk3_0 = esk2_0
| a(esk2_0,esk3_0) != real_zero ),
inference(cn,[status(thm)],[c_0_60]) ).
cnf(c_0_69,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_61,c_0_62]),c_0_58]) ).
cnf(c_0_70,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_71,negated_conjecture,
int_leq(esk3_0,n),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_72,negated_conjecture,
( int_less(esk2_0,esk3_0)
| int_less(esk3_0,esk2_0)
| esk2_0 = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_73,plain,
( int_less(esk1_2(X1,X2),X2)
| ~ int_less(int_zero,X1)
| ~ int_less(X1,X2) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_39])]) ).
cnf(c_0_74,plain,
( esk1_2(X1,int_one) = int_one
| ~ int_less(int_zero,X1)
| ~ int_less(X1,int_one) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_75,negated_conjecture,
( int_less(int_zero,n)
| int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
( esk3_0 = esk2_0
| ~ int_less(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71]),c_0_67])]) ).
cnf(c_0_77,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk2_0,esk3_0)
| int_less(X1,esk2_0)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_72]) ).
cnf(c_0_78,plain,
( a(plus(X3,X4),X3) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_leq(X3,X2)
| ~ int_leq(int_one,X3)
| X1 != plus(X2,X4)
| ~ int_less(int_zero,X4) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_79,plain,
( ~ int_less(int_zero,X1)
| ~ int_less(X1,int_one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_36]) ).
cnf(c_0_80,negated_conjecture,
( esk3_0 = esk2_0
| int_less(int_zero,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_75]),c_0_76]) ).
cnf(c_0_81,negated_conjecture,
( esk3_0 = esk2_0
| X1 = esk3_0
| int_less(esk2_0,esk3_0)
| int_less(esk3_0,X1)
| int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_23]) ).
cnf(c_0_82,negated_conjecture,
( int_one = esk3_0
| int_less(int_one,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_83,plain,
( a(plus(X1,esk1_2(X2,X3)),X1) = real_zero
| ~ epred1_2(X3,X2)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_39])]),c_0_45]) ).
cnf(c_0_84,negated_conjecture,
( esk3_0 = esk2_0
| ~ int_less(n,int_one) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( esk3_0 = esk2_0
| X1 = esk3_0
| X1 = X2
| int_less(esk2_0,esk3_0)
| int_less(X1,esk2_0)
| int_less(esk3_0,X2)
| int_less(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
( int_one = esk3_0
| esk3_0 = X1
| int_less(int_one,X1)
| int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_82]) ).
cnf(c_0_87,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X2,X1)
| ~ int_leq(int_one,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_39]),c_0_54])]) ).
cnf(c_0_88,negated_conjecture,
( esk3_0 = esk2_0
| X1 = esk3_0
| int_less(esk2_0,esk3_0)
| int_less(esk3_0,X1)
| int_less(X2,esk2_0)
| ~ int_less(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_81]) ).
cnf(c_0_89,negated_conjecture,
( n = int_one
| int_one = esk3_0
| esk3_0 = esk2_0
| int_less(int_one,esk2_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_76]) ).
cnf(c_0_90,plain,
( a(X3,X3) = real_one
| ~ epred1_2(X1,X2)
| ~ int_leq(X3,X2)
| ~ int_leq(int_one,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_91,hypothesis,
( a(X1,X2) = real_zero
| ~ int_less(X2,X1)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_62]),c_0_58]) ).
cnf(c_0_92,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk3_0,esk2_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_23]),c_0_23]),c_0_23]),c_0_76]) ).
cnf(c_0_93,hypothesis,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(X3,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X3)
| ~ int_leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_90,c_0_62]) ).
cnf(c_0_94,negated_conjecture,
( int_less(esk2_0,esk3_0)
| int_less(esk3_0,esk2_0)
| a(esk2_0,esk3_0) != real_one ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_95,negated_conjecture,
esk3_0 = esk2_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_91]),c_0_43]),c_0_71]),c_0_67])]),c_0_92]) ).
cnf(c_0_96,negated_conjecture,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_67]),c_0_70])]) ).
cnf(c_0_97,negated_conjecture,
a(esk2_0,esk2_0) != real_one,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_95]),c_0_95])]),c_0_36]) ).
cnf(c_0_98,negated_conjecture,
( a(X1,X1) = real_one
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_71]),c_0_43])]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_70]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV491+3 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 10:51:49 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.28/5.47 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.28/5.47 # Preprocessing time : 0.016 s
% 0.28/5.47
% 0.28/5.47 # Proof found!
% 0.28/5.47 # SZS status Theorem
% 0.28/5.47 # SZS output start CNFRefutation
% See solution above
% 0.28/5.47 # Proof object total steps : 100
% 0.28/5.47 # Proof object clause steps : 73
% 0.28/5.47 # Proof object formula steps : 27
% 0.28/5.47 # Proof object conjectures : 31
% 0.28/5.47 # Proof object clause conjectures : 28
% 0.28/5.47 # Proof object formula conjectures : 3
% 0.28/5.47 # Proof object initial clauses used : 24
% 0.28/5.47 # Proof object initial formulas used : 11
% 0.28/5.47 # Proof object generating inferences : 45
% 0.28/5.47 # Proof object simplifying inferences : 45
% 0.28/5.47 # Training examples: 0 positive, 0 negative
% 0.28/5.47 # Parsed axioms : 13
% 0.28/5.47 # Removed by relevancy pruning/SinE : 0
% 0.28/5.47 # Initial clauses : 32
% 0.28/5.47 # Removed in clause preprocessing : 0
% 0.28/5.47 # Initial clauses in saturation : 32
% 0.28/5.47 # Processed clauses : 11998
% 0.28/5.47 # ...of these trivial : 16
% 0.28/5.47 # ...subsumed : 10006
% 0.28/5.47 # ...remaining for further processing : 1976
% 0.28/5.47 # Other redundant clauses eliminated : 32
% 0.28/5.47 # Clauses deleted for lack of memory : 71939
% 0.28/5.47 # Backward-subsumed : 270
% 0.28/5.47 # Backward-rewritten : 700
% 0.28/5.47 # Generated clauses : 250582
% 0.28/5.47 # ...of the previous two non-trivial : 230714
% 0.28/5.47 # Contextual simplify-reflections : 19289
% 0.28/5.47 # Paramodulations : 250385
% 0.28/5.47 # Factorizations : 156
% 0.28/5.47 # Equation resolutions : 38
% 0.28/5.47 # Current number of processed clauses : 1001
% 0.28/5.47 # Positive orientable unit clauses : 10
% 0.28/5.47 # Positive unorientable unit clauses: 1
% 0.28/5.47 # Negative unit clauses : 7
% 0.28/5.47 # Non-unit-clauses : 983
% 0.28/5.47 # Current number of unprocessed clauses: 43983
% 0.28/5.47 # ...number of literals in the above : 308855
% 0.28/5.47 # Current number of archived formulas : 0
% 0.28/5.47 # Current number of archived clauses : 973
% 0.28/5.47 # Clause-clause subsumption calls (NU) : 1040541
% 0.28/5.47 # Rec. Clause-clause subsumption calls : 228336
% 0.28/5.47 # Non-unit clause-clause subsumptions : 27905
% 0.28/5.47 # Unit Clause-clause subsumption calls : 139
% 0.28/5.47 # Rewrite failures with RHS unbound : 0
% 0.28/5.47 # BW rewrite match attempts : 17
% 0.28/5.47 # BW rewrite match successes : 3
% 0.28/5.47 # Condensation attempts : 0
% 0.28/5.47 # Condensation successes : 0
% 0.28/5.47 # Termbank termtop insertions : 4347816
% 0.28/5.47
% 0.28/5.47 # -------------------------------------------------
% 0.28/5.47 # User time : 3.932 s
% 0.28/5.47 # System time : 0.097 s
% 0.28/5.47 # Total time : 4.029 s
% 0.28/5.47 # Maximum resident set size: 126576 pages
% 0.28/23.43 eprover: CPU time limit exceeded, terminating
% 0.28/23.44 eprover: CPU time limit exceeded, terminating
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------