%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:24:51 PM UTC 2026
% Result : Theorem 0.11s 0.47s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 9 unt; 5 def)
% Number of atoms : 255 ( 31 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 278 ( 77 ~; 67 |; 109 &)
% ( 8 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 4 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 33 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
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(f84,axiom,
( xi != sz00
=> ( ? [X0] :
( aElementOf0(X0,szNzAzT0)
& szszuzczcdt0(X0) = xi )
& aSet0(sdtlpdtrp0(xN,xi))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3702_02) ).
fof(f85,conjecture,
( ( ( aSet0(sdtlpdtrp0(xN,xi))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f86,negated_conjecture,
~ ( ( ( aSet0(sdtlpdtrp0(xN,xi))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(negated_conjecture,[status(cth)],[f85]) ).
fof(f96,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(f97,plain,
( xi != sz00
=> ( ? [X0] :
( aElementOf0(X0,szNzAzT0)
& szszuzczcdt0(X0) = xi )
& aSet0(sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
inference(rectify,[],[f84]) ).
fof(f197,plain,
( aSet0(xS)
& ! [X0] :
( aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X0,xS) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(ennf_transformation,[],[f75]) ).
fof(f202,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,[],[f96]) ).
fof(f203,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,[],[f202]) ).
fof(f206,plain,
( ( ? [X0] :
( aElementOf0(X0,szNzAzT0)
& szszuzczcdt0(X0) = xi )
& aSet0(sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) )
| sz00 = xi ),
inference(ennf_transformation,[],[f97]) ).
fof(f207,plain,
( ( ( ~ aSet0(sdtlpdtrp0(xN,xi))
| ? [X0] :
( ~ aElementOf0(X0,szNzAzT0)
& aElementOf0(X0,sdtlpdtrp0(xN,xi)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(ennf_transformation,[],[f86]) ).
fof(f219,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 ) )
| ~ sP8(X0) ),
introduced(definition,[new_symbols(definition,[sP8])],[predicate_definition_introduction]) ).
fof(f220,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))))
& sP8(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))) )
| ~ sP9(X0) ),
introduced(definition,[new_symbols(definition,[sP9])],[predicate_definition_introduction]) ).
fof(f221,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( sP9(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,[],[f203,f220,f219]) ).
fof(f302,plain,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X0] :
( sP9(X0)
| ( ( ~ aSet0(sdtlpdtrp0(xN,X0))
| ( ~ aElementOf0(sK39(X0),szNzAzT0)
& aElementOf0(sK39(X0),sdtlpdtrp0(xN,X0)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK39]),skolemize(X1,sK39(X0))],[f221]) ).
fof(f303,plain,
( ( aElementOf0(sK40,szNzAzT0)
& xi = szszuzczcdt0(sK40)
& aSet0(sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) )
| sz00 = xi ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK40]),skolemize(X0,sK40)],[f206]) ).
fof(f304,plain,
( ( ( ~ aSet0(sdtlpdtrp0(xN,xi))
| ( ~ aElementOf0(sK41,szNzAzT0)
& aElementOf0(sK41,sdtlpdtrp0(xN,xi)) ) )
& ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41]),skolemize(X0,sK41)],[f207]) ).
fof(f451,plain,
isCountable0(xS),
inference(cnf_transformation,[],[f197]) ).
fof(f452,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f197]) ).
fof(f520,plain,
xS = sdtlpdtrp0(xN,sz00),
inference(cnf_transformation,[],[f302]) ).
fof(f528,plain,
( isCountable0(sdtlpdtrp0(xN,xi))
| sz00 = xi ),
inference(cnf_transformation,[],[f303]) ).
fof(f529,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| sz00 = xi ),
inference(cnf_transformation,[],[f303]) ).
fof(f534,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(cnf_transformation,[],[f304]) ).
fof(f726,plain,
~ aSubsetOf0(xS,szNzAzT0),
inference(consistent_polarity_flipping,[],[f452]) ).
fof(f792,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| sz00 = xi ),
inference(consistent_polarity_flipping,[],[f529]) ).
fof(f795,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(consistent_polarity_flipping,[],[f534]) ).
fof(f798,definition,
( spl42_1
<=> isCountable0(sdtlpdtrp0(xN,xi)) ),
introduced(definition,[new_symbols(definition,[spl42_1])],[avatar_definition]) ).
fof(f800,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| spl42_1 ),
inference(avatar_component_clause,[],[f798]) ).
fof(f802,definition,
( spl42_2
<=> aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
introduced(definition,[new_symbols(definition,[spl42_2])],[avatar_definition]) ).
fof(f804,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ spl42_2 ),
inference(avatar_component_clause,[],[f802]) ).
fof(f805,plain,
( ~ spl42_1
| spl42_2 ),
inference(avatar_split_clause,[],[f795,f802,f798]) ).
fof(f821,definition,
( spl42_6
<=> sz00 = xi ),
introduced(definition,[new_symbols(definition,[spl42_6])],[avatar_definition]) ).
fof(f823,plain,
( sz00 = xi
| ~ spl42_6 ),
inference(avatar_component_clause,[],[f821]) ).
fof(f824,plain,
( spl42_6
| spl42_1 ),
inference(avatar_split_clause,[],[f528,f798,f821]) ).
fof(f825,plain,
( spl42_6
| ~ spl42_2 ),
inference(avatar_split_clause,[],[f792,f802,f821]) ).
fof(f860,plain,
( ~ isCountable0(sdtlpdtrp0(xN,sz00))
| spl42_1
| ~ spl42_6 ),
inference(superposition,[],[f800,f823]) ).
fof(f863,plain,
( ~ isCountable0(xS)
| spl42_1
| ~ spl42_6 ),
inference(superposition,[],[f860,f520]) ).
fof(f865,plain,
( $false
| spl42_1
| ~ spl42_6 ),
inference(resolution,[],[f863,f451]) ).
fof(f866,plain,
( spl42_1
| ~ spl42_6 ),
inference(avatar_contradiction_clause,[],[f865]) ).
fof(f869,plain,
( aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0)
| ~ spl42_2
| ~ spl42_6 ),
inference(superposition,[],[f804,f823]) ).
fof(f876,plain,
( aSubsetOf0(xS,szNzAzT0)
| ~ spl42_2
| ~ spl42_6 ),
inference(superposition,[],[f869,f520]) ).
fof(f877,plain,
( $false
| ~ spl42_2
| ~ spl42_6 ),
inference(resolution,[],[f876,f726]) ).
fof(f878,plain,
( ~ spl42_2
| ~ spl42_6 ),
inference(avatar_contradiction_clause,[],[f877]) ).
cnf(s1,plain,
( ~ spl42_1
| spl42_2 ),
inference(sat_conversion,[],[f805]) ).
cnf(s4,plain,
( spl42_1
| spl42_6 ),
inference(sat_conversion,[],[f824]) ).
cnf(s5,plain,
( ~ spl42_2
| spl42_6 ),
inference(sat_conversion,[],[f825]) ).
cnf(s13,plain,
( spl42_1
| ~ spl42_6 ),
inference(sat_conversion,[],[f866]) ).
cnf(s15,plain,
( ~ spl42_2
| ~ spl42_6 ),
inference(sat_conversion,[],[f878]) ).
cnf(s18,plain,
spl42_1,
inference(rat,[],[s4,s13]) ).
cnf(s19,plain,
spl42_2,
inference(rat,[],[s1,s18]) ).
cnf(s20,plain,
~ spl42_6,
inference(rat,[],[s15,s19]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s5,s20,s19]) ).
fof(f879,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n018.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:35:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.47 % (2702952)Will run a generic schedule for satisfiability detection.
% 0.11/0.47 % (2702980)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2733395472:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.47 % (2702975)% WARNING: option uhcvi not known.
% 0.11/0.47 % (2702974)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3767488243_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.47 % (2702980) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2702952-2702980"...
% 0.11/0.47 % (2702976)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=506518691:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.47 % (2702975)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3258216129:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.47 % (2702977)dis+10_1_sil=32000:sp=arity:random_seed=673526345:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.47 % (2702978)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2629939400:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.47 % (2702979)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3695010009:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.47 % (2702980)...printing done.
% 0.11/0.47 % (2702980)Refutation found. Thanks to Tanya!
% 0.11/0.47 % SZS status Theorem for theBenchmark
% 0.11/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.47 % (2702980)------------------------------
% 0.11/0.47 % (2702980)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.47 % (2702980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.47 % (2702980)CaDiCaL version: 2.1.3
% 0.11/0.47 % (2702980)Termination reason: Refutation
% 0.11/0.47 % (2702980)Time elapsed: 0.008 s
% 0.11/0.47 % (2702980)Peak memory usage: 12 MB
% 0.11/0.47 % (2702980)Instructions burned: 20 (million)
% 0.11/0.47 % (2702952)Success in time 0.06 s
% 0.11/0.47 % Vampire exiting
%------------------------------------------------------------------------------