TSTP Solution File: NUM582+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM582+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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 : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:34:03 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 248 ( 12 equ)
% Maximal formula atoms : 181 ( 12 avg)
% Number of connectives : 381 ( 153 ~; 162 |; 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 ( 1 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/solver/bin/../tmp/theBenchmark.p',m__3754) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mZeroLess) ).
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3989) ).
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/solver/bin/../tmp/theBenchmark.p',m__3623) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mZeroNum) ).
fof(c_0_6,hypothesis,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,sdtlpdtrp0(xN,X4))
| aElementOf0(X6,sdtlpdtrp0(xN,X5))
| ~ sdtlseqdt0(X5,X4)
| ~ aElementOf0(X4,szNzAzT0)
| ~ aElementOf0(X5,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X4),sdtlpdtrp0(xN,X5))
| ~ sdtlseqdt0(X5,X4)
| ~ aElementOf0(X4,szNzAzT0)
| ~ aElementOf0(X5,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])])])])]) ).
fof(c_0_7,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| sdtlseqdt0(sz00,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])]) ).
fof(c_0_8,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_9,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3989]) ).
cnf(c_0_11,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,hypothesis,
! [X3,X5,X6,X6,X7] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X3)),sdtlpdtrp0(xN,X3))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X5,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X3)),X5)
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElement0(X6)
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElementOf0(X6,sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( X6 != szmzizndt0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElement0(X6)
| ~ aElementOf0(X6,sdtlpdtrp0(xN,X3))
| X6 = szmzizndt0(sdtlpdtrp0(xN,X3))
| aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X7,sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| aElementOf0(X7,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| aElementOf0(esk3_1(X3),sdtlpdtrp0(xN,X3))
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X3)),sdtlpdtrp0(xN,X3))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X5,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X3)),X5)
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElement0(X6)
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElementOf0(X6,sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( X6 != szmzizndt0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElement0(X6)
| ~ aElementOf0(X6,sdtlpdtrp0(xN,X3))
| X6 = szmzizndt0(sdtlpdtrp0(xN,X3))
| aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X7,sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| aElementOf0(X7,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| ~ aElementOf0(esk3_1(X3),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X3))
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X3)),sdtlpdtrp0(xN,X3))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X5,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X3)),X5)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElement0(X6)
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aElementOf0(X6,sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( X6 != szmzizndt0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElement0(X6)
| ~ aElementOf0(X6,sdtlpdtrp0(xN,X3))
| X6 = szmzizndt0(sdtlpdtrp0(xN,X3))
| aElementOf0(X6,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X7,sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| aElementOf0(X7,sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X3)),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X3)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])])])]) ).
fof(c_0_13,negated_conjecture,
( aElementOf0(esk1_0,sdtlpdtrp0(xN,xi))
& ~ aElementOf0(esk1_0,xS)
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_14,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,X1))
| ~ sdtlseqdt0(X1,xi)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,hypothesis,
sdtlseqdt0(sz00,xi),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_18,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM582+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n028.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 : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jul 7 11:38:38 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.21/1.40 # Preprocessing time : 0.022 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 20
% 0.21/1.40 # Proof object clause steps : 9
% 0.21/1.40 # Proof object formula steps : 11
% 0.21/1.40 # Proof object conjectures : 4
% 0.21/1.40 # Proof object clause conjectures : 1
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 6
% 0.21/1.40 # Proof object initial formulas used : 6
% 0.21/1.40 # Proof object generating inferences : 3
% 0.21/1.40 # Proof object simplifying inferences : 4
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 88
% 0.21/1.40 # Removed by relevancy pruning/SinE : 48
% 0.21/1.40 # Initial clauses : 106
% 0.21/1.40 # Removed in clause preprocessing : 5
% 0.21/1.40 # Initial clauses in saturation : 101
% 0.21/1.40 # Processed clauses : 321
% 0.21/1.40 # ...of these trivial : 10
% 0.21/1.40 # ...subsumed : 37
% 0.21/1.40 # ...remaining for further processing : 274
% 0.21/1.40 # Other redundant clauses eliminated : 1
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 1
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 1021
% 0.21/1.40 # ...of the previous two non-trivial : 968
% 0.21/1.40 # Contextual simplify-reflections : 99
% 0.21/1.40 # Paramodulations : 1014
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 7
% 0.21/1.40 # Current number of processed clauses : 272
% 0.21/1.40 # Positive orientable unit clauses : 88
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 46
% 0.21/1.40 # Non-unit-clauses : 138
% 0.21/1.40 # Current number of unprocessed clauses: 746
% 0.21/1.40 # ...number of literals in the above : 1780
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 1
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 3924
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1816
% 0.21/1.40 # Non-unit clause-clause subsumptions : 129
% 0.21/1.40 # Unit Clause-clause subsumption calls : 1791
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 37
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 26320
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.044 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.048 s
% 0.21/1.40 # Maximum resident set size: 4360 pages
%------------------------------------------------------------------------------