%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM595+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 : 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:49:42 PM UTC 2026
% Result : Theorem 0.17s 0.52s
% Output : CNFRefutation 0.17s
% 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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__4618) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(m__4806,hypothesis,
( sdtlpdtrp0(xd,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__3671) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccNum) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/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,
! [X201,X203] :
( ( ~ aElementOf0(X201,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X201),X203) = esk24_1(X201)
| ~ aElementOf0(X203,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X201)),xk))
| ~ aSet0(X203) )
& ( ~ aElementOf0(X201,szNzAzT0)
| aElementOf0(esk24_1(X201),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,
! [X120,X121,X122,X123,X124,X125] :
( ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| aSubsetOf0(esk11_3(X120,X121,X125),X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| ~ aElementOf0(esk11_3(X120,X121,X125),X125) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aElementOf0(X124,X122)
| sbrdtbr0(X124) != X121
| ~ aSubsetOf0(X124,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| sbrdtbr0(X123) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| aSubsetOf0(X123,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aSet0(X122) ) ),
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) = esk24_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,
! [X205,X206] :
( ( sdtlpdtrp0(xd,X205) = sdtlpdtrp0(sdtlpdtrp0(xC,X205),X206)
| ~ aElementOf0(X206,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X205)),xk))
| ~ aSet0(X206)
| ~ aElementOf0(X205,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(esk24_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) = esk24_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,
! [X19,X20,X21,X22] :
( ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| ~ aElementOf0(esk2_2(X19,X22),X19) )
& ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X19,X22),X22) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aElementOf0(X21,X19)
| ~ aElementOf0(X21,X20) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aSet0(X20) ) ),
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,
! [X184] :
( ( ~ aElementOf0(X184,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X184)) )
& ( ~ aElementOf0(X184,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X184),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,
! [X58] :
( ( ~ aElementOf0(X58,szNzAzT0)
| szszuzczcdt0(X58) != sz00 )
& ( ~ aElementOf0(X58,szNzAzT0)
| aElementOf0(szszuzczcdt0(X58),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,
! [X12,X13,X14] :
( ( X14 = slcrc0
| aElementOf0(esk1_1(X14),X14)
| ~ aSet0(X14) )
& ( X12 != slcrc0
| ~ aElementOf0(X13,X12) )
& ( X12 != slcrc0
| aSet0(X12) ) ),
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(esk1_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.02 % Problem : NUM595+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.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 02:43:13 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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/0.52 % Version: 3.5.1
% 0.17/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 % Starting sh5l with 300s (1) cores
% 0.17/0.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 672068 completed with status 0
% 0.17/0.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.52 % No SInE strategy applied
% 0.17/0.52 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.17/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.52 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.17/0.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.17/0.52 % SubtermCWHack with pid 672080 completed with status 0
% 0.17/0.52 % Result found by SubtermCWHack
% 0.17/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.52 % No SInE strategy applied
% 0.17/0.52 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.17/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.52 % Preprocessing time : 0.003 s
% 0.17/0.52
% 0.17/0.52 % Proof found!
% 0.17/0.52 % SZS status Theorem
% 0.17/0.52 % SZS output start CNFRefutation
% See solution above
% 0.17/0.52 % Parsed axioms : 97
% 0.17/0.52 % Removed by relevancy pruning/SinE : 0
% 0.17/0.52 % Initial clauses : 196
% 0.17/0.52 % Removed in clause preprocessing : 7
% 0.17/0.52 % Initial clauses in saturation : 189
% 0.17/0.52 % Processed clauses : 1064
% 0.17/0.52 % ...of these trivial : 3
% 0.17/0.52 % ...subsumed : 418
% 0.17/0.52 % ...remaining for further processing : 643
% 0.17/0.52 % Other redundant clauses eliminated : 53
% 0.17/0.52 % Clauses deleted for lack of memory : 0
% 0.17/0.52 % Backward-subsumed : 122
% 0.17/0.52 % Backward-rewritten : 11
% 0.17/0.52 % Generated clauses : 2392
% 0.17/0.52 % ...of the previous two non-redundant : 2143
% 0.17/0.52 % ...aggressively subsumed : 0
% 0.17/0.52 % Contextual simplify-reflections : 42
% 0.17/0.52 % Paramodulations : 2342
% 0.17/0.52 % Factorizations : 0
% 0.17/0.52 % NegExts : 0
% 0.17/0.52 % Equation resolutions : 55
% 0.17/0.52 % Disequality decompositions : 0
% 0.17/0.52 % Total rewrite steps : 1402
% 0.17/0.52 % ...of those cached : 1342
% 0.17/0.52 % Propositional unsat checks : 0
% 0.17/0.52 % Propositional check models : 0
% 0.17/0.52 % Propositional check unsatisfiable : 0
% 0.17/0.52 % Propositional clauses : 0
% 0.17/0.52 % Propositional clauses after purity: 0
% 0.17/0.52 % Propositional unsat core size : 0
% 0.17/0.52 % Propositional preprocessing time : 0.000
% 0.17/0.52 % Propositional encoding time : 0.000
% 0.17/0.52 % Propositional solver time : 0.000
% 0.17/0.52 % Success case prop preproc time : 0.000
% 0.17/0.52 % Success case prop encoding time : 0.000
% 0.17/0.52 % Success case prop solver time : 0.000
% 0.17/0.52 % Current number of processed clauses : 470
% 0.17/0.52 % Positive orientable unit clauses : 68
% 0.17/0.52 % Positive unorientable unit clauses: 0
% 0.17/0.52 % Negative unit clauses : 22
% 0.17/0.52 % Non-unit-clauses : 380
% 0.17/0.52 % Current number of unprocessed clauses: 1235
% 0.17/0.52 % ...number of literals in the above : 6856
% 0.17/0.52 % Current number of archived formulas : 0
% 0.17/0.52 % Current number of archived clauses : 133
% 0.17/0.52 % Clause-clause subsumption calls (NU) : 26840
% 0.17/0.52 % Rec. Clause-clause subsumption calls : 12268
% 0.17/0.52 % Non-unit clause-clause subsumptions : 349
% 0.17/0.52 % Unit Clause-clause subsumption calls : 1261
% 0.17/0.52 % Rewrite failures with RHS unbound : 0
% 0.17/0.52 % BW rewrite match attempts : 8
% 0.17/0.52 % BW rewrite match successes : 8
% 0.17/0.52 % Condensation attempts : 0
% 0.17/0.52 % Condensation successes : 0
% 0.17/0.52 % Termbank termtop insertions : 56083
% 0.17/0.52 % Search garbage collected termcells : 3708
% 0.17/0.52
% 0.17/0.52 % -------------------------------------------------
% 0.17/0.52 % User time : 0.063 s
% 0.17/0.52 % System time : 0.011 s
% 0.17/0.52 % Total time : 0.074 s
% 0.17/0.52 % Maximum resident set size: 4272 pages
% 0.17/0.52
% 0.17/0.52 % -------------------------------------------------
% 0.17/0.52 % User time : 0.253 s
% 0.17/0.52 % System time : 0.033 s
% 0.17/0.52 % Total time : 0.286 s
% 0.17/0.52 % Maximum resident set size: 4608 pages
% 0.17/0.52 % E exiting
%------------------------------------------------------------------------------