%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU094+1 : TPTP v9.3.1. Released v3.2.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:51:55 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 7 unt; 5 def)
% Number of atoms : 195 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 197 ( 78 ~; 97 |; 7 &)
% ( 8 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 47 ( 0 sgn 44 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( ( finite(X0)
& ! [X1] :
( in(X1,X0)
=> finite(X1) ) )
=> finite(union(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_finset_1) ).
fof(f48,axiom,
! [X0] : subset(X0,powerset(union(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(f49,axiom,
! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f51,axiom,
! [X0] :
( finite(X0)
<=> finite(powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_finset_1) ).
fof(f52,conjecture,
! [X0] :
( ( finite(X0)
& ! [X1] :
( in(X1,X0)
=> finite(X1) ) )
<=> finite(union(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_finset_1) ).
fof(f53,negated_conjecture,
~ ! [X0] :
( ( finite(X0)
& ! [X1] :
( in(X1,X0)
=> finite(X1) ) )
<=> finite(union(X0)) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f61,axiom,
! [X0,X1] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t92_zfmisc_1) ).
fof(f100,plain,
! [X0] :
( finite(union(X0))
| ~ finite(X0)
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f101,plain,
! [X0] :
( finite(union(X0))
| ~ finite(X0)
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) ) ),
inference(flattening,[],[f100]) ).
fof(f104,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f105,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(flattening,[],[f104]) ).
fof(f107,plain,
? [X0] :
( ( finite(X0)
& ! [X1] :
( finite(X1)
| ~ in(X1,X0) ) )
<~> finite(union(X0)) ),
inference(ennf_transformation,[],[f53]) ).
fof(f116,plain,
! [X0,X1] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f152,plain,
! [X0] :
( in(sK1(X0),X0)
| ~ finite(X0)
| finite(union(X0)) ),
inference(cnf_transformation,[],[f101]) ).
fof(f153,plain,
! [X0] :
( ~ finite(sK1(X0))
| ~ finite(X0)
| finite(union(X0)) ),
inference(cnf_transformation,[],[f101]) ).
fof(f226,plain,
! [X0] : subset(X0,powerset(union(X0))),
inference(cnf_transformation,[],[f48]) ).
fof(f227,plain,
! [X0,X1] :
( ~ finite(X1)
| ~ subset(X0,X1)
| finite(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f230,plain,
! [X0] :
( finite(powerset(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f231,plain,
! [X1] :
( finite(union(sK27))
| ~ in(X1,sK27)
| finite(X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f232,plain,
( ~ finite(union(sK27))
| in(sK28,sK27)
| ~ finite(sK27) ),
inference(cnf_transformation,[],[f107]) ).
fof(f233,plain,
( ~ finite(union(sK27))
| ~ finite(sK28)
| ~ finite(sK27) ),
inference(cnf_transformation,[],[f107]) ).
fof(f234,plain,
( finite(union(sK27))
| finite(sK27) ),
inference(cnf_transformation,[],[f107]) ).
fof(f243,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(X0,union(X1)) ),
inference(cnf_transformation,[],[f116]) ).
fof(f265,plain,
! [X0] :
( ~ finite(union(X0))
| finite(X0)
| finite(sK1(X0)) ),
inference(consistent_polarity_flipping,[],[f153]) ).
fof(f266,plain,
! [X0] :
( ~ finite(union(X0))
| finite(X0)
| ~ in(sK1(X0),X0) ),
inference(consistent_polarity_flipping,[],[f152]) ).
fof(f307,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| finite(X1)
| ~ finite(X0) ),
inference(consistent_polarity_flipping,[],[f227]) ).
fof(f309,plain,
! [X0] :
( ~ finite(powerset(X0))
| finite(X0) ),
inference(consistent_polarity_flipping,[],[f230]) ).
fof(f311,plain,
( ~ finite(union(sK27))
| ~ finite(sK27) ),
inference(consistent_polarity_flipping,[],[f234]) ).
fof(f312,plain,
( finite(union(sK27))
| finite(sK28)
| finite(sK27) ),
inference(consistent_polarity_flipping,[],[f233]) ).
fof(f313,plain,
( finite(union(sK27))
| ~ in(sK28,sK27)
| finite(sK27) ),
inference(consistent_polarity_flipping,[],[f232]) ).
fof(f314,plain,
! [X1] :
( ~ finite(union(sK27))
| in(X1,sK27)
| ~ finite(X1) ),
inference(consistent_polarity_flipping,[],[f231]) ).
fof(f321,plain,
! [X0,X1] :
( subset(X0,union(X1))
| in(X0,X1) ),
inference(consistent_polarity_flipping,[],[f243]) ).
fof(f323,definition,
( spl29_1
<=> ! [X1] :
( in(X1,sK27)
| ~ finite(X1) ) ),
introduced(definition,[new_symbols(definition,[spl29_1])],[avatar_definition]) ).
fof(f324,plain,
( ! [X1] :
( in(X1,sK27)
| ~ finite(X1) )
| ~ spl29_1 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f326,definition,
( spl29_2
<=> finite(union(sK27)) ),
introduced(definition,[new_symbols(definition,[spl29_2])],[avatar_definition]) ).
fof(f327,plain,
( finite(union(sK27))
| ~ spl29_2 ),
inference(avatar_component_clause,[],[f326]) ).
fof(f328,plain,
( ~ finite(union(sK27))
| spl29_2 ),
inference(avatar_component_clause,[],[f326]) ).
fof(f329,plain,
( spl29_1
| ~ spl29_2 ),
inference(avatar_split_clause,[],[f314,f326,f323]) ).
fof(f331,definition,
( spl29_3
<=> finite(sK27) ),
introduced(definition,[new_symbols(definition,[spl29_3])],[avatar_definition]) ).
fof(f332,plain,
( ~ finite(sK27)
| spl29_3 ),
inference(avatar_component_clause,[],[f331]) ).
fof(f335,definition,
( spl29_4
<=> in(sK28,sK27) ),
introduced(definition,[new_symbols(definition,[spl29_4])],[avatar_definition]) ).
fof(f337,plain,
( ~ in(sK28,sK27)
| spl29_4 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f338,plain,
( spl29_3
| ~ spl29_4
| spl29_2 ),
inference(avatar_split_clause,[],[f313,f326,f335,f331]) ).
fof(f340,definition,
( spl29_5
<=> finite(sK28) ),
introduced(definition,[new_symbols(definition,[spl29_5])],[avatar_definition]) ).
fof(f342,plain,
( finite(sK28)
| ~ spl29_5 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f343,plain,
( spl29_3
| spl29_5
| spl29_2 ),
inference(avatar_split_clause,[],[f312,f326,f340,f331]) ).
fof(f344,plain,
( ~ spl29_3
| ~ spl29_2 ),
inference(avatar_split_clause,[],[f311,f326,f331]) ).
fof(f437,plain,
! [X0] :
( finite(powerset(union(X0)))
| ~ finite(X0) ),
inference(resolution,[],[f307,f226]) ).
fof(f450,plain,
! [X0,X1] :
( in(X0,X1)
| finite(union(X1))
| ~ finite(X0) ),
inference(resolution,[],[f321,f307]) ).
fof(f593,plain,
! [X0] :
( finite(union(X0))
| ~ finite(X0) ),
inference(resolution,[],[f437,f309]) ).
fof(f828,plain,
( ~ finite(sK27)
| spl29_2 ),
inference(resolution,[],[f593,f328]) ).
fof(f836,plain,
( ~ spl29_3
| spl29_2 ),
inference(avatar_split_clause,[],[f828,f326,f331]) ).
fof(f845,plain,
( finite(union(sK27))
| ~ finite(sK28)
| spl29_4 ),
inference(resolution,[],[f337,f450]) ).
fof(f856,plain,
( ~ finite(sK28)
| spl29_2
| spl29_4 ),
inference(forward_subsumption_resolution,[],[f845,f328]) ).
fof(f871,plain,
( $false
| spl29_2
| spl29_4
| ~ spl29_5 ),
inference(forward_subsumption_resolution,[],[f856,f342]) ).
fof(f872,plain,
( spl29_2
| spl29_4
| ~ spl29_5 ),
inference(avatar_contradiction_clause,[],[f871]) ).
fof(f873,plain,
( finite(sK27)
| ~ in(sK1(sK27),sK27)
| ~ spl29_2 ),
inference(resolution,[],[f327,f266]) ).
fof(f874,plain,
( finite(sK27)
| finite(sK1(sK27))
| ~ spl29_2 ),
inference(resolution,[],[f327,f265]) ).
fof(f878,plain,
( finite(sK1(sK27))
| ~ spl29_2
| spl29_3 ),
inference(forward_subsumption_resolution,[],[f874,f332]) ).
fof(f879,plain,
( ~ in(sK1(sK27),sK27)
| ~ spl29_2
| spl29_3 ),
inference(forward_subsumption_resolution,[],[f873,f332]) ).
fof(f916,plain,
( ~ finite(sK1(sK27))
| ~ spl29_1
| ~ spl29_2
| spl29_3 ),
inference(resolution,[],[f879,f324]) ).
fof(f938,plain,
( $false
| ~ spl29_1
| ~ spl29_2
| spl29_3 ),
inference(forward_subsumption_resolution,[],[f916,f878]) ).
fof(f939,plain,
( ~ spl29_1
| ~ spl29_2
| spl29_3 ),
inference(avatar_contradiction_clause,[],[f938]) ).
cnf(s1,plain,
( spl29_1
| ~ spl29_2 ),
inference(sat_conversion,[],[f329]) ).
cnf(s2,plain,
( spl29_2
| spl29_3
| ~ spl29_4 ),
inference(sat_conversion,[],[f338]) ).
cnf(s3,plain,
( spl29_2
| spl29_3
| spl29_5 ),
inference(sat_conversion,[],[f343]) ).
cnf(s4,plain,
( ~ spl29_2
| ~ spl29_3 ),
inference(sat_conversion,[],[f344]) ).
cnf(s8,plain,
( spl29_2
| ~ spl29_3 ),
inference(sat_conversion,[],[f836]) ).
cnf(s12,plain,
( spl29_2
| spl29_4
| ~ spl29_5 ),
inference(sat_conversion,[],[f872]) ).
cnf(s19,plain,
( ~ spl29_1
| ~ spl29_2
| spl29_3 ),
inference(sat_conversion,[],[f939]) ).
cnf(s20,plain,
( spl29_3
| spl29_2 ),
inference(rat,[],[s12,s2,s3]) ).
cnf(s21,plain,
spl29_2,
inference(rat,[],[s20,s8]) ).
cnf(s22,plain,
~ spl29_3,
inference(rat,[],[s4,s21]) ).
cnf(s23,plain,
spl29_1,
inference(rat,[],[s1,s21]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s19,s21,s23,s22]) ).
fof(f940,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU094+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:34:45 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.41 Running first-order model finding
% 0.12/0.41 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.15/0.46 % (1158303)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (1158309)% WARNING: option uhcvi not known.
% 0.15/0.46 % (1158309)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2368773334:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % (1158308)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=932666885_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (1158310)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1227239369:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (1158311)dis+10_1_sil=32000:sp=arity:random_seed=1732262539:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (1158312)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=228929365:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (1158314)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2288308106:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.46 % (1158313)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=62974519:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.46 % TRYING [1]
% 0.15/0.46 % TRYING [2]
% 0.15/0.46 % TRYING [3]
% 0.15/0.46 % TRYING [4]
% 0.15/0.46 % (1158309) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1158303-1158309"...
% 0.15/0.46 % (1158312) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1158303-1158312"...
% 0.15/0.46 % (1158309)...printing done.
% 0.15/0.46 % TRYING [5]
% 0.15/0.46 % (1158309)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Theorem for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (1158309)------------------------------
% 0.15/0.46 % (1158309)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (1158309)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (1158309)CaDiCaL version: 2.1.3
% 0.15/0.46 % (1158309)Termination reason: Refutation
% 0.15/0.46 % (1158309)Time elapsed: 0.014 s
% 0.15/0.46 % (1158309)Peak memory usage: 13 MB
% 0.15/0.46 % (1158309)Instructions burned: 45 (million)
% 0.15/0.46 % (1158303)Success in time 0.041 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------