%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM542+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 : n008.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:30 PM UTC 2026
% Result : Theorem 0.17s 5.59s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 6 unt; 0 def)
% Number of atoms : 229 ( 22 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 298 ( 129 ~; 128 |; 23 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccNum) ).
fof(mNatNSucc,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> X1 != szszuzczcdt0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNatNSucc) ).
fof(m__,conjecture,
( sdtlseqdt0(xm,xn)
<=> aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
fof(mLessSucc,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessSucc) ).
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sdtlseqdt0(szszuzczcdt0(X3),X1)
& aElementOf0(X3,szNzAzT0) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSeg) ).
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(m__1964,hypothesis,
( aElementOf0(xn,szNzAzT0)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1964) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessTotal) ).
fof(mLessTrans,axiom,
! [X1,X2,X3] :
( ( aElementOf0(X3,szNzAzT0)
& aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X3)
& sdtlseqdt0(X1,X2) )
=> sdtlseqdt0(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessTrans) ).
fof(c_0_10,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
fof(c_0_11,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> X1 != szszuzczcdt0(X1) ),
inference(fof_simplification,[status(thm)],[mNatNSucc]) ).
fof(c_0_12,negated_conjecture,
~ ( sdtlseqdt0(xm,xn)
<=> aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_13,plain,
! [X33,X34] :
( X33 = X34
| ~ sdtlseqdt0(X34,X33)
| ~ sdtlseqdt0(X33,X34)
| ~ aElementOf0(X34,szNzAzT0)
| ~ aElementOf0(X33,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
fof(c_0_14,plain,
! [X31] :
( sdtlseqdt0(X31,szszuzczcdt0(X31))
| ~ aElementOf0(X31,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessSucc])])]) ).
fof(c_0_15,plain,
! [X51] :
( ( ~ aElementOf0(X51,szNzAzT0)
| szszuzczcdt0(X51) != sz00 )
& ( ~ aElementOf0(X51,szNzAzT0)
| aElementOf0(szszuzczcdt0(X51),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_16,plain,
! [X44] :
( X44 != szszuzczcdt0(X44)
| ~ aElementOf0(X44,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_17,plain,
! [X18,X19,X20,X21,X22] :
( ( ~ aElementOf0(X18,szNzAzT0)
| X22 = slbdtrb0(X18)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X18,X22),X22)
| sdtlseqdt0(szszuzczcdt0(esk2_2(X18,X22)),X18) )
& ( ~ aElementOf0(X18,szNzAzT0)
| X22 = slbdtrb0(X18)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X18,X22),X22)
| aElementOf0(esk2_2(X18,X22),szNzAzT0) )
& ( ~ aElementOf0(X18,szNzAzT0)
| X22 = slbdtrb0(X18)
| ~ aSet0(X22)
| ~ sdtlseqdt0(szszuzczcdt0(esk2_2(X18,X22)),X18)
| ~ aElementOf0(esk2_2(X18,X22),szNzAzT0)
| ~ aElementOf0(esk2_2(X18,X22),X22) )
& ( ~ aElementOf0(X18,szNzAzT0)
| X19 != slbdtrb0(X18)
| aElementOf0(X21,X19)
| ~ sdtlseqdt0(szszuzczcdt0(X21),X18)
| ~ aElementOf0(X21,szNzAzT0) )
& ( ~ aElementOf0(X18,szNzAzT0)
| X19 != slbdtrb0(X18)
| ~ aElementOf0(X20,X19)
| sdtlseqdt0(szszuzczcdt0(X20),X18) )
& ( ~ aElementOf0(X18,szNzAzT0)
| X19 != slbdtrb0(X18)
| ~ aElementOf0(X20,X19)
| aElementOf0(X20,szNzAzT0) )
& ( ~ aElementOf0(X18,szNzAzT0)
| X19 != slbdtrb0(X18)
| aSet0(X19) ) ),
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)],[mDefSeg])])])])])])]) ).
fof(c_0_18,plain,
! [X5,X6,X7,X8] :
( ( ~ aSet0(X5)
| aSubsetOf0(X8,X5)
| ~ aSet0(X8)
| ~ aElementOf0(esk1_2(X5,X8),X5) )
& ( ~ aSet0(X5)
| aSubsetOf0(X8,X5)
| ~ aSet0(X8)
| aElementOf0(esk1_2(X5,X8),X8) )
& ( ~ aSet0(X5)
| ~ aSubsetOf0(X6,X5)
| aElementOf0(X7,X5)
| ~ aElementOf0(X7,X6) )
& ( ~ aSet0(X5)
| ~ aSubsetOf0(X6,X5)
| aSet0(X6) ) ),
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])])])])])])]) ).
fof(c_0_19,negated_conjecture,
( ( aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn))
| sdtlseqdt0(xm,xn) )
& ( ~ aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn))
| ~ sdtlseqdt0(xm,xn) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
cnf(c_0_20,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( X1 != szszuzczcdt0(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ aElementOf0(X1,X3)
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn))
| sdtlseqdt0(xm,xn) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X1 != slbdtrb0(X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_29,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ aSet0(slbdtrb0(xn))
| ~ aElementOf0(X1,slbdtrb0(xm))
| aElementOf0(X1,slbdtrb0(xn))
| sdtlseqdt0(xm,xn) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(slbdtrb0(X1)) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1964]) ).
cnf(c_0_33,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_34,plain,
! [X38,X39] :
( sdtlseqdt0(szszuzczcdt0(X39),X38)
| sdtlseqdt0(X38,X39)
| ~ aElementOf0(X39,szNzAzT0)
| ~ aElementOf0(X38,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
cnf(c_0_35,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( ~ aElementOf0(X1,slbdtrb0(xm))
| aElementOf0(X1,slbdtrb0(xn))
| sdtlseqdt0(xm,xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_37,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| aElementOf0(X1,slbdtrb0(X2)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_39,plain,
! [X35,X36,X37] :
( sdtlseqdt0(X35,X37)
| ~ sdtlseqdt0(X36,X37)
| ~ sdtlseqdt0(X35,X36)
| ~ aElementOf0(X37,szNzAzT0)
| ~ aElementOf0(X36,szNzAzT0)
| ~ aElementOf0(X35,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTrans])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ aElementOf0(xn,slbdtrb0(xm))
| sdtlseqdt0(xm,xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32])]) ).
cnf(c_0_41,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X2,slbdtrb0(X1))
| sdtlseqdt0(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1964]) ).
cnf(c_0_43,plain,
( ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
sdtlseqdt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_32])]) ).
cnf(c_0_45,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X1,xm)
| sdtlseqdt0(X1,xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_32]),c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),xm)
| aElementOf0(X1,slbdtrb0(xn)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_45]),c_0_32])]),c_0_22]) ).
cnf(c_0_47,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_48,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(xm))
| aElementOf0(X1,slbdtrb0(xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
( ~ aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn))
| ~ sdtlseqdt0(xm,xn) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_50,plain,
( ~ aElementOf0(X3,szNzAzT0)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_51,negated_conjecture,
( ~ aSet0(X1)
| ~ aSet0(slbdtrb0(xn))
| ~ aElementOf0(esk1_2(slbdtrb0(xn),X1),szNzAzT0)
| ~ aElementOf0(esk1_2(slbdtrb0(xn),X1),slbdtrb0(xm))
| aSubsetOf0(X1,slbdtrb0(xn)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_53,negated_conjecture,
~ aSubsetOf0(slbdtrb0(xm),slbdtrb0(xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_44])]) ).
cnf(c_0_54,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( ~ aSet0(slbdtrb0(xm))
| ~ aSet0(slbdtrb0(xn))
| ~ aElementOf0(esk1_2(slbdtrb0(xn),slbdtrb0(xm)),szNzAzT0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_56,plain,
( ~ aSet0(X2)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(esk1_2(X2,slbdtrb0(X1)),szNzAzT0)
| aSubsetOf0(slbdtrb0(X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_52]),c_0_31]) ).
cnf(c_0_57,negated_conjecture,
( ~ aSet0(slbdtrb0(xm))
| ~ aSet0(slbdtrb0(xn)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_42])]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
~ aSet0(slbdtrb0(xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_31]),c_0_32])]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM542+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.40 % Computer : n008.cluster.edu
% 0.16/5.40 % Model : x86_64 x86_64
% 0.16/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.40 % Memory : 8046.5625MB
% 0.16/5.40 % OS : Linux 6.8.0-71-generic
% 0.16/5.40 % CPULimit : 300
% 0.16/5.40 % WCLimit : 300
% 0.16/5.40 % DateTime : Mon Sep 21 02:39:30 UTC 2026
% 0.16/5.40 % CPUTime :
% 0.16/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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.17/5.59 % Version: 3.5.1
% 0.17/5.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.59 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.59 % Starting sh5l with 300s (1) cores
% 0.17/5.59 % new_bool_1 with pid 4161670 completed with status 0
% 0.17/5.59 % Result found by new_bool_1
% 0.17/5.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.59 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/5.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/5.59 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/5.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/5.59 % Starting SubtermCWHack with 31s (1) cores
% 0.17/5.59 % SubtermCWHack with pid 4161673 completed with status 0
% 0.17/5.59 % Result found by SubtermCWHack
% 0.17/5.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.59 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/5.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/5.59 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/5.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/5.59 % Starting SubtermCWHack with 31s (1) cores
% 0.17/5.59 % Preprocessing time : 0.002 s
% 0.17/5.59
% 0.17/5.59 % Proof found!
% 0.17/5.59 % SZS status Theorem
% 0.17/5.59 % SZS output start CNFRefutation
% See solution above
% 0.17/5.59 % Parsed axioms : 55
% 0.17/5.59 % Removed by relevancy pruning/SinE : 13
% 0.17/5.59 % Initial clauses : 64
% 0.17/5.59 % Removed in clause preprocessing : 4
% 0.17/5.59 % Initial clauses in saturation : 60
% 0.17/5.59 % Processed clauses : 1775
% 0.17/5.59 % ...of these trivial : 2
% 0.17/5.59 % ...subsumed : 1003
% 0.17/5.59 % ...remaining for further processing : 770
% 0.17/5.59 % Other redundant clauses eliminated : 16
% 0.17/5.59 % Clauses deleted for lack of memory : 0
% 0.17/5.59 % Backward-subsumed : 51
% 0.17/5.59 % Backward-rewritten : 31
% 0.17/5.59 % Generated clauses : 7995
% 0.17/5.59 % ...of the previous two non-redundant : 6357
% 0.17/5.59 % ...aggressively subsumed : 0
% 0.17/5.59 % Contextual simplify-reflections : 126
% 0.17/5.59 % Paramodulations : 7975
% 0.17/5.59 % Factorizations : 0
% 0.17/5.59 % NegExts : 0
% 0.17/5.59 % Equation resolutions : 20
% 0.17/5.59 % Disequality decompositions : 0
% 0.17/5.59 % Total rewrite steps : 5700
% 0.17/5.59 % ...of those cached : 5678
% 0.17/5.59 % Propositional unsat checks : 0
% 0.17/5.59 % Propositional check models : 0
% 0.17/5.59 % Propositional check unsatisfiable : 0
% 0.17/5.59 % Propositional clauses : 0
% 0.17/5.59 % Propositional clauses after purity: 0
% 0.17/5.59 % Propositional unsat core size : 0
% 0.17/5.59 % Propositional preprocessing time : 0.000
% 0.17/5.59 % Propositional encoding time : 0.000
% 0.17/5.59 % Propositional solver time : 0.000
% 0.17/5.59 % Success case prop preproc time : 0.000
% 0.17/5.59 % Success case prop encoding time : 0.000
% 0.17/5.59 % Success case prop solver time : 0.000
% 0.17/5.59 % Current number of processed clauses : 679
% 0.17/5.59 % Positive orientable unit clauses : 25
% 0.17/5.59 % Positive unorientable unit clauses: 0
% 0.17/5.59 % Negative unit clauses : 6
% 0.17/5.59 % Non-unit-clauses : 648
% 0.17/5.59 % Current number of unprocessed clauses: 4526
% 0.17/5.59 % ...number of literals in the above : 24909
% 0.17/5.59 % Current number of archived formulas : 0
% 0.17/5.59 % Current number of archived clauses : 82
% 0.17/5.59 % Clause-clause subsumption calls (NU) : 47072
% 0.17/5.59 % Rec. Clause-clause subsumption calls : 21325
% 0.17/5.59 % Non-unit clause-clause subsumptions : 1088
% 0.17/5.59 % Unit Clause-clause subsumption calls : 206
% 0.17/5.59 % Rewrite failures with RHS unbound : 0
% 0.17/5.59 % BW rewrite match attempts : 8
% 0.17/5.59 % BW rewrite match successes : 8
% 0.17/5.59 % Condensation attempts : 0
% 0.17/5.59 % Condensation successes : 0
% 0.17/5.59 % Termbank termtop insertions : 150842
% 0.17/5.59 % Search garbage collected termcells : 1170
% 0.17/5.59
% 0.17/5.59 % -------------------------------------------------
% 0.17/5.59 % User time : 0.111 s
% 0.17/5.59 % System time : 0.003 s
% 0.17/5.59 % Total time : 0.114 s
% 0.17/5.59 % Maximum resident set size: 3696 pages
% 0.17/5.59
% 0.17/5.59 % -------------------------------------------------
% 0.17/5.59 % User time : 0.112 s
% 0.17/5.59 % System time : 0.007 s
% 0.17/5.59 % Total time : 0.119 s
% 0.17/5.59 % Maximum resident set size: 4864 pages
% 0.17/5.59 % E exiting
%------------------------------------------------------------------------------