%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU160+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:52:10 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 12 unt; 3 def)
% Number of atoms : 112 ( 31 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 102 ( 42 ~; 53 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 1 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f49,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f62,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f70,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f71,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
inference(negated_conjecture,[status(cth)],[f70]) ).
fof(f82,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f95,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f49]) ).
fof(f124,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( X0 = empty_set
| X0 = singleton(X1) ) ),
inference(ennf_transformation,[],[f71]) ).
fof(f219,plain,
! [X0,X1] :
( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f44]) ).
fof(f228,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f95]) ).
fof(f242,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f62]) ).
fof(f255,plain,
( sK19 != singleton(sK20)
| ~ subset(sK19,singleton(sK20)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f256,plain,
( empty_set != sK19
| ~ subset(sK19,singleton(sK20)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f257,plain,
( sK19 = singleton(sK20)
| empty_set = sK19
| subset(sK19,singleton(sK20)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f271,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f82]) ).
fof(f311,plain,
! [X0,X1] :
( ~ subset(X0,unordered_pair(X1,X1))
| empty_set = X0
| unordered_pair(X1,X1) = X0 ),
inference(definition_unfolding,[],[f219,f271,f271]) ).
fof(f325,plain,
( sK19 = unordered_pair(sK20,sK20)
| empty_set = sK19
| subset(sK19,unordered_pair(sK20,sK20)) ),
inference(definition_unfolding,[],[f257,f271,f271]) ).
fof(f326,plain,
( empty_set != sK19
| ~ subset(sK19,unordered_pair(sK20,sK20)) ),
inference(definition_unfolding,[],[f256,f271]) ).
fof(f327,plain,
( sK19 != unordered_pair(sK20,sK20)
| ~ subset(sK19,unordered_pair(sK20,sK20)) ),
inference(definition_unfolding,[],[f255,f271,f271]) ).
fof(f366,definition,
( spl23_1
<=> subset(sK19,unordered_pair(sK20,sK20)) ),
introduced(definition,[new_symbols(definition,[spl23_1])],[avatar_definition]) ).
fof(f367,plain,
( subset(sK19,unordered_pair(sK20,sK20))
| ~ spl23_1 ),
inference(avatar_component_clause,[],[f366]) ).
fof(f368,plain,
( ~ subset(sK19,unordered_pair(sK20,sK20))
| spl23_1 ),
inference(avatar_component_clause,[],[f366]) ).
fof(f370,definition,
( spl23_2
<=> sK19 = unordered_pair(sK20,sK20) ),
introduced(definition,[new_symbols(definition,[spl23_2])],[avatar_definition]) ).
fof(f371,plain,
( sK19 = unordered_pair(sK20,sK20)
| ~ spl23_2 ),
inference(avatar_component_clause,[],[f370]) ).
fof(f372,plain,
( sK19 != unordered_pair(sK20,sK20)
| spl23_2 ),
inference(avatar_component_clause,[],[f370]) ).
fof(f373,plain,
( ~ spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f327,f370,f366]) ).
fof(f375,definition,
( spl23_3
<=> empty_set = sK19 ),
introduced(definition,[new_symbols(definition,[spl23_3])],[avatar_definition]) ).
fof(f376,plain,
( empty_set = sK19
| ~ spl23_3 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f377,plain,
( empty_set != sK19
| spl23_3 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f378,plain,
( ~ spl23_1
| ~ spl23_3 ),
inference(avatar_split_clause,[],[f326,f375,f366]) ).
fof(f379,plain,
( spl23_1
| spl23_3
| spl23_2 ),
inference(avatar_split_clause,[],[f325,f370,f375,f366]) ).
fof(f381,plain,
( ~ subset(sK19,sK19)
| spl23_1
| ~ spl23_2 ),
inference(superposition,[],[f368,f371]) ).
fof(f382,plain,
( $false
| spl23_1
| ~ spl23_2 ),
inference(forward_subsumption_resolution,[],[f381,f228]) ).
fof(f383,plain,
( spl23_1
| ~ spl23_2 ),
inference(avatar_contradiction_clause,[],[f382]) ).
fof(f384,plain,
( ~ subset(empty_set,unordered_pair(sK20,sK20))
| spl23_1
| ~ spl23_3 ),
inference(superposition,[],[f368,f376]) ).
fof(f385,plain,
( $false
| spl23_1
| ~ spl23_3 ),
inference(forward_subsumption_resolution,[],[f384,f242]) ).
fof(f386,plain,
( spl23_1
| ~ spl23_3 ),
inference(avatar_contradiction_clause,[],[f385]) ).
fof(f1462,plain,
( empty_set = sK19
| sK19 = unordered_pair(sK20,sK20)
| ~ spl23_1 ),
inference(resolution,[],[f311,f367]) ).
fof(f1464,plain,
( sK19 = unordered_pair(sK20,sK20)
| ~ spl23_1
| spl23_3 ),
inference(forward_subsumption_resolution,[],[f1462,f377]) ).
fof(f1466,plain,
( $false
| ~ spl23_1
| spl23_2
| spl23_3 ),
inference(forward_subsumption_resolution,[],[f1464,f372]) ).
fof(f1467,plain,
( ~ spl23_1
| spl23_2
| spl23_3 ),
inference(avatar_contradiction_clause,[],[f1466]) ).
cnf(s1,plain,
( ~ spl23_1
| ~ spl23_2 ),
inference(sat_conversion,[],[f373]) ).
cnf(s2,plain,
( ~ spl23_1
| ~ spl23_3 ),
inference(sat_conversion,[],[f378]) ).
cnf(s3,plain,
( spl23_1
| spl23_2
| spl23_3 ),
inference(sat_conversion,[],[f379]) ).
cnf(s4,plain,
( spl23_1
| ~ spl23_2 ),
inference(sat_conversion,[],[f383]) ).
cnf(s5,plain,
( spl23_1
| ~ spl23_3 ),
inference(sat_conversion,[],[f386]) ).
cnf(s12,plain,
( ~ spl23_1
| spl23_2
| spl23_3 ),
inference(sat_conversion,[],[f1467]) ).
cnf(s13,plain,
spl23_1,
inference(rat,[],[s3,s4,s5]) ).
cnf(s14,plain,
~ spl23_3,
inference(rat,[],[s2,s13]) ).
cnf(s15,plain,
~ spl23_2,
inference(rat,[],[s1,s13]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s12,s13,s14,s15]) ).
fof(f1468,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU160+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n004.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 03:48:07 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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.17/0.47 % (4129852)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (4129861)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2238487469:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (4129858)% WARNING: option uhcvi not known.
% 0.17/0.47 % (4129858)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2372988736:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (4129857)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2978128389_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (4129859)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1312020009:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (4129860)dis+10_1_sil=32000:sp=arity:random_seed=1001301508:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % (4129862)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2872006624:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (4129860) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4129852-4129860"...
% 0.17/0.47 % (4129861) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4129852-4129861"...
% 0.17/0.47 % (4129863)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=680959218:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % (4129861)...printing done.
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % (4129861)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 % (4129861)------------------------------
% 0.17/0.47 % (4129861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (4129861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (4129861)CaDiCaL version: 2.1.3
% 0.17/0.47 % (4129861)Termination reason: Refutation
% 0.17/0.47 % (4129861)Time elapsed: 0.021 s
% 0.17/0.47 % (4129861)Peak memory usage: 13 MB
% 0.17/0.47 % (4129861)Instructions burned: 53 (million)
% 0.17/0.47 % (4129852)Success in time 0.049 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------