%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU110+1 : 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 : n010.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:57 PM UTC 2026
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 7 unt; 0 def)
% Number of atoms : 171 ( 13 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 208 ( 81 ~; 85 |; 31 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 91 ( 84 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f9,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f26,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f27,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(f28,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f52,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f53,plain,
! [X0,X1] :
( ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f58,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f59,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
? [X0,X1] :
( ~ subset(finite_subsets(X0),finite_subsets(X1))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f69,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f52]) ).
fof(f70,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f70]) ).
fof(f72,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,[],[f53]) ).
fof(f73,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,[],[f72]) ).
fof(f74,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,[],[f73]) ).
fof(f75,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ( ( ~ subset(sK1(X0,X1),X0)
| ~ finite(sK1(X0,X1))
| ~ in(sK1(X0,X1),X1) )
& ( ( subset(sK1(X0,X1),X0)
& finite(sK1(X0,X1)) )
| in(sK1(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,[sK1]),skolemize(X2,sK1(X0,X1))],[f74]) ).
fof(f86,plain,
( ~ subset(finite_subsets(sK12),finite_subsets(sK13))
& subset(sK12,sK13) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X0,sK12),skolemize(X1,sK13)],[f60]) ).
fof(f96,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f97,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f98,plain,
! [X3,X0,X1] :
( finite(X3)
| ~ in(X3,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f99,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f100,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f104,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f139,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f59]) ).
fof(f140,plain,
subset(sK12,sK13),
inference(cnf_transformation,[],[f86]) ).
fof(f141,plain,
~ subset(finite_subsets(sK12),finite_subsets(sK13)),
inference(cnf_transformation,[],[f86]) ).
fof(f150,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f100]) ).
fof(f151,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f99]) ).
fof(f152,plain,
! [X3,X0] :
( finite(X3)
| ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f98]) ).
fof(f240,plain,
! [X0] :
( ~ subset(X0,sK12)
| subset(X0,sK13) ),
inference(resolution,[],[f139,f140]) ).
fof(f266,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| finite(X3) ),
inference(forward_subsumption_resolution,[],[f152,f104]) ).
fof(f280,plain,
! [X0,X1] :
( finite(sK0(finite_subsets(X0),X1))
| subset(finite_subsets(X0),X1) ),
inference(resolution,[],[f266,f96]) ).
fof(f295,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| subset(X3,X0) ),
inference(forward_subsumption_resolution,[],[f151,f104]) ).
fof(f298,plain,
! [X0,X1] :
( subset(sK0(finite_subsets(X0),X1),X0)
| subset(finite_subsets(X0),X1) ),
inference(resolution,[],[f295,f96]) ).
fof(f300,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3) ),
inference(forward_subsumption_resolution,[],[f150,f104]) ).
fof(f307,plain,
! [X0,X1] :
( ~ subset(sK0(X0,finite_subsets(X1)),X1)
| ~ finite(sK0(X0,finite_subsets(X1)))
| subset(X0,finite_subsets(X1)) ),
inference(resolution,[],[f300,f97]) ).
fof(f681,plain,
! [X0] :
( subset(sK0(finite_subsets(sK12),X0),sK13)
| subset(finite_subsets(sK12),X0) ),
inference(resolution,[],[f298,f240]) ).
fof(f912,plain,
( subset(finite_subsets(sK12),finite_subsets(sK13))
| ~ finite(sK0(finite_subsets(sK12),finite_subsets(sK13)))
| subset(finite_subsets(sK12),finite_subsets(sK13)) ),
inference(resolution,[],[f681,f307]) ).
fof(f918,plain,
( subset(finite_subsets(sK12),finite_subsets(sK13))
| ~ finite(sK0(finite_subsets(sK12),finite_subsets(sK13))) ),
inference(duplicate_literal_removal,[],[f912]) ).
fof(f919,plain,
~ finite(sK0(finite_subsets(sK12),finite_subsets(sK13))),
inference(forward_subsumption_resolution,[],[f918,f141]) ).
fof(f1079,plain,
subset(finite_subsets(sK12),finite_subsets(sK13)),
inference(resolution,[],[f919,f280]) ).
fof(f1080,plain,
$false,
inference(forward_subsumption_resolution,[],[f1079,f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU110+1 : 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.39 % Computer : n010.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Mon Sep 28 03:35:52 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.50 % (1535756)Will run a generic schedule for satisfiability detection.
% 0.18/0.50 % (1535761)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3123767919_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.50 % TRYING [1]
% 0.18/0.50 % TRYING [2]
% 0.18/0.50 % TRYING [3]
% 0.18/0.50 % TRYING [4]
% 0.18/0.50 % (1535762)% WARNING: option uhcvi not known.
% 0.18/0.50 % TRYING [5]
% 0.18/0.50 % (1535766)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2413653624:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.50 % (1535765)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1139402106:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.50 % (1535762)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2658685279:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.50 % (1535763)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1280343602:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.50 % (1535764)dis+10_1_sil=32000:sp=arity:random_seed=286766203:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.50 % (1535767)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2296966315:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.50 % TRYING [6]
% 0.18/0.50 % TRYING [7]
% 0.18/0.50 % (1535764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1535756-1535764"...
% 0.18/0.50 % (1535764)...printing done.
% 0.18/0.50 % (1535764)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (1535764)------------------------------
% 0.18/0.50 % (1535764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.50 % (1535764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.50 % (1535764)CaDiCaL version: 2.1.3
% 0.18/0.50 % (1535764)Termination reason: Refutation
% 0.18/0.50 % (1535764)Time elapsed: 0.021 s
% 0.18/0.50 % (1535764)Peak memory usage: 12 MB
% 0.18/0.50 % (1535764)Instructions burned: 31 (million)
% 0.18/0.50 % (1535756)Success in time 0.064 s
% 0.18/0.50 % Vampire exiting
%------------------------------------------------------------------------------