%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM551+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 : n017.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:47 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 56 ( 12 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 47 ( 17 ~; 20 |; 6 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 20 ( 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f5,axiom,
! [X0] :
( X0 = slcrc0
<=> ( aSet0(X0)
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(f66,axiom,
( aSet0(xQ)
& isFinite0(xQ)
& sbrdtbr0(xQ) = xk ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2291) ).
fof(f67,axiom,
xQ != slcrc0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2313) ).
fof(f68,conjecture,
? [X0] :
( aElement0(X0)
& aElementOf0(X0,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f69,negated_conjecture,
~ ? [X0] :
( aElement0(X0)
& aElementOf0(X0,xQ) ),
inference(negated_conjecture,[status(cth)],[f68]) ).
fof(f72,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f75,plain,
! [X0] :
( X0 = slcrc0
<=> ( aSet0(X0)
& ! [X1] : ~ aElementOf0(X1,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f162,plain,
! [X0] :
( ~ aElement0(X0)
| ~ aElementOf0(X0,xQ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f163,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aElementOf0(X1,X0)
| aElement0(X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f166,plain,
! [X0] :
( aElementOf0(sK0(X0),X0)
| ~ aSet0(X0)
| slcrc0 = X0 ),
inference(cnf_transformation,[],[f75]) ).
fof(f277,plain,
aSet0(xQ),
inference(cnf_transformation,[],[f66]) ).
fof(f278,plain,
slcrc0 != xQ,
inference(cnf_transformation,[],[f67]) ).
fof(f279,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f310,plain,
! [X0,X1] :
( ~ aElement0(X1)
| aElementOf0(X1,X0)
| aSet0(X0) ),
inference(consistent_polarity_flipping,[],[f163]) ).
fof(f311,plain,
! [X0] :
( ~ aElementOf0(sK0(X0),X0)
| aSet0(X0)
| slcrc0 = X0 ),
inference(consistent_polarity_flipping,[],[f166]) ).
fof(f415,plain,
~ aSet0(xQ),
inference(consistent_polarity_flipping,[],[f277]) ).
fof(f416,plain,
! [X0] :
( aElementOf0(X0,xQ)
| aElement0(X0) ),
inference(consistent_polarity_flipping,[],[f279]) ).
fof(f456,plain,
( aSet0(xQ)
| slcrc0 = xQ
| aElement0(sK0(xQ)) ),
inference(resolution,[],[f311,f416]) ).
fof(f460,plain,
( slcrc0 = xQ
| aElement0(sK0(xQ)) ),
inference(forward_subsumption_resolution,[],[f456,f415]) ).
fof(f470,plain,
aElement0(sK0(xQ)),
inference(forward_subsumption_resolution,[],[f460,f278]) ).
fof(f487,plain,
! [X0] :
( aElementOf0(sK0(xQ),X0)
| aSet0(X0) ),
inference(resolution,[],[f470,f310]) ).
fof(f491,plain,
( aSet0(xQ)
| aSet0(xQ)
| slcrc0 = xQ ),
inference(resolution,[],[f487,f311]) ).
fof(f493,plain,
( aSet0(xQ)
| slcrc0 = xQ ),
inference(duplicate_literal_removal,[],[f491]) ).
fof(f503,plain,
slcrc0 = xQ,
inference(forward_subsumption_resolution,[],[f493,f415]) ).
fof(f504,plain,
$false,
inference(forward_subsumption_resolution,[],[f503,f278]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM551+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 20:22:51 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.16/0.47 % (2914399)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (2914404)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3366678781_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (2914405)% WARNING: option uhcvi not known.
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (2914405)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3260965106:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (2914406)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3710232986:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (2914407)dis+10_1_sil=32000:sp=arity:random_seed=1049382731:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (2914409)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=609097668:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (2914408)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=435636349:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (2914410)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2820554167:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % TRYING [4]
% 0.16/0.47 % (2914405) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2914399-2914405"...
% 0.16/0.47 % (2914409) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2914399-2914409"...
% 0.16/0.47 % (2914405)...printing done.
% 0.16/0.47 % (2914405)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (2914405)------------------------------
% 0.16/0.47 % (2914405)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (2914405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (2914405)CaDiCaL version: 2.1.3
% 0.16/0.47 % (2914405)Termination reason: Refutation
% 0.16/0.47 % (2914405)Time elapsed: 0.007 s
% 0.16/0.47 % (2914405)Peak memory usage: 12 MB
% 0.16/0.47 % (2914405)Instructions burned: 8 (million)
% 0.16/0.47 % (2914399)Success in time 0.042 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------