%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM476+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:14 PM UTC 2026
% Result : Theorem 0.12s 5.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 15 unt; 0 def)
% Number of atoms : 242 ( 92 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 277 ( 99 ~; 109 |; 47 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 36 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( xl != sz00
=> ? [X1] :
( ? [X2] :
( ? [X3] :
( xn = sdtasdt0(xl,X3)
& sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3)) = sdtpldt0(sdtasdt0(xl,X1),xn)
& X3 = sdtmndt0(X2,X1) )
& sdtlseqdt0(X1,X2)
& X2 = sdtsldt0(sdtpldt0(xm,xn),xl) )
& X1 = sdtsldt0(xm,xl) ) )
=> doDivides0(xl,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/sandbox2/benchmark/theBenchmark.p',mDefQuot) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324) ).
fof(m__1324_04,hypothesis,
( doDivides0(xl,sdtpldt0(xm,xn))
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324_04) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(c_0_12,negated_conjecture,
~ ( ( xl != sz00
=> ? [X1] :
( ? [X2] :
( ? [X3] :
( xn = sdtasdt0(xl,X3)
& sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3)) = sdtpldt0(sdtasdt0(xl,X1),xn)
& X3 = sdtmndt0(X2,X1) )
& sdtlseqdt0(X1,X2)
& X2 = sdtsldt0(sdtpldt0(xm,xn),xl) )
& X1 = sdtsldt0(xm,xl) ) )
=> doDivides0(xl,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_13,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_14,negated_conjecture,
~ ( ( xl != sz00
=> ? [X1] :
( ? [X2] :
( ? [X3] :
( xn = sdtasdt0(xl,X3)
& sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3)) = sdtpldt0(sdtasdt0(xl,X1),xn)
& X3 = sdtmndt0(X2,X1) )
& sdtlseqdt0(X1,X2)
& X2 = sdtsldt0(sdtpldt0(xm,xn),xl) )
& X1 = sdtsldt0(xm,xl) ) )
=> doDivides0(xl,xn) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X8,X9,X11] :
( ( ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X8)
| doDivides0(X8,X9)
| X9 != sdtasdt0(X8,X11)
| ~ aNaturalNumber0(X11) )
& ( ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X8)
| ~ doDivides0(X8,X9)
| X9 = sdtasdt0(X8,esk4_2(X8,X9)) )
& ( ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X8)
| ~ doDivides0(X8,X9)
| aNaturalNumber0(esk4_2(X8,X9)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])]) ).
fof(c_0_16,plain,
! [X41,X42] :
( aNaturalNumber0(sdtasdt0(X41,X42))
| ~ aNaturalNumber0(X42)
| ~ aNaturalNumber0(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_17,plain,
! [X70,X71,X72] :
( ( ~ aNaturalNumber0(X71)
| ~ aNaturalNumber0(X70)
| ~ doDivides0(X70,X71)
| X70 = sz00
| X72 = sdtsldt0(X71,X70)
| X71 != sdtasdt0(X70,X72)
| ~ aNaturalNumber0(X72) )
& ( ~ aNaturalNumber0(X71)
| ~ aNaturalNumber0(X70)
| ~ doDivides0(X70,X71)
| X70 = sz00
| X72 != sdtsldt0(X71,X70)
| X71 = sdtasdt0(X70,X72) )
& ( ~ aNaturalNumber0(X71)
| ~ aNaturalNumber0(X70)
| ~ doDivides0(X70,X71)
| X70 = sz00
| X72 != sdtsldt0(X71,X70)
| aNaturalNumber0(X72) ) ),
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_13])])])])]) ).
fof(c_0_18,negated_conjecture,
( ~ doDivides0(xl,xn)
& ( xl = sz00
| xn = sdtasdt0(xl,esk3_0) )
& ( xl = sz00
| sdtpldt0(sdtasdt0(xl,esk1_0),sdtasdt0(xl,esk3_0)) = sdtpldt0(sdtasdt0(xl,esk1_0),xn) )
& ( xl = sz00
| esk3_0 = sdtmndt0(esk2_0,esk1_0) )
& ( xl = sz00
| sdtlseqdt0(esk1_0,esk2_0) )
& ( xl = sz00
| esk2_0 = sdtsldt0(sdtpldt0(xm,xn),xl) )
& ( xl = sz00
| esk1_0 = sdtsldt0(xm,xl) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_19,plain,
! [X20,X21] :
( sdtpldt0(X20,X21) = sdtpldt0(X21,X20)
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
fof(c_0_20,plain,
! [X59,X60,X61] :
( ( ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X59)
| ~ sdtlseqdt0(X59,X60)
| X61 = sdtmndt0(X60,X59)
| sdtpldt0(X59,X61) != X60
| ~ aNaturalNumber0(X61) )
& ( ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X59)
| ~ sdtlseqdt0(X59,X60)
| X61 != sdtmndt0(X60,X59)
| sdtpldt0(X59,X61) = X60 )
& ( ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X59)
| ~ sdtlseqdt0(X59,X60)
| X61 != sdtmndt0(X60,X59)
| aNaturalNumber0(X61) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( xl = sz00
| esk2_0 = sdtsldt0(sdtpldt0(xm,xn),xl) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_27,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_28,hypothesis,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X3,X2)
| X1 != sdtmndt0(X2,X3)
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_21]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( xl = sz00
| xn = sdtasdt0(xl,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_33,negated_conjecture,
~ doDivides0(xl,xn),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( xl = sz00
| sdtsldt0(sdtpldt0(xn,xm),xl) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_36,hypothesis,
doDivides0(xl,sdtpldt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26]),c_0_27])]) ).
fof(c_0_37,plain,
! [X18,X19] :
( aNaturalNumber0(sdtpldt0(X18,X19))
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_38,plain,
! [X48] :
( ( ~ aNaturalNumber0(X48)
| sz00 = sdtasdt0(sz00,X48) )
& ( ~ aNaturalNumber0(X48)
| sdtasdt0(X48,sz00) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| aNaturalNumber0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_40,negated_conjecture,
( xl = sz00
| esk3_0 = sdtmndt0(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_41,negated_conjecture,
( xl = sz00
| sdtlseqdt0(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_42,negated_conjecture,
( ~ aNaturalNumber0(esk3_0)
| xl = sz00 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_43,negated_conjecture,
( ~ aNaturalNumber0(sdtpldt0(xn,xm))
| aNaturalNumber0(esk2_0)
| xl = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_32])]) ).
cnf(c_0_44,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( xl = sz00
| esk1_0 = sdtsldt0(xm,xl) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_46,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_47,plain,
( ~ aNaturalNumber0(X1)
| sz00 = sdtasdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X1 = sdtasdt0(X2,esk4_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_49,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_50,negated_conjecture,
( ~ aNaturalNumber0(esk2_0)
| ~ aNaturalNumber0(esk1_0)
| xl = sz00 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( aNaturalNumber0(esk2_0)
| xl = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_26]),c_0_27])]) ).
cnf(c_0_52,negated_conjecture,
( aNaturalNumber0(esk1_0)
| xl = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_46]),c_0_32]),c_0_26])]) ).
cnf(c_0_53,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(esk4_2(sz00,X1))
| ~ doDivides0(sz00,X1)
| X1 = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_54,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_55,negated_conjecture,
xl = sz00,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,plain,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(sz00,X1)
| X1 = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_49])]) ).
cnf(c_0_57,hypothesis,
doDivides0(sz00,xm),
inference(rw,[status(thm)],[c_0_46,c_0_55]) ).
cnf(c_0_58,hypothesis,
xm = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_26])]) ).
fof(c_0_59,plain,
! [X25] :
( ( ~ aNaturalNumber0(X25)
| X25 = sdtpldt0(sz00,X25) )
& ( ~ aNaturalNumber0(X25)
| sdtpldt0(X25,sz00) = X25 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
cnf(c_0_60,hypothesis,
doDivides0(sz00,sdtpldt0(xn,sz00)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_55]),c_0_58]) ).
cnf(c_0_61,plain,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_62,negated_conjecture,
~ doDivides0(sz00,xn),
inference(rw,[status(thm)],[c_0_33,c_0_55]) ).
cnf(c_0_63,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_27])]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM476+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/5.35 % Computer : n010.cluster.edu
% 0.07/5.35 % Model : x86_64 x86_64
% 0.07/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/5.35 % Memory : 8046.5625MB
% 0.07/5.35 % OS : Linux 6.8.0-71-generic
% 0.07/5.35 % CPULimit : 300
% 0.07/5.35 % WCLimit : 300
% 0.07/5.35 % DateTime : Mon Sep 21 02:34:00 UTC 2026
% 0.07/5.35 % CPUTime :
% 0.07/5.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.40 Running first-order theorem proving
% 0.12/5.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.12/5.43 % Version: 3.5.1
% 0.12/5.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/5.43 % Starting sh5l with 300s (1) cores
% 0.12/5.43 % new_bool_3 with pid 4048592 completed with status 0
% 0.12/5.43 % Result found by new_bool_3
% 0.12/5.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/5.43 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.12/5.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/5.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/5.43 % SubtermCWHack with pid 4048596 completed with status 0
% 0.12/5.43 % Result found by SubtermCWHack
% 0.12/5.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/5.43 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.12/5.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/5.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/5.43 % Preprocessing time : 0.001 s
% 0.12/5.43
% 0.12/5.43 % Proof found!
% 0.12/5.43 % SZS status Theorem
% 0.12/5.43 % SZS output start CNFRefutation
% See solution above
% 0.12/5.43 % Parsed axioms : 36
% 0.12/5.43 % Removed by relevancy pruning/SinE : 5
% 0.12/5.43 % Initial clauses : 61
% 0.12/5.43 % Removed in clause preprocessing : 1
% 0.12/5.43 % Initial clauses in saturation : 60
% 0.12/5.43 % Processed clauses : 169
% 0.12/5.43 % ...of these trivial : 1
% 0.12/5.43 % ...subsumed : 68
% 0.12/5.43 % ...remaining for further processing : 100
% 0.12/5.43 % Other redundant clauses eliminated : 18
% 0.12/5.43 % Clauses deleted for lack of memory : 0
% 0.12/5.43 % Backward-subsumed : 8
% 0.12/5.43 % Backward-rewritten : 35
% 0.12/5.43 % Generated clauses : 279
% 0.12/5.43 % ...of the previous two non-redundant : 246
% 0.12/5.43 % ...aggressively subsumed : 0
% 0.12/5.43 % Contextual simplify-reflections : 5
% 0.12/5.43 % Paramodulations : 257
% 0.12/5.43 % Factorizations : 0
% 0.12/5.43 % NegExts : 0
% 0.12/5.43 % Equation resolutions : 22
% 0.12/5.43 % Disequality decompositions : 0
% 0.12/5.43 % Total rewrite steps : 203
% 0.12/5.43 % ...of those cached : 191
% 0.12/5.43 % Propositional unsat checks : 0
% 0.12/5.43 % Propositional check models : 0
% 0.12/5.43 % Propositional check unsatisfiable : 0
% 0.12/5.43 % Propositional clauses : 0
% 0.12/5.43 % Propositional clauses after purity: 0
% 0.12/5.43 % Propositional unsat core size : 0
% 0.12/5.43 % Propositional preprocessing time : 0.000
% 0.12/5.43 % Propositional encoding time : 0.000
% 0.12/5.43 % Propositional solver time : 0.000
% 0.12/5.43 % Success case prop preproc time : 0.000
% 0.12/5.43 % Success case prop encoding time : 0.000
% 0.12/5.43 % Success case prop solver time : 0.000
% 0.12/5.43 % Current number of processed clauses : 51
% 0.12/5.43 % Positive orientable unit clauses : 8
% 0.12/5.43 % Positive unorientable unit clauses: 0
% 0.12/5.43 % Negative unit clauses : 1
% 0.12/5.43 % Non-unit-clauses : 42
% 0.12/5.43 % Current number of unprocessed clauses: 124
% 0.12/5.43 % ...number of literals in the above : 624
% 0.12/5.43 % Current number of archived formulas : 0
% 0.12/5.43 % Current number of archived clauses : 43
% 0.12/5.43 % Clause-clause subsumption calls (NU) : 462
% 0.12/5.43 % Rec. Clause-clause subsumption calls : 294
% 0.12/5.43 % Non-unit clause-clause subsumptions : 81
% 0.12/5.43 % Unit Clause-clause subsumption calls : 20
% 0.12/5.43 % Rewrite failures with RHS unbound : 0
% 0.12/5.43 % BW rewrite match attempts : 3
% 0.12/5.43 % BW rewrite match successes : 3
% 0.12/5.43 % Condensation attempts : 0
% 0.12/5.43 % Condensation successes : 0
% 0.12/5.43 % Termbank termtop insertions : 8833
% 0.12/5.43 % Search garbage collected termcells : 1092
% 0.12/5.43
% 0.12/5.43 % -------------------------------------------------
% 0.12/5.43 % User time : 0.012 s
% 0.12/5.43 % System time : 0.002 s
% 0.12/5.43 % Total time : 0.014 s
% 0.12/5.43 % Maximum resident set size: 3672 pages
% 0.12/5.43
% 0.12/5.43 % -------------------------------------------------
% 0.12/5.43 % User time : 0.014 s
% 0.12/5.43 % System time : 0.006 s
% 0.12/5.43 % Total time : 0.021 s
% 0.12/5.43 % Maximum resident set size: 4608 pages
% 0.12/5.43 % E exiting
%------------------------------------------------------------------------------