%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU114+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 : 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:47:16 PM UTC 2026
% Result : Theorem 2.78s 1.26s
% Output : Refutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 88 ( 16 unt; 5 def)
% Number of atoms : 279 ( 20 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 320 ( 129 ~; 138 |; 35 &)
% ( 12 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 93 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,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(f10,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f12,axiom,
! [X0] :
( ~ empty(powerset(X0))
& cup_closed(powerset(X0))
& diff_closed(powerset(X0))
& preboolean(powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_finsub_1) ).
fof(f26,axiom,
! [X0,X1] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f27,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f28,axiom,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_finsub_1) ).
fof(f29,conjecture,
! [X0] :
( finite(X0)
=> finite_subsets(X0) = powerset(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_finsub_1) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( finite(X0)
=> finite_subsets(X0) = powerset(X0) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f32,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f55,plain,
! [X0,X1] :
( ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f59,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f60,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f62,plain,
? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f73,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,[],[f54]) ).
fof(f74,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,[],[f73]) ).
fof(f75,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))],[f74]) ).
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,[],[f55]) ).
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(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))],[f78]) ).
fof(f90,plain,
( powerset(sK12) != finite_subsets(sK12)
& finite(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f62]) ).
fof(f91,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f102,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f107,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f108,plain,
! [X0,X1] :
( finite_subsets(X0) = X1
| finite(sK1(X0,X1))
| in(sK1(X0,X1),X1)
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f109,plain,
! [X0,X1] :
( finite_subsets(X0) = X1
| subset(sK1(X0,X1),X0)
| in(sK1(X0,X1),X1)
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f110,plain,
! [X0,X1] :
( finite_subsets(X0) = X1
| ~ subset(sK1(X0,X1),X0)
| ~ finite(sK1(X0,X1))
| ~ in(sK1(X0,X1),X1)
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f111,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f113,plain,
! [X0] : preboolean(powerset(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f145,plain,
! [X0,X1] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f146,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f147,plain,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f148,plain,
finite(sK12),
inference(cnf_transformation,[],[f90]) ).
fof(f149,plain,
powerset(sK12) != finite_subsets(sK12),
inference(cnf_transformation,[],[f90]) ).
fof(f151,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f160,plain,
! [X3,X0] :
( ~ preboolean(finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3)
| in(X3,finite_subsets(X0)) ),
inference(equality_resolution,[],[f107]) ).
fof(f163,definition,
! [X0,X1] :
( sQ13_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ13_eqProxy])],[equality_proxy_definition]) ).
fof(f165,plain,
! [X0,X1] :
( sQ13_eqProxy(finite_subsets(X0),X1)
| ~ subset(sK1(X0,X1),X0)
| ~ finite(sK1(X0,X1))
| ~ in(sK1(X0,X1),X1)
| ~ preboolean(X1) ),
inference(equality_proxy_replacement,[],[f110,f163]) ).
fof(f166,plain,
! [X0,X1] :
( sQ13_eqProxy(finite_subsets(X0),X1)
| subset(sK1(X0,X1),X0)
| in(sK1(X0,X1),X1)
| ~ preboolean(X1) ),
inference(equality_proxy_replacement,[],[f109,f163]) ).
fof(f167,plain,
! [X0,X1] :
( sQ13_eqProxy(finite_subsets(X0),X1)
| finite(sK1(X0,X1))
| in(sK1(X0,X1),X1)
| ~ preboolean(X1) ),
inference(equality_proxy_replacement,[],[f108,f163]) ).
fof(f168,plain,
~ sQ13_eqProxy(powerset(sK12),finite_subsets(sK12)),
inference(equality_proxy_replacement,[],[f149,f163]) ).
fof(f172,plain,
! [X0,X1] :
( sQ13_eqProxy(X1,X0)
| ~ sQ13_eqProxy(X0,X1) ),
inference(equality_proxy_axiom,[],[f163]) ).
fof(f180,plain,
~ sQ13_eqProxy(finite_subsets(sK12),powerset(sK12)),
inference(resolution,[],[f172,f168]) ).
fof(f182,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(X0,powerset(X1)) ),
inference(resolution,[],[f151,f146]) ).
fof(f211,plain,
! [X0,X1] :
( ~ in(X0,finite_subsets(X1))
| in(X0,powerset(X1)) ),
inference(resolution,[],[f102,f147]) ).
fof(f252,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ subset(X0,X1)
| in(X0,finite_subsets(X1)) ),
inference(resolution,[],[f160,f111]) ).
fof(f255,plain,
( finite(sK1(sK12,powerset(sK12)))
| in(sK1(sK12,powerset(sK12)),powerset(sK12))
| ~ preboolean(powerset(sK12)) ),
inference(resolution,[],[f167,f180]) ).
fof(f257,definition,
( spl14_3
<=> preboolean(powerset(sK12)) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f258,plain,
( ~ preboolean(powerset(sK12))
| spl14_3 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,definition,
( spl14_4
<=> in(sK1(sK12,powerset(sK12)),powerset(sK12)) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f263,definition,
( spl14_5
<=> finite(sK1(sK12,powerset(sK12))) ),
introduced(definition,[new_symbols(definition,[spl14_5])],[avatar_definition]) ).
fof(f264,plain,
( finite(sK1(sK12,powerset(sK12)))
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f265,plain,
( ~ spl14_3
| spl14_4
| spl14_5 ),
inference(avatar_split_clause,[],[f255,f263,f260,f257]) ).
fof(f266,plain,
( $false
| spl14_3 ),
inference(resolution,[],[f258,f113]) ).
fof(f267,plain,
spl14_3,
inference(avatar_contradiction_clause,[],[f266]) ).
fof(f271,plain,
( subset(sK1(sK12,powerset(sK12)),sK12)
| in(sK1(sK12,powerset(sK12)),powerset(sK12))
| ~ preboolean(powerset(sK12)) ),
inference(resolution,[],[f166,f180]) ).
fof(f273,plain,
( ~ subset(sK1(sK12,powerset(sK12)),sK12)
| ~ finite(sK1(sK12,powerset(sK12)))
| ~ in(sK1(sK12,powerset(sK12)),powerset(sK12))
| ~ preboolean(powerset(sK12)) ),
inference(resolution,[],[f165,f180]) ).
fof(f275,plain,
( ~ finite(sK1(sK12,powerset(sK12)))
| spl14_5 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f277,definition,
( spl14_6
<=> subset(sK1(sK12,powerset(sK12)),sK12) ),
introduced(definition,[new_symbols(definition,[spl14_6])],[avatar_definition]) ).
fof(f278,plain,
( ~ subset(sK1(sK12,powerset(sK12)),sK12)
| spl14_6 ),
inference(avatar_component_clause,[],[f277]) ).
fof(f279,plain,
( ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(avatar_split_clause,[],[f273,f277,f263,f260,f257]) ).
fof(f280,plain,
( ! [X0] :
( ~ finite(X0)
| ~ subset(sK1(sK12,powerset(sK12)),X0) )
| spl14_5 ),
inference(resolution,[],[f275,f145]) ).
fof(f294,plain,
( ~ subset(sK1(sK12,powerset(sK12)),sK12)
| spl14_5 ),
inference(resolution,[],[f280,f148]) ).
fof(f295,plain,
( ~ spl14_6
| spl14_5 ),
inference(avatar_split_clause,[],[f294,f263,f277]) ).
fof(f296,plain,
( ~ in(sK1(sK12,powerset(sK12)),powerset(sK12))
| spl14_6 ),
inference(resolution,[],[f278,f182]) ).
fof(f299,plain,
( ~ spl14_4
| spl14_6 ),
inference(avatar_split_clause,[],[f296,f277,f260]) ).
fof(f300,plain,
( subset(sK1(sK12,powerset(sK12)),sK12)
| ~ spl14_6 ),
inference(avatar_component_clause,[],[f277]) ).
fof(f301,plain,
( ~ spl14_3
| spl14_4
| spl14_6 ),
inference(avatar_split_clause,[],[f271,f277,f260,f257]) ).
fof(f353,plain,
( ! [X0] :
( ~ subset(sK1(sK12,powerset(sK12)),X0)
| in(sK1(sK12,powerset(sK12)),finite_subsets(X0)) )
| ~ spl14_5 ),
inference(resolution,[],[f252,f264]) ).
fof(f363,plain,
( in(sK1(sK12,powerset(sK12)),finite_subsets(sK12))
| ~ spl14_5
| ~ spl14_6 ),
inference(resolution,[],[f353,f300]) ).
fof(f369,plain,
( in(sK1(sK12,powerset(sK12)),powerset(sK12))
| ~ spl14_5
| ~ spl14_6 ),
inference(resolution,[],[f363,f211]) ).
fof(f374,plain,
( spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(avatar_split_clause,[],[f369,f277,f263,f260]) ).
cnf(s3,plain,
( ~ spl14_3
| spl14_4
| spl14_5 ),
inference(sat_conversion,[],[f265]) ).
cnf(s4,plain,
spl14_3,
inference(sat_conversion,[],[f267]) ).
cnf(s5,plain,
( ~ spl14_3
| ~ spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(sat_conversion,[],[f279]) ).
cnf(s6,plain,
( spl14_5
| ~ spl14_6 ),
inference(sat_conversion,[],[f295]) ).
cnf(s7,plain,
( ~ spl14_4
| spl14_6 ),
inference(sat_conversion,[],[f299]) ).
cnf(s8,plain,
( ~ spl14_3
| spl14_4
| spl14_6 ),
inference(sat_conversion,[],[f301]) ).
cnf(s10,plain,
( spl14_4
| ~ spl14_5
| ~ spl14_6 ),
inference(sat_conversion,[],[f374]) ).
cnf(s11,plain,
( spl14_4
| spl14_5 ),
inference(rat,[],[s3,s4]) ).
cnf(s12,plain,
spl14_4,
inference(rat,[],[s10,s11,s8,s4]) ).
cnf(s13,plain,
spl14_6,
inference(rat,[],[s7,s12]) ).
cnf(s14,plain,
~ spl14_5,
inference(rat,[],[s5,s13,s4,s12]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s6,s13,s14]) ).
fof(f375,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU114+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.36 % Computer : n010.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 03:35:32 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 Running first-order theorem proving
% 0.11/0.39 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
% 2.78/1.26 % (1535356)Detected formulas, will run a generic FOF schedule.
% 2.78/1.26 % (1535361)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=1012992141:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.78/1.26 % (1535365)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2112803110:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.78/1.26 % (1535364)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2786043684:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.78/1.26 % (1535367)dis-21_1_sil=8000:lcm=predicate:random_seed=1671767705: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.78/1.26 % (1535362)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=2211002167:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.78/1.26 % (1535363)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=3133647091:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.78/1.26 % (1535364)Refutation not found, incomplete strategy
% 2.78/1.26 % (1535364)------------------------------
% 2.78/1.26 % (1535364)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.78/1.26 % (1535364)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.78/1.26 % (1535364)CaDiCaL version: 2.1.3
% 2.78/1.26 % (1535364)Termination reason: Refutation not found, incomplete strategy
% 2.78/1.26 % (1535364)Time elapsed: 0.002 s
% 2.78/1.26 % (1535364)Peak memory usage: 88 MB
% 2.78/1.26 % (1535364)Instructions burned: 1 (million)
% 2.78/1.26 % (1535367)First to succeed.
% 2.78/1.26 % (1535367)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1535356"
% 2.78/1.26 % (1535366)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1999105930:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.78/1.26 % (1535365)Instruction limit reached!
% 2.78/1.26 % (1535365)------------------------------
% 2.78/1.26 % (1535365)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.78/1.26 % (1535365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.78/1.26 % (1535365)CaDiCaL version: 2.1.3
% 2.78/1.26 % (1535365)Termination reason: Instruction limit
% 2.78/1.26 % (1535365)Termination phase: Saturation
% 2.78/1.26 % (1535365)Time elapsed: 0.076 s
% 2.78/1.26 % (1535365)Peak memory usage: 88 MB
% 2.78/1.26 % (1535365)Instructions burned: 121 (million)
% 2.78/1.26 % (1535366)Instruction limit reached!
% 2.78/1.26 % (1535366)------------------------------
% 2.78/1.26 % (1535366)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.78/1.26 % (1535366)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.78/1.26 % (1535366)CaDiCaL version: 2.1.3
% 2.78/1.26 % (1535366)Termination reason: Instruction limit
% 2.78/1.26 % (1535366)Termination phase: Saturation
% 2.78/1.26 % (1535366)Time elapsed: 0.103 s
% 2.78/1.26 % (1535366)Peak memory usage: 89 MB
% 2.78/1.26 % (1535366)Instructions burned: 140 (million)
% 2.78/1.26 % (1535375)lrs+10_1_sil=8000:sp=occurrence:random_seed=1856754548:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.78/1.26 % (1535364)------------------------------
% 2.78/1.26 % (1535364)------------------------------
% 2.78/1.26 % (1535367)Refutation found. Thanks to Tanya!
% 2.78/1.26 % SZS status Theorem for theBenchmark
% 2.78/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.45/1.36 % (1535367)------------------------------
% 3.45/1.36 % (1535367)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.36 % (1535367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.36 % (1535367)CaDiCaL version: 2.1.3
% 3.45/1.36 % (1535367)Termination reason: Refutation
% 3.45/1.36 % (1535367)Time elapsed: 0.007 s
% 3.45/1.36 % (1535367)Peak memory usage: 89 MB
% 3.45/1.36 % (1535367)Instructions burned: 8 (million)
% 3.45/1.36 % (1535367)------------------------------
% 3.45/1.36 % (1535367)------------------------------
% 3.45/1.36 % (1535356)Success in time 0.425 s
% 3.45/1.36 % Vampire exiting
%------------------------------------------------------------------------------