%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET096+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:05 PM UTC 2026
% Result : Theorem 0.16s 0.51s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 79 ( 33 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 61 ( 20 ~; 23 |; 10 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subclass(X0,X1)
& subclass(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f41,axiom,
! [X0] :
( X0 != null_class
=> ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(f44,conjecture,
! [X0,X1] :
( subclass(X0,singleton(X1))
=> ( X0 = null_class
| singleton(X1) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_subsets_of_singleton) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] :
( subclass(X0,singleton(X1))
=> ( X0 = null_class
| singleton(X1) = X0 ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f47,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f57,plain,
! [X0] :
( ? [X1] :
( member(X1,universal_class)
& member(X1,X0)
& disjoint(X1,X0) )
| null_class = X0 ),
inference(ennf_transformation,[],[f41]) ).
fof(f60,plain,
? [X0,X1] :
( null_class != X0
& singleton(X1) != X0
& subclass(X0,singleton(X1)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1] :
( null_class != X0
& singleton(X1) != X0
& subclass(X0,singleton(X1)) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ subclass(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f63,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f64,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f68,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f3]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f74,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f144,plain,
! [X0] :
( member(sK4(X0),X0)
| null_class = X0 ),
inference(cnf_transformation,[],[f57]) ).
fof(f149,plain,
subclass(sK6,singleton(sK7)),
inference(cnf_transformation,[],[f61]) ).
fof(f150,plain,
sK6 != singleton(sK7),
inference(cnf_transformation,[],[f61]) ).
fof(f151,plain,
null_class != sK6,
inference(cnf_transformation,[],[f61]) ).
fof(f189,plain,
sK6 != unordered_pair(sK7,sK7),
inference(definition_unfolding,[],[f150,f74]) ).
fof(f190,plain,
subclass(sK6,unordered_pair(sK7,sK7)),
inference(definition_unfolding,[],[f149,f74]) ).
fof(f258,plain,
! [X0] :
( ~ member(X0,sK6)
| member(X0,unordered_pair(sK7,sK7)) ),
inference(resolution,[],[f62,f190]) ).
fof(f269,plain,
( ~ subclass(unordered_pair(sK7,sK7),sK6)
| sK6 = unordered_pair(sK7,sK7) ),
inference(resolution,[],[f68,f190]) ).
fof(f270,plain,
~ subclass(unordered_pair(sK7,sK7),sK6),
inference(forward_subsumption_resolution,[],[f269,f189]) ).
fof(f328,plain,
( member(sK4(sK6),unordered_pair(sK7,sK7))
| null_class = sK6 ),
inference(resolution,[],[f258,f144]) ).
fof(f330,plain,
member(sK4(sK6),unordered_pair(sK7,sK7)),
inference(forward_subsumption_resolution,[],[f328,f151]) ).
fof(f349,plain,
! [X2,X0,X1] :
( subclass(unordered_pair(X0,X1),X2)
| sK0(unordered_pair(X0,X1),X2) = X1
| sK0(unordered_pair(X0,X1),X2) = X0 ),
inference(resolution,[],[f71,f63]) ).
fof(f360,plain,
( sK7 = sK4(sK6)
| sK7 = sK4(sK6) ),
inference(resolution,[],[f330,f71]) ).
fof(f364,plain,
sK7 = sK4(sK6),
inference(duplicate_literal_removal,[],[f360]) ).
fof(f372,plain,
( member(sK7,sK6)
| null_class = sK6 ),
inference(superposition,[],[f144,f364]) ).
fof(f373,plain,
member(sK7,sK6),
inference(forward_subsumption_resolution,[],[f372,f151]) ).
fof(f2546,plain,
( sK7 = sK0(unordered_pair(sK7,sK7),sK6)
| sK7 = sK0(unordered_pair(sK7,sK7),sK6) ),
inference(resolution,[],[f349,f270]) ).
fof(f2550,plain,
sK7 = sK0(unordered_pair(sK7,sK7),sK6),
inference(duplicate_literal_removal,[],[f2546]) ).
fof(f3917,plain,
( ~ member(sK7,sK6)
| subclass(unordered_pair(sK7,sK7),sK6) ),
inference(superposition,[],[f64,f2550]) ).
fof(f3920,plain,
subclass(unordered_pair(sK7,sK7),sK6),
inference(forward_subsumption_resolution,[],[f3917,f373]) ).
fof(f3921,plain,
$false,
inference(forward_subsumption_resolution,[],[f3920,f270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET096+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n010.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 00:40:17 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.16/0.51 % (1463884)Will run a generic schedule for satisfiability detection.
% 0.16/0.51 % (1463890)% WARNING: option uhcvi not known.
% 0.16/0.51 % (1463890)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3524078216:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.51 % (1463893)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=353413309:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.51 % (1463889)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=177178307_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.51 % (1463891)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1907782597:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.51 % (1463894)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1538856391:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.51 % (1463892)dis+10_1_sil=32000:sp=arity:random_seed=2093744051:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.51 % (1463895)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4014707155:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.51 % TRYING [1]
% 0.16/0.51 % TRYING [2]
% 0.16/0.51 % TRYING [3]
% 0.16/0.51 % (1463890) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1463884-1463890"...
% 0.16/0.51 % (1463890)...printing done.
% 0.16/0.51 % (1463890)Refutation found. Thanks to Tanya!
% 0.16/0.51 % SZS status Theorem for theBenchmark
% 0.16/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.51 % (1463890)------------------------------
% 0.16/0.51 % (1463890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.51 % (1463890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.51 % (1463890)CaDiCaL version: 2.1.3
% 0.16/0.51 % (1463890)Termination reason: Refutation
% 0.16/0.51 % (1463890)Time elapsed: 0.062 s
% 0.16/0.51 % (1463890)Peak memory usage: 14 MB
% 0.16/0.51 % (1463890)Instructions burned: 177 (million)
% 0.16/0.51 % (1463884)Success in time 0.091 s
% 0.16/0.51 % Vampire exiting
%------------------------------------------------------------------------------