%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET148+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:40:18 PM UTC 2026
% Result : Theorem 2.54s 1.34s
% Output : Refutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 70 ( 28 ~; 26 |; 9 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 57 ( 55 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
fof(f12,conjecture,
! [X0] : equal_set(intersection(X0,X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI13) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(intersection(X0,X0),X0),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f16,plain,
? [X0] : ~ equal_set(intersection(X0,X0),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f20,plain,
~ equal_set(intersection(sK0,sK0),sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f16]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f19]) ).
fof(f24,plain,
~ equal_set(intersection(sK0,sK0),sK0),
inference(cnf_transformation,[],[f20]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f27,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f28,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X0,X1] :
( member(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f30,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(sK1(intersection(X0,X1),X2),X0)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f29,f26]) ).
fof(f35,plain,
( ~ subset(sK0,intersection(sK0,sK0))
| ~ subset(intersection(sK0,sK0),sK0) ),
inference(resolution,[],[f28,f24]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ member(sK1(X0,intersection(X1,X2)),X2)
| ~ member(sK1(X0,intersection(X1,X2)),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[],[f27,f30]) ).
fof(f39,plain,
! [X0,X1] :
( subset(intersection(X0,X1),X0)
| subset(intersection(X0,X1),X0) ),
inference(resolution,[],[f31,f30]) ).
fof(f42,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(duplicate_literal_removal,[],[f39]) ).
fof(f51,plain,
! [X0,X1] :
( ~ member(sK1(X0,intersection(X1,X1)),X1)
| subset(X0,intersection(X1,X1)) ),
inference(factoring,[],[f38]) ).
fof(f55,plain,
! [X0] :
( subset(X0,intersection(X0,X0))
| subset(X0,intersection(X0,X0)) ),
inference(resolution,[],[f51,f29]) ).
fof(f61,plain,
! [X0] : subset(X0,intersection(X0,X0)),
inference(duplicate_literal_removal,[],[f55]) ).
fof(f62,plain,
~ subset(intersection(sK0,sK0),sK0),
inference(resolution,[],[f61,f35]) ).
fof(f63,plain,
$false,
inference(forward_subsumption_resolution,[],[f62,f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET148+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n005.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 00:54:32 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.54/1.34 % (334437)Detected formulas, will run a generic FOF schedule.
% 2.54/1.34 % (334446)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2059733423:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.54/1.34 % (334446)First to succeed.
% 2.54/1.34 % (334446)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-334437"
% 2.54/1.34 % (334445)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2455824763:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.54/1.34 % (334448)dis-21_1_sil=8000:lcm=predicate:random_seed=2224838120: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.54/1.34 % (334442)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=3099070953:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.54/1.34 % (334443)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=2246883920:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.54/1.34 % (334444)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=28447576:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.54/1.34 % (334445)Refutation not found, incomplete strategy
% 2.54/1.34 % (334445)------------------------------
% 2.54/1.34 % (334445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.34 % (334445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.34 % (334445)CaDiCaL version: 2.1.3
% 2.54/1.34 % (334445)Termination reason: Refutation not found, incomplete strategy
% 2.54/1.34 % (334445)Time elapsed: 0.001 s
% 2.54/1.34 % (334445)Peak memory usage: 87 MB
% 2.54/1.34 % (334448)Also succeeded, but the first one will report.
% 2.54/1.34 % (334447)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1264515343:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.54/1.34 % (334447)Also succeeded, but the first one will report.
% 2.54/1.34 % (334446)Refutation found. Thanks to Tanya!
% 2.54/1.34 % SZS status Theorem for theBenchmark
% 2.54/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.34 % (334446)------------------------------
% 2.54/1.34 % (334446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.34 % (334446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.34 % (334446)CaDiCaL version: 2.1.3
% 2.54/1.34 % (334446)Termination reason: Refutation
% 2.54/1.34 % (334446)Time elapsed: 0.001 s
% 2.54/1.34 % (334446)Peak memory usage: 88 MB
% 2.54/1.34 % (334446)Instructions burned: 1 (million)
% 2.54/1.34 % (334446)------------------------------
% 2.54/1.34 % (334446)------------------------------
% 2.54/1.34 % (334437)Success in time 0.273 s
% 2.54/1.34 % Vampire exiting
%------------------------------------------------------------------------------