%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n009.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:02 PM UTC 2026
% Result : Theorem 0.04s 0.45s
% Output : Refutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 69 ( 14 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 57 ( 20 ~; 19 |; 11 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 44 !; 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(f3,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
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(f16,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
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(f19,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f3]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f37,plain,
empty_set = intersection(sK3,sK4),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
subset(sK2,sK4),
inference(cnf_transformation,[],[f18]) ).
fof(f39,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f18]) ).
fof(f45,plain,
! [X0] : member(X0,empty_set),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f50,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X2,X1)
| member(X2,X0) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f89,plain,
! [X0] :
( ~ member(X0,sK4)
| member(X0,sK2) ),
inference(resolution,[],[f51,f38]) ).
fof(f90,plain,
! [X0] :
( ~ member(X0,sK3)
| member(X0,sK2) ),
inference(resolution,[],[f51,f39]) ).
fof(f98,plain,
! [X0] :
( ~ member(X0,empty_set)
| member(X0,sK3)
| member(X0,sK4) ),
inference(superposition,[],[f46,f37]) ).
fof(f101,plain,
! [X0] :
( member(X0,sK4)
| member(X0,sK3) ),
inference(forward_subsumption_resolution,[],[f98,f45]) ).
fof(f117,plain,
! [X0] :
( member(X0,sK3)
| member(X0,sK2) ),
inference(resolution,[],[f101,f89]) ).
fof(f119,plain,
! [X0] : member(X0,sK2),
inference(forward_subsumption_resolution,[],[f117,f90]) ).
fof(f120,plain,
! [X0] : subset(sK2,X0),
inference(resolution,[],[f119,f50]) ).
fof(f122,plain,
empty_set = sK2,
inference(resolution,[],[f120,f19]) ).
fof(f126,plain,
$false,
inference(forward_subsumption_resolution,[],[f122,f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 SAT
% 0.11/0.38 % Computer : n009.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:17:00 UTC 2026
% 0.04/0.38 % CPUTime :
% 0.04/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.41 Running first-order model finding
% 0.04/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.04/0.45 % (2603785)Will run a generic schedule for satisfiability detection.
% 0.04/0.45 % (2603790)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1556970920_3000 on theBenchmark for (3000ds/0Mi)
% 0.04/0.45 % TRYING [1]
% 0.04/0.45 % TRYING [2]
% 0.04/0.45 % TRYING [3]
% 0.04/0.45 % TRYING [4]
% 0.04/0.45 % (2603791)% WARNING: option uhcvi not known.
% 0.04/0.45 % TRYING [5]
% 0.04/0.45 % TRYING [6]
% 0.04/0.45 % (2603791)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2880592178:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.04/0.45 % (2603792)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3679022767:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.04/0.45 % (2603793)dis+10_1_sil=32000:sp=arity:random_seed=321940999:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.04/0.45 % (2603794)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1178845697:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.04/0.45 % (2603795)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2374249711:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.04/0.45 % (2603796)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2407090196:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.04/0.45 % (2603795) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2603785-2603795"...
% 0.04/0.45 % (2603791) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2603785-2603791"...
% 0.04/0.45 % (2603794) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2603785-2603794"...
% 0.04/0.45 % (2603793) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2603785-2603793"...
% 0.04/0.45 % TRYING [7]
% 0.04/0.45 % (2603795)...printing done.
% 0.04/0.45 % (2603791)...printing done.
% 0.04/0.45 % (2603794)...printing done.
% 0.04/0.45 % (2603793)...printing done.
% 0.04/0.45 % (2603796) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2603785-2603796"...
% 0.04/0.45 % (2603791)Refutation found. Thanks to Tanya!
% 0.04/0.45 % SZS status Theorem for theBenchmark
% 0.04/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.04/0.45 % (2603791)------------------------------
% 0.04/0.45 % (2603791)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.04/0.45 % (2603791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.04/0.45 % (2603791)CaDiCaL version: 2.1.3
% 0.04/0.45 % (2603791)Termination reason: Refutation
% 0.04/0.45 % (2603791)Time elapsed: 0.004 s
% 0.04/0.45 % (2603791)Peak memory usage: 12 MB
% 0.04/0.45 % (2603791)Instructions burned: 3 (million)
% 0.04/0.45 % (2603785)Success in time 0.029 s
% 0.04/0.45 % Vampire exiting
%------------------------------------------------------------------------------