%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM605+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:59 PM UTC 2026
% Result : Theorem 0.35s 0.47s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 21 unt; 2 def)
% Number of atoms : 100 ( 36 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 91 ( 37 ~; 30 |; 10 &)
% ( 12 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( X0 = slcrc0
<=> ( aSet0(X0)
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f57,axiom,
! [X0,X1] :
( ( aSet0(X0)
& aElementOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aSubsetOf0(X3,X0)
& sbrdtbr0(X3) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(f74,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
fof(f78,axiom,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
fof(f95,axiom,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891) ).
fof(f99,axiom,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(f100,conjecture,
xQ != slcrc0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f101,negated_conjecture,
~ ( xQ != slcrc0 ),
inference(negated_conjecture,[status(cth)],[f100]) ).
fof(f102,plain,
slcrc0 = xQ,
inference(flattening,[],[f101]) ).
fof(f108,plain,
! [X0] :
( X0 = slcrc0
<=> ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f163,plain,
! [X0] :
( ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f187,plain,
! [X0,X1] :
( ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aSubsetOf0(X3,X0)
& sbrdtbr0(X3) = X1 ) ) ) )
| ~ aSet0(X0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f188,plain,
! [X0,X1] :
( ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aSubsetOf0(X3,X0)
& sbrdtbr0(X3) = X1 ) ) ) )
| ~ aSet0(X0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(flattening,[],[f187]) ).
fof(f239,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f108]) ).
fof(f298,plain,
! [X0] :
( ~ aSet0(X0)
| slcrc0 != X0
| sz00 = sbrdtbr0(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f331,plain,
! [X2,X3,X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| sbrdtbr0(X3) = X1
| ~ aElementOf0(X3,X2)
| slbdtsldtrb0(X0,X1) != X2 ),
inference(cnf_transformation,[],[f188]) ).
fof(f376,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f74]) ).
fof(f386,plain,
sz00 != xK,
inference(cnf_transformation,[],[f78]) ).
fof(f423,plain,
aSet0(xO),
inference(cnf_transformation,[],[f95]) ).
fof(f430,plain,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(cnf_transformation,[],[f99]) ).
fof(f431,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f102]) ).
fof(f433,plain,
! [X0] :
( aSet0(X0)
| xQ != X0 ),
inference(definition_unfolding,[],[f239,f431]) ).
fof(f438,plain,
! [X0] :
( ~ aSet0(X0)
| xQ != X0
| sz00 = sbrdtbr0(X0) ),
inference(definition_unfolding,[],[f298,f431]) ).
fof(f451,plain,
aSet0(xQ),
inference(equality_resolution,[],[f433]) ).
fof(f466,plain,
( ~ aSet0(xQ)
| sz00 = sbrdtbr0(xQ) ),
inference(equality_resolution,[],[f438]) ).
fof(f480,plain,
! [X3,X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| sbrdtbr0(X3) = X1
| ~ aElementOf0(X3,slbdtsldtrb0(X0,X1)) ),
inference(equality_resolution,[],[f331]) ).
fof(f581,plain,
! [X3,X0,X1] :
( aElementOf0(X3,slbdtsldtrb0(X0,X1))
| ~ aSet0(X0)
| sbrdtbr0(X3) = X1
| aElementOf0(X1,szNzAzT0) ),
inference(consistent_polarity_flipping,[],[f480]) ).
fof(f618,plain,
~ aElementOf0(xK,szNzAzT0),
inference(consistent_polarity_flipping,[],[f376]) ).
fof(f653,plain,
~ aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(consistent_polarity_flipping,[],[f430]) ).
fof(f657,definition,
( spl25_1
<=> sz00 = sbrdtbr0(xQ) ),
introduced(definition,[new_symbols(definition,[spl25_1])],[avatar_definition]) ).
fof(f659,plain,
( sz00 = sbrdtbr0(xQ)
| ~ spl25_1 ),
inference(avatar_component_clause,[],[f657]) ).
fof(f661,definition,
( spl25_2
<=> aSet0(xQ) ),
introduced(definition,[new_symbols(definition,[spl25_2])],[avatar_definition]) ).
fof(f664,plain,
( spl25_1
| ~ spl25_2 ),
inference(avatar_split_clause,[],[f466,f661,f657]) ).
fof(f670,plain,
spl25_2,
inference(avatar_split_clause,[],[f451,f661]) ).
fof(f1348,plain,
( ~ aSet0(xO)
| xK = sbrdtbr0(xQ)
| aElementOf0(xK,szNzAzT0) ),
inference(resolution,[],[f581,f653]) ).
fof(f1356,plain,
( xK = sbrdtbr0(xQ)
| aElementOf0(xK,szNzAzT0) ),
inference(forward_subsumption_resolution,[],[f1348,f423]) ).
fof(f1357,plain,
xK = sbrdtbr0(xQ),
inference(forward_subsumption_resolution,[],[f1356,f618]) ).
fof(f1358,plain,
( sz00 = xK
| ~ spl25_1 ),
inference(forward_demodulation,[],[f1357,f659]) ).
fof(f1359,plain,
( $false
| ~ spl25_1 ),
inference(forward_subsumption_resolution,[],[f1358,f386]) ).
fof(f1360,plain,
~ spl25_1,
inference(avatar_contradiction_clause,[],[f1359]) ).
cnf(s1,plain,
( spl25_1
| ~ spl25_2 ),
inference(sat_conversion,[],[f664]) ).
cnf(s3,plain,
spl25_2,
inference(sat_conversion,[],[f670]) ).
cnf(s47,plain,
~ spl25_1,
inference(sat_conversion,[],[f1360]) ).
cnf(s66,plain,
$false,
inference(rat,[],[s1,s3,s47]) ).
fof(f1361,plain,
$false,
inference(avatar_sat_refutation,[],[s66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM605+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n005.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 27 20:43:17 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.47 % (146270)Will run a generic schedule for satisfiability detection.
% 0.35/0.47 % (146285)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2718556110:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.47 % (146281)% WARNING: option uhcvi not known.
% 0.35/0.47 % (146280)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4262112222_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.47 % (146282)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2697287554:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.47 % (146283)dis+10_1_sil=32000:sp=arity:random_seed=4189345962:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.47 % (146281)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1912511224:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.47 % (146284)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2204584046:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.47 % (146286)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3022374381:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.47 % TRYING [1]
% 0.35/0.47 % TRYING [2]
% 0.35/0.47 % (146281) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146270-146281"...
% 0.35/0.47 % (146281)...printing done.
% 0.35/0.47 % (146281)Refutation found. Thanks to Tanya!
% 0.35/0.47 % SZS status Theorem for theBenchmark
% 0.35/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.47 % (146281)------------------------------
% 0.35/0.47 % (146281)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.47 % (146281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.47 % (146281)CaDiCaL version: 2.1.3
% 0.35/0.47 % (146281)Termination reason: Refutation
% 0.35/0.47 % (146281)Time elapsed: 0.027 s
% 0.35/0.47 % (146281)Peak memory usage: 13 MB
% 0.35/0.47 % (146281)Instructions burned: 36 (million)
% 0.35/0.47 % (146270)Success in time 0.064 s
% 0.35/0.47 % Vampire exiting
%------------------------------------------------------------------------------