%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU147+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:06 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 15 unt; 1 def)
% Number of atoms : 77 ( 34 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 25 ~; 31 |; 0 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 1 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f3,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f7,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f8,conjecture,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_zfmisc_1) ).
fof(f9,negated_conjecture,
powerset(empty_set) != singleton(empty_set),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f11,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f12,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f7]) ).
fof(f13,plain,
powerset(empty_set) != singleton(empty_set),
inference(flattening,[],[f9]) ).
fof(f16,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0,X1] :
( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1)
| singleton(X0) = X1 ),
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] :
( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1)
| singleton(X0) = X1 ),
inference(cnf_transformation,[],[f2]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ subset(X2,X0)
| in(X2,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f3]) ).
fof(f23,plain,
! [X2,X0,X1] :
( subset(X2,X0)
| ~ in(X2,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f3]) ).
fof(f29,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f30,plain,
powerset(empty_set) != singleton(empty_set),
inference(cnf_transformation,[],[f13]) ).
fof(f33,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f37,plain,
! [X2,X0] :
( subset(X2,X0)
| ~ in(X2,powerset(X0)) ),
inference(equality_resolution,[],[f23]) ).
fof(f38,plain,
! [X2,X0] :
( ~ subset(X2,X0)
| in(X2,powerset(X0)) ),
inference(equality_resolution,[],[f22]) ).
fof(f40,plain,
! [X0,X1] :
( sK0(X0,X1) != X0
| in(sK0(X0,X1),X1)
| singleton(X0) = X1 ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f41,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0
| singleton(X0) = X1 ),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f46,plain,
! [X2,X0] :
( in(X2,powerset(X0))
| subset(X2,X0) ),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f47,plain,
! [X2,X0] :
( ~ in(X2,powerset(X0))
| ~ subset(X2,X0) ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f72,plain,
! [X0,X1] :
( subset(sK0(X0,powerset(X1)),X1)
| singleton(X0) = powerset(X1)
| sK0(X0,powerset(X1)) = X0 ),
inference(resolution,[],[f41,f46]) ).
fof(f114,plain,
! [X0] :
( sK0(X0,powerset(empty_set)) = X0
| empty_set = sK0(X0,powerset(empty_set))
| singleton(X0) = powerset(empty_set) ),
inference(resolution,[],[f72,f33]) ).
fof(f150,plain,
! [X0] :
( empty_set != X0
| empty_set = sK0(X0,powerset(empty_set))
| singleton(X0) = powerset(empty_set) ),
inference(equality_factoring,[],[f114]) ).
fof(f159,definition,
( spl5_1
<=> in(empty_set,powerset(empty_set)) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f161,plain,
( in(empty_set,powerset(empty_set))
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f254,plain,
( empty_set = sK0(empty_set,powerset(empty_set))
| powerset(empty_set) = singleton(empty_set) ),
inference(equality_resolution,[],[f150]) ).
fof(f255,plain,
empty_set = sK0(empty_set,powerset(empty_set)),
inference(forward_subsumption_resolution,[],[f254,f30]) ).
fof(f264,plain,
( empty_set != empty_set
| in(empty_set,powerset(empty_set))
| powerset(empty_set) = singleton(empty_set) ),
inference(superposition,[],[f40,f255]) ).
fof(f265,plain,
( in(empty_set,powerset(empty_set))
| powerset(empty_set) = singleton(empty_set) ),
inference(trivial_inequality_removal,[],[f264]) ).
fof(f269,plain,
in(empty_set,powerset(empty_set)),
inference(forward_subsumption_resolution,[],[f265,f30]) ).
fof(f270,plain,
spl5_1,
inference(avatar_split_clause,[],[f269,f159]) ).
fof(f280,plain,
( ~ subset(empty_set,empty_set)
| ~ spl5_1 ),
inference(resolution,[],[f161,f47]) ).
fof(f281,plain,
( $false
| ~ spl5_1 ),
inference(forward_subsumption_resolution,[],[f280,f29]) ).
fof(f282,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f281]) ).
cnf(s4,plain,
spl5_1,
inference(sat_conversion,[],[f270]) ).
cnf(s5,plain,
~ spl5_1,
inference(sat_conversion,[],[f282]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s4,s5]) ).
fof(f283,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU147+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:47:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.45 % (3442222)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3442228)% WARNING: option uhcvi not known.
% 0.10/0.45 % (3442228)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1408424473:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (3442230)dis+10_1_sil=32000:sp=arity:random_seed=283797446:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (3442227)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=798275239_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (3442229)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1875722252:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (3442231)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1683294487:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (3442232)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=893826000:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (3442233)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1242289385:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % TRYING [1]
% 0.10/0.45 % TRYING [2]
% 0.10/0.45 % TRYING [3]
% 0.10/0.45 % TRYING [4]
% 0.10/0.45 % (3442228) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3442222-3442228"...
% 0.10/0.45 % (3442228)...printing done.
% 0.10/0.45 % TRYING [5]
% 0.10/0.45 % (3442228)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (3442228)------------------------------
% 0.10/0.45 % (3442228)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3442228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3442228)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3442228)Termination reason: Refutation
% 0.10/0.45 % (3442228)Time elapsed: 0.006 s
% 0.10/0.45 % (3442228)Peak memory usage: 13 MB
% 0.10/0.45 % (3442228)Instructions burned: 13 (million)
% 0.10/0.45 % (3442222)Success in time 0.038 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------