%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET573+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:41:10 PM UTC 2026
% Result : Theorem 2.79s 1.39s
% Output : Refutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 24 ~; 14 |; 15 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 29 !; 9 ?)
% 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(f2,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f4,conjecture,
! [X0,X1,X2] :
( ( member(X0,X1)
& disjoint(X1,X2) )
=> ~ member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th12) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X1)
& disjoint(X1,X2) )
=> ~ member(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( disjoint(X0,X1)
=> ~ intersect(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f7,plain,
? [X0,X1,X2] :
( member(X0,X2)
& member(X0,X1)
& disjoint(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f8,plain,
? [X0,X1,X2] :
( member(X0,X2)
& member(X0,X1)
& disjoint(X1,X2) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
( member(sK0,sK2)
& member(sK0,sK1)
& disjoint(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f8]) ).
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,[],[f1]) ).
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(sK3(X0,X1),X0)
& member(sK3(X0,X1),X1) )
| ~ intersect(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1))],[f13]) ).
fof(f15,plain,
disjoint(sK1,sK2),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
member(sK0,sK1),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
member(sK0,sK2),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
! [X2,X0,X1] :
( intersect(X0,X1)
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
~ intersect(sK1,sK2),
inference(resolution,[],[f21,f15]) ).
fof(f26,plain,
! [X0] :
( ~ member(X0,sK2)
| ~ member(X0,sK1) ),
inference(resolution,[],[f20,f23]) ).
fof(f28,plain,
~ member(sK0,sK1),
inference(resolution,[],[f26,f17]) ).
fof(f31,plain,
$false,
inference(forward_subsumption_resolution,[],[f28,f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET573+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n007.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:09:25 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.39 % (1960602)Detected formulas, will run a generic FOF schedule.
% 2.79/1.39 % (1960611)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2153030280:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.79/1.39 % (1960611)First to succeed.
% 2.79/1.39 % (1960611)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1960602"
% 2.79/1.39 % (1960612)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=143887508:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.79/1.39 % (1960613)dis-21_1_sil=8000:lcm=predicate:random_seed=1845502545:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.79/1.39 % (1960607)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=591799685:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.79/1.39 % (1960608)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4073784153:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.79/1.39 % (1960609)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2038889105:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.79/1.39 % (1960610)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2539854184:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.79/1.39 % (1960610)Also succeeded, but the first one will report.
% 2.79/1.39 % (1960613)Also succeeded, but the first one will report.
% 2.79/1.39 % (1960612)Also succeeded, but the first one will report.
% 2.79/1.39 % (1960611)Refutation found. Thanks to Tanya!
% 2.79/1.39 % SZS status Theorem for theBenchmark
% 2.79/1.39 % SZS output start Proof for theBenchmark
% See solution above
% 2.79/1.39 % (1960611)------------------------------
% 2.79/1.39 % (1960611)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.39 % (1960611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.39 % (1960611)CaDiCaL version: 2.1.3
% 2.79/1.39 % (1960611)Termination reason: Refutation
% 2.79/1.39 % (1960611)Time elapsed: 0.002 s
% 2.79/1.39 % (1960611)Peak memory usage: 88 MB
% 2.79/1.39 % (1960611)Instructions burned: 1 (million)
% 2.79/1.39 % (1960611)------------------------------
% 2.79/1.39 % (1960611)------------------------------
% 2.79/1.39 % (1960602)Success in time 0.313 s
% 2.79/1.39 % Vampire exiting
%------------------------------------------------------------------------------