%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM534+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 : n011.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:27 PM UTC 2026
% Result : Theorem 121.32s 18.16s
% Output : CNFRefutation 121.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 10 unt; 0 def)
% Number of atoms : 341 ( 65 equ)
% Maximal formula atoms : 54 ( 6 avg)
% Number of connectives : 500 ( 215 ~; 236 |; 33 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 140 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefCons,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtpldt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( ( X4 = X2
| aElementOf0(X4,X1) )
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefCons) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(mSubASymm,axiom,
! [X1,X2] :
( ( aSet0(X2)
& aSet0(X1) )
=> ( ( aSubsetOf0(X2,X1)
& aSubsetOf0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubASymm) ).
fof(m__,conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) = xS,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__617_02,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__617_02) ).
fof(m__617,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__617) ).
fof(c_0_8,plain,
! [X30,X31,X32,X33,X34,X35] :
( ( ~ aElement0(X31)
| ~ aSet0(X30)
| X35 = sdtpldt0(X30,X31)
| ~ aSet0(X35)
| aElementOf0(esk3_3(X30,X31,X35),X35)
| esk3_3(X30,X31,X35) = X31
| aElementOf0(esk3_3(X30,X31,X35),X30) )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X35 = sdtpldt0(X30,X31)
| ~ aSet0(X35)
| aElementOf0(esk3_3(X30,X31,X35),X35)
| aElement0(esk3_3(X30,X31,X35)) )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X35 = sdtpldt0(X30,X31)
| ~ aSet0(X35)
| ~ aElementOf0(esk3_3(X30,X31,X35),X35)
| ~ aElement0(esk3_3(X30,X31,X35))
| esk3_3(X30,X31,X35) != X31 )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X35 = sdtpldt0(X30,X31)
| ~ aSet0(X35)
| ~ aElementOf0(esk3_3(X30,X31,X35),X35)
| ~ aElement0(esk3_3(X30,X31,X35))
| ~ aElementOf0(esk3_3(X30,X31,X35),X30) )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X32 != sdtpldt0(X30,X31)
| aElementOf0(X34,X32)
| ~ aElement0(X34)
| X34 != X31 )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X32 != sdtpldt0(X30,X31)
| aElementOf0(X34,X32)
| ~ aElement0(X34)
| ~ aElementOf0(X34,X30) )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X32 != sdtpldt0(X30,X31)
| ~ aElementOf0(X33,X32)
| X33 = X31
| aElementOf0(X33,X30) )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X32 != sdtpldt0(X30,X31)
| ~ aElementOf0(X33,X32)
| aElement0(X33) )
& ( ~ aElement0(X31)
| ~ aSet0(X30)
| X32 != sdtpldt0(X30,X31)
| aSet0(X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefCons])])])])])])]) ).
fof(c_0_9,plain,
! [X7,X8] :
( aElement0(X8)
| ~ aElementOf0(X8,X7)
| ~ aSet0(X7) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_10,plain,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
cnf(c_0_11,plain,
( ~ aElement0(X4)
| ~ aSet0(X2)
| X3 != sdtpldt0(X2,X4)
| ~ aElement0(X1)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X37,X38,X39,X40,X41,X42] :
( ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| aElementOf0(esk4_3(X37,X38,X42),X42)
| esk4_3(X37,X38,X42) != X38 )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| aElementOf0(esk4_3(X37,X38,X42),X42)
| aElementOf0(esk4_3(X37,X38,X42),X37) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| aElementOf0(esk4_3(X37,X38,X42),X42)
| aElement0(esk4_3(X37,X38,X42)) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X42 = sdtmndt0(X37,X38)
| ~ aSet0(X42)
| esk4_3(X37,X38,X42) = X38
| ~ aElementOf0(esk4_3(X37,X38,X42),X37)
| ~ aElement0(esk4_3(X37,X38,X42))
| ~ aElementOf0(esk4_3(X37,X38,X42),X42) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| aElementOf0(X41,X39)
| X41 = X38
| ~ aElementOf0(X41,X37)
| ~ aElement0(X41) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| ~ aElementOf0(X40,X39)
| X40 != X38 )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| ~ aElementOf0(X40,X39)
| aElementOf0(X40,X37) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| ~ aElementOf0(X40,X39)
| aElement0(X40) )
& ( ~ aElement0(X38)
| ~ aSet0(X37)
| X39 != sdtmndt0(X37,X38)
| aSet0(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])]) ).
fof(c_0_14,plain,
! [X17,X18,X19,X20] :
( ( ~ aSet0(X17)
| aSubsetOf0(X20,X17)
| ~ aSet0(X20)
| ~ aElementOf0(esk2_2(X17,X20),X17) )
& ( ~ aSet0(X17)
| aSubsetOf0(X20,X17)
| ~ aSet0(X20)
| aElementOf0(esk2_2(X17,X20),X20) )
& ( ~ aSet0(X17)
| ~ aSubsetOf0(X18,X17)
| aElementOf0(X19,X17)
| ~ aElementOf0(X19,X18) )
& ( ~ aSet0(X17)
| ~ aSubsetOf0(X18,X17)
| aSet0(X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
cnf(c_0_15,plain,
( ~ aSet0(X3)
| ~ aElement0(X4)
| ~ aElementOf0(X1,X3)
| X2 != sdtpldt0(X3,X4)
| aElementOf0(X1,X2) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X1 != sdtpldt0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X4 != sdtmndt0(X2,X3)
| ~ aElementOf0(X1,X2)
| ~ aElement0(X1)
| aElementOf0(X1,X4)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ aSet0(X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,sdtpldt0(X2,X3)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ aSet0(X1)
| ~ aElement0(X2)
| aSet0(sdtpldt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X4)
| X3 != sdtmndt0(X4,X2)
| aElementOf0(X1,X3)
| X1 = X2 ),
inference(csr,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X1 != sdtmndt0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElement0(X3)
| ~ aElementOf0(esk2_2(sdtpldt0(X2,X3),X1),X2)
| aSubsetOf0(X1,sdtpldt0(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
( ~ aSet0(X3)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,sdtmndt0(X3,X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( ~ aSet0(X1)
| ~ aElement0(X2)
| aSet0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X4 != sdtpldt0(X2,X3)
| ~ aElementOf0(X1,X4)
| X1 = X3
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,plain,
( ~ aSet0(X1)
| ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElementOf0(esk2_2(sdtpldt0(sdtmndt0(X1,X2),X3),X4),X1)
| aSubsetOf0(X4,sdtpldt0(sdtmndt0(X1,X2),X3))
| esk2_2(sdtpldt0(sdtmndt0(X1,X2),X3),X4) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( ~ aElement0(X2)
| ~ aSet0(X4)
| X3 != sdtpldt0(X4,X2)
| ~ aElement0(X1)
| X1 != X2
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,plain,
( ~ aElement0(X4)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X4)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
( ~ aSet0(X3)
| ~ aElement0(X2)
| ~ aElementOf0(X1,sdtpldt0(X3,X2))
| aElementOf0(X1,X3)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X25,X26] :
( X25 = X26
| ~ aSubsetOf0(X26,X25)
| ~ aSubsetOf0(X25,X26)
| ~ aSet0(X26)
| ~ aSet0(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubASymm])])]) ).
cnf(c_0_33,plain,
( ~ aSet0(X1)
| ~ aSet0(sdtpldt0(sdtmndt0(X1,X2),X3))
| ~ aElement0(X2)
| ~ aElement0(X3)
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(X1,X2),X3))
| esk2_2(sdtpldt0(sdtmndt0(X1,X2),X3),X1) = X2 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ aSet0(X3)
| ~ aElement0(X1)
| X2 != sdtpldt0(X3,X1)
| aElementOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( ~ aSet0(X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| aElementOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElement0(X3)
| aElementOf0(esk2_2(X1,sdtpldt0(X2,X3)),X2)
| aSubsetOf0(sdtpldt0(X2,X3),X1)
| esk2_2(X1,sdtpldt0(X2,X3)) = X3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_20]) ).
cnf(c_0_37,plain,
( ~ aSubsetOf0(X2,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,plain,
( ~ aSet0(X1)
| ~ aSet0(sdtpldt0(sdtmndt0(X1,X2),X3))
| ~ aElement0(X3)
| ~ aElementOf0(X2,sdtpldt0(sdtmndt0(X1,X2),X3))
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_33]),c_0_12]) ).
cnf(c_0_40,plain,
( ~ aSet0(X2)
| ~ aElement0(X1)
| aElementOf0(X1,sdtpldt0(X2,X1)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElement0(X4)
| ~ aElement0(X3)
| aElementOf0(esk2_2(X1,sdtpldt0(sdtmndt0(X2,X3),X4)),X2)
| aSubsetOf0(sdtpldt0(sdtmndt0(X2,X3),X4),X1)
| esk2_2(X1,sdtpldt0(sdtmndt0(X2,X3),X4)) = X4 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25]) ).
fof(c_0_42,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_43,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X1)
| X1 = X2 ),
inference(csr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( ~ aSet0(X1)
| ~ aSet0(sdtpldt0(sdtmndt0(X1,X2),X2))
| ~ aElement0(X2)
| aSubsetOf0(X1,sdtpldt0(sdtmndt0(X1,X2),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25]) ).
cnf(c_0_45,plain,
( ~ aSet0(X1)
| ~ aSet0(sdtpldt0(sdtmndt0(X1,X2),X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| aSubsetOf0(sdtpldt0(sdtmndt0(X1,X2),X3),X1)
| esk2_2(X1,sdtpldt0(sdtmndt0(X1,X2),X3)) = X3 ),
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
fof(c_0_46,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(fof_simplification,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( ~ aSet0(X1)
| ~ aElement0(X2)
| ~ aSubsetOf0(sdtpldt0(sdtmndt0(X1,X2),X2),X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_38]) ).
cnf(c_0_48,plain,
( ~ aSet0(X1)
| ~ aSet0(sdtpldt0(sdtmndt0(X1,X2),X3))
| ~ aElement0(X2)
| ~ aElementOf0(X3,X1)
| aSubsetOf0(sdtpldt0(sdtmndt0(X1,X2),X3),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_45]),c_0_12]) ).
fof(c_0_49,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(fof_nnf,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
( ~ aSet0(X1)
| ~ aSet0(sdtpldt0(sdtmndt0(X1,X2),X2))
| ~ aElementOf0(X2,X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_12]) ).
cnf(c_0_51,negated_conjecture,
sdtpldt0(sdtmndt0(xS,xx),xx) != xS,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_52,plain,
( ~ aSet0(X1)
| ~ aElementOf0(X2,X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_20]),c_0_25]),c_0_12]) ).
cnf(c_0_53,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__617_02]) ).
cnf(c_0_54,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__617]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM534+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.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 02:38:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 121.32/18.16 % Version: 3.5.1
% 121.32/18.16 % Preprocessing class: FSMSSMSSSSSNFFN.
% 121.32/18.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.32/18.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 121.32/18.16 % Starting new_bool_3 with 300s (1) cores
% 121.32/18.16 % Starting new_bool_1 with 300s (1) cores
% 121.32/18.16 % Starting sh5l with 300s (1) cores
% 121.32/18.16 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 786626 completed with status 0
% 121.32/18.16 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 121.32/18.16 % Preprocessing class: FSMSSMSSSSSNFFN.
% 121.32/18.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.32/18.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 121.32/18.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 121.32/18.16 % No SInE strategy applied
% 121.32/18.16 % Search class: FGHSF-FFMS32-SFFFFFNN
% 121.32/18.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 121.32/18.16 % Starting SubtermCWHack with 136s (1) cores
% 121.32/18.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 121.32/18.16 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 121.32/18.16 % Starting new_bool_3 with 136s (1) cores
% 121.32/18.16 % Starting new_bool_1 with 136s (1) cores
% 121.32/18.16 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 786635 completed with status 0
% 121.32/18.16 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 121.32/18.16 % Preprocessing class: FSMSSMSSSSSNFFN.
% 121.32/18.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 121.32/18.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 121.32/18.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 121.32/18.16 % No SInE strategy applied
% 121.32/18.16 % Search class: FGHSF-FFMS32-SFFFFFNN
% 121.32/18.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 121.32/18.16 % Starting SubtermCWHack with 136s (1) cores
% 121.32/18.16 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 121.32/18.16 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 121.32/18.16 % Preprocessing time : 0.003 s
% 121.32/18.16
% 121.32/18.16 % Proof found!
% 121.32/18.16 % SZS status Theorem
% 121.32/18.16 % SZS output start CNFRefutation
% See solution above
% 121.32/18.16 % Parsed axioms : 19
% 121.32/18.16 % Removed by relevancy pruning/SinE : 0
% 121.32/18.16 % Initial clauses : 40
% 121.32/18.16 % Removed in clause preprocessing : 4
% 121.32/18.16 % Initial clauses in saturation : 36
% 121.32/18.16 % Processed clauses : 11966
% 121.32/18.16 % ...of these trivial : 192
% 121.32/18.16 % ...subsumed : 8655
% 121.32/18.16 % ...remaining for further processing : 3119
% 121.32/18.16 % Other redundant clauses eliminated : 147
% 121.32/18.16 % Clauses deleted for lack of memory : 0
% 121.32/18.16 % Backward-subsumed : 373
% 121.32/18.16 % Backward-rewritten : 99
% 121.32/18.16 % Generated clauses : 332824
% 121.32/18.16 % ...of the previous two non-redundant : 322256
% 121.32/18.16 % ...aggressively subsumed : 0
% 121.32/18.16 % Contextual simplify-reflections : 1289
% 121.32/18.16 % Paramodulations : 332550
% 121.32/18.16 % Factorizations : 6
% 121.32/18.16 % NegExts : 0
% 121.32/18.16 % Equation resolutions : 246
% 121.32/18.16 % Disequality decompositions : 0
% 121.32/18.16 % Total rewrite steps : 105724
% 121.32/18.16 % ...of those cached : 105694
% 121.32/18.16 % Propositional unsat checks : 0
% 121.32/18.16 % Propositional check models : 0
% 121.32/18.16 % Propositional check unsatisfiable : 0
% 121.32/18.16 % Propositional clauses : 0
% 121.32/18.16 % Propositional clauses after purity: 0
% 121.32/18.16 % Propositional unsat core size : 0
% 121.32/18.16 % Propositional preprocessing time : 0.000
% 121.32/18.16 % Propositional encoding time : 0.000
% 121.32/18.16 % Propositional solver time : 0.000
% 121.32/18.16 % Success case prop preproc time : 0.000
% 121.32/18.16 % Success case prop encoding time : 0.000
% 121.32/18.16 % Success case prop solver time : 0.000
% 121.32/18.16 % Current number of processed clauses : 2623
% 121.32/18.16 % Positive orientable unit clauses : 29
% 121.32/18.16 % Positive unorientable unit clauses: 0
% 121.32/18.16 % Negative unit clauses : 8
% 121.32/18.16 % Non-unit-clauses : 2586
% 121.32/18.16 % Current number of unprocessed clauses: 306213
% 121.32/18.16 % ...number of literals in the above : 3141998
% 121.32/18.16 % Current number of archived formulas : 0
% 121.32/18.16 % Current number of archived clauses : 494
% 121.32/18.16 % Clause-clause subsumption calls (NU) : 2843788
% 121.32/18.16 % Rec. Clause-clause subsumption calls : 115230
% 121.32/18.16 % Non-unit clause-clause subsumptions : 8274
% 121.32/18.16 % Unit Clause-clause subsumption calls : 16692
% 121.32/18.16 % Rewrite failures with RHS unbound : 0
% 121.32/18.16 % BW rewrite match attempts : 49
% 121.32/18.16 % BW rewrite match successes : 18
% 121.32/18.16 % Condensation attempts : 0
% 121.32/18.16 % Condensation successes : 0
% 121.32/18.16 % Termbank termtop insertions : 12342500
% 121.32/18.16 % Search garbage collected termcells : 847
% 121.32/18.16
% 121.32/18.16 % -------------------------------------------------
% 121.32/18.16 % User time : 16.961 s
% 121.32/18.16 % System time : 0.410 s
% 121.32/18.16 % Total time : 17.371 s
% 121.32/18.16 % Maximum resident set size: 3648 pages
% 121.32/18.16
% 121.32/18.16 % -------------------------------------------------
% 121.32/18.16 % User time : 83.941 s
% 121.32/18.16 % System time : 2.121 s
% 121.32/18.16 % Total time : 86.061 s
% 121.32/18.16 % Maximum resident set size: 4864 pages
% 121.32/18.16 % E exiting
%------------------------------------------------------------------------------