%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU160+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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.12s 0.47s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 9 unt; 3 def)
% Number of atoms : 78 ( 21 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 32 |; 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 : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 1 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f7,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = empty_set
| X0 = singleton(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f10,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f3]) ).
fof(f11,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( X0 = empty_set
| X0 = singleton(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
( sK2 != singleton(sK3)
| ~ subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
( empty_set != sK2
| ~ subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f18,plain,
( sK2 = singleton(sK3)
| empty_set = sK2
| subset(sK2,singleton(sK3)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f19,plain,
! [X0,X1] :
( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
! [X0,X1] :
( empty_set != X0
| subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f22,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(equality_resolution,[],[f21]) ).
fof(f25,definition,
( spl4_1
<=> subset(sK2,singleton(sK3)) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f27,plain,
( ~ subset(sK2,singleton(sK3))
| spl4_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f29,definition,
( spl4_2
<=> sK2 = singleton(sK3) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f30,plain,
( sK2 = singleton(sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f32,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f16,f29,f25]) ).
fof(f34,definition,
( spl4_3
<=> empty_set = sK2 ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f35,plain,
( empty_set = sK2
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f37,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f17,f34,f25]) ).
fof(f38,plain,
( sK2 = singleton(sK3)
| empty_set = sK2 ),
inference(forward_subsumption_resolution,[],[f18,f19]) ).
fof(f39,plain,
( spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f38,f29,f34]) ).
fof(f40,plain,
( ~ subset(sK2,sK2)
| spl4_1
| ~ spl4_2 ),
inference(superposition,[],[f27,f30]) ).
fof(f41,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f40,f14]) ).
fof(f42,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f41]) ).
fof(f44,plain,
( ! [X0] : subset(sK2,singleton(X0))
| ~ spl4_3 ),
inference(superposition,[],[f22,f35]) ).
fof(f45,plain,
( $false
| spl4_1
| ~ spl4_3 ),
inference(resolution,[],[f44,f27]) ).
fof(f46,plain,
( spl4_1
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f45]) ).
cnf(s1,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f32]) ).
cnf(s2,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(sat_conversion,[],[f37]) ).
cnf(s3,plain,
( spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f39]) ).
cnf(s4,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f42]) ).
cnf(s5,plain,
( spl4_1
| ~ spl4_3 ),
inference(sat_conversion,[],[f46]) ).
cnf(s6,plain,
spl4_1,
inference(rat,[],[s3,s4,s5]) ).
cnf(s7,plain,
~ spl4_3,
inference(rat,[],[s2,s6]) ).
cnf(s8,plain,
~ spl4_2,
inference(rat,[],[s1,s6]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s7,s8]) ).
fof(f47,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU160+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n018.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 03:50:39 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.12/0.47 % (2977184)Will run a generic schedule for satisfiability detection.
% 0.12/0.47 % (2977193)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3419356877:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.47 % (2977193) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2977184-2977193"...
% 0.12/0.47 % (2977193)...printing done.
% 0.12/0.47 % (2977190)% WARNING: option uhcvi not known.
% 0.12/0.47 % (2977193)Refutation found. Thanks to Tanya!
% 0.12/0.47 % SZS status Theorem for theBenchmark
% 0.12/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.48 % (2977193)------------------------------
% 0.12/0.48 % (2977193)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.48 % (2977193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.48 % (2977193)CaDiCaL version: 2.1.3
% 0.12/0.48 % (2977193)Termination reason: Refutation
% 0.12/0.48 % (2977193)Time elapsed: 0.001 s
% 0.12/0.48 % (2977193)Peak memory usage: 12 MB
% 0.12/0.48 % (2977193)Instructions burned: 1 (million)
% 0.12/0.48 % (2977184)Success in time 0.043 s
% 0.12/0.48 % Vampire exiting
%------------------------------------------------------------------------------