%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET076+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 : n001.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:42:59 PM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 2 def)
% Number of atoms : 62 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 20 ~; 15 |; 7 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 22 !; 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(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(f44,conjecture,
! [X0,X1,X2] :
( ( member(X0,X2)
& member(X1,X2) )
=> subclass(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_is_subset) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X2)
& member(X1,X2) )
=> subclass(unordered_pair(X0,X1),X2) ),
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(f60,plain,
? [X0,X1,X2] :
( ~ subclass(unordered_pair(X0,X1),X2)
& member(X0,X2)
& member(X1,X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f61,plain,
? [X0,X1,X2] :
( ~ subclass(unordered_pair(X0,X1),X2)
& member(X0,X2)
& member(X1,X2) ),
inference(flattening,[],[f60]) ).
fof(f63,plain,
! [X0,X1] :
( subclass(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f64,plain,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f149,plain,
member(sK7,sK8),
inference(cnf_transformation,[],[f61]) ).
fof(f150,plain,
member(sK6,sK8),
inference(cnf_transformation,[],[f61]) ).
fof(f151,plain,
~ subclass(unordered_pair(sK6,sK7),sK8),
inference(cnf_transformation,[],[f61]) ).
fof(f204,plain,
member(sK0(unordered_pair(sK6,sK7),sK8),unordered_pair(sK6,sK7)),
inference(resolution,[],[f63,f151]) ).
fof(f205,plain,
~ member(sK0(unordered_pair(sK6,sK7),sK8),sK8),
inference(resolution,[],[f64,f151]) ).
fof(f347,plain,
( sK6 = sK0(unordered_pair(sK6,sK7),sK8)
| sK7 = sK0(unordered_pair(sK6,sK7),sK8) ),
inference(resolution,[],[f71,f204]) ).
fof(f353,definition,
( spl9_9
<=> sK7 = sK0(unordered_pair(sK6,sK7),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_9])],[avatar_definition]) ).
fof(f355,plain,
( sK7 = sK0(unordered_pair(sK6,sK7),sK8)
| ~ spl9_9 ),
inference(avatar_component_clause,[],[f353]) ).
fof(f357,definition,
( spl9_10
<=> sK6 = sK0(unordered_pair(sK6,sK7),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_10])],[avatar_definition]) ).
fof(f359,plain,
( sK6 = sK0(unordered_pair(sK6,sK7),sK8)
| ~ spl9_10 ),
inference(avatar_component_clause,[],[f357]) ).
fof(f360,plain,
( spl9_9
| spl9_10 ),
inference(avatar_split_clause,[],[f347,f357,f353]) ).
fof(f365,plain,
( ~ member(sK7,sK8)
| ~ spl9_9 ),
inference(superposition,[],[f205,f355]) ).
fof(f366,plain,
( $false
| ~ spl9_9 ),
inference(forward_subsumption_resolution,[],[f365,f149]) ).
fof(f367,plain,
~ spl9_9,
inference(avatar_contradiction_clause,[],[f366]) ).
fof(f378,plain,
( ~ member(sK6,sK8)
| ~ spl9_10 ),
inference(superposition,[],[f205,f359]) ).
fof(f383,plain,
( $false
| ~ spl9_10 ),
inference(forward_subsumption_resolution,[],[f378,f150]) ).
fof(f384,plain,
~ spl9_10,
inference(avatar_contradiction_clause,[],[f383]) ).
cnf(s5,plain,
( spl9_9
| spl9_10 ),
inference(sat_conversion,[],[f360]) ).
cnf(s6,plain,
~ spl9_9,
inference(sat_conversion,[],[f367]) ).
cnf(s7,plain,
~ spl9_10,
inference(sat_conversion,[],[f384]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s5,s7,s6]) ).
fof(f385,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET076+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 00:38:02 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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.48 % (4112159)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (4112165)% WARNING: option uhcvi not known.
% 0.16/0.48 % (4112170)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3819634755:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48 % (4112165)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2776326618:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48 % (4112167)dis+10_1_sil=32000:sp=arity:random_seed=3839203145:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48 % (4112168)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2981440130:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48 % (4112164)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3559246587_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48 % (4112169)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2891141658:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % (4112166)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=198451231:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48 % (4112168) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4112159-4112168"...
% 0.16/0.48 % (4112168)...printing done.
% 0.16/0.48 % (4112168)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (4112168)------------------------------
% 0.16/0.48 % (4112168)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (4112168)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (4112168)CaDiCaL version: 2.1.3
% 0.16/0.48 % (4112168)Termination reason: Refutation
% 0.16/0.48 % (4112168)Time elapsed: 0.010 s
% 0.16/0.48 % (4112168)Peak memory usage: 12 MB
% 0.16/0.48 % (4112168)Instructions burned: 14 (million)
% 0.16/0.48 % (4112159)Success in time 0.06 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------