%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET628+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 8 unt; 2 def)
% Number of atoms : 96 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 80 ( 30 ~; 40 |; 1 &)
% ( 8 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f2,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f4,axiom,
! [X0,X1] :
( not_equal(X0,X1)
<=> X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_equal_defn) ).
fof(f7,conjecture,
! [X0] :
( intersect(X0,X0)
<=> not_equal(X0,empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th110) ).
fof(f8,negated_conjecture,
~ ! [X0] :
( intersect(X0,X0)
<=> not_equal(X0,empty_set) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f10,plain,
? [X0] :
( intersect(X0,X0)
<~> not_equal(X0,empty_set) ),
inference(ennf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1] :
( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f20,plain,
! [X0,X1] :
( X0 != X1
| ~ not_equal(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f22,plain,
( not_equal(sK2,empty_set)
| intersect(sK2,sK2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
( ~ not_equal(sK2,empty_set)
| ~ intersect(sK2,sK2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f26,plain,
! [X1] : ~ not_equal(X1,X1),
inference(equality_resolution,[],[f20]) ).
fof(f28,definition,
( spl3_1
<=> intersect(sK2,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f29,plain,
( ~ intersect(sK2,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f30,plain,
( intersect(sK2,sK2)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f32,definition,
( spl3_2
<=> not_equal(sK2,empty_set) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f33,plain,
( ~ not_equal(sK2,empty_set)
| spl3_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f34,plain,
( not_equal(sK2,empty_set)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f35,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f22,f32,f28]) ).
fof(f36,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f23,f32,f28]) ).
fof(f38,plain,
! [X0] : ~ intersect(X0,empty_set),
inference(resolution,[],[f11,f14]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ member(sK1(X0,X1),X2)
| X0 = X1
| member(sK1(X0,X1),X0)
| intersect(X2,X1) ),
inference(resolution,[],[f17,f13]) ).
fof(f44,plain,
! [X0] :
( member(sK1(empty_set,X0),X0)
| empty_set = X0 ),
inference(resolution,[],[f17,f14]) ).
fof(f60,plain,
! [X0] :
( empty_set = X0
| member(sK1(empty_set,X0),empty_set)
| intersect(X0,X0)
| empty_set = X0 ),
inference(resolution,[],[f43,f44]) ).
fof(f61,plain,
! [X0] :
( empty_set = X0
| member(sK1(empty_set,X0),empty_set)
| intersect(X0,X0) ),
inference(duplicate_literal_removal,[],[f60]) ).
fof(f65,plain,
! [X0] :
( intersect(X0,X0)
| empty_set = X0 ),
inference(forward_subsumption_resolution,[],[f61,f14]) ).
fof(f75,plain,
( empty_set = sK2
| spl3_1 ),
inference(resolution,[],[f65,f29]) ).
fof(f128,plain,
( not_equal(sK2,sK2)
| spl3_1
| ~ spl3_2 ),
inference(superposition,[],[f34,f75]) ).
fof(f135,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f128,f26]) ).
fof(f136,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f135]) ).
fof(f140,plain,
( empty_set = sK2
| spl3_2 ),
inference(resolution,[],[f33,f19]) ).
fof(f143,plain,
( ! [X0] : ~ intersect(X0,sK2)
| spl3_2 ),
inference(superposition,[],[f38,f140]) ).
fof(f157,plain,
( $false
| ~ spl3_1
| spl3_2 ),
inference(backward_subsumption_resolution,[],[f30,f143]) ).
fof(f159,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f157]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f35]) ).
cnf(s2,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f36]) ).
cnf(s3,plain,
( spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f136]) ).
cnf(s4,plain,
( ~ spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f159]) ).
cnf(s5,plain,
spl3_1,
inference(rat,[],[s1,s3]) ).
cnf(s6,plain,
spl3_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s6,s5]) ).
fof(f160,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET628+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 02:18:35 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % (3154875)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3154881)% WARNING: option uhcvi not known.
% 0.11/0.44 % (3154881)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2047361028:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.44 % (3154880)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3940883928_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.44 % (3154882)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2519642771:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.44 % (3154883)dis+10_1_sil=32000:sp=arity:random_seed=1037150369:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.44 % (3154884)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4246763407:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.44 % (3154885)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2866792322:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.44 % (3154886)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1462213570:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.44 % (3154881) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3154875-3154881"...
% 0.11/0.44 % TRYING [1]
% 0.11/0.44 % TRYING [2]
% 0.11/0.44 % TRYING [3]
% 0.11/0.44 % (3154881)...printing done.
% 0.11/0.44 % TRYING [4]
% 0.11/0.44 % (3154884) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3154875-3154884"...
% 0.11/0.44 % (3154881)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (3154881)------------------------------
% 0.11/0.44 % (3154881)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3154881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3154881)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3154881)Termination reason: Refutation
% 0.11/0.44 % (3154881)Time elapsed: 0.003 s
% 0.11/0.44 % (3154881)Peak memory usage: 13 MB
% 0.11/0.44 % (3154881)Instructions burned: 4 (million)
% 0.11/0.44 % (3154875)Success in time 0.036 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------