TSTP Solution File: SWV490+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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.29s 7.47s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 69 ( 17 unt; 0 def)
% Number of atoms : 270 ( 81 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 314 ( 113 ~; 121 |; 51 &)
% ( 3 <=>; 26 =>; 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 : 151 ( 5 sgn 73 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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_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_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(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',plus_zero) ).
fof(qii,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',qii) ).
fof(di,conjecture,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ( X1 != X2
=> a(X1,X2) = real_zero )
& ( X1 = X2
=> a(X1,X2) != real_zero ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',di) ).
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_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(real_constants,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',real_constants) ).
fof(c_0_10,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_11,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_10]) ).
fof(c_0_12,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_13,plain,
! [X3,X4] : plus(X3,X4) = plus(X4,X3),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
fof(c_0_14,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_11])])])])])]) ).
fof(c_0_15,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_16,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])])])])]) ).
cnf(c_0_17,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_leq(X2,X4)
| ~ int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X2] : plus(X2,int_zero) = X2,
inference(variable_rename,[status(thm)],[plus_zero]) ).
cnf(c_0_20,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_14]) ).
cnf(c_0_21,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,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)],[qii,c_0_10]) ).
cnf(c_0_25,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_less(X1,X4)
| ~ int_leq(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ( X1 != X2
=> a(X1,X2) = real_zero )
& ( X1 = X2
=> a(X1,X2) != real_zero ) ) ),
inference(assume_negation,[status(cth)],[di]) ).
cnf(c_0_28,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_20,c_0_21])]),c_0_22]) ).
cnf(c_0_29,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_23]) ).
fof(c_0_30,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_24])]) ).
cnf(c_0_31,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_25,c_0_21]) ).
cnf(c_0_32,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
fof(c_0_33,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
| esk2_0 != esk3_0 )
& ( a(esk2_0,esk3_0) = real_zero
| esk2_0 != esk3_0 )
& ( esk2_0 = esk3_0
| a(esk2_0,esk3_0) != real_zero )
& ( 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_27])])])]) ).
cnf(c_0_34,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_28,c_0_21]),c_0_29])]) ).
cnf(c_0_35,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_30]) ).
cnf(c_0_36,plain,
( int_leq(X1,X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_32]) ).
fof(c_0_37,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])]) ).
fof(c_0_38,plain,
! [X3,X4] :
( int_less(X3,X4)
| int_leq(X4,X3) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
cnf(c_0_39,negated_conjecture,
( esk2_0 = esk3_0
| a(esk2_0,esk3_0) != real_zero ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,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_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
int_leq(esk3_0,n),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,negated_conjecture,
int_leq(esk2_0,n),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,plain,
( int_less(X1,X2)
| ~ int_less(X3,X2)
| ~ int_less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( int_leq(X1,X2)
| int_less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,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_14]) ).
cnf(c_0_47,plain,
( X1 = X2
| int_less(X1,X2)
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_48,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_39,c_0_40]),c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_49,plain,
( int_less(X1,X2)
| int_leq(X2,X3)
| ~ int_less(X1,X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,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_46,c_0_21])]),c_0_22]) ).
cnf(c_0_51,plain,
( X1 = X2
| int_less(X3,X2)
| ~ int_less(X3,X1)
| ~ int_leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( esk3_0 = esk2_0
| int_leq(esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_45]) ).
cnf(c_0_53,plain,
( X1 = X2
| int_less(X1,X3)
| int_leq(X3,X2)
| ~ int_leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_54,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_14]) ).
cnf(c_0_55,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_50,c_0_21]),c_0_29])]) ).
cnf(c_0_56,negated_conjecture,
( esk3_0 = esk2_0
| int_less(X1,esk2_0)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk3_0,X1)
| int_leq(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_58,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_54,c_0_35]) ).
cnf(c_0_59,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_55,c_0_35]),c_0_36]) ).
cnf(c_0_60,negated_conjecture,
int_leq(int_one,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_61,negated_conjecture,
( esk3_0 = esk2_0
| int_less(esk3_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_47]) ).
cnf(c_0_62,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_58,c_0_43]),c_0_41])]) ).
cnf(c_0_63,negated_conjecture,
( a(esk2_0,esk3_0) = real_zero
| esk2_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_64,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_39,c_0_59]),c_0_60]),c_0_42]),c_0_43])]),c_0_61]) ).
cnf(c_0_65,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_62,c_0_42]),c_0_60])]) ).
cnf(c_0_66,negated_conjecture,
a(esk2_0,esk2_0) = real_zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_64])]) ).
cnf(c_0_67,plain,
real_zero != real_one,
inference(split_conjunct,[status(thm)],[real_constants]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_41]),c_0_29])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 01:36:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.29/7.47 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.29/7.47 # Preprocessing time : 0.015 s
% 0.29/7.47
% 0.29/7.47 # Proof found!
% 0.29/7.47 # SZS status Theorem
% 0.29/7.47 # SZS output start CNFRefutation
% See solution above
% 0.29/7.47 # Proof object total steps : 69
% 0.29/7.47 # Proof object clause steps : 45
% 0.29/7.47 # Proof object formula steps : 24
% 0.29/7.47 # Proof object conjectures : 19
% 0.29/7.47 # Proof object clause conjectures : 16
% 0.29/7.47 # Proof object formula conjectures : 3
% 0.29/7.47 # Proof object initial clauses used : 20
% 0.29/7.47 # Proof object initial formulas used : 10
% 0.29/7.47 # Proof object generating inferences : 23
% 0.29/7.47 # Proof object simplifying inferences : 33
% 0.29/7.47 # Training examples: 0 positive, 0 negative
% 0.29/7.47 # Parsed axioms : 13
% 0.29/7.47 # Removed by relevancy pruning/SinE : 0
% 0.29/7.47 # Initial clauses : 28
% 0.29/7.47 # Removed in clause preprocessing : 2
% 0.29/7.47 # Initial clauses in saturation : 26
% 0.29/7.47 # Processed clauses : 13608
% 0.29/7.47 # ...of these trivial : 13
% 0.29/7.47 # ...subsumed : 11181
% 0.29/7.47 # ...remaining for further processing : 2414
% 0.29/7.47 # Other redundant clauses eliminated : 116
% 0.29/7.47 # Clauses deleted for lack of memory : 217945
% 0.29/7.47 # Backward-subsumed : 236
% 0.29/7.47 # Backward-rewritten : 812
% 0.29/7.47 # Generated clauses : 384778
% 0.29/7.47 # ...of the previous two non-trivial : 345962
% 0.29/7.47 # Contextual simplify-reflections : 24871
% 0.29/7.47 # Paramodulations : 384543
% 0.29/7.47 # Factorizations : 113
% 0.29/7.47 # Equation resolutions : 122
% 0.29/7.47 # Current number of processed clauses : 1364
% 0.29/7.47 # Positive orientable unit clauses : 10
% 0.29/7.47 # Positive unorientable unit clauses: 1
% 0.29/7.47 # Negative unit clauses : 4
% 0.29/7.47 # Non-unit-clauses : 1349
% 0.29/7.47 # Current number of unprocessed clauses: 40728
% 0.29/7.47 # ...number of literals in the above : 273807
% 0.29/7.47 # Current number of archived formulas : 0
% 0.29/7.47 # Current number of archived clauses : 1048
% 0.29/7.47 # Clause-clause subsumption calls (NU) : 944752
% 0.29/7.47 # Rec. Clause-clause subsumption calls : 274104
% 0.29/7.47 # Non-unit clause-clause subsumptions : 36125
% 0.29/7.47 # Unit Clause-clause subsumption calls : 96
% 0.29/7.47 # Rewrite failures with RHS unbound : 0
% 0.29/7.47 # BW rewrite match attempts : 21
% 0.29/7.47 # BW rewrite match successes : 6
% 0.29/7.47 # Condensation attempts : 0
% 0.29/7.47 # Condensation successes : 0
% 0.29/7.47 # Termbank termtop insertions : 6782409
% 0.29/7.47
% 0.29/7.47 # -------------------------------------------------
% 0.29/7.47 # User time : 6.366 s
% 0.29/7.47 # System time : 0.095 s
% 0.29/7.47 # Total time : 6.461 s
% 0.29/7.47 # Maximum resident set size: 127436 pages
% 0.32/23.42 eprover: CPU time limit exceeded, terminating
% 0.32/23.42 eprover: CPU time limit exceeded, terminating
% 0.32/23.42 eprover: CPU time limit exceeded, terminating
% 0.32/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.43 eprover: No such file or directory
% 0.32/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.43 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.44 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.45 eprover: No such file or directory
% 0.32/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.46 eprover: No such file or directory
% 0.32/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.46 eprover: No such file or directory
% 0.32/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.46 eprover: No such file or directory
% 0.32/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.46 eprover: No such file or directory
% 0.32/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.46 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.47 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.48 eprover: No such file or directory
% 0.32/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.32/23.49 eprover: No such file or directory
% 0.32/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.32/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------