%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:47 PM UTC 2026
% Result : Theorem 2.78s 1.26s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 8 unt; 5 def)
% Number of atoms : 246 ( 31 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 265 ( 69 ~; 62 |; 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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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(f582,definition,
( spl42_1
<=> isCountable0(sdtlpdtrp0(xN,xi)) ),
introduced(definition,[new_symbols(definition,[spl42_1])],[avatar_definition]) ).
fof(f584,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| spl42_1 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f586,definition,
( spl42_2
<=> aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
introduced(definition,[new_symbols(definition,[spl42_2])],[avatar_definition]) ).
fof(f588,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| spl42_2 ),
inference(avatar_component_clause,[],[f586]) ).
fof(f589,plain,
( ~ spl42_1
| ~ spl42_2 ),
inference(avatar_split_clause,[],[f534,f586,f582]) ).
fof(f605,definition,
( spl42_6
<=> sz00 = xi ),
introduced(definition,[new_symbols(definition,[spl42_6])],[avatar_definition]) ).
fof(f607,plain,
( sz00 = xi
| ~ spl42_6 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f608,plain,
( spl42_6
| spl42_1 ),
inference(avatar_split_clause,[],[f528,f582,f605]) ).
fof(f609,plain,
( spl42_6
| spl42_2 ),
inference(avatar_split_clause,[],[f529,f586,f605]) ).
fof(f645,plain,
( xS = sdtlpdtrp0(xN,xi)
| ~ spl42_6 ),
inference(forward_demodulation,[],[f520,f607]) ).
fof(f646,plain,
( ~ isCountable0(xS)
| spl42_1
| ~ spl42_6 ),
inference(superposition,[],[f584,f645]) ).
fof(f647,plain,
( $false
| spl42_1
| ~ spl42_6 ),
inference(forward_subsumption_resolution,[],[f646,f451]) ).
fof(f648,plain,
( spl42_1
| ~ spl42_6 ),
inference(avatar_contradiction_clause,[],[f647]) ).
fof(f650,plain,
( ~ aSubsetOf0(xS,szNzAzT0)
| spl42_2
| ~ spl42_6 ),
inference(forward_demodulation,[],[f588,f645]) ).
fof(f652,plain,
( $false
| spl42_2
| ~ spl42_6 ),
inference(forward_subsumption_resolution,[],[f650,f452]) ).
fof(f653,plain,
( spl42_2
| ~ spl42_6 ),
inference(avatar_contradiction_clause,[],[f652]) ).
cnf(s1,plain,
( ~ spl42_1
| ~ spl42_2 ),
inference(sat_conversion,[],[f589]) ).
cnf(s4,plain,
( spl42_1
| spl42_6 ),
inference(sat_conversion,[],[f608]) ).
cnf(s5,plain,
( spl42_2
| spl42_6 ),
inference(sat_conversion,[],[f609]) ).
cnf(s13,plain,
( spl42_1
| ~ spl42_6 ),
inference(sat_conversion,[],[f648]) ).
cnf(s14,plain,
( spl42_2
| ~ spl42_6 ),
inference(sat_conversion,[],[f653]) ).
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,[],[s14,s19]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s5,s20,s19]) ).
fof(f656,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.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.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:33:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.26 % (2739359)Detected formulas, will run a generic FOF schedule.
% 2.78/1.26 % (2739366)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=3941057876:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.78/1.26 % (2739367)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=902920403:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.78/1.26 % (2739364)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=580212545:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.78/1.26 % (2739369)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2183058454:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.78/1.26 % (2739365)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=2433206143:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.78/1.26 % (2739369)First to succeed.
% 2.78/1.26 % (2739369)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2739359"
% 2.78/1.26 % (2739367)Also succeeded, but the first one will report.
% 2.78/1.26 % (2739368)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2209681729:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.78/1.26 % (2739368)Also succeeded, but the first one will report.
% 2.78/1.26 % (2739370)dis-21_1_sil=8000:lcm=predicate:random_seed=1199930945: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)
% 2.78/1.26 % (2739370)Instruction limit reached!
% 2.78/1.26 % (2739370)------------------------------
% 2.78/1.26 % (2739370)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.78/1.26 % (2739370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.78/1.26 % (2739370)CaDiCaL version: 2.1.3
% 2.78/1.26 % (2739370)Termination reason: Instruction limit
% 2.78/1.26 % (2739370)Termination phase: Saturation
% 2.78/1.26 % (2739370)Time elapsed: 0.078 s
% 2.78/1.26 % (2739370)Peak memory usage: 91 MB
% 2.78/1.26 % (2739370)Instructions burned: 130 (million)
% 2.78/1.26 % (2739378)lrs+10_1_sil=8000:sp=occurrence:random_seed=1950530551:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.78/1.26 % (2739378)Also succeeded, but the first one will report.
% 2.78/1.26 % (2739369)Refutation found. Thanks to Tanya!
% 2.78/1.26 % SZS status Theorem for theBenchmark
% 2.78/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.45 % (2739369)------------------------------
% 3.47/1.45 % (2739369)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.45 % (2739369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.45 % (2739369)CaDiCaL version: 2.1.3
% 3.47/1.45 % (2739369)Termination reason: Refutation
% 3.47/1.45 % (2739369)Time elapsed: 0.010 s
% 3.47/1.45 % (2739369)Peak memory usage: 90 MB
% 3.47/1.45 % (2739369)Instructions burned: 14 (million)
% 3.47/1.45 % (2739369)------------------------------
% 3.47/1.45 % (2739369)------------------------------
% 3.47/1.45 % (2739359)Success in time 0.409 s
% 3.47/1.45 % Vampire exiting
%------------------------------------------------------------------------------