%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET146+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 : n014.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:43:16 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 77 ( 14 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 82 ( 33 ~; 28 |; 16 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 49 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_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
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f9,conjecture,
! [X0] : intersection(X0,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th61) ).
fof(f10,negated_conjecture,
~ ! [X0] : intersection(X0,empty_set) = empty_set,
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f12,plain,
? [X0] : empty_set != intersection(X0,empty_set),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f18]) ).
fof(f23,plain,
empty_set != intersection(sK2,empty_set),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f12]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f2]) ).
fof(f30,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f33,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
empty_set != intersection(sK2,empty_set),
inference(cnf_transformation,[],[f23]) ).
fof(f68,plain,
! [X0] : subset(empty_set,X0),
inference(resolution,[],[f33,f27]) ).
fof(f70,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f33,f24]) ).
fof(f143,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(resolution,[],[f30,f68]) ).
fof(f521,plain,
! [X0,X1] : subset(intersection(X0,empty_set),X1),
inference(resolution,[],[f70,f27]) ).
fof(f550,plain,
! [X0] : empty_set = intersection(X0,empty_set),
inference(resolution,[],[f521,f143]) ).
fof(f568,plain,
empty_set != empty_set,
inference(superposition,[],[f40,f550]) ).
fof(f569,plain,
$false,
inference(trivial_inequality_removal,[],[f568]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET146+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 28 00:54:01 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 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.14/0.45 % (1330626)Will run a generic schedule for satisfiability detection.
% 0.14/0.45 % (1330633)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1269925695:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.45 % (1330632)% WARNING: option uhcvi not known.
% 0.14/0.45 % (1330632)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1384821377:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.45 % (1330633) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1330626-1330633"...
% 0.14/0.45 % (1330633)...printing done.
% 0.14/0.45 % (1330631)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=770314167_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.45 % (1330635)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1266608799:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.45 % (1330636)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1042611658:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.45 % (1330637)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2059962638:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.45 % (1330634)dis+10_1_sil=32000:sp=arity:random_seed=3574484943:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.45 % (1330632) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1330626-1330632"...
% 0.14/0.45 % TRYING [1]
% 0.14/0.45 % (1330633)Refutation found. Thanks to Tanya!
% 0.14/0.45 % SZS status Theorem for theBenchmark
% 0.14/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.45 % (1330633)------------------------------
% 0.14/0.45 % (1330633)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.45 % (1330633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.45 % (1330633)CaDiCaL version: 2.1.3
% 0.14/0.45 % (1330633)Termination reason: Refutation
% 0.14/0.45 % (1330633)Time elapsed: 0.009 s
% 0.14/0.45 % (1330633)Peak memory usage: 12 MB
% 0.14/0.45 % (1330633)Instructions burned: 15 (million)
% 0.14/0.45 % (1330626)Success in time 0.033 s
% 0.14/0.45 % Vampire exiting
%------------------------------------------------------------------------------