%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM550+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:42 PM UTC 2026
% Result : Theorem 2.75s 1.39s
% Output : Refutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 83 ( 37 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 90 ( 35 ~; 24 |; 25 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 21 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( X0 = slcrc0
<=> ( aSet0(X0)
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f62,axiom,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(f65,axiom,
( aSet0(xQ)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2270) ).
fof(f67,conjecture,
~ ( ~ ? [X0] : aElementOf0(X0,xQ)
& xQ = slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f68,negated_conjecture,
~ ~ ( ~ ? [X0] : aElementOf0(X0,xQ)
& xQ = slcrc0 ),
inference(negated_conjecture,[status(cth)],[f67]) ).
fof(f70,plain,
( ~ ? [X0] : aElementOf0(X0,xQ)
& xQ = slcrc0 ),
inference(flattening,[],[f68]) ).
fof(f77,plain,
( aSet0(xQ)
& ! [X0] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,xQ) )
& aSubsetOf0(xQ,xS)
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f78,plain,
( ! [X0] : ~ aElementOf0(X0,xQ)
& xQ = slcrc0 ),
inference(ennf_transformation,[],[f70]) ).
fof(f79,plain,
! [X0] :
( ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
! [X0] :
( X0 = slcrc0
<=> ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f126,plain,
! [X0] :
( ( ( sbrdtbr0(X0) = sz00
| slcrc0 != X0 )
& ( X0 = slcrc0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f79]) ).
fof(f128,plain,
! [X0] :
( ( X0 = slcrc0
| ~ aSet0(X0)
| ? [X1] : aElementOf0(X1,X0) )
& ( ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f85]) ).
fof(f129,plain,
! [X0] :
( ( X0 = slcrc0
| ~ aSet0(X0)
| ? [X1] : aElementOf0(X1,X0) )
& ( ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ( X0 = slcrc0
| ~ aSet0(X0)
| ? [X1] : aElementOf0(X1,X0) )
& ( ( aSet0(X0)
& ! [X2] : ~ aElementOf0(X2,X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f129]) ).
fof(f131,plain,
! [X0] :
( ( X0 = slcrc0
| ~ aSet0(X0)
| aElementOf0(sK5(X0),X0) )
& ( ( aSet0(X0)
& ! [X2] : ~ aElementOf0(X2,X0) )
| slcrc0 != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f130]) ).
fof(f144,plain,
sz00 != xk,
inference(cnf_transformation,[],[f62]) ).
fof(f176,plain,
xk = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f77]) ).
fof(f183,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f78]) ).
fof(f186,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| slcrc0 != X0
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f196,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f235,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| xQ != X0
| ~ aSet0(X0) ),
inference(definition_unfolding,[],[f186,f183]) ).
fof(f239,plain,
! [X0] :
( aSet0(X0)
| xQ != X0 ),
inference(definition_unfolding,[],[f196,f183]) ).
fof(f243,plain,
( sz00 = sbrdtbr0(xQ)
| ~ aSet0(xQ) ),
inference(equality_resolution,[],[f235]) ).
fof(f244,plain,
aSet0(xQ),
inference(equality_resolution,[],[f239]) ).
fof(f253,plain,
sz00 = sbrdtbr0(xQ),
inference(forward_subsumption_resolution,[],[f243,f244]) ).
fof(f255,plain,
sz00 = xk,
inference(forward_demodulation,[],[f176,f253]) ).
fof(f256,plain,
$false,
inference(forward_subsumption_resolution,[],[f255,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM550+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 % Computer : n001.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Sun Sep 27 20:33:17 UTC 2026
% 0.10/0.40 % CPUTime :
% 0.10/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.44 Running first-order theorem proving
% 0.10/0.44 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.75/1.39 % (3930238)Detected formulas, will run a generic FOF schedule.
% 2.75/1.39 % (3930247)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=554155930:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.75/1.39 % (3930247)First to succeed.
% 2.75/1.39 % (3930247)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3930238"
% 2.75/1.39 % (3930246)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4149329679:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.75/1.39 % (3930244)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=1858920549:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.75/1.39 % (3930245)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=479062537:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.75/1.39 % (3930243)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=2977153400:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.75/1.39 % (3930249)dis-21_1_sil=8000:lcm=predicate:random_seed=1239971465: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.75/1.39 % (3930246)Also succeeded, but the first one will report.
% 2.75/1.39 % (3930248)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2534570642:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.75/1.39 % (3930248)Also succeeded, but the first one will report.
% 2.75/1.39 % (3930249)Instruction limit reached!
% 2.75/1.39 % (3930249)------------------------------
% 2.75/1.39 % (3930249)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.39 % (3930249)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.39 % (3930249)CaDiCaL version: 2.1.3
% 2.75/1.39 % (3930249)Termination reason: Instruction limit
% 2.75/1.39 % (3930249)Termination phase: Saturation
% 2.75/1.39 % (3930249)Time elapsed: 0.067 s
% 2.75/1.39 % (3930249)Peak memory usage: 89 MB
% 2.75/1.39 % (3930249)Instructions burned: 129 (million)
% 2.75/1.39 % (3930247)Refutation found. Thanks to Tanya!
% 2.75/1.39 % SZS status Theorem for theBenchmark
% 2.75/1.39 % SZS output start Proof for theBenchmark
% See solution above
% 2.75/1.40 % (3930247)------------------------------
% 2.75/1.40 % (3930247)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.40 % (3930247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.40 % (3930247)CaDiCaL version: 2.1.3
% 2.75/1.40 % (3930247)Termination reason: Refutation
% 2.75/1.40 % (3930247)Time elapsed: 0.002 s
% 2.75/1.40 % (3930247)Peak memory usage: 88 MB
% 2.75/1.40 % (3930247)Instructions burned: 4 (million)
% 2.75/1.40 % (3930247)------------------------------
% 2.75/1.40 % (3930247)------------------------------
% 2.75/1.40 % (3930238)Success in time 0.309 s
% 2.75/1.40 % Vampire exiting
%------------------------------------------------------------------------------