%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM532+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 : n018.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:42 PM UTC 2026
% Result : Theorem 0.14s 0.43s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 39 ( 19 ~; 14 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 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(f12,axiom,
aSet0(xA),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__467) ).
fof(f13,conjecture,
aSubsetOf0(xA,xA),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f14,negated_conjecture,
~ aSubsetOf0(xA,xA),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
~ aSubsetOf0(xA,xA),
inference(flattening,[],[f14]) ).
fof(f25,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f33,plain,
! [X0,X1] :
( aSubsetOf0(X1,X0)
| aElementOf0(sK1(X0,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f34,plain,
! [X0,X1] :
( aSubsetOf0(X1,X0)
| ~ aElementOf0(sK1(X0,X1),X0)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
aSet0(xA),
inference(cnf_transformation,[],[f12]) ).
fof(f39,plain,
~ aSubsetOf0(xA,xA),
inference(cnf_transformation,[],[f15]) ).
fof(f43,plain,
( aElementOf0(sK1(xA,xA),xA)
| ~ aSet0(xA)
| ~ aSet0(xA) ),
inference(resolution,[],[f33,f39]) ).
fof(f46,plain,
( aElementOf0(sK1(xA,xA),xA)
| ~ aSet0(xA) ),
inference(duplicate_literal_removal,[],[f43]) ).
fof(f47,plain,
aElementOf0(sK1(xA,xA),xA),
inference(forward_subsumption_resolution,[],[f46,f38]) ).
fof(f48,plain,
( ~ aElementOf0(sK1(xA,xA),xA)
| ~ aSet0(xA)
| ~ aSet0(xA) ),
inference(resolution,[],[f34,f39]) ).
fof(f51,plain,
( ~ aElementOf0(sK1(xA,xA),xA)
| ~ aSet0(xA) ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f52,plain,
~ aSet0(xA),
inference(forward_subsumption_resolution,[],[f51,f47]) ).
fof(f53,plain,
$false,
inference(forward_subsumption_resolution,[],[f52,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM532+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.12/0.35 % Computer : n018.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8046.5625MB
% 0.12/0.35 % OS : Linux 6.8.0-71-generic
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 27 20:24:09 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.14/0.43 % (2697880)Will run a generic schedule for satisfiability detection.
% 0.14/0.43 % (2697889)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2540683375:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.43 % (2697889) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2697880-2697889"...
% 0.14/0.43 % (2697889)...printing done.
% 0.14/0.43 % (2697889)Refutation found. Thanks to Tanya!
% 0.14/0.43 % SZS status Theorem for theBenchmark
% 0.14/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.43 % (2697889)------------------------------
% 0.14/0.43 % (2697889)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.43 % (2697889)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.43 % (2697889)CaDiCaL version: 2.1.3
% 0.14/0.43 % (2697889)Termination reason: Refutation
% 0.14/0.43 % (2697889)Time elapsed: 0.001 s
% 0.14/0.43 % (2697889)Peak memory usage: 11 MB
% 0.14/0.43 % (2697889)Instructions burned: 1 (million)
% 0.14/0.43 % (2697880)Success in time 0.027 s
% 0.14/0.43 % Vampire exiting
%------------------------------------------------------------------------------