%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU294+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:48:12 PM UTC 2026
% Result : Theorem 2.65s 1.32s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 14 ~; 9 |; 8 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f40,conjecture,
! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f44,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f44]) ).
fof(f52,plain,
? [X0,X1] :
( ~ finite(X0)
& subset(X0,X1)
& finite(X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f53,plain,
? [X0,X1] :
( ~ finite(X0)
& subset(X0,X1)
& finite(X1) ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f57,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f59,plain,
( ~ finite(sK0)
& subset(sK0,sK1)
& finite(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f53]) ).
fof(f67,plain,
finite(sK1),
inference(cnf_transformation,[],[f59]) ).
fof(f68,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f59]) ).
fof(f69,plain,
~ finite(sK0),
inference(cnf_transformation,[],[f59]) ).
fof(f75,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| finite(X1)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f77,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(resolution,[],[f75,f77]) ).
fof(f93,plain,
( ~ finite(sK1)
| finite(sK0) ),
inference(resolution,[],[f88,f68]) ).
fof(f95,plain,
finite(sK0),
inference(forward_subsumption_resolution,[],[f93,f67]) ).
fof(f96,plain,
$false,
inference(forward_subsumption_resolution,[],[f95,f69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU294+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 04:27:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.65/1.32 % (3202057)Detected formulas, will run a generic FOF schedule.
% 2.65/1.32 % (3202066)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2427097223:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.65/1.32 % (3202066)First to succeed.
% 2.65/1.32 % (3202066)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3202057"
% 2.65/1.32 % (3202068)dis-21_1_sil=8000:lcm=predicate:random_seed=3451974971:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.65/1.32 % (3202064)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1613650040:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.65/1.32 % (3202065)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2595225533:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.65/1.32 % (3202063)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1754514643:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.65/1.32 % (3202062)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1085185658:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.65/1.32 % (3202067)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=376091630:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.65/1.32 % (3202065)Refutation not found, incomplete strategy
% 2.65/1.32 % (3202065)------------------------------
% 2.65/1.32 % (3202065)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.32 % (3202065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.32 % (3202065)CaDiCaL version: 2.1.3
% 2.65/1.32 % (3202065)Termination reason: Refutation not found, incomplete strategy
% 2.65/1.32 % (3202065)Time elapsed: 0.001 s
% 2.65/1.32 % (3202065)Peak memory usage: 88 MB
% 2.65/1.32 % (3202068)Also succeeded, but the first one will report.
% 2.65/1.32 % (3202067)Also succeeded, but the first one will report.
% 2.65/1.32 % (3202066)Refutation found. Thanks to Tanya!
% 2.65/1.32 % SZS status Theorem for theBenchmark
% 2.65/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.65/1.32 % (3202066)------------------------------
% 2.65/1.32 % (3202066)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.32 % (3202066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.32 % (3202066)CaDiCaL version: 2.1.3
% 2.65/1.32 % (3202066)Termination reason: Refutation
% 2.65/1.32 % (3202066)Time elapsed: 0.001 s
% 2.65/1.32 % (3202066)Peak memory usage: 88 MB
% 2.65/1.32 % (3202066)Instructions burned: 1 (million)
% 2.65/1.32 % (3202066)------------------------------
% 2.65/1.32 % (3202066)------------------------------
% 2.65/1.32 % (3202057)Success in time 0.288 s
% 2.65/1.32 % Vampire exiting
%------------------------------------------------------------------------------