%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM587+1 : 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 : n003.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:55 PM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 44 ( 3 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 35 ( 14 ~; 11 |; 6 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 14 ( 14 !; 0 ?)
% 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(f73,axiom,
( aSet0(xT)
& isFinite0(xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3291) ).
fof(f76,axiom,
( aFunction0(xc)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
fof(f90,axiom,
( xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4263) ).
fof(f91,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f92,negated_conjecture,
~ aElementOf0(xx,xT),
inference(negated_conjecture,[status(cth)],[f91]) ).
fof(f93,plain,
~ aElementOf0(xx,xT),
inference(flattening,[],[f92]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0)
| ~ aSubsetOf0(X1,X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f355,plain,
aSet0(xT),
inference(cnf_transformation,[],[f73]) ).
fof(f359,plain,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(cnf_transformation,[],[f76]) ).
fof(f389,plain,
aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(cnf_transformation,[],[f90]) ).
fof(f390,plain,
xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(cnf_transformation,[],[f90]) ).
fof(f391,plain,
~ aElementOf0(xx,xT),
inference(cnf_transformation,[],[f93]) ).
fof(f443,plain,
! [X2,X0,X1] :
( ~ aElementOf0(X2,X0)
| aElementOf0(X2,X1)
| ~ aSet0(X0)
| aSubsetOf0(X1,X0) ),
inference(consistent_polarity_flipping,[],[f226]) ).
fof(f572,plain,
~ aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(consistent_polarity_flipping,[],[f359]) ).
fof(f593,plain,
~ aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(consistent_polarity_flipping,[],[f389]) ).
fof(f594,plain,
aElementOf0(xx,xT),
inference(consistent_polarity_flipping,[],[f391]) ).
fof(f790,plain,
! [X0] :
( aElementOf0(xx,X0)
| ~ aSet0(xT)
| aSubsetOf0(X0,xT) ),
inference(resolution,[],[f443,f594]) ).
fof(f799,plain,
! [X0] :
( aSubsetOf0(X0,xT)
| aElementOf0(xx,X0) ),
inference(forward_subsumption_resolution,[],[f790,f355]) ).
fof(f801,plain,
aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(resolution,[],[f799,f572]) ).
fof(f983,plain,
~ aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(forward_demodulation,[],[f593,f390]) ).
fof(f984,plain,
$false,
inference(forward_subsumption_resolution,[],[f983,f801]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM587+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n003.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 20:39:55 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.16/0.48 % (901896)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (901901)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2339703616_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48 % (901902)% WARNING: option uhcvi not known.
% 0.16/0.48 % (901904)dis+10_1_sil=32000:sp=arity:random_seed=249521084:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48 % (901902)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1500950719:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48 % (901903)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1820205767:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48 % (901905)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3441997670:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48 % (901906)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2804627227:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % (901907)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2954042172:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48 % TRYING [1]
% 0.16/0.48 % TRYING [2]
% 0.16/0.48 % TRYING [3]
% 0.16/0.48 % (901902) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-901896-901902"...
% 0.16/0.48 % (901902)...printing done.
% 0.16/0.48 % (901902)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (901902)------------------------------
% 0.16/0.48 % (901902)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (901902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (901902)CaDiCaL version: 2.1.3
% 0.16/0.48 % (901902)Termination reason: Refutation
% 0.16/0.48 % (901902)Time elapsed: 0.016 s
% 0.16/0.48 % (901902)Peak memory usage: 12 MB
% 0.16/0.48 % (901902)Instructions burned: 21 (million)
% 0.16/0.48 % (901896)Success in time 0.059 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------