%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET090+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 : n016.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:03 PM UTC 2026
% Result : Theorem 0.16s 5.70s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 71 ( 31 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 21 ~; 22 |; 7 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 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 : 38 ( 34 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f44,axiom,
! [X0] :
( member(X0,universal_class)
=> member(member_of(singleton(X0)),universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_singleton_universal) ).
fof(f45,axiom,
! [X0] :
( member(X0,universal_class)
=> singleton(member_of(singleton(X0))) = singleton(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_singleton_singleton) ).
fof(f48,conjecture,
! [X0,X1] :
( ( member(X1,universal_class)
& X0 = singleton(X1) )
=> member_of(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_singleton) ).
fof(f49,negated_conjecture,
~ ! [X0,X1] :
( ( member(X1,universal_class)
& X0 = singleton(X1) )
=> member_of(X0) = X1 ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f64,plain,
! [X0] :
( member(member_of(singleton(X0)),universal_class)
| ~ member(X0,universal_class) ),
inference(ennf_transformation,[],[f44]) ).
fof(f65,plain,
! [X0] :
( singleton(member_of(singleton(X0))) = singleton(X0)
| ~ member(X0,universal_class) ),
inference(ennf_transformation,[],[f45]) ).
fof(f66,plain,
? [X0,X1] :
( member_of(X0) != X1
& member(X1,universal_class)
& X0 = singleton(X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f67,plain,
? [X0,X1] :
( member_of(X0) != X1
& member(X1,universal_class)
& X0 = singleton(X1) ),
inference(flattening,[],[f66]) ).
fof(f76,plain,
! [X2,X0,X1] :
( X0 != X1
| ~ member(X0,universal_class)
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f77,plain,
! [X2,X0,X1] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f80,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f155,plain,
! [X0] :
( ~ member(X0,universal_class)
| member(member_of(singleton(X0)),universal_class) ),
inference(cnf_transformation,[],[f64]) ).
fof(f156,plain,
! [X0] :
( ~ member(X0,universal_class)
| singleton(X0) = singleton(member_of(singleton(X0))) ),
inference(cnf_transformation,[],[f65]) ).
fof(f159,plain,
sK6 = singleton(sK7),
inference(cnf_transformation,[],[f67]) ).
fof(f160,plain,
member(sK7,universal_class),
inference(cnf_transformation,[],[f67]) ).
fof(f161,plain,
sK7 != member_of(sK6),
inference(cnf_transformation,[],[f67]) ).
fof(f199,plain,
! [X0] :
( ~ member(X0,universal_class)
| member(member_of(unordered_pair(X0,X0)),universal_class) ),
inference(definition_unfolding,[],[f155,f80]) ).
fof(f200,plain,
! [X0] :
( ~ member(X0,universal_class)
| unordered_pair(X0,X0) = unordered_pair(member_of(unordered_pair(X0,X0)),member_of(unordered_pair(X0,X0))) ),
inference(definition_unfolding,[],[f156,f80,f80,f80]) ).
fof(f202,plain,
sK6 = unordered_pair(sK7,sK7),
inference(definition_unfolding,[],[f159,f80]) ).
fof(f205,plain,
! [X2,X1] :
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(equality_resolution,[],[f76]) ).
fof(f213,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(consistent_polarity_flipping,[],[f77]) ).
fof(f214,plain,
! [X2,X1] :
( ~ member(X1,unordered_pair(X1,X2))
| member(X1,universal_class) ),
inference(consistent_polarity_flipping,[],[f205]) ).
fof(f271,plain,
! [X0] :
( ~ member(member_of(unordered_pair(X0,X0)),universal_class)
| member(X0,universal_class) ),
inference(consistent_polarity_flipping,[],[f199]) ).
fof(f272,plain,
! [X0] :
( member(X0,universal_class)
| unordered_pair(X0,X0) = unordered_pair(member_of(unordered_pair(X0,X0)),member_of(unordered_pair(X0,X0))) ),
inference(consistent_polarity_flipping,[],[f200]) ).
fof(f274,plain,
~ member(sK7,universal_class),
inference(consistent_polarity_flipping,[],[f160]) ).
fof(f366,plain,
( ~ member(member_of(sK6),universal_class)
| member(sK7,universal_class) ),
inference(superposition,[],[f271,f202]) ).
fof(f367,plain,
~ member(member_of(sK6),universal_class),
inference(forward_subsumption_resolution,[],[f366,f274]) ).
fof(f388,plain,
! [X0] :
( member(X0,sK6)
| sK7 = X0
| sK7 = X0 ),
inference(superposition,[],[f213,f202]) ).
fof(f391,plain,
! [X0] :
( member(X0,sK6)
| sK7 = X0 ),
inference(duplicate_literal_removal,[],[f388]) ).
fof(f506,plain,
unordered_pair(sK7,sK7) = unordered_pair(member_of(unordered_pair(sK7,sK7)),member_of(unordered_pair(sK7,sK7))),
inference(resolution,[],[f272,f274]) ).
fof(f531,plain,
sK6 = unordered_pair(member_of(sK6),member_of(sK6)),
inference(forward_demodulation,[],[f506,f202]) ).
fof(f542,plain,
( ~ member(member_of(sK6),sK6)
| member(member_of(sK6),universal_class) ),
inference(superposition,[],[f214,f531]) ).
fof(f558,plain,
~ member(member_of(sK6),sK6),
inference(forward_subsumption_resolution,[],[f542,f367]) ).
fof(f578,plain,
sK7 = member_of(sK6),
inference(resolution,[],[f558,f391]) ).
fof(f579,plain,
$false,
inference(forward_subsumption_resolution,[],[f578,f161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET090+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/5.61 % Computer : n016.cluster.edu
% 0.13/5.61 % Model : x86_64 x86_64
% 0.13/5.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.61 % Memory : 8046.5625MB
% 0.13/5.61 % OS : Linux 6.8.0-71-generic
% 0.13/5.61 % CPULimit : 300
% 0.13/5.61 % WCLimit : 300
% 0.13/5.61 % DateTime : Mon Sep 28 00:43:25 UTC 2026
% 0.13/5.62 % CPUTime :
% 0.13/5.62 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/5.64 Running first-order model finding
% 0.13/5.64 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.16/5.70 % (3151963)Will run a generic schedule for satisfiability detection.
% 0.16/5.70 % (3151973)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3178883069:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/5.70 % (3151969)% WARNING: option uhcvi not known.
% 0.16/5.70 % (3151970)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=862144561:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/5.70 % (3151968)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1912923493_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/5.70 % (3151969)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2682592557:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/5.70 % (3151974)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=140619011:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/5.70 % (3151971)dis+10_1_sil=32000:sp=arity:random_seed=2320437036:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/5.70 % (3151972)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3268879620:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/5.70 % (3151969) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3151963-3151969"...
% 0.16/5.70 % (3151969)...printing done.
% 0.16/5.70 % (3151969)Refutation found. Thanks to Tanya!
% 0.16/5.70 % SZS status Theorem for theBenchmark
% 0.16/5.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/5.70 % (3151969)------------------------------
% 0.16/5.70 % (3151969)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/5.70 % (3151969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/5.70 % (3151969)CaDiCaL version: 2.1.3
% 0.16/5.70 % (3151969)Termination reason: Refutation
% 0.16/5.70 % (3151969)Time elapsed: 0.013 s
% 0.16/5.70 % (3151969)Peak memory usage: 12 MB
% 0.16/5.70 % (3151969)Instructions burned: 17 (million)
% 0.16/5.70 % (3151963)Success in time 0.052 s
% 0.16/5.70 % Vampire exiting
%------------------------------------------------------------------------------