TSTP Solution File: NUM633+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM633+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:56:44 EDT 2023
% Result : Theorem 38.98s 5.50s
% Output : CNFRefutation 38.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 343 ( 65 equ)
% Maximal formula atoms : 229 ( 15 avg)
% Number of connectives : 509 ( 188 ~; 198 |; 103 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 69 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn; 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xO) ) )
| aSubsetOf0(X1,xO) )
& sbrdtbr0(X1) = xK )
| aElementOf0(X1,slbdtsldtrb0(xO,xK)) )
=> ( ~ ( ~ ? [X2] : aElementOf0(X2,X1)
| X1 = slcrc0 )
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(X1,szNzAzT0)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.flo8PtIdCu/E---3.1_29007.p',m__) ).
fof(m__4998,hypothesis,
( ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
file('/export/starexec/sandbox/tmp/tmp.flo8PtIdCu/E---3.1_29007.p',m__4998) ).
fof(m__4908,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/tmp/tmp.flo8PtIdCu/E---3.1_29007.p',m__4908) ).
fof(m__4854,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( aElementOf0(X1,szDzozmdt0(xd))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.flo8PtIdCu/E---3.1_29007.p',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xO) ) )
| aSubsetOf0(X1,xO) )
& sbrdtbr0(X1) = xK )
| aElementOf0(X1,slbdtsldtrb0(xO,xK)) )
=> ( ~ ( ~ ? [X2] : aElementOf0(X2,X1)
| X1 = slcrc0 )
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(X1,szNzAzT0)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X246,X249,X250,X251,X252,X253,X256] :
( ( aElementOf0(esk41_1(X246),X246)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( X246 != slcrc0
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,szNzAzT0)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(X246,szDzozmdt0(xc))
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(esk41_1(X246),X246)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( X246 != slcrc0
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,szNzAzT0)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(X246,szDzozmdt0(xc))
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(esk41_1(X246),X246)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( X246 != slcrc0
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,szNzAzT0)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(X246,szDzozmdt0(xc))
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(esk41_1(X246),X246)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( X246 != slcrc0
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X246,szNzAzT0)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(X246,szDzozmdt0(xc))
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSet0(esk43_2(X252,X253))
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( ~ aElementOf0(X256,esk43_2(X252,X253))
| aElementOf0(X256,X253)
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSubsetOf0(esk43_2(X252,X253),X253)
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sbrdtbr0(esk43_2(X252,X253)) = xK
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aElementOf0(esk43_2(X252,X253),slbdtsldtrb0(X253,xK))
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sdtlpdtrp0(xc,esk43_2(X252,X253)) != X252
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSet0(esk43_2(X252,X253))
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( ~ aElementOf0(X256,esk43_2(X252,X253))
| aElementOf0(X256,X253)
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSubsetOf0(esk43_2(X252,X253),X253)
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sbrdtbr0(esk43_2(X252,X253)) = xK
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aElementOf0(esk43_2(X252,X253),slbdtsldtrb0(X253,xK))
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sdtlpdtrp0(xc,esk43_2(X252,X253)) != X252
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSet0(esk43_2(X252,X253))
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( ~ aElementOf0(X256,esk43_2(X252,X253))
| aElementOf0(X256,X253)
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSubsetOf0(esk43_2(X252,X253),X253)
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sbrdtbr0(esk43_2(X252,X253)) = xK
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aElementOf0(esk43_2(X252,X253),slbdtsldtrb0(X253,xK))
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sdtlpdtrp0(xc,esk43_2(X252,X253)) != X252
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_6,hypothesis,
! [X245] :
( ( ~ aElementOf0(X245,xO)
| aElementOf0(X245,xS) )
& aSubsetOf0(xO,xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])]) ).
cnf(c_0_7,negated_conjecture,
( aSubsetOf0(esk43_2(X1,X2),X2)
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[m__4908]) ).
fof(c_0_10,hypothesis,
! [X236] :
( aElementOf0(szDzizrdt0(xd),xT)
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( aElementOf0(X236,szDzozmdt0(xd))
| ~ aElementOf0(X236,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xd,X236) = szDzizrdt0(xd)
| ~ aElementOf0(X236,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X236,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X236) != szDzizrdt0(xd)
| aElementOf0(X236,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4854])])])]) ).
cnf(c_0_11,negated_conjecture,
( sbrdtbr0(esk43_2(X1,X2)) = xK
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,hypothesis,
( aSubsetOf0(esk43_2(X1,xO),xO)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_13,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
( sbrdtbr0(esk43_2(X1,xO)) = xK
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_8]),c_0_9])]) ).
cnf(c_0_15,negated_conjecture,
( sdtlpdtrp0(xc,esk43_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aSubsetOf0(X1,xO)
| sbrdtbr0(X1) != xK ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(esk43_2(szDzizrdt0(xd),xO),xO),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
sbrdtbr0(esk43_2(szDzizrdt0(xd),xO)) = xK,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,hypothesis,
( sdtlpdtrp0(xc,esk43_2(X1,xO)) != X1
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_8]),c_0_9])]) ).
cnf(c_0_20,negated_conjecture,
sdtlpdtrp0(xc,esk43_2(szDzizrdt0(xd),xO)) = szDzizrdt0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : NUM633+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n031.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 14:38:13 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/tmp/tmp.flo8PtIdCu/E---3.1_29007.p
% 38.98/5.50 # Version: 3.1pre001
% 38.98/5.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 38.98/5.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.98/5.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 38.98/5.50 # Starting new_bool_3 with 300s (1) cores
% 38.98/5.50 # Starting new_bool_1 with 300s (1) cores
% 38.98/5.50 # Starting sh5l with 300s (1) cores
% 38.98/5.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29085 completed with status 0
% 38.98/5.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 38.98/5.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 38.98/5.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.98/5.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 38.98/5.50 # No SInE strategy applied
% 38.98/5.50 # Search class: FGHSF-SMLM32-MFFFFFNN
% 38.98/5.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 38.98/5.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 38.98/5.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 38.98/5.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 38.98/5.50 # Starting new_bool_3 with 136s (1) cores
% 38.98/5.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 38.98/5.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 29091 completed with status 0
% 38.98/5.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 38.98/5.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 38.98/5.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.98/5.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 38.98/5.50 # No SInE strategy applied
% 38.98/5.50 # Search class: FGHSF-SMLM32-MFFFFFNN
% 38.98/5.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 38.98/5.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 38.98/5.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 38.98/5.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 38.98/5.50 # Preprocessing time : 0.140 s
% 38.98/5.50 # Presaturation interreduction done
% 38.98/5.50
% 38.98/5.50 # Proof found!
% 38.98/5.50 # SZS status Theorem
% 38.98/5.50 # SZS output start CNFRefutation
% See solution above
% 38.98/5.50 # Parsed axioms : 99
% 38.98/5.50 # Removed by relevancy pruning/SinE : 0
% 38.98/5.50 # Initial clauses : 4934
% 38.98/5.50 # Removed in clause preprocessing : 7
% 38.98/5.50 # Initial clauses in saturation : 4927
% 38.98/5.50 # Processed clauses : 7802
% 38.98/5.50 # ...of these trivial : 39
% 38.98/5.50 # ...subsumed : 1047
% 38.98/5.50 # ...remaining for further processing : 6716
% 38.98/5.50 # Other redundant clauses eliminated : 2046
% 38.98/5.50 # Clauses deleted for lack of memory : 0
% 38.98/5.50 # Backward-subsumed : 26
% 38.98/5.50 # Backward-rewritten : 31
% 38.98/5.50 # Generated clauses : 5100
% 38.98/5.50 # ...of the previous two non-redundant : 4869
% 38.98/5.50 # ...aggressively subsumed : 0
% 38.98/5.50 # Contextual simplify-reflections : 78
% 38.98/5.50 # Paramodulations : 3252
% 38.98/5.50 # Factorizations : 0
% 38.98/5.50 # NegExts : 0
% 38.98/5.50 # Equation resolutions : 2048
% 38.98/5.50 # Total rewrite steps : 2168
% 38.98/5.50 # Propositional unsat checks : 2
% 38.98/5.50 # Propositional check models : 2
% 38.98/5.50 # Propositional check unsatisfiable : 0
% 38.98/5.50 # Propositional clauses : 0
% 38.98/5.50 # Propositional clauses after purity: 0
% 38.98/5.50 # Propositional unsat core size : 0
% 38.98/5.50 # Propositional preprocessing time : 0.000
% 38.98/5.50 # Propositional encoding time : 0.029
% 38.98/5.50 # Propositional solver time : 0.001
% 38.98/5.50 # Success case prop preproc time : 0.000
% 38.98/5.50 # Success case prop encoding time : 0.000
% 38.98/5.50 # Success case prop solver time : 0.000
% 38.98/5.50 # Current number of processed clauses : 799
% 38.98/5.50 # Positive orientable unit clauses : 266
% 38.98/5.50 # Positive unorientable unit clauses: 0
% 38.98/5.50 # Negative unit clauses : 29
% 38.98/5.50 # Non-unit-clauses : 504
% 38.98/5.50 # Current number of unprocessed clauses: 5977
% 38.98/5.50 # ...number of literals in the above : 49491
% 38.98/5.50 # Current number of archived formulas : 0
% 38.98/5.50 # Current number of archived clauses : 4071
% 38.98/5.50 # Clause-clause subsumption calls (NU) : 6888527
% 38.98/5.50 # Rec. Clause-clause subsumption calls : 90889
% 38.98/5.50 # Non-unit clause-clause subsumptions : 1077
% 38.98/5.50 # Unit Clause-clause subsumption calls : 8211
% 38.98/5.50 # Rewrite failures with RHS unbound : 0
% 38.98/5.50 # BW rewrite match attempts : 58
% 38.98/5.50 # BW rewrite match successes : 10
% 38.98/5.50 # Condensation attempts : 0
% 38.98/5.50 # Condensation successes : 0
% 38.98/5.50 # Termbank termtop insertions : 908032
% 38.98/5.50
% 38.98/5.50 # -------------------------------------------------
% 38.98/5.50 # User time : 4.964 s
% 38.98/5.50 # System time : 0.031 s
% 38.98/5.50 # Total time : 4.995 s
% 38.98/5.50 # Maximum resident set size: 14300 pages
% 38.98/5.50
% 38.98/5.50 # -------------------------------------------------
% 38.98/5.50 # User time : 24.135 s
% 38.98/5.50 # System time : 0.109 s
% 38.98/5.50 # Total time : 24.245 s
% 38.98/5.50 # Maximum resident set size: 1856 pages
% 38.98/5.50 % E---3.1 exiting
% 38.98/5.50 % E---3.1 exiting
%------------------------------------------------------------------------------