%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM595+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 : n009.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:55:38 PM UTC 2026
% Result : Theorem 0.46s 0.51s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 14 unt; 0 def)
% Number of atoms : 202 ( 44 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 253 ( 107 ~; 97 |; 35 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 12 con; 0-3 aty)
% Number of variables : 67 ( 3 sgn 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4826,hypothesis,
( xX != slcrc0
& xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4826) ).
fof(m__4618,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ? [X2] :
( ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
& aSet0(X3) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X3) = X2 )
& aElementOf0(X2,xT) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4618) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aSet0(X1) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sbrdtbr0(X4) = X2
& aSubsetOf0(X4,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(m__4806,hypothesis,
( sdtlpdtrp0(xd,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4806) ).
fof(m__4730,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
& aSet0(X2) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4730) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccNum) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(c_0_12,hypothesis,
( xX != slcrc0
& xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk) ),
inference(fof_simplification,[status(thm)],[m__4826]) ).
fof(c_0_13,hypothesis,
! [X31,X33] :
( ( ~ aElementOf0(X31,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X31),X33) = esk5_1(X31)
| ~ aElementOf0(X33,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X31)),xk))
| ~ aSet0(X33) )
& ( ~ aElementOf0(X31,szNzAzT0)
| aElementOf0(esk5_1(X31),xT) ) ),
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)],[m__4618])])])])])]) ).
fof(c_0_14,hypothesis,
( xX != slcrc0
& xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_15,negated_conjecture,
~ aElementOf0(xx,xT),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_16,plain,
! [X166,X167,X168,X169,X170,X171] :
( ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X171 = slbdtsldtrb0(X166,X167)
| ~ aSet0(X171)
| aElementOf0(esk19_3(X166,X167,X171),X171)
| sbrdtbr0(esk19_3(X166,X167,X171)) = X167 )
& ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X171 = slbdtsldtrb0(X166,X167)
| ~ aSet0(X171)
| aElementOf0(esk19_3(X166,X167,X171),X171)
| aSubsetOf0(esk19_3(X166,X167,X171),X166) )
& ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X171 = slbdtsldtrb0(X166,X167)
| ~ aSet0(X171)
| sbrdtbr0(esk19_3(X166,X167,X171)) != X167
| ~ aSubsetOf0(esk19_3(X166,X167,X171),X166)
| ~ aElementOf0(esk19_3(X166,X167,X171),X171) )
& ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X168 != slbdtsldtrb0(X166,X167)
| aElementOf0(X170,X168)
| sbrdtbr0(X170) != X167
| ~ aSubsetOf0(X170,X166) )
& ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X168 != slbdtsldtrb0(X166,X167)
| ~ aElementOf0(X169,X168)
| sbrdtbr0(X169) = X167 )
& ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X168 != slbdtsldtrb0(X166,X167)
| ~ aElementOf0(X169,X168)
| aSubsetOf0(X169,X166) )
& ( ~ aElementOf0(X167,szNzAzT0)
| ~ aSet0(X166)
| X168 != slbdtsldtrb0(X166,X167)
| aSet0(X168) ) ),
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)],[mDefSel])])])])])])]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),xk))
| ~ aSet0(X1)
| sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = esk5_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4806]) ).
fof(c_0_20,hypothesis,
! [X35,X36] :
( ( sdtlpdtrp0(xd,X35) = sdtlpdtrp0(sdtlpdtrp0(xC,X35),X36)
| ~ aElementOf0(X36,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X35)),xk))
| ~ aSet0(X36)
| ~ aElementOf0(X35,szNzAzT0) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])])]) ).
fof(c_0_21,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X4,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aElementOf0(X1,X3)
| aSubsetOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(esk5_1(X1),xT) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,xX)
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = esk5_1(xi) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,hypothesis,
( ~ aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
| ~ aSet0(X2)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,hypothesis,
sdtlpdtrp0(xd,xi) = xx,
inference(split_conjunct,[status(thm)],[m__4806]) ).
fof(c_0_27,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X54,X55,X56,X57] :
( ( ~ aSet0(X54)
| aSubsetOf0(X57,X54)
| ~ aSet0(X57)
| ~ aElementOf0(esk7_2(X54,X57),X54) )
& ( ~ aSet0(X54)
| aSubsetOf0(X57,X54)
| ~ aSet0(X57)
| aElementOf0(esk7_2(X54,X57),X57) )
& ( ~ aSet0(X54)
| ~ aSubsetOf0(X55,X54)
| aElementOf0(X56,X54)
| ~ aElementOf0(X56,X55) )
& ( ~ aSet0(X54)
| ~ aSubsetOf0(X55,X54)
| aSet0(X55) ) ),
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_29,plain,
( ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| aSubsetOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_30,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_31,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,xX)
| aElementOf0(sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1),xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19])]) ).
cnf(c_0_32,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,xX)
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_18]),c_0_26]),c_0_19])]) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_34,hypothesis,
! [X14] :
( ( ~ aElementOf0(X14,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X14)) )
& ( ~ aElementOf0(X14,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X14),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])]) ).
cnf(c_0_35,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X1 != slbdtsldtrb0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,hypothesis,
( ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xi)))
| ~ aElementOf0(X1,xX)
| aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xi))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_30])]) ).
cnf(c_0_38,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,xX) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_41,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
cnf(c_0_42,plain,
( ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| aSet0(slbdtsldtrb0(X1,X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_43,hypothesis,
( ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xi)))
| ~ aElementOf0(X1,xX) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_44,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_39]),c_0_40])]) ).
fof(c_0_45,plain,
! [X94] :
( ( ~ aElementOf0(X94,szNzAzT0)
| szszuzczcdt0(X94) != sz00 )
& ( ~ aElementOf0(X94,szNzAzT0)
| aElementOf0(szszuzczcdt0(X94),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
cnf(c_0_46,hypothesis,
( ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xi)))
| aSet0(xX) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_18]),c_0_30])]) ).
cnf(c_0_47,hypothesis,
( ~ aElementOf0(X1,xX)
| ~ aElementOf0(szszuzczcdt0(xi),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_49,plain,
! [X151,X152,X153] :
( ( X153 = slcrc0
| aElementOf0(esk17_1(X153),X153)
| ~ aSet0(X153) )
& ( X151 != slcrc0
| ~ aElementOf0(X152,X151) )
& ( X151 != slcrc0
| aSet0(X151) ) ),
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)],[mDefEmp])])])])])])]) ).
cnf(c_0_50,hypothesis,
( ~ aElementOf0(szszuzczcdt0(xi),szNzAzT0)
| aSet0(xX) ),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_51,hypothesis,
~ aElementOf0(X1,xX),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_19])]) ).
cnf(c_0_52,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk17_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,hypothesis,
aSet0(xX),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_19])]) ).
cnf(c_0_54,hypothesis,
xX != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[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 : NUM595+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.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:43:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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
% 0.46/0.51 % Version: 3.5.1
% 0.46/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.46/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.46/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.46/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.46/0.51 % Starting sh5l with 300s (1) cores
% 0.46/0.51 % new_bool_3 with pid 671983 completed with status 0
% 0.46/0.51 % Result found by new_bool_3
% 0.46/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.46/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.46/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.46/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.46/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.51 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.46/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.46/0.51 % SubtermCWHack with pid 671991 completed with status 0
% 0.46/0.51 % Result found by SubtermCWHack
% 0.46/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.46/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.46/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.46/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.46/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.51 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.46/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.46/0.51 % Preprocessing time : 0.004 s
% 0.46/0.51
% 0.46/0.51 % Proof found!
% 0.46/0.51 % SZS status Theorem
% 0.46/0.51 % SZS output start CNFRefutation
% See solution above
% 0.46/0.51 % Parsed axioms : 97
% 0.46/0.51 % Removed by relevancy pruning/SinE : 5
% 0.46/0.51 % Initial clauses : 177
% 0.46/0.51 % Removed in clause preprocessing : 7
% 0.46/0.51 % Initial clauses in saturation : 170
% 0.46/0.51 % Processed clauses : 835
% 0.46/0.51 % ...of these trivial : 3
% 0.46/0.51 % ...subsumed : 301
% 0.46/0.51 % ...remaining for further processing : 531
% 0.46/0.51 % Other redundant clauses eliminated : 36
% 0.46/0.51 % Clauses deleted for lack of memory : 0
% 0.46/0.51 % Backward-subsumed : 69
% 0.46/0.51 % Backward-rewritten : 10
% 0.46/0.51 % Generated clauses : 1853
% 0.46/0.51 % ...of the previous two non-redundant : 1633
% 0.46/0.51 % ...aggressively subsumed : 0
% 0.46/0.51 % Contextual simplify-reflections : 34
% 0.46/0.51 % Paramodulations : 1819
% 0.46/0.51 % Factorizations : 0
% 0.46/0.51 % NegExts : 0
% 0.46/0.51 % Equation resolutions : 38
% 0.46/0.51 % Disequality decompositions : 0
% 0.46/0.51 % Total rewrite steps : 1127
% 0.46/0.51 % ...of those cached : 1068
% 0.46/0.51 % Propositional unsat checks : 0
% 0.46/0.51 % Propositional check models : 0
% 0.46/0.51 % Propositional check unsatisfiable : 0
% 0.46/0.51 % Propositional clauses : 0
% 0.46/0.51 % Propositional clauses after purity: 0
% 0.46/0.51 % Propositional unsat core size : 0
% 0.46/0.51 % Propositional preprocessing time : 0.000
% 0.46/0.51 % Propositional encoding time : 0.000
% 0.46/0.51 % Propositional solver time : 0.000
% 0.46/0.51 % Success case prop preproc time : 0.000
% 0.46/0.51 % Success case prop encoding time : 0.000
% 0.46/0.51 % Success case prop solver time : 0.000
% 0.46/0.51 % Current number of processed clauses : 425
% 0.46/0.51 % Positive orientable unit clauses : 69
% 0.46/0.51 % Positive unorientable unit clauses: 0
% 0.46/0.51 % Negative unit clauses : 23
% 0.46/0.51 % Non-unit-clauses : 333
% 0.46/0.51 % Current number of unprocessed clauses: 946
% 0.46/0.51 % ...number of literals in the above : 5172
% 0.46/0.51 % Current number of archived formulas : 0
% 0.46/0.51 % Current number of archived clauses : 79
% 0.46/0.51 % Clause-clause subsumption calls (NU) : 15212
% 0.46/0.51 % Rec. Clause-clause subsumption calls : 7119
% 0.46/0.51 % Non-unit clause-clause subsumptions : 235
% 0.46/0.51 % Unit Clause-clause subsumption calls : 988
% 0.46/0.51 % Rewrite failures with RHS unbound : 0
% 0.46/0.51 % BW rewrite match attempts : 7
% 0.46/0.51 % BW rewrite match successes : 7
% 0.46/0.51 % Condensation attempts : 0
% 0.46/0.51 % Condensation successes : 0
% 0.46/0.51 % Termbank termtop insertions : 45649
% 0.46/0.51 % Search garbage collected termcells : 3309
% 0.46/0.51
% 0.46/0.51 % -------------------------------------------------
% 0.46/0.51 % User time : 0.080 s
% 0.46/0.51 % System time : 0.009 s
% 0.46/0.51 % Total time : 0.089 s
% 0.46/0.51 % Maximum resident set size: 4272 pages
% 0.46/0.51
% 0.46/0.51 % -------------------------------------------------
% 0.46/0.51 % User time : 0.084 s
% 0.46/0.51 % System time : 0.014 s
% 0.46/0.51 % Total time : 0.097 s
% 0.46/0.51 % Maximum resident set size: 4608 pages
% 0.46/0.51 % E exiting
%------------------------------------------------------------------------------