%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM582+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 : Tue Sep 29 12:15:51 PM UTC 2026
% Result : Theorem 3.00s 1.32s
% Output : Refutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 10 unt; 2 def)
% Number of atoms : 291 ( 18 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 359 ( 122 ~; 102 |; 106 &)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 95 ( 88 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(f12,axiom,
! [X0] :
( aSet0(X0)
=> aSubsetOf0(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubRefl) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( aSet0(X0)
& aSet0(X1)
& aSet0(X2) )
=> ( ( aSubsetOf0(X0,X1)
& aSubsetOf0(X1,X2) )
=> aSubsetOf0(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(f24,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(f30,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> sdtlseqdt0(sz00,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).
fof(f75,axiom,
( aSet0(xS)
& ! [X0] :
( aElementOf0(X0,xS)
=> aElementOf0(X0,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(f81,axiom,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( ( ( ( aSet0(sdtlpdtrp0(xN,X0))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> aElementOf0(X1,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X0)) )
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X1) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,X0))
& X1 != szmzizndt0(sdtlpdtrp0(xN,X0)) ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).
fof(f83,axiom,
! [X0,X1] :
( ( aElementOf0(X0,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X0))
=> aElementOf0(X2,sdtlpdtrp0(xN,X1)) )
& aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).
fof(f85,axiom,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3989) ).
fof(f88,conjecture,
( ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,xS) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f89,negated_conjecture,
~ ( ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,xS) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f92,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( ( ( ( aSet0(sdtlpdtrp0(xN,X0))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> aElementOf0(X1,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X0)) )
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X0))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X2) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X0))
& szmzizndt0(sdtlpdtrp0(xN,X0)) != X3 ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,szszuzczcdt0(X0)))
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) ),
inference(rectify,[],[f81]) ).
fof(f103,plain,
( aSet0(xS)
& ! [X0] :
( aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X0,xS) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(ennf_transformation,[],[f75]) ).
fof(f108,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0))
& ! [X2] :
( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X2)
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X0)) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X0))
& szmzizndt0(sdtlpdtrp0(xN,X0)) != X3 ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
| ~ aElementOf0(X4,sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
| ( ( ~ aSet0(sdtlpdtrp0(xN,X0))
| ? [X1] :
( ~ aElementOf0(X1,szNzAzT0)
& aElementOf0(X1,sdtlpdtrp0(xN,X0)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ) ),
inference(ennf_transformation,[],[f92]) ).
fof(f109,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0))
& ! [X2] :
( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X2)
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X0)) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X0))
& szmzizndt0(sdtlpdtrp0(xN,X0)) != X3 ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
| ~ aElementOf0(X4,sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
| ( ( ~ aSet0(sdtlpdtrp0(xN,X0))
| ? [X1] :
( ~ aElementOf0(X1,szNzAzT0)
& aElementOf0(X1,sdtlpdtrp0(xN,X0)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ) ),
inference(flattening,[],[f108]) ).
fof(f111,plain,
! [X0,X1] :
( ( ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X0)) )
& aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) )
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f112,plain,
! [X0,X1] :
( ( ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X0)) )
& aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) )
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(flattening,[],[f111]) ).
fof(f117,plain,
( ? [X0] :
( ~ aElementOf0(X0,xS)
& aElementOf0(X0,sdtlpdtrp0(xN,xi)) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(ennf_transformation,[],[f89]) ).
fof(f122,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f123,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(flattening,[],[f122]) ).
fof(f126,plain,
! [X0] :
( aSubsetOf0(X0,X0)
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f127,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f154,plain,
! [X0] :
( sdtlseqdt0(sz00,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f204,definition,
! [X0] :
( ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X0))
& szmzizndt0(sdtlpdtrp0(xN,X0)) != X3 ) )
| ~ sP4(X0) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f205,definition,
! [X0] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X0)),sdtlpdtrp0(xN,X0))
& ! [X2] :
( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X0)),X2)
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X0)) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& sP4(X0)
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
| ~ aElementOf0(X4,sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
| ~ sP5(X0) ),
introduced(definition,[new_symbols(definition,[sP5])],[predicate_definition_introduction]) ).
fof(f206,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( sP5(X0)
| ( ( ~ aSet0(sdtlpdtrp0(xN,X0))
| ? [X1] :
( ~ aElementOf0(X1,szNzAzT0)
& aElementOf0(X1,sdtlpdtrp0(xN,X0)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ) ),
inference(definition_folding,[],[f109,f205,f204]) ).
fof(f234,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( sP5(X0)
| ( ( ~ aSet0(sdtlpdtrp0(xN,X0))
| ( ~ aElementOf0(sK20(X0),szNzAzT0)
& aElementOf0(sK20(X0),sdtlpdtrp0(xN,X0)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(X1,sK20(X0))],[f206]) ).
fof(f241,plain,
( ~ aElementOf0(sK22,xS)
& aElementOf0(sK22,sdtlpdtrp0(xN,xi))
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK22]),skolemize(X0,sK22)],[f117]) ).
fof(f242,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f127]) ).
fof(f243,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(flattening,[],[f242]) ).
fof(f244,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ( ~ aElementOf0(sK23(X0,X1),X0)
& aElementOf0(sK23(X0,X1),X1) ) )
& ( ( aSet0(X1)
& ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23]),skolemize(X2,sK23(X0,X1))],[f244]) ).
fof(f287,plain,
aSet0(xS),
inference(cnf_transformation,[],[f103]) ).
fof(f353,plain,
xS = sdtlpdtrp0(xN,sz00),
inference(cnf_transformation,[],[f234]) ).
fof(f360,plain,
! [X0,X1] :
( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f367,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f85]) ).
fof(f388,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnf_transformation,[],[f241]) ).
fof(f395,plain,
! [X2,X0,X1] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(cnf_transformation,[],[f123]) ).
fof(f397,plain,
! [X0] :
( aSubsetOf0(X0,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f399,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,X0)
| aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f438,plain,
! [X0] :
( sdtlseqdt0(sz00,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f443,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnf_transformation,[],[f24]) ).
fof(f1268,plain,
! [X2,X0,X1] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(forward_subsumption_resolution,[],[f395,f399]) ).
fof(f1269,plain,
! [X2,X0,X1] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(forward_subsumption_resolution,[],[f1268,f399]) ).
fof(f1292,plain,
! [X0] :
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),X0)
| ~ aSubsetOf0(X0,xS)
| ~ aSet0(xS) ),
inference(resolution,[],[f1269,f388]) ).
fof(f1303,plain,
! [X0] :
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),X0)
| ~ aSubsetOf0(X0,xS) ),
inference(forward_subsumption_resolution,[],[f1292,f287]) ).
fof(f1455,plain,
! [X0] :
( ~ sdtlseqdt0(X0,xi)
| ~ aElementOf0(xi,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X0),xS) ),
inference(resolution,[],[f360,f1303]) ).
fof(f1469,plain,
! [X0] :
( ~ aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X0,xi) ),
inference(forward_subsumption_resolution,[],[f1455,f367]) ).
fof(f1473,plain,
( ~ aSubsetOf0(xS,xS)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ sdtlseqdt0(sz00,xi) ),
inference(superposition,[],[f1469,f353]) ).
fof(f1476,plain,
( ~ sdtlseqdt0(sz00,xi)
| ~ aSubsetOf0(xS,xS) ),
inference(forward_subsumption_resolution,[],[f1473,f443]) ).
fof(f1478,plain,
( ~ aSubsetOf0(xS,xS)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(resolution,[],[f1476,f438]) ).
fof(f1479,plain,
~ aSubsetOf0(xS,xS),
inference(forward_subsumption_resolution,[],[f1478,f367]) ).
fof(f1481,plain,
~ aSet0(xS),
inference(resolution,[],[f1479,f397]) ).
fof(f1484,plain,
$false,
inference(forward_subsumption_resolution,[],[f1481,f287]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM582+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 20:38:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.00/1.32 % (3858176)Detected formulas, will run a generic FOF schedule.
% 3.00/1.32 % (3858181)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=707176876:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.00/1.32 % (3858186)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1895930238:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.00/1.32 % (3858184)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=73567140:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.00/1.32 % (3858187)dis-21_1_sil=8000:lcm=predicate:random_seed=2670051126:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.00/1.32 % (3858183)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=177823020:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.00/1.32 % (3858182)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=824866294:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.00/1.32 % (3858185)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=196975463:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.00/1.32 % (3858185)First to succeed.
% 3.00/1.32 % (3858185)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3858176"
% 3.00/1.32 % (3858184)Also succeeded, but the first one will report.
% 3.00/1.32 % (3858186)Also succeeded, but the first one will report.
% 3.00/1.32 % (3858187)Instruction limit reached!
% 3.00/1.32 % (3858187)------------------------------
% 3.00/1.32 % (3858187)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.32 % (3858187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.32 % (3858187)CaDiCaL version: 2.1.3
% 3.00/1.32 % (3858187)Termination reason: Instruction limit
% 3.00/1.32 % (3858187)Termination phase: Saturation
% 3.00/1.32 % (3858187)Time elapsed: 0.077 s
% 3.00/1.32 % (3858187)Peak memory usage: 90 MB
% 3.00/1.32 % (3858187)Instructions burned: 130 (million)
% 3.00/1.32 % (3858195)lrs+10_1_sil=8000:sp=occurrence:random_seed=3691440281:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.00/1.32 % (3858185)Refutation found. Thanks to Tanya!
% 3.00/1.32 % SZS status Theorem for theBenchmark
% 3.00/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.95/1.53 % (3858185)------------------------------
% 3.95/1.53 % (3858185)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.95/1.53 % (3858185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/1.53 % (3858185)CaDiCaL version: 2.1.3
% 3.95/1.53 % (3858185)Termination reason: Refutation
% 3.95/1.53 % (3858185)Time elapsed: 0.035 s
% 3.95/1.53 % (3858185)Peak memory usage: 89 MB
% 3.95/1.53 % (3858185)Instructions burned: 49 (million)
% 3.95/1.53 % (3858185)------------------------------
% 3.95/1.53 % (3858185)------------------------------
% 3.95/1.53 % (3858176)Success in time 0.472 s
% 3.95/1.53 % Vampire exiting
%------------------------------------------------------------------------------