TSTP Solution File: NUM469+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM469+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : Mon Jul 18 09:32:46 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 69 ( 18 unt; 0 def)
% Number of atoms : 214 ( 62 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 255 ( 110 ~; 109 |; 23 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 1 sgn 36 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(m__,conjecture,
doDivides0(xl,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__1298,hypothesis,
( xl != sz00
=> sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1298) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulZero) ).
fof(mDivTrans,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X2,X3) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDivTrans) ).
fof(m__1240,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1240) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefQuot) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC) ).
fof(m__1240_04,hypothesis,
( doDivides0(xl,xm)
& doDivides0(xl,xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1240_04) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddAsso) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_AddZero) ).
fof(c_0_13,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| X5 != sdtasdt0(X4,X7)
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(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)],[mDefDiv])])])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_15,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_16,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,hypothesis,
( xl = sz00
| sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(fof_nnf,[status(thm)],[m__1298]) ).
fof(c_0_19,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X2] :
( ( sdtasdt0(X2,sz00) = sz00
| ~ aNaturalNumber0(X2) )
& ( sz00 = sdtasdt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])]) ).
fof(c_0_21,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ doDivides0(X4,X5)
| ~ doDivides0(X5,X6)
| doDivides0(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])]) ).
cnf(c_0_22,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).
cnf(c_0_23,hypothesis,
( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
| xl = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_25,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
fof(c_0_27,plain,
! [X4,X5,X6,X6] :
( ( aNaturalNumber0(X6)
| X6 != sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,X6)
| X6 != sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| X5 != sdtasdt0(X4,X6)
| X6 = sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
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)],[mDefQuot])])])])])]) ).
cnf(c_0_28,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( X1 = sdtasdt0(X2,esk1_2(X2,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_31,plain,
( doDivides0(X1,X2)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,hypothesis,
doDivides0(xl,xn),
inference(split_conjunct,[status(thm)],[m__1240_04]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_34,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_35,hypothesis,
( sz00 = xl
| ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_36,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1240_04]) ).
cnf(c_0_39,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_40,plain,
( X1 = sz00
| ~ doDivides0(sz00,X1)
| ~ aNaturalNumber0(esk1_2(sz00,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_41,plain,
( aNaturalNumber0(esk1_2(X2,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,hypothesis,
( doDivides0(X1,xn)
| ~ doDivides0(X1,xl)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_43,plain,
( doDivides0(X1,X2)
| X2 != sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_34]),c_0_30])]) ).
cnf(c_0_44,hypothesis,
( sz00 = xl
| ~ aNaturalNumber0(sdtsldt0(xn,xl))
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_37]) ).
fof(c_0_46,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| sdtpldt0(sdtpldt0(X4,X5),X6) = sdtpldt0(X4,sdtpldt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).
fof(c_0_47,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
cnf(c_0_48,hypothesis,
( doDivides0(X1,xm)
| ~ doDivides0(X1,xl)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_24]),c_0_39])]) ).
cnf(c_0_49,plain,
( X1 = sz00
| ~ doDivides0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30])]) ).
cnf(c_0_50,hypothesis,
( doDivides0(X1,xn)
| sz00 != xl
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24])]) ).
cnf(c_0_51,hypothesis,
( sz00 = xl
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_52,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,hypothesis,
( doDivides0(X1,xm)
| sz00 != xl
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_43]),c_0_24])]) ).
cnf(c_0_56,hypothesis,
( sz00 = xn
| sz00 != xl ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_33]),c_0_30])]) ).
cnf(c_0_57,hypothesis,
sz00 = xl,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_38]),c_0_24]),c_0_39])]) ).
cnf(c_0_58,plain,
( sdtpldt0(sz00,sdtpldt0(X1,X2)) = sdtpldt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_30])]) ).
cnf(c_0_59,plain,
( sdtpldt0(X1,sdtpldt0(X2,sz00)) = sdtpldt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_52]),c_0_30])]),c_0_36]) ).
cnf(c_0_60,negated_conjecture,
( sdtpldt0(xm,xn) != sz00
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_43]),c_0_24])]) ).
cnf(c_0_61,hypothesis,
( sz00 = xm
| sz00 != xl ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_55]),c_0_39]),c_0_30])]) ).
cnf(c_0_62,hypothesis,
xl = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_57])]) ).
cnf(c_0_63,plain,
( sdtpldt0(sz00,X1) = sdtpldt0(X1,sz00)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_30])]) ).
cnf(c_0_64,negated_conjecture,
sdtpldt0(xm,xn) != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_36]),c_0_33]),c_0_39])]) ).
cnf(c_0_65,hypothesis,
xn = xm,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_57]),c_0_57])]),c_0_62]) ).
cnf(c_0_66,plain,
sdtpldt0(sz00,sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_63]),c_0_30])]) ).
cnf(c_0_67,negated_conjecture,
sdtpldt0(xm,xm) != xm,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_57]),c_0_65]),c_0_62]),c_0_65]) ).
cnf(c_0_68,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_57]),c_0_57]),c_0_57]),c_0_62]),c_0_65]),c_0_62]),c_0_65]),c_0_62]),c_0_65]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM469+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 08:27:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.017 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 69
% 0.21/1.40 # Proof object clause steps : 45
% 0.21/1.40 # Proof object formula steps : 24
% 0.21/1.40 # Proof object conjectures : 7
% 0.21/1.40 # Proof object clause conjectures : 4
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 20
% 0.21/1.40 # Proof object initial formulas used : 13
% 0.21/1.40 # Proof object generating inferences : 21
% 0.21/1.40 # Proof object simplifying inferences : 69
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 36
% 0.21/1.40 # Removed by relevancy pruning/SinE : 6
% 0.21/1.40 # Initial clauses : 52
% 0.21/1.40 # Removed in clause preprocessing : 1
% 0.21/1.40 # Initial clauses in saturation : 51
% 0.21/1.40 # Processed clauses : 368
% 0.21/1.40 # ...of these trivial : 5
% 0.21/1.40 # ...subsumed : 185
% 0.21/1.40 # ...remaining for further processing : 177
% 0.21/1.40 # Other redundant clauses eliminated : 12
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 15
% 0.21/1.40 # Backward-rewritten : 110
% 0.21/1.40 # Generated clauses : 1722
% 0.21/1.40 # ...of the previous two non-trivial : 1672
% 0.21/1.40 # Contextual simplify-reflections : 58
% 0.21/1.40 # Paramodulations : 1695
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 27
% 0.21/1.40 # Current number of processed clauses : 51
% 0.21/1.40 # Positive orientable unit clauses : 5
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 2
% 0.21/1.40 # Non-unit-clauses : 44
% 0.21/1.40 # Current number of unprocessed clauses: 487
% 0.21/1.40 # ...number of literals in the above : 3054
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 125
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 4679
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1658
% 0.21/1.40 # Non-unit clause-clause subsumptions : 248
% 0.21/1.40 # Unit Clause-clause subsumption calls : 58
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 5
% 0.21/1.40 # BW rewrite match successes : 5
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 31311
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.067 s
% 0.21/1.40 # System time : 0.001 s
% 0.21/1.40 # Total time : 0.068 s
% 0.21/1.40 # Maximum resident set size: 4400 pages
%------------------------------------------------------------------------------