%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU355+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 : n003.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:59 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 11 unt; 2 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 114 ( 45 ~; 44 |; 5 &)
% ( 8 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 3 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 43 ( 0 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( rel_str(X0)
=> ! [X1,X2] :
( element(X2,the_carrier(X0))
=> ( relstr_element_smaller(X0,X1,X2)
<=> ! [X3] :
( element(X3,the_carrier(X0))
=> ( in(X3,X1)
=> related(X0,X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_lattice3) ).
fof(f4,axiom,
! [X0] :
( rel_str(X0)
=> ! [X1,X2] :
( element(X2,the_carrier(X0))
=> ( relstr_set_smaller(X0,X1,X2)
<=> ! [X3] :
( element(X3,the_carrier(X0))
=> ( in(X3,X1)
=> related(X0,X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_lattice3) ).
fof(f13,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f20,conjecture,
! [X0] :
( rel_str(X0)
=> ! [X1] :
( element(X1,the_carrier(X0))
=> ( relstr_set_smaller(X0,empty_set,X1)
& relstr_element_smaller(X0,empty_set,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_yellow_0) ).
fof(f21,negated_conjecture,
~ ! [X0] :
( rel_str(X0)
=> ! [X1] :
( element(X1,the_carrier(X0))
=> ( relstr_set_smaller(X0,empty_set,X1)
& relstr_element_smaller(X0,empty_set,X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f22,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f29,plain,
! [X0] :
( ! [X1,X2] :
( ( relstr_element_smaller(X0,X1,X2)
<=> ! [X3] :
( related(X0,X2,X3)
| ~ in(X3,X1)
| ~ element(X3,the_carrier(X0)) ) )
| ~ element(X2,the_carrier(X0)) )
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f30,plain,
! [X0] :
( ! [X1,X2] :
( ( relstr_element_smaller(X0,X1,X2)
<=> ! [X3] :
( related(X0,X2,X3)
| ~ in(X3,X1)
| ~ element(X3,the_carrier(X0)) ) )
| ~ element(X2,the_carrier(X0)) )
| ~ rel_str(X0) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ! [X1,X2] :
( ( relstr_set_smaller(X0,X1,X2)
<=> ! [X3] :
( related(X0,X3,X2)
| ~ in(X3,X1)
| ~ element(X3,the_carrier(X0)) ) )
| ~ element(X2,the_carrier(X0)) )
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f32,plain,
! [X0] :
( ! [X1,X2] :
( ( relstr_set_smaller(X0,X1,X2)
<=> ! [X3] :
( related(X0,X3,X2)
| ~ in(X3,X1)
| ~ element(X3,the_carrier(X0)) ) )
| ~ element(X2,the_carrier(X0)) )
| ~ rel_str(X0) ),
inference(flattening,[],[f31]) ).
fof(f37,plain,
? [X0] :
( ? [X1] :
( ( ~ relstr_set_smaller(X0,empty_set,X1)
| ~ relstr_element_smaller(X0,empty_set,X1) )
& element(X1,the_carrier(X0)) )
& rel_str(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f38,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f43,plain,
! [X2,X0,X1] :
( relstr_element_smaller(X0,X1,X2)
| ~ element(X2,the_carrier(X0))
| in(sK0(X0,X1,X2),X1)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f47,plain,
! [X2,X0,X1] :
( relstr_set_smaller(X0,X1,X2)
| ~ element(X2,the_carrier(X0))
| in(sK1(X0,X1,X2),X1)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f51,plain,
empty(empty_set),
inference(cnf_transformation,[],[f13]) ).
fof(f58,plain,
( ~ relstr_element_smaller(sK7,empty_set,sK8)
| ~ relstr_set_smaller(sK7,empty_set,sK8) ),
inference(cnf_transformation,[],[f37]) ).
fof(f59,plain,
element(sK8,the_carrier(sK7)),
inference(cnf_transformation,[],[f37]) ).
fof(f60,plain,
rel_str(sK7),
inference(cnf_transformation,[],[f37]) ).
fof(f61,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f64,definition,
( spl9_1
<=> relstr_set_smaller(sK7,empty_set,sK8) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f66,plain,
( ~ relstr_set_smaller(sK7,empty_set,sK8)
| spl9_1 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f68,definition,
( spl9_2
<=> relstr_element_smaller(sK7,empty_set,sK8) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f70,plain,
( ~ relstr_element_smaller(sK7,empty_set,sK8)
| spl9_2 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f71,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f58,f68,f64]) ).
fof(f75,plain,
! [X0] : ~ in(X0,empty_set),
inference(resolution,[],[f61,f51]) ).
fof(f93,plain,
( ~ element(sK8,the_carrier(sK7))
| in(sK1(sK7,empty_set,sK8),empty_set)
| ~ rel_str(sK7)
| spl9_1 ),
inference(resolution,[],[f47,f66]) ).
fof(f94,plain,
( in(sK1(sK7,empty_set,sK8),empty_set)
| ~ rel_str(sK7)
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f93,f59]) ).
fof(f95,plain,
( ~ rel_str(sK7)
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f94,f75]) ).
fof(f96,plain,
( $false
| spl9_1 ),
inference(forward_subsumption_resolution,[],[f95,f60]) ).
fof(f97,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f96]) ).
fof(f98,plain,
( ~ element(sK8,the_carrier(sK7))
| in(sK0(sK7,empty_set,sK8),empty_set)
| ~ rel_str(sK7)
| spl9_2 ),
inference(resolution,[],[f70,f43]) ).
fof(f99,plain,
( in(sK0(sK7,empty_set,sK8),empty_set)
| ~ rel_str(sK7)
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f98,f59]) ).
fof(f100,plain,
( ~ rel_str(sK7)
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f99,f75]) ).
fof(f101,plain,
( $false
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f100,f60]) ).
fof(f102,plain,
spl9_2,
inference(avatar_contradiction_clause,[],[f101]) ).
cnf(s1,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(sat_conversion,[],[f71]) ).
cnf(s2,plain,
spl9_1,
inference(sat_conversion,[],[f97]) ).
cnf(s3,plain,
spl9_2,
inference(sat_conversion,[],[f102]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f103,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU355+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n003.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 04:55:12 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.16/0.47 % (1194952)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (1194957)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=18109989_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (1194958)% WARNING: option uhcvi not known.
% 0.16/0.47 % TRYING [4]
% 0.16/0.47 % (1194961)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=433339399:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % TRYING [5]
% 0.16/0.47 % (1194958)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1096459630:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (1194962)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1354318812:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (1194959)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=979139525:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (1194960)dis+10_1_sil=32000:sp=arity:random_seed=4264317790:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (1194963)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4266950577:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % (1194961) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1194952-1194961"...
% 0.16/0.47 % (1194958) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1194952-1194958"...
% 0.16/0.47 % (1194962) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1194952-1194962"...
% 0.16/0.47 % (1194960) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1194952-1194960"...
% 0.16/0.47 % (1194961)...printing done.
% 0.16/0.47 % (1194958)...printing done.
% 0.16/0.47 % (1194961)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (1194961)------------------------------
% 0.16/0.47 % (1194961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (1194961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (1194961)CaDiCaL version: 2.1.3
% 0.16/0.47 % (1194961)Termination reason: Refutation
% 0.16/0.47 % (1194961)Time elapsed: 0.003 s
% 0.16/0.47 % (1194961)Peak memory usage: 12 MB
% 0.16/0.47 % (1194961)Instructions burned: 3 (million)
% 0.16/0.47 % (1194952)Success in time 0.036 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------