%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM473+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:49:13 PM UTC 2026
% Result : Theorem 5.22s 6.19s
% Output : CNFRefutation 5.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 66 ( 29 unt; 0 def)
% Number of atoms : 251 ( 85 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 299 ( 114 ~; 121 |; 40 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1347) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).
fof(m__,conjecture,
sdtlseqdt0(xp,xq),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1324_04,hypothesis,
( doDivides0(xl,sdtpldt0(xm,xn))
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324_04) ).
fof(m__1360,hypothesis,
xp = sdtsldt0(xm,xl),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1360) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).
fof(m__1379,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1379) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonMul) ).
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulCanc) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEAsym) ).
fof(m__1409,hypothesis,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1409) ).
fof(c_0_14,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_15,plain,
! [X67,X68,X69] :
( ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 = sdtsldt0(X68,X67)
| X68 != sdtasdt0(X67,X69)
| ~ aNaturalNumber0(X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| X68 = sdtasdt0(X67,X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| aNaturalNumber0(X69) ) ),
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_14])])])])]) ).
fof(c_0_16,hypothesis,
xl != sz00,
inference(fof_simplification,[status(thm)],[m__1347]) ).
fof(c_0_17,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
cnf(c_0_18,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,hypothesis,
xl != sz00,
inference(fof_nnf,[status(thm)],[c_0_16]) ).
fof(c_0_20,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_21,plain,
! [X48,X49] :
( ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| sdtlseqdt0(X49,X48) )
& ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| X49 != X48 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_24,hypothesis,
xp = sdtsldt0(xm,xl),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_27,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_29,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
inference(split_conjunct,[status(thm)],[m__1379]) ).
fof(c_0_30,plain,
! [X5,X6] :
( aNaturalNumber0(sdtpldt0(X5,X6))
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_31,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_32,plain,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[mMonMul]) ).
cnf(c_0_33,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xp),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_35,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| aNaturalNumber0(xq) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_29]),c_0_25])]),c_0_27]) ).
cnf(c_0_36,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
fof(c_0_38,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2)
| X2 = sz00
| X1 = sdtasdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_40,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[mMulCanc]) ).
fof(c_0_41,plain,
! [X53,X54,X55] :
( ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtlseqdt0(sdtasdt0(X54,X53),sdtasdt0(X55,X53)) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtasdt0(X54,X53) != sdtasdt0(X55,X53) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtlseqdt0(sdtasdt0(X53,X54),sdtasdt0(X53,X55)) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtasdt0(X53,X54) != sdtasdt0(X53,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
cnf(c_0_42,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(xp,X1)
| sdtlseqdt0(X1,xp) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,hypothesis,
aNaturalNumber0(xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_26])]) ).
cnf(c_0_44,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_39]) ).
fof(c_0_46,plain,
! [X28,X29,X30] :
( ( ~ aNaturalNumber0(X28)
| X28 = sz00
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X29)
| X29 = X30
| sdtasdt0(X29,X28) != sdtasdt0(X30,X28) )
& ( ~ aNaturalNumber0(X28)
| X28 = sz00
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X29)
| X29 = X30
| sdtasdt0(X28,X29) != sdtasdt0(X28,X30) ) ),
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_40])])])])]) ).
cnf(c_0_47,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X3)
| X2 = X3
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,hypothesis,
sdtlseqdt0(xq,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_49,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| sdtasdt0(xl,xq) = sdtpldt0(xm,xn) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_29]),c_0_25])]),c_0_27]) ).
fof(c_0_50,plain,
! [X7,X8] :
( aNaturalNumber0(sdtasdt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_51,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_52,plain,
! [X43,X44] :
( X43 = X44
| ~ sdtlseqdt0(X44,X43)
| ~ sdtlseqdt0(X43,X44)
| ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).
cnf(c_0_53,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(sdtasdt0(X1,xq),sdtasdt0(X1,xp))
| X1 = sz00
| xq = xp ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34]),c_0_43])]) ).
cnf(c_0_54,hypothesis,
sdtasdt0(xl,xq) = sdtpldt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_36]),c_0_37]),c_0_26])]) ).
cnf(c_0_55,hypothesis,
sdtasdt0(xl,xp) = xm,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_56,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,hypothesis,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X2,X1) != sdtasdt0(X2,xp)
| X2 = sz00
| X1 = xp ),
inference(spm,[status(thm)],[c_0_51,c_0_34]) ).
cnf(c_0_58,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,hypothesis,
( sdtlseqdt0(sdtpldt0(xm,xn),xm)
| xq = xp ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_25]),c_0_54]),c_0_55]),c_0_27]) ).
cnf(c_0_60,hypothesis,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[m__1409]) ).
cnf(c_0_61,hypothesis,
aNaturalNumber0(sdtpldt0(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_54]),c_0_43]),c_0_25])]) ).
cnf(c_0_62,hypothesis,
( sdtpldt0(xm,xn) != xm
| xq = xp ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_54]),c_0_55]),c_0_43]),c_0_25])]),c_0_27]) ).
cnf(c_0_63,hypothesis,
xq = xp,
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_58,c_0_59]),c_0_60]),c_0_61]),c_0_26])]),c_0_62]) ).
cnf(c_0_64,hypothesis,
sdtlseqdt0(xp,xp),
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM473+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n001.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 02:38:49 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 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
% 5.22/6.19 % Version: 3.5.1
% 5.22/6.19 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.22/6.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.22/6.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.22/6.19 % Starting new_bool_3 with 300s (1) cores
% 5.22/6.19 % Starting new_bool_1 with 300s (1) cores
% 5.22/6.19 % Starting sh5l with 300s (1) cores
% 5.22/6.19 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2006876 completed with status 0
% 5.22/6.19 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 5.22/6.19 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.22/6.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.22/6.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.22/6.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.22/6.19 % No SInE strategy applied
% 5.22/6.19 % Search class: FGUSF-FFMM22-SFFFFFNN
% 5.22/6.19 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.22/6.19 % Starting SubtermCWHack with 136s (1) cores
% 5.22/6.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.22/6.19 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 5.22/6.19 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.22/6.19 % Starting new_bool_3 with 136s (1) cores
% 5.22/6.19 % G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2006886 completed with status 0
% 5.22/6.19 % Result found by G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.22/6.19 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.22/6.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.22/6.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.22/6.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.22/6.19 % No SInE strategy applied
% 5.22/6.19 % Search class: FGUSF-FFMM22-SFFFFFNN
% 5.22/6.19 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.22/6.19 % Starting SubtermCWHack with 136s (1) cores
% 5.22/6.19 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.22/6.19 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 5.22/6.19 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.22/6.19 % Preprocessing time : 0.002 s
% 5.22/6.19 % Presaturation interreduction done
% 5.22/6.19
% 5.22/6.19 % Proof found!
% 5.22/6.19 % SZS status Theorem
% 5.22/6.19 % SZS output start CNFRefutation
% See solution above
% 5.22/6.19 % Parsed axioms : 40
% 5.22/6.19 % Removed by relevancy pruning/SinE : 0
% 5.22/6.19 % Initial clauses : 67
% 5.22/6.19 % Removed in clause preprocessing : 3
% 5.22/6.19 % Initial clauses in saturation : 64
% 5.22/6.19 % Processed clauses : 4779
% 5.22/6.19 % ...of these trivial : 201
% 5.22/6.19 % ...subsumed : 2613
% 5.22/6.19 % ...remaining for further processing : 1965
% 5.22/6.19 % Other redundant clauses eliminated : 307
% 5.22/6.19 % Clauses deleted for lack of memory : 0
% 5.22/6.19 % Backward-subsumed : 255
% 5.22/6.19 % Backward-rewritten : 704
% 5.22/6.19 % Generated clauses : 35573
% 5.22/6.19 % ...of the previous two non-redundant : 32823
% 5.22/6.19 % ...aggressively subsumed : 0
% 5.22/6.19 % Contextual simplify-reflections : 71
% 5.22/6.19 % Paramodulations : 35196
% 5.22/6.19 % Factorizations : 0
% 5.22/6.19 % NegExts : 0
% 5.22/6.19 % Equation resolutions : 338
% 5.22/6.19 % Disequality decompositions : 0
% 5.22/6.19 % Total rewrite steps : 35162
% 5.22/6.19 % ...of those cached : 34909
% 5.22/6.19 % Propositional unsat checks : 0
% 5.22/6.19 % Propositional check models : 0
% 5.22/6.19 % Propositional check unsatisfiable : 0
% 5.22/6.19 % Propositional clauses : 0
% 5.22/6.19 % Propositional clauses after purity: 0
% 5.22/6.19 % Propositional unsat core size : 0
% 5.22/6.19 % Propositional preprocessing time : 0.000
% 5.22/6.19 % Propositional encoding time : 0.000
% 5.22/6.19 % Propositional solver time : 0.000
% 5.22/6.19 % Success case prop preproc time : 0.000
% 5.22/6.19 % Success case prop encoding time : 0.000
% 5.22/6.19 % Success case prop solver time : 0.000
% 5.22/6.19 % Current number of processed clauses : 899
% 5.22/6.19 % Positive orientable unit clauses : 215
% 5.22/6.19 % Positive unorientable unit clauses: 0
% 5.22/6.19 % Negative unit clauses : 52
% 5.22/6.19 % Non-unit-clauses : 632
% 5.22/6.19 % Current number of unprocessed clauses: 27466
% 5.22/6.19 % ...number of literals in the above : 114064
% 5.22/6.19 % Current number of archived formulas : 0
% 5.22/6.19 % Current number of archived clauses : 1057
% 5.22/6.19 % Clause-clause subsumption calls (NU) : 181580
% 5.22/6.19 % Rec. Clause-clause subsumption calls : 79291
% 5.22/6.19 % Non-unit clause-clause subsumptions : 2267
% 5.22/6.19 % Unit Clause-clause subsumption calls : 21758
% 5.22/6.19 % Rewrite failures with RHS unbound : 0
% 5.22/6.19 % BW rewrite match attempts : 103
% 5.22/6.19 % BW rewrite match successes : 92
% 5.22/6.19 % Condensation attempts : 0
% 5.22/6.19 % Condensation successes : 0
% 5.22/6.19 % Termbank termtop insertions : 672635
% 5.22/6.19 % Search garbage collected termcells : 1039
% 5.22/6.19
% 5.22/6.19 % -------------------------------------------------
% 5.22/6.19 % User time : 0.711 s
% 5.22/6.19 % System time : 0.035 s
% 5.22/6.19 % Total time : 0.746 s
% 5.22/6.19 % Maximum resident set size: 3660 pages
% 5.22/6.19
% 5.22/6.19 % -------------------------------------------------
% 5.22/6.19 % User time : 3.562 s
% 5.22/6.19 % System time : 0.177 s
% 5.22/6.19 % Total time : 3.738 s
% 5.22/6.19 % Maximum resident set size: 4608 pages
% 5.22/6.19 % E exiting
%------------------------------------------------------------------------------