%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET062+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:42:52 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 11 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 22 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f5,conjecture,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_empty_set_subset) ).
fof(f6,negated_conjecture,
~ ! [X0] : subset(empty_set,X0),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
? [X0] : ~ subset(empty_set,X0),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f10]) ).
fof(f12,plain,
~ subset(empty_set,sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f8]) ).
fof(f13,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f18,plain,
~ subset(empty_set,sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X0] : subset(empty_set,X0),
inference(resolution,[],[f15,f13]) ).
fof(f28,plain,
$false,
inference(resolution,[],[f25,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET062+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 00:32:37 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.12/0.46 % (4110920)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (4110927)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1265337461:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46 % (4110927) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4110920-4110927"...
% 0.12/0.46 % (4110927)...printing done.
% 0.12/0.46 % (4110927)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (4110927)------------------------------
% 0.12/0.46 % (4110927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (4110927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (4110927)CaDiCaL version: 2.1.3
% 0.12/0.46 % (4110927)Termination reason: Refutation
% 0.12/0.46 % (4110927)Time elapsed: 0.001 s
% 0.12/0.46 % (4110927)Peak memory usage: 11 MB
% 0.12/0.46 % (4110920)Success in time 0.031 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------