%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n011.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:47:17 PM UTC 2026
% Result : Theorem 3.13s 1.20s
% Output : Refutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 124 ( 11 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 147 ( 54 ~; 56 |; 28 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 51 !; 5 ?)
% 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(f74,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f75,plain,
( ~ element(sK11,powerset(sK10))
& element(sK11,finite_subsets(sK10)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f62]) ).
fof(f76,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,[],[f63]) ).
fof(f77,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,[],[f76]) ).
fof(f78,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,[],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ( ( ~ subset(sK12(X0,X1),X0)
| ~ finite(sK12(X0,X1))
| ~ in(sK12(X0,X1),X1) )
& ( ( subset(sK12(X0,X1),X0)
& finite(sK12(X0,X1)) )
| in(sK12(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,[sK12]),skolemize(X2,sK12(X0,X1))],[f78]) ).
fof(f83,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f90,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f98,plain,
! [X0] : ~ empty(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f127,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f130,plain,
element(sK11,finite_subsets(sK10)),
inference(cnf_transformation,[],[f75]) ).
fof(f131,plain,
~ element(sK11,powerset(sK10)),
inference(cnf_transformation,[],[f75]) ).
fof(f133,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f139,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f133]) ).
fof(f151,plain,
~ subset(sK11,sK10),
inference(resolution,[],[f127,f131]) ).
fof(f164,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| subset(X3,X0) ),
inference(forward_subsumption_resolution,[],[f139,f90]) ).
fof(f166,plain,
! [X0,X1] :
( subset(X0,X1)
| empty(finite_subsets(X1))
| ~ element(X0,finite_subsets(X1)) ),
inference(resolution,[],[f164,f83]) ).
fof(f167,plain,
! [X0,X1] :
( ~ element(X0,finite_subsets(X1))
| subset(X0,X1) ),
inference(forward_subsumption_resolution,[],[f166,f98]) ).
fof(f178,plain,
subset(sK11,sK10),
inference(resolution,[],[f167,f130]) ).
fof(f179,plain,
$false,
inference(forward_subsumption_resolution,[],[f178,f151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU117+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 03:36:36 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.13/1.20 % (2993752)Detected formulas, will run a generic FOF schedule.
% 3.13/1.20 % (2993762)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=259638284:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.13/1.20 % (2993761)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3991208552:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.13/1.20 % (2993760)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3615112029:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.13/1.20 % (2993758)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=800265722:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.13/1.20 % (2993757)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=1345401047:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.13/1.20 % (2993763)dis-21_1_sil=8000:lcm=predicate:random_seed=1878982280: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)
% 3.13/1.20 % (2993759)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=90453711:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.13/1.20 % (2993760)Refutation not found, incomplete strategy
% 3.13/1.20 % (2993760)------------------------------
% 3.13/1.20 % (2993760)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.20 % (2993760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.20 % (2993760)CaDiCaL version: 2.1.3
% 3.13/1.20 % (2993760)Termination reason: Refutation not found, incomplete strategy
% 3.13/1.20 % (2993760)Time elapsed: 0.001 s
% 3.13/1.20 % (2993760)Peak memory usage: 87 MB
% 3.13/1.20 % (2993761)Refutation not found, incomplete strategy
% 3.13/1.20 % (2993761)------------------------------
% 3.13/1.20 % (2993761)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.20 % (2993761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.20 % (2993761)CaDiCaL version: 2.1.3
% 3.13/1.20 % (2993761)Termination reason: Refutation not found, incomplete strategy
% 3.13/1.20 % (2993761)Time elapsed: 0.002 s
% 3.13/1.20 % (2993761)Peak memory usage: 88 MB
% 3.13/1.20 % (2993761)Instructions burned: 1 (million)
% 3.13/1.20 % (2993762)First to succeed.
% 3.13/1.20 % (2993762)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2993752"
% 3.13/1.20 % (2993763)Instruction limit reached!
% 3.13/1.20 % (2993763)------------------------------
% 3.13/1.20 % (2993763)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.20 % (2993763)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.20 % (2993763)CaDiCaL version: 2.1.3
% 3.13/1.20 % (2993763)Termination reason: Instruction limit
% 3.13/1.20 % (2993763)Termination phase: Saturation
% 3.13/1.20 % (2993763)Time elapsed: 0.072 s
% 3.13/1.20 % (2993763)Peak memory usage: 90 MB
% 3.13/1.20 % (2993763)Instructions burned: 130 (million)
% 3.13/1.20 % (2993771)lrs+10_1_sil=8000:sp=occurrence:random_seed=1382994138:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.13/1.20 % (2993771)Also succeeded, but the first one will report.
% 3.13/1.20 % (2993761)------------------------------
% 3.13/1.20 % (2993761)------------------------------
% 3.13/1.20 % (2993760)------------------------------
% 3.13/1.20 % (2993760)------------------------------
% 3.13/1.20 % (2993762)Refutation found. Thanks to Tanya!
% 3.13/1.20 % SZS status Theorem for theBenchmark
% 3.13/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 3.13/1.20 % (2993762)------------------------------
% 3.13/1.20 % (2993762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.20 % (2993762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.20 % (2993762)CaDiCaL version: 2.1.3
% 3.13/1.20 % (2993762)Termination reason: Refutation
% 3.13/1.20 % (2993762)Time elapsed: 0.004 s
% 3.13/1.20 % (2993762)Peak memory usage: 89 MB
% 3.13/1.20 % (2993762)Instructions burned: 5 (million)
% 3.13/1.20 % (2993762)------------------------------
% 3.13/1.20 % (2993762)------------------------------
% 3.13/1.20 % (2993752)Success in time 0.389 s
% 3.13/1.20 % Vampire exiting
%------------------------------------------------------------------------------