%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET592+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 : 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:41:15 PM UTC 2026
% Result : Theorem 2.70s 1.35s
% Output : Refutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 52 ( 18 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 18 ~; 13 |; 14 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
fof(f11,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2)
& intersection(X1,X2) = empty_set )
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2)
& intersection(X1,X2) = empty_set )
=> X0 = empty_set ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(flattening,[],[f14]) ).
fof(f17,plain,
? [X0,X1,X2] :
( empty_set != X0
& subset(X0,X1)
& subset(X0,X2)
& intersection(X1,X2) = empty_set ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,plain,
? [X0,X1,X2] :
( empty_set != X0
& subset(X0,X1)
& subset(X0,X2)
& intersection(X1,X2) = empty_set ),
inference(flattening,[],[f17]) ).
fof(f29,plain,
( empty_set != sK2
& subset(sK2,sK3)
& subset(sK2,sK4)
& empty_set = intersection(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f18]) ).
fof(f30,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f31,plain,
! [X2,X0,X1] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f48,plain,
empty_set = intersection(sK3,sK4),
inference(cnf_transformation,[],[f29]) ).
fof(f49,plain,
subset(sK2,sK4),
inference(cnf_transformation,[],[f29]) ).
fof(f50,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f29]) ).
fof(f98,plain,
! [X0] :
( subset(X0,empty_set)
| ~ subset(X0,sK3)
| ~ subset(X0,sK4) ),
inference(superposition,[],[f31,f48]) ).
fof(f122,plain,
! [X0] :
( ~ subset(X0,sK4)
| ~ subset(X0,sK3)
| empty_set = X0 ),
inference(resolution,[],[f98,f30]) ).
fof(f285,plain,
( ~ subset(sK2,sK3)
| empty_set = sK2 ),
inference(resolution,[],[f122,f49]) ).
fof(f298,plain,
empty_set = sK2,
inference(forward_subsumption_resolution,[],[f285,f50]) ).
fof(f299,plain,
$false,
inference(forward_subsumption_resolution,[],[f298,f51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET592+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 02:12:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.70/1.35 % (3151233)Detected formulas, will run a generic FOF schedule.
% 2.70/1.35 % (3151315)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=853240865:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.70/1.35 % (3151315)First to succeed.
% 2.70/1.35 % (3151315)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3151233"
% 2.70/1.35 % (3151306)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=1268442941:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.70/1.35 % (3151313)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1896733250:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.70/1.35 % (3151308)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=3160663526:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.70/1.35 % (3151312)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=3532589661:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.70/1.35 % (3151316)dis-21_1_sil=8000:lcm=predicate:random_seed=3202852971: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.70/1.35 % (3151313)Also succeeded, but the first one will report.
% 2.70/1.35 % (3151314)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4087005777:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.70/1.35 % (3151314)Also succeeded, but the first one will report.
% 2.70/1.35 % (3151316)Instruction limit reached!
% 2.70/1.35 % (3151316)------------------------------
% 2.70/1.35 % (3151316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.35 % (3151316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.35 % (3151316)CaDiCaL version: 2.1.3
% 2.70/1.35 % (3151316)Termination reason: Instruction limit
% 2.70/1.35 % (3151316)Termination phase: Saturation
% 2.70/1.35 % (3151316)Time elapsed: 0.080 s
% 2.70/1.35 % (3151316)Peak memory usage: 89 MB
% 2.70/1.35 % (3151316)Instructions burned: 129 (million)
% 2.70/1.35 % (3151315)Refutation found. Thanks to Tanya!
% 2.70/1.35 % SZS status Theorem for theBenchmark
% 2.70/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 2.70/1.35 % (3151315)------------------------------
% 2.70/1.35 % (3151315)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.70/1.35 % (3151315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/1.35 % (3151315)CaDiCaL version: 2.1.3
% 2.70/1.35 % (3151315)Termination reason: Refutation
% 2.70/1.35 % (3151315)Time elapsed: 0.006 s
% 2.70/1.35 % (3151315)Peak memory usage: 89 MB
% 2.70/1.35 % (3151315)Instructions burned: 11 (million)
% 2.70/1.35 % (3151315)------------------------------
% 2.70/1.35 % (3151315)------------------------------
% 2.70/1.35 % (3151233)Success in time 0.3 s
% 2.70/1.35 % Vampire exiting
%------------------------------------------------------------------------------