%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU117+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 : n026.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.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 66 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 57 ( 21 ~; 21 |; 6 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 41 ( 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f11,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f13,axiom,
! [X0] :
( ~ empty(finite_subsets(X0))
& cup_closed(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& preboolean(finite_subsets(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f28,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f31,conjecture,
! [X0,X1] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_finsub_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f33,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(f46,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f47,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f46]) ).
fof(f62,plain,
? [X0,X1] :
( ~ element(X1,powerset(X0))
& element(X1,finite_subsets(X0)) ),
inference(ennf_transformation,[],[f32]) ).
fof(f63,plain,
! [X0,X1] :
( ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f67,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f74,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f82,plain,
! [X0] : ~ empty(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f110,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f114,plain,
element(sK11,finite_subsets(sK10)),
inference(cnf_transformation,[],[f62]) ).
fof(f115,plain,
~ element(sK11,powerset(sK10)),
inference(cnf_transformation,[],[f62]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ preboolean(X1)
| subset(X2,X0)
| ~ in(X2,X1)
| finite_subsets(X0) != X1 ),
inference(cnf_transformation,[],[f63]) ).
fof(f123,plain,
! [X2,X0] :
( ~ preboolean(finite_subsets(X0))
| subset(X2,X0)
| ~ in(X2,finite_subsets(X0)) ),
inference(equality_resolution,[],[f120]) ).
fof(f126,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1)
| empty(X1) ),
inference(consistent_polarity_flipping,[],[f67]) ).
fof(f144,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(consistent_polarity_flipping,[],[f110]) ).
fof(f147,plain,
element(sK11,powerset(sK10)),
inference(consistent_polarity_flipping,[],[f115]) ).
fof(f148,plain,
~ element(sK11,finite_subsets(sK10)),
inference(consistent_polarity_flipping,[],[f114]) ).
fof(f150,plain,
! [X2,X0] :
( ~ preboolean(finite_subsets(X0))
| ~ subset(X2,X0)
| in(X2,finite_subsets(X0)) ),
inference(consistent_polarity_flipping,[],[f123]) ).
fof(f190,plain,
subset(sK11,sK10),
inference(resolution,[],[f144,f147]) ).
fof(f214,plain,
! [X2,X0] :
( ~ subset(X2,X0)
| in(X2,finite_subsets(X0)) ),
inference(forward_subsumption_resolution,[],[f150,f74]) ).
fof(f216,plain,
in(sK11,finite_subsets(sK10)),
inference(resolution,[],[f190,f214]) ).
fof(f218,plain,
( element(sK11,finite_subsets(sK10))
| empty(finite_subsets(sK10)) ),
inference(resolution,[],[f216,f126]) ).
fof(f219,plain,
empty(finite_subsets(sK10)),
inference(forward_subsumption_resolution,[],[f218,f148]) ).
fof(f220,plain,
$false,
inference(forward_subsumption_resolution,[],[f219,f82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU117+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n026.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 03:39:16 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/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.17/0.46 % (3438067)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (3438077)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4116220680:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (3438073)% WARNING: option uhcvi not known.
% 0.17/0.46 % (3438072)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1571941106_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % (3438073)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=224720925:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (3438074)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2260323389:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (3438075)dis+10_1_sil=32000:sp=arity:random_seed=298456182:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (3438076)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2151048594:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (3438078)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1779890110:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % (3438073) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3438067-3438073"...
% 0.17/0.46 % (3438075) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3438067-3438075"...
% 0.17/0.46 % TRYING [4]
% 0.17/0.46 % (3438077) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3438067-3438077"...
% 0.17/0.46 % (3438073)...printing done.
% 0.17/0.46 % (3438075)...printing done.
% 0.17/0.46 % (3438077)...printing done.
% 0.17/0.46 % (3438073)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (3438073)------------------------------
% 0.17/0.46 % (3438073)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (3438073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (3438073)CaDiCaL version: 2.1.3
% 0.17/0.46 % (3438073)Termination reason: Refutation
% 0.17/0.46 % (3438073)Time elapsed: 0.004 s
% 0.17/0.46 % (3438073)Peak memory usage: 12 MB
% 0.17/0.46 % (3438073)Instructions burned: 5 (million)
% 0.17/0.47 % (3438067)Success in time 0.038 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------