%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET091+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:04 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 46 ( 37 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 45 ( 21 ~; 14 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f46,axiom,
! [X0] :
( member(member_of(X0),universal_class)
| member_of(X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_universal_self) ).
fof(f47,axiom,
! [X0] :
( singleton(member_of(X0)) = X0
| member_of(X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_self) ).
fof(f48,conjecture,
! [X0,X1] :
( ( ~ ? [X2] :
( member(X2,universal_class)
& X0 = singleton(X2) )
& X0 = X1 )
=> member_of(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_when_not_a_singleton) ).
fof(f49,negated_conjecture,
~ ! [X0,X1] :
( ( ~ ? [X2] :
( member(X2,universal_class)
& X0 = singleton(X2) )
& X0 = X1 )
=> member_of(X0) = X1 ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f66,plain,
? [X0,X1] :
( member_of(X0) != X1
& ! [X2] :
( ~ member(X2,universal_class)
| singleton(X2) != X0 )
& X0 = X1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f67,plain,
? [X0,X1] :
( member_of(X0) != X1
& ! [X2] :
( ~ member(X2,universal_class)
| singleton(X2) != X0 )
& X0 = X1 ),
inference(flattening,[],[f66]) ).
fof(f80,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f157,plain,
! [X0] :
( member(member_of(X0),universal_class)
| member_of(X0) = X0 ),
inference(cnf_transformation,[],[f46]) ).
fof(f158,plain,
! [X0] :
( member_of(X0) = X0
| singleton(member_of(X0)) = X0 ),
inference(cnf_transformation,[],[f47]) ).
fof(f159,plain,
! [X2] :
( singleton(X2) != sK6
| ~ member(X2,universal_class) ),
inference(cnf_transformation,[],[f67]) ).
fof(f160,plain,
sK6 = sK7,
inference(cnf_transformation,[],[f67]) ).
fof(f161,plain,
sK7 != member_of(sK6),
inference(cnf_transformation,[],[f67]) ).
fof(f201,plain,
! [X0] :
( unordered_pair(member_of(X0),member_of(X0)) = X0
| member_of(X0) = X0 ),
inference(definition_unfolding,[],[f158,f80]) ).
fof(f202,plain,
sK7 != member_of(sK7),
inference(definition_unfolding,[],[f161,f160]) ).
fof(f203,plain,
! [X2] :
( ~ member(X2,universal_class)
| sK7 != unordered_pair(X2,X2) ),
inference(definition_unfolding,[],[f159,f80,f160]) ).
fof(f312,plain,
! [X0] :
( sK7 != unordered_pair(member_of(X0),member_of(X0))
| member_of(X0) = X0 ),
inference(resolution,[],[f157,f203]) ).
fof(f474,plain,
! [X0] :
( sK7 != X0
| member_of(X0) = X0
| member_of(X0) = X0 ),
inference(superposition,[],[f312,f201]) ).
fof(f485,plain,
! [X0] :
( member_of(X0) = X0
| sK7 != X0 ),
inference(duplicate_literal_removal,[],[f474]) ).
fof(f488,plain,
( sK7 != sK7
| sK7 != sK7 ),
inference(superposition,[],[f202,f485]) ).
fof(f490,plain,
sK7 != sK7,
inference(duplicate_literal_removal,[],[f488]) ).
fof(f491,plain,
$false,
inference(trivial_inequality_removal,[],[f490]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET091+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n020.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 00:39:35 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.11/0.46 % (3922421)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (3922430)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1698647187:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (3922427)% WARNING: option uhcvi not known.
% 0.11/0.46 % (3922426)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2939081934_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % (3922427)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3320374214:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46 % (3922428)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1581033929:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (3922429)dis+10_1_sil=32000:sp=arity:random_seed=2007067845:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (3922430) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3922421-3922430"...
% 0.11/0.46 % (3922432)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4093055047:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46 % (3922431)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=776356031:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46 % (3922430)...printing done.
% 0.11/0.46 % (3922430)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3922430)------------------------------
% 0.11/0.46 % (3922430)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3922430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3922430)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3922430)Termination reason: Refutation
% 0.11/0.46 % (3922430)Time elapsed: 0.007 s
% 0.11/0.46 % (3922430)Peak memory usage: 12 MB
% 0.11/0.46 % (3922430)Instructions burned: 18 (million)
% 0.11/0.46 % (3922421)Success in time 0.037 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------