%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU250+1 : 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 : n007.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:36 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 7 unt; 2 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 25 ~; 27 |; 6 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f31,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_field(relation_restriction(X2,X1)))
=> ( in(X0,relation_field(X2))
& in(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_wellord1) ).
fof(f34,conjecture,
! [X0,X1] :
( relation(X1)
=> ( subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
& subset(relation_field(relation_restriction(X1,X0)),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_wellord1) ).
fof(f35,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
& subset(relation_field(relation_restriction(X1,X0)),X0) ) ),
inference(negated_conjecture,[status(cth)],[f34]) ).
fof(f53,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X0,X1) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X0,X1) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(flattening,[],[f59]) ).
fof(f62,plain,
? [X0,X1] :
( ( ~ subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
| ~ subset(relation_field(relation_restriction(X1,X0)),X0) )
& relation(X1) ),
inference(ennf_transformation,[],[f35]) ).
fof(f76,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f77,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| in(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f98,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| in(X0,relation_field(X2)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f101,plain,
( ~ subset(relation_field(relation_restriction(sK8,sK7)),sK7)
| ~ subset(relation_field(relation_restriction(sK8,sK7)),relation_field(sK8)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f102,plain,
relation(sK8),
inference(cnf_transformation,[],[f62]) ).
fof(f113,definition,
( spl9_1
<=> subset(relation_field(relation_restriction(sK8,sK7)),relation_field(sK8)) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f115,plain,
( ~ subset(relation_field(relation_restriction(sK8,sK7)),relation_field(sK8))
| spl9_1 ),
inference(avatar_component_clause,[],[f113]) ).
fof(f117,definition,
( spl9_2
<=> subset(relation_field(relation_restriction(sK8,sK7)),sK7) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f119,plain,
( ~ subset(relation_field(relation_restriction(sK8,sK7)),sK7)
| spl9_2 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f120,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f101,f117,f113]) ).
fof(f172,plain,
( in(sK0(relation_field(relation_restriction(sK8,sK7)),relation_field(sK8)),relation_field(relation_restriction(sK8,sK7)))
| spl9_1 ),
inference(resolution,[],[f76,f115]) ).
fof(f173,plain,
( ~ in(sK0(relation_field(relation_restriction(sK8,sK7)),relation_field(sK8)),relation_field(sK8))
| spl9_1 ),
inference(resolution,[],[f77,f115]) ).
fof(f243,plain,
! [X0,X1] :
( ~ in(X0,relation_field(relation_restriction(sK8,X1)))
| in(X0,X1) ),
inference(resolution,[],[f97,f102]) ).
fof(f252,plain,
! [X0,X1] :
( ~ in(X0,relation_field(relation_restriction(sK8,X1)))
| in(X0,relation_field(sK8)) ),
inference(resolution,[],[f98,f102]) ).
fof(f259,plain,
( in(sK0(relation_field(relation_restriction(sK8,sK7)),relation_field(sK8)),relation_field(sK8))
| spl9_1 ),
inference(resolution,[],[f252,f172]) ).
fof(f260,plain,
( $false
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f259,f173]) ).
fof(f261,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f260]) ).
fof(f262,plain,
( ~ in(sK0(relation_field(relation_restriction(sK8,sK7)),sK7),sK7)
| spl9_2 ),
inference(resolution,[],[f119,f77]) ).
fof(f263,plain,
( in(sK0(relation_field(relation_restriction(sK8,sK7)),sK7),relation_field(relation_restriction(sK8,sK7)))
| spl9_2 ),
inference(resolution,[],[f119,f76]) ).
fof(f267,plain,
( in(sK0(relation_field(relation_restriction(sK8,sK7)),sK7),sK7)
| spl9_2 ),
inference(resolution,[],[f263,f243]) ).
fof(f270,plain,
( $false
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f267,f262]) ).
fof(f271,plain,
spl9_2,
inference(avatar_contradiction_clause,[],[f270]) ).
cnf(s1,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(sat_conversion,[],[f120]) ).
cnf(s4,plain,
spl9_1,
inference(sat_conversion,[],[f261]) ).
cnf(s5,plain,
spl9_2,
inference(sat_conversion,[],[f271]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s5,s4]) ).
fof(f272,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU250+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n007.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 04:17:26 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.18/0.48 % (2019104)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (2019114)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2810520719:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % (2019110)% WARNING: option uhcvi not known.
% 0.18/0.48 % (2019109)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2288435303_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (2019110)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2224266340:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (2019111)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=141784729:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (2019113)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3912915952:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (2019112)dis+10_1_sil=32000:sp=arity:random_seed=4146591082:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (2019115)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1733204612:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % TRYING [2]
% 0.18/0.48 % TRYING [3]
% 0.18/0.48 % (2019113) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2019104-2019113"...
% 0.18/0.48 % TRYING [4]
% 0.18/0.48 % (2019113)...printing done.
% 0.18/0.48 % (2019113)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (2019113)------------------------------
% 0.18/0.48 % (2019113)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (2019113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (2019113)CaDiCaL version: 2.1.3
% 0.18/0.48 % (2019113)Termination reason: Refutation
% 0.18/0.48 % (2019113)Time elapsed: 0.006 s
% 0.18/0.48 % (2019113)Peak memory usage: 12 MB
% 0.18/0.48 % (2019113)Instructions burned: 8 (million)
% 0.18/0.48 % (2019104)Success in time 0.046 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------