%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU158+3 : TPTP v9.3.1. Released v3.2.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:09 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 4 unt; 2 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 21 ~; 22 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f10,plain,
? [X0,X1] :
( subset(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f15,plain,
( in(sK2,sK3)
| subset(singleton(sK2),sK3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
( ~ in(sK2,sK3)
| ~ subset(singleton(sK2),sK3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
! [X0,X1] :
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f22,definition,
( spl4_1
<=> subset(singleton(sK2),sK3) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f23,plain,
( ~ subset(singleton(sK2),sK3)
| spl4_1 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f24,plain,
( subset(singleton(sK2),sK3)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f26,definition,
( spl4_2
<=> in(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f27,plain,
( ~ in(sK2,sK3)
| spl4_2 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f28,plain,
( in(sK2,sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f29,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f15,f26,f22]) ).
fof(f30,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f16,f26,f22]) ).
fof(f32,plain,
( ~ in(sK2,sK3)
| spl4_1 ),
inference(resolution,[],[f17,f23]) ).
fof(f33,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f32,f28]) ).
fof(f34,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f33]) ).
fof(f36,plain,
( in(sK2,sK3)
| ~ spl4_1 ),
inference(resolution,[],[f18,f24]) ).
fof(f38,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f36,f27]) ).
fof(f39,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f38]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f29]) ).
cnf(s2,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f30]) ).
cnf(s3,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f34]) ).
cnf(s4,plain,
( ~ spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f39]) ).
cnf(s5,plain,
spl4_1,
inference(rat,[],[s1,s3]) ).
cnf(s6,plain,
spl4_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s6,s5]) ).
fof(f40,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU158+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n004.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.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 03:47:52 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.10/0.45 % (4129329)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (4129335)% WARNING: option uhcvi not known.
% 0.10/0.45 % (4129335)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1937364368:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (4129335) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4129329-4129335"...
% 0.10/0.45 % (4129335)...printing done.
% 0.10/0.45 % (4129335)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.46 % (4129335)------------------------------
% 0.10/0.46 % (4129335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (4129335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (4129335)CaDiCaL version: 2.1.3
% 0.10/0.46 % (4129335)Termination reason: Refutation
% 0.10/0.46 % (4129335)Time elapsed: 0.001 s
% 0.10/0.46 % (4129335)Peak memory usage: 12 MB
% 0.10/0.46 % (4129335)Instructions burned: 1 (million)
% 0.10/0.46 % (4129329)Success in time 0.035 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------