%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET102+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 : 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:07 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 15 unt; 0 def)
% Number of atoms : 40 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 37 ( 17 ~; 12 |; 7 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 32 ( 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0,X1] : member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member_of_ordered_pair) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0,X1] : ~ member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
inference(ennf_transformation,[],[f45]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) )
& ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f66]) ).
fof(f103,plain,
~ member(unordered_pair(sK6,singleton(sK7)),ordered_pair(sK6,sK7)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f60]) ).
fof(f113,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X2 ),
inference(cnf_transformation,[],[f67]) ).
fof(f115,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f116,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f117,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f191,plain,
~ member(unordered_pair(sK6,singleton(sK7)),ordered_pair(sK6,sK7)),
inference(cnf_transformation,[],[f103]) ).
fof(f192,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f117,f116,f116]) ).
fof(f229,plain,
~ member(unordered_pair(sK6,unordered_pair(sK7,sK7)),unordered_pair(unordered_pair(sK6,sK6),unordered_pair(sK6,unordered_pair(sK7,sK7)))),
inference(definition_unfolding,[],[f191,f116,f192]) ).
fof(f233,plain,
! [X2,X1] :
( member(X2,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f113]) ).
fof(f276,plain,
~ member(unordered_pair(sK6,unordered_pair(sK7,sK7)),universal_class),
inference(resolution,[],[f233,f229]) ).
fof(f278,plain,
$false,
inference(forward_subsumption_resolution,[],[f276,f115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET102+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 : n020.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.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 00:43:19 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.42 Running first-order model finding
% 0.12/0.42 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.17/0.47 % (3923805)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (3923810)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1506753616_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (3923811)% WARNING: option uhcvi not known.
% 0.17/0.47 % (3923812)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1813174334:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (3923813)dis+10_1_sil=32000:sp=arity:random_seed=4032333929:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (3923811)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3164976822:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (3923814)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=498701579:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (3923815)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=445775722:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (3923816)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2312657101:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % (3923813) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3923805-3923813"...
% 0.17/0.47 % (3923811) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3923805-3923811"...
% 0.17/0.47 % (3923814) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3923805-3923814"...
% 0.17/0.47 % (3923813)...printing done.
% 0.17/0.47 % (3923811)...printing done.
% 0.17/0.47 % (3923814)...printing done.
% 0.17/0.47 % (3923813)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (3923813)------------------------------
% 0.17/0.47 % (3923813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (3923813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (3923813)CaDiCaL version: 2.1.3
% 0.17/0.47 % (3923813)Termination reason: Refutation
% 0.17/0.47 % (3923813)Time elapsed: 0.005 s
% 0.17/0.47 % (3923813)Peak memory usage: 11 MB
% 0.17/0.47 % (3923813)Instructions burned: 6 (million)
% 0.17/0.47 % (3923805)Success in time 0.043 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------