TSTP Solution File: NUM582+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM582+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:28 EDT 2023
% Result : Theorem 35.69s 5.06s
% Output : CNFRefutation 35.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 246 ( 12 equ)
% Maximal formula atoms : 181 ( 12 avg)
% Number of connectives : 379 ( 152 ~; 161 |; 54 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> aElementOf0(X3,sdtlpdtrp0(xN,X2)) )
& aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IrUsqBX7DQ/E---3.1_4344.p',m__3754) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( ( ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X2)
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& X2 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IrUsqBX7DQ/E---3.1_4344.p',m__3623) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox/tmp/tmp.IrUsqBX7DQ/E---3.1_4344.p',mZeroLess) ).
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox/tmp/tmp.IrUsqBX7DQ/E---3.1_4344.p',m__) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.IrUsqBX7DQ/E---3.1_4344.p',mZeroNum) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.IrUsqBX7DQ/E---3.1_4344.p',m__3989) ).
fof(c_0_6,hypothesis,
! [X69,X70,X71] :
( ( ~ aElementOf0(X71,sdtlpdtrp0(xN,X69))
| aElementOf0(X71,sdtlpdtrp0(xN,X70))
| ~ sdtlseqdt0(X70,X69)
| ~ aElementOf0(X69,szNzAzT0)
| ~ aElementOf0(X70,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X69),sdtlpdtrp0(xN,X70))
| ~ sdtlseqdt0(X70,X69)
| ~ aElementOf0(X69,szNzAzT0)
| ~ aElementOf0(X70,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])])]) ).
fof(c_0_7,hypothesis,
! [X82,X84,X85,X86,X87] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X82)),sdtlpdtrp0(xN,X82))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElementOf0(X84,sdtlpdtrp0(xN,X82))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X82)),X84)
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElement0(X85)
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElementOf0(X85,sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( X85 != szmzizndt0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElement0(X86)
| ~ aElementOf0(X86,sdtlpdtrp0(xN,X82))
| X86 = szmzizndt0(sdtlpdtrp0(xN,X82))
| aElementOf0(X86,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElementOf0(X87,sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| aElementOf0(X87,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X82)),sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| aElementOf0(esk15_1(X82),sdtlpdtrp0(xN,X82))
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X82)),sdtlpdtrp0(xN,X82))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElementOf0(X84,sdtlpdtrp0(xN,X82))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X82)),X84)
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElement0(X85)
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElementOf0(X85,sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( X85 != szmzizndt0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElement0(X86)
| ~ aElementOf0(X86,sdtlpdtrp0(xN,X82))
| X86 = szmzizndt0(sdtlpdtrp0(xN,X82))
| aElementOf0(X86,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElementOf0(X87,sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| aElementOf0(X87,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X82)),sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| ~ aElementOf0(esk15_1(X82),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X82))
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X82)),sdtlpdtrp0(xN,X82))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElementOf0(X84,sdtlpdtrp0(xN,X82))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X82)),X84)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElement0(X85)
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aElementOf0(X85,sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( X85 != szmzizndt0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X85,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElement0(X86)
| ~ aElementOf0(X86,sdtlpdtrp0(xN,X82))
| X86 = szmzizndt0(sdtlpdtrp0(xN,X82))
| aElementOf0(X86,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( ~ aElementOf0(X87,sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| aElementOf0(X87,sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X82)),sdtmndt0(sdtlpdtrp0(xN,X82),szmzizndt0(sdtlpdtrp0(xN,X82))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X82)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X82),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X82))
| ~ aElementOf0(X82,szNzAzT0) ) ),
inference(distribute,[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)],[m__3623])])])])])]) ).
fof(c_0_8,plain,
! [X165] :
( ~ aElementOf0(X165,szNzAzT0)
| sdtlseqdt0(sz00,X165) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])]) ).
fof(c_0_9,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_12,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,negated_conjecture,
( aElementOf0(esk1_0,sdtlpdtrp0(xN,xi))
& ~ aElementOf0(esk1_0,xS)
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_15,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3989]) ).
cnf(c_0_17,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : NUM582+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n003.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 14:43:33 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.IrUsqBX7DQ/E---3.1_4344.p
% 35.69/5.06 # Version: 3.1pre001
% 35.69/5.06 # Preprocessing class: FSLSSMSMSSSNFFN.
% 35.69/5.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.69/5.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.69/5.06 # Starting new_bool_3 with 300s (1) cores
% 35.69/5.06 # Starting new_bool_1 with 300s (1) cores
% 35.69/5.06 # Starting sh5l with 300s (1) cores
% 35.69/5.06 # sh5l with pid 4426 completed with status 0
% 35.69/5.06 # Result found by sh5l
% 35.69/5.06 # Preprocessing class: FSLSSMSMSSSNFFN.
% 35.69/5.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.69/5.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.69/5.06 # Starting new_bool_3 with 300s (1) cores
% 35.69/5.06 # Starting new_bool_1 with 300s (1) cores
% 35.69/5.06 # Starting sh5l with 300s (1) cores
% 35.69/5.06 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.69/5.06 # Search class: FGHSF-SMLM32-MFFFFFNN
% 35.69/5.06 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.69/5.06 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 35.69/5.06 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 4432 completed with status 0
% 35.69/5.06 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 35.69/5.06 # Preprocessing class: FSLSSMSMSSSNFFN.
% 35.69/5.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.69/5.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 35.69/5.06 # Starting new_bool_3 with 300s (1) cores
% 35.69/5.06 # Starting new_bool_1 with 300s (1) cores
% 35.69/5.06 # Starting sh5l with 300s (1) cores
% 35.69/5.06 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.69/5.06 # Search class: FGHSF-SMLM32-MFFFFFNN
% 35.69/5.06 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.69/5.06 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 35.69/5.06 # Preprocessing time : 0.099 s
% 35.69/5.06 # Presaturation interreduction done
% 35.69/5.06
% 35.69/5.06 # Proof found!
% 35.69/5.06 # SZS status Theorem
% 35.69/5.06 # SZS output start CNFRefutation
% See solution above
% 35.69/5.06 # Parsed axioms : 88
% 35.69/5.06 # Removed by relevancy pruning/SinE : 2
% 35.69/5.06 # Initial clauses : 4201
% 35.69/5.06 # Removed in clause preprocessing : 7
% 35.69/5.06 # Initial clauses in saturation : 4194
% 35.69/5.06 # Processed clauses : 7727
% 35.69/5.06 # ...of these trivial : 43
% 35.69/5.06 # ...subsumed : 1129
% 35.69/5.06 # ...remaining for further processing : 6555
% 35.69/5.06 # Other redundant clauses eliminated : 1935
% 35.69/5.06 # Clauses deleted for lack of memory : 0
% 35.69/5.06 # Backward-subsumed : 16
% 35.69/5.06 # Backward-rewritten : 18
% 35.69/5.06 # Generated clauses : 9105
% 35.69/5.06 # ...of the previous two non-redundant : 8824
% 35.69/5.06 # ...aggressively subsumed : 0
% 35.69/5.06 # Contextual simplify-reflections : 53
% 35.69/5.06 # Paramodulations : 7356
% 35.69/5.06 # Factorizations : 6
% 35.69/5.06 # NegExts : 0
% 35.69/5.06 # Equation resolutions : 1937
% 35.69/5.06 # Total rewrite steps : 3370
% 35.69/5.06 # Propositional unsat checks : 0
% 35.69/5.06 # Propositional check models : 0
% 35.69/5.06 # Propositional check unsatisfiable : 0
% 35.69/5.06 # Propositional clauses : 0
% 35.69/5.06 # Propositional clauses after purity: 0
% 35.69/5.06 # Propositional unsat core size : 0
% 35.69/5.06 # Propositional preprocessing time : 0.000
% 35.69/5.06 # Propositional encoding time : 0.000
% 35.69/5.06 # Propositional solver time : 0.000
% 35.69/5.06 # Success case prop preproc time : 0.000
% 35.69/5.06 # Success case prop encoding time : 0.000
% 35.69/5.06 # Success case prop solver time : 0.000
% 35.69/5.06 # Current number of processed clauses : 1181
% 35.69/5.06 # Positive orientable unit clauses : 371
% 35.69/5.06 # Positive unorientable unit clauses: 0
% 35.69/5.06 # Negative unit clauses : 95
% 35.69/5.06 # Non-unit-clauses : 715
% 35.69/5.06 # Current number of unprocessed clauses: 8855
% 35.69/5.06 # ...number of literals in the above : 61694
% 35.69/5.06 # Current number of archived formulas : 0
% 35.69/5.06 # Current number of archived clauses : 3634
% 35.69/5.06 # Clause-clause subsumption calls (NU) : 6768774
% 35.69/5.06 # Rec. Clause-clause subsumption calls : 90390
% 35.69/5.06 # Non-unit clause-clause subsumptions : 1017
% 35.69/5.06 # Unit Clause-clause subsumption calls : 12672
% 35.69/5.06 # Rewrite failures with RHS unbound : 0
% 35.69/5.06 # BW rewrite match attempts : 814
% 35.69/5.06 # BW rewrite match successes : 18
% 35.69/5.06 # Condensation attempts : 0
% 35.69/5.06 # Condensation successes : 0
% 35.69/5.06 # Termbank termtop insertions : 724826
% 35.69/5.06
% 35.69/5.06 # -------------------------------------------------
% 35.69/5.06 # User time : 4.425 s
% 35.69/5.06 # System time : 0.026 s
% 35.69/5.06 # Total time : 4.451 s
% 35.69/5.06 # Maximum resident set size: 13360 pages
% 35.69/5.06
% 35.69/5.06 # -------------------------------------------------
% 35.69/5.06 # User time : 4.428 s
% 35.69/5.06 # System time : 0.028 s
% 35.69/5.06 # Total time : 4.456 s
% 35.69/5.06 # Maximum resident set size: 1812 pages
% 35.69/5.06 % E---3.1 exiting
% 35.69/5.06 % E---3.1 exiting
%------------------------------------------------------------------------------