%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:44:14 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 12 |; 7 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f2,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f3,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f6,conjecture,
! [X0] : disjoint(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th104) ).
fof(f7,negated_conjecture,
~ ! [X0] : disjoint(X0,empty_set),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f9,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f11,plain,
? [X0] : ~ disjoint(X0,empty_set),
inference(ennf_transformation,[],[f7]) ).
fof(f12,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f13,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ? [X3] :
( member(X3,X0)
& member(X3,X1) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) )
| ~ intersect(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f13]) ).
fof(f15,plain,
~ disjoint(sK1,empty_set),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f11]) ).
fof(f16,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f1]) ).
fof(f17,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f22,plain,
~ disjoint(sK1,empty_set),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
intersect(sK1,empty_set),
inference(resolution,[],[f20,f22]) ).
fof(f25,plain,
member(sK0(sK1,empty_set),empty_set),
inference(resolution,[],[f17,f23]) ).
fof(f26,plain,
$false,
inference(forward_subsumption_resolution,[],[f25,f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n017.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 02:18:05 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.18/0.47 % (3153580)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (3153599)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=793617626:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (3153599) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3153580-3153599"...
% 0.18/0.47 % (3153599)...printing done.
% 0.18/0.47 % (3153599)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (3153599)------------------------------
% 0.18/0.47 % (3153599)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (3153599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (3153599)CaDiCaL version: 2.1.3
% 0.18/0.47 % (3153599)Termination reason: Refutation
% 0.18/0.47 % (3153599)Time elapsed: 0.001 s
% 0.18/0.47 % (3153599)Peak memory usage: 11 MB
% 0.18/0.47 % (3153580)Success in time 0.036 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------