%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM558+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 : n006.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:33 PM UTC 2026
% Result : Theorem 0.32s 0.66s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 22 unt; 0 def)
% Number of atoms : 294 ( 59 equ)
% Maximal formula atoms : 54 ( 5 avg)
% Number of connectives : 401 ( 163 ~; 169 |; 52 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2227,hypothesis,
( slbdtsldtrb0(xS,xk) != slcrc0
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2227) ).
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(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__2202_02,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).
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(m__2256,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2256) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2378,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2378) ).
fof(m__2357,hypothesis,
xP = sdtpldt0(sdtmndt0(xQ,xy),xx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2357) ).
fof(m__2304,hypothesis,
( aElementOf0(xy,xQ)
& aElement0(xy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2304) ).
fof(m__2291,hypothesis,
( sbrdtbr0(xQ) = xk
& isFinite0(xQ)
& aSet0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2291) ).
fof(c_0_14,hypothesis,
( slbdtsldtrb0(xS,xk) != slcrc0
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
inference(fof_simplification,[status(thm)],[m__2227]) ).
fof(c_0_15,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])])])])])])]) ).
fof(c_0_16,hypothesis,
( slbdtsldtrb0(xS,xk) != slcrc0
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X118,X119,X120,X121,X122,X123] :
( ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X123 = slbdtsldtrb0(X118,X119)
| ~ aSet0(X123)
| aElementOf0(esk11_3(X118,X119,X123),X123)
| sbrdtbr0(esk11_3(X118,X119,X123)) = X119 )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X123 = slbdtsldtrb0(X118,X119)
| ~ aSet0(X123)
| aElementOf0(esk11_3(X118,X119,X123),X123)
| aSubsetOf0(esk11_3(X118,X119,X123),X118) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X123 = slbdtsldtrb0(X118,X119)
| ~ aSet0(X123)
| sbrdtbr0(esk11_3(X118,X119,X123)) != X119
| ~ aSubsetOf0(esk11_3(X118,X119,X123),X118)
| ~ aElementOf0(esk11_3(X118,X119,X123),X123) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| aElementOf0(X122,X120)
| sbrdtbr0(X122) != X119
| ~ aSubsetOf0(X122,X118) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| ~ aElementOf0(X121,X120)
| sbrdtbr0(X121) = X119 )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| ~ aElementOf0(X121,X120)
| aSubsetOf0(X121,X118) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| aSet0(X120) ) ),
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])])])])])])]) ).
fof(c_0_18,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_19,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X1 != slbdtsldtrb0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X4,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aElementOf0(X1,X3)
| aSubsetOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ aSet0(slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| aSet0(slbdtsldtrb0(X1,X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_27,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,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_29,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_30,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_31,plain,
( ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| aSubsetOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_32,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
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_33,plain,
( ~ aElement0(X2)
| ~ aSet0(X4)
| X3 != sdtpldt0(X4,X2)
| ~ aElement0(X1)
| X1 != X2
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__2256]) ).
cnf(c_0_36,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_37,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_30])])])])])])]) ).
fof(c_0_38,negated_conjecture,
~ aElementOf0(xx,xT),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_39,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_40,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[m__2378]) ).
cnf(c_0_41,plain,
( ~ aSet0(X2)
| ~ aElement0(X1)
| aElementOf0(X1,sdtpldt0(X2,X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]) ).
cnf(c_0_42,hypothesis,
xP = sdtpldt0(sdtmndt0(xQ,xy),xx),
inference(split_conjunct,[status(thm)],[m__2357]) ).
cnf(c_0_43,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_44,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X1 != sdtmndt0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_45,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
cnf(c_0_46,hypothesis,
aSubsetOf0(xP,xT),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,hypothesis,
( ~ aSet0(sdtmndt0(xQ,xy))
| aElementOf0(xx,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_48,plain,
( ~ aSet0(X1)
| ~ aElement0(X2)
| aSet0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_49,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__2304]) ).
cnf(c_0_50,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[m__2291]) ).
fof(c_0_51,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_45]) ).
cnf(c_0_52,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_46]),c_0_27])]) ).
cnf(c_0_53,hypothesis,
aElementOf0(xx,xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM558+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n006.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 02:39:42 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.53 Running first-order theorem proving
% 0.26/0.53 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.32/0.66 % Version: 3.5.1
% 0.32/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.66 % Starting sh5l with 300s (1) cores
% 0.32/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1827898 completed with status 0
% 0.32/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.32/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.66 % No SInE strategy applied
% 0.32/0.66 % Search class: FGHSF-FSMM31-MFFFFFNN
% 0.32/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.32/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.32/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.32/0.66 % Starting new_bool_1 with 136s (1) cores
% 0.32/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1827904 completed with status 0
% 0.32/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.32/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.66 % No SInE strategy applied
% 0.32/0.66 % Search class: FGHSF-FSMM31-MFFFFFNN
% 0.32/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.32/0.66 % Preprocessing time : 0.003 s
% 0.32/0.66 % Presaturation interreduction done
% 0.32/0.66
% 0.32/0.66 % Proof found!
% 0.32/0.66 % SZS status Theorem
% 0.32/0.66 % SZS output start CNFRefutation
% See solution above
% 0.32/0.66 % Parsed axioms : 72
% 0.32/0.66 % Removed by relevancy pruning/SinE : 0
% 0.32/0.66 % Initial clauses : 128
% 0.32/0.66 % Removed in clause preprocessing : 6
% 0.32/0.66 % Initial clauses in saturation : 122
% 0.32/0.66 % Processed clauses : 462
% 0.32/0.66 % ...of these trivial : 2
% 0.32/0.66 % ...subsumed : 72
% 0.32/0.66 % ...remaining for further processing : 388
% 0.32/0.66 % Other redundant clauses eliminated : 34
% 0.32/0.66 % Clauses deleted for lack of memory : 0
% 0.32/0.66 % Backward-subsumed : 7
% 0.32/0.66 % Backward-rewritten : 10
% 0.32/0.66 % Generated clauses : 756
% 0.32/0.66 % ...of the previous two non-redundant : 659
% 0.32/0.66 % ...aggressively subsumed : 0
% 0.32/0.66 % Contextual simplify-reflections : 24
% 0.32/0.66 % Paramodulations : 724
% 0.32/0.66 % Factorizations : 0
% 0.32/0.66 % NegExts : 0
% 0.32/0.66 % Equation resolutions : 35
% 0.32/0.66 % Disequality decompositions : 0
% 0.32/0.66 % Total rewrite steps : 409
% 0.32/0.66 % ...of those cached : 379
% 0.32/0.66 % Propositional unsat checks : 0
% 0.32/0.66 % Propositional check models : 0
% 0.32/0.66 % Propositional check unsatisfiable : 0
% 0.32/0.66 % Propositional clauses : 0
% 0.32/0.66 % Propositional clauses after purity: 0
% 0.32/0.66 % Propositional unsat core size : 0
% 0.32/0.66 % Propositional preprocessing time : 0.000
% 0.32/0.66 % Propositional encoding time : 0.000
% 0.32/0.66 % Propositional solver time : 0.000
% 0.32/0.66 % Success case prop preproc time : 0.000
% 0.32/0.66 % Success case prop encoding time : 0.000
% 0.32/0.66 % Success case prop solver time : 0.000
% 0.32/0.66 % Current number of processed clauses : 223
% 0.32/0.66 % Positive orientable unit clauses : 39
% 0.32/0.66 % Positive unorientable unit clauses: 0
% 0.32/0.66 % Negative unit clauses : 11
% 0.32/0.66 % Non-unit-clauses : 173
% 0.32/0.66 % Current number of unprocessed clauses: 433
% 0.32/0.66 % ...number of literals in the above : 2580
% 0.32/0.66 % Current number of archived formulas : 0
% 0.32/0.66 % Current number of archived clauses : 138
% 0.32/0.66 % Clause-clause subsumption calls (NU) : 5407
% 0.32/0.66 % Rec. Clause-clause subsumption calls : 1920
% 0.32/0.66 % Non-unit clause-clause subsumptions : 80
% 0.32/0.66 % Unit Clause-clause subsumption calls : 457
% 0.32/0.66 % Rewrite failures with RHS unbound : 0
% 0.32/0.66 % BW rewrite match attempts : 10
% 0.32/0.66 % BW rewrite match successes : 10
% 0.32/0.66 % Condensation attempts : 0
% 0.32/0.66 % Condensation successes : 0
% 0.32/0.66 % Termbank termtop insertions : 23944
% 0.32/0.66 % Search garbage collected termcells : 2310
% 0.32/0.66
% 0.32/0.66 % -------------------------------------------------
% 0.32/0.66 % User time : 0.046 s
% 0.32/0.66 % System time : 0.009 s
% 0.32/0.66 % Total time : 0.055 s
% 0.32/0.66 % Maximum resident set size: 3708 pages
% 0.32/0.66
% 0.32/0.66 % -------------------------------------------------
% 0.32/0.66 % User time : 0.130 s
% 0.32/0.66 % System time : 0.023 s
% 0.32/0.66 % Total time : 0.153 s
% 0.32/0.66 % Maximum resident set size: 4608 pages
% 0.32/0.66 % E exiting
%------------------------------------------------------------------------------