%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET575+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 : n008.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:43:58 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 53 ( 23 ~; 16 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 30 ( 23 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f3,conjecture,
! [X0,X1] :
( intersect(X0,X1)
=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th15) ).
fof(f4,negated_conjecture,
~ ! [X0,X1] :
( intersect(X0,X1)
=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f6,plain,
? [X0,X1] :
( ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) )
& intersect(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f7,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,[],[f1]) ).
fof(f8,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,[],[f7]) ).
fof(f9,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))],[f8]) ).
fof(f10,plain,
( ! [X2] :
( ~ member(X2,sK1)
| ~ member(X2,sK2) )
& intersect(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f6]) ).
fof(f11,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
intersect(sK1,sK2),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
! [X0] :
( ~ member(sK0(X0,sK2),sK1)
| ~ intersect(X0,sK2) ),
inference(resolution,[],[f11,f16]) ).
fof(f18,plain,
( ~ intersect(sK1,sK2)
| ~ intersect(sK1,sK2) ),
inference(resolution,[],[f12,f17]) ).
fof(f20,plain,
~ intersect(sK1,sK2),
inference(duplicate_literal_removal,[],[f18]) ).
fof(f21,plain,
$false,
inference(resolution,[],[f20,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET575+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n008.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 : Mon Sep 28 02:13:10 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.45 % (1805601)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1805612)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1091061504:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (1805612) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1805601-1805612"...
% 0.11/0.45 % (1805612)...printing done.
% 0.11/0.45 % (1805612)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1805612)------------------------------
% 0.11/0.45 % (1805612)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1805612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1805612)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1805612)Termination reason: Refutation
% 0.11/0.45 % (1805612)Time elapsed: 0.001 s
% 0.11/0.45 % (1805612)Peak memory usage: 12 MB
% 0.11/0.45 % (1805612)Instructions burned: 1 (million)
% 0.11/0.45 % (1805601)Success in time 0.029 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------