%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU118+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 : 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:51:58 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 139 ( 11 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 167 ( 64 ~; 61 |; 30 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 53 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f8,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f24,axiom,
! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f25,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(f27,conjecture,
! [X0,X1] :
( element(X1,powerset(X0))
=> ( finite(X0)
=> element(X1,finite_subsets(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_finsub_1) ).
fof(f28,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(X0))
=> ( finite(X0)
=> element(X1,finite_subsets(X0)) ) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f29,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f51,plain,
! [X0,X1] :
( ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f55,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f56,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f60,plain,
? [X0,X1] :
( ~ element(X1,finite_subsets(X0))
& finite(X0)
& element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f28]) ).
fof(f61,plain,
? [X0,X1] :
( ~ element(X1,finite_subsets(X0))
& finite(X0)
& element(X1,powerset(X0)) ),
inference(flattening,[],[f60]) ).
fof(f68,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(nnf_transformation,[],[f51]) ).
fof(f69,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ finite(sK0(X0,X1))
| ~ in(sK0(X0,X1),X1) )
& ( ( subset(sK0(X0,X1),X0)
& finite(sK0(X0,X1)) )
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f70]) ).
fof(f82,plain,
( ~ element(sK12,finite_subsets(sK11))
& finite(sK11)
& element(sK12,powerset(sK11)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X0,sK11),skolemize(X1,sK12)],[f61]) ).
fof(f83,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f93,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f97,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f131,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| finite(X0)
| ~ finite(X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f132,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f134,plain,
element(sK12,powerset(sK11)),
inference(cnf_transformation,[],[f82]) ).
fof(f135,plain,
finite(sK11),
inference(cnf_transformation,[],[f82]) ).
fof(f136,plain,
~ element(sK12,finite_subsets(sK11)),
inference(cnf_transformation,[],[f82]) ).
fof(f137,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f144,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f93]) ).
fof(f181,plain,
subset(sK12,sK11),
inference(resolution,[],[f137,f134]) ).
fof(f185,plain,
( finite(sK12)
| ~ finite(sK11) ),
inference(resolution,[],[f181,f131]) ).
fof(f186,plain,
finite(sK12),
inference(forward_subsumption_resolution,[],[f185,f135]) ).
fof(f275,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3) ),
inference(forward_subsumption_resolution,[],[f144,f97]) ).
fof(f278,plain,
! [X0,X1] :
( element(X0,finite_subsets(X1))
| ~ finite(X0)
| ~ subset(X0,X1) ),
inference(resolution,[],[f275,f132]) ).
fof(f398,plain,
( ~ finite(sK12)
| ~ subset(sK12,sK11) ),
inference(resolution,[],[f278,f136]) ).
fof(f401,plain,
~ subset(sK12,sK11),
inference(forward_subsumption_resolution,[],[f398,f186]) ).
fof(f402,plain,
$false,
inference(forward_subsumption_resolution,[],[f401,f181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU118+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 03:33:55 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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.46 % (2000553)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (2000562)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2479721378:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % (2000559)% WARNING: option uhcvi not known.
% 0.16/0.46 % (2000559)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1049082105:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % (2000560)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1236518119:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (2000558)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3156447501_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % (2000561)dis+10_1_sil=32000:sp=arity:random_seed=3164713255:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (2000563)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2351170985:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % (2000564)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3589879530:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.46 % TRYING [1]
% 0.16/0.46 % TRYING [2]
% 0.16/0.46 % TRYING [3]
% 0.16/0.46 % TRYING [4]
% 0.16/0.46 % (2000561) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2000553-2000561"...
% 0.16/0.46 % TRYING [5]
% 0.16/0.46 % (2000561)...printing done.
% 0.16/0.46 % (2000561)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Theorem for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (2000561)------------------------------
% 0.16/0.46 % (2000561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (2000561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (2000561)CaDiCaL version: 2.1.3
% 0.16/0.46 % (2000561)Termination reason: Refutation
% 0.16/0.46 % (2000561)Time elapsed: 0.008 s
% 0.16/0.46 % (2000561)Peak memory usage: 12 MB
% 0.16/0.46 % (2000561)Instructions burned: 10 (million)
% 0.16/0.46 % (2000553)Success in time 0.051 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------