%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM605+3 : 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 : n020.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.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 12 unt; 2 def)
% Number of atoms : 73 ( 28 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 19 |; 13 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 8 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f79,axiom,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3520) ).
fof(f99,axiom,
( aSet0(xQ)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(f100,conjecture,
~ ( ~ ? [X0] : aElementOf0(X0,xQ)
& xQ = slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f101,negated_conjecture,
~ ~ ( ~ ? [X0] : aElementOf0(X0,xQ)
& xQ = slcrc0 ),
inference(negated_conjecture,[status(cth)],[f100]) ).
fof(f121,plain,
( ~ ? [X0] : aElementOf0(X0,xQ)
& xQ = slcrc0 ),
inference(flattening,[],[f101]) ).
fof(f172,plain,
! [X0] :
( ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f250,plain,
( aSet0(xQ)
& ! [X0] :
( aElementOf0(X0,xO)
| ~ aElementOf0(X0,xQ) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(ennf_transformation,[],[f99]) ).
fof(f251,plain,
( ! [X0] : ~ aElementOf0(X0,xQ)
& xQ = slcrc0 ),
inference(ennf_transformation,[],[f121]) ).
fof(f308,plain,
! [X0] :
( ( ( sbrdtbr0(X0) = sz00
| slcrc0 != X0 )
& ( X0 = slcrc0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f172]) ).
fof(f500,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| slcrc0 != X0
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f629,plain,
sz00 != xK,
inference(cnf_transformation,[],[f79]) ).
fof(f825,plain,
xK = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f250]) ).
fof(f828,plain,
aSet0(xQ),
inference(cnf_transformation,[],[f250]) ).
fof(f829,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f251]) ).
fof(f836,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| xQ != X0
| ~ aSet0(X0) ),
inference(definition_unfolding,[],[f500,f829]) ).
fof(f857,plain,
( sz00 = sbrdtbr0(xQ)
| ~ aSet0(xQ) ),
inference(equality_resolution,[],[f836]) ).
fof(f955,plain,
( sz00 = sbrdtbr0(xQ)
| aSet0(xQ) ),
inference(consistent_polarity_flipping,[],[f857]) ).
fof(f1175,plain,
~ aSet0(xQ),
inference(consistent_polarity_flipping,[],[f828]) ).
fof(f1179,definition,
( spl71_1
<=> aSet0(xQ) ),
introduced(definition,[new_symbols(definition,[spl71_1])],[avatar_definition]) ).
fof(f1181,plain,
( aSet0(xQ)
| ~ spl71_1 ),
inference(avatar_component_clause,[],[f1179]) ).
fof(f1183,definition,
( spl71_2
<=> sz00 = sbrdtbr0(xQ) ),
introduced(definition,[new_symbols(definition,[spl71_2])],[avatar_definition]) ).
fof(f1185,plain,
( sz00 = sbrdtbr0(xQ)
| ~ spl71_2 ),
inference(avatar_component_clause,[],[f1183]) ).
fof(f1186,plain,
( spl71_1
| spl71_2 ),
inference(avatar_split_clause,[],[f955,f1183,f1179]) ).
fof(f1261,plain,
( sz00 = xK
| ~ spl71_2 ),
inference(superposition,[],[f1185,f825]) ).
fof(f1262,plain,
( sz00 != sz00
| ~ spl71_2 ),
inference(superposition,[],[f629,f1261]) ).
fof(f1264,plain,
( $false
| ~ spl71_2 ),
inference(trivial_inequality_removal,[],[f1262]) ).
fof(f1265,plain,
~ spl71_2,
inference(avatar_contradiction_clause,[],[f1264]) ).
fof(f1266,plain,
( $false
| ~ spl71_1 ),
inference(resolution,[],[f1181,f1175]) ).
fof(f1267,plain,
~ spl71_1,
inference(avatar_contradiction_clause,[],[f1266]) ).
cnf(s1,plain,
( spl71_1
| spl71_2 ),
inference(sat_conversion,[],[f1186]) ).
cnf(s14,plain,
~ spl71_2,
inference(sat_conversion,[],[f1265]) ).
cnf(s15,plain,
~ spl71_1,
inference(sat_conversion,[],[f1267]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s14,s15]) ).
fof(f1268,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM605+3 : 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.39 % Computer : n020.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 20:44:19 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.18/0.47 % (3727780)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (3727798)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3360116376:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47 % (3727793)% WARNING: option uhcvi not known.
% 0.18/0.47 % (3727793)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1620048925:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (3727797)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=703803391:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (3727794)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=63989050:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (3727792)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=811046957_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (3727795)dis+10_1_sil=32000:sp=arity:random_seed=2989572085:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (3727796)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1557962313:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (3727798) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3727780-3727798"...
% 0.18/0.47 % (3727798)...printing done.
% 0.18/0.47 % (3727798)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (3727798)------------------------------
% 0.18/0.47 % (3727798)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (3727798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (3727798)CaDiCaL version: 2.1.3
% 0.18/0.47 % (3727798)Termination reason: Refutation
% 0.18/0.47 % (3727798)Time elapsed: 0.011 s
% 0.18/0.47 % (3727798)Peak memory usage: 13 MB
% 0.18/0.47 % (3727798)Instructions burned: 33 (million)
% 0.18/0.47 % (3727780)Success in time 0.044 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------