%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU108+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:15 PM UTC 2026
% Result : Theorem 2.87s 1.36s
% Output : Refutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 86 ( 15 unt; 4 def)
% Number of atoms : 232 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 256 ( 110 ~; 111 |; 21 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 113 ( 0 sgn 108 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X0))
& element(X2,powerset(X0)) )
=> element(subset_union2(X0,X1,X2),powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k4_subset_1) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X0))
& element(X2,powerset(X0)) )
=> element(subset_difference(X0,X1,X2),powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k6_subset_1) ).
fof(f12,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f28,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X0))
& element(X2,powerset(X0)) )
=> subset_union2(X0,X1,X2) = set_union2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k4_subset_1) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X0))
& element(X2,powerset(X0)) )
=> subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).
fof(f31,axiom,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(X1,X0)
& in(X2,X0) )
=> ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f33,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f34,conjecture,
! [X0] : preboolean(powerset(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_finsub_1) ).
fof(f35,negated_conjecture,
~ ! [X0] : preboolean(powerset(X0)),
inference(negated_conjecture,[status(cth)],[f34]) ).
fof(f36,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f43,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f64,plain,
! [X0,X1,X2] :
( element(subset_union2(X0,X1,X2),powerset(X0))
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f65,plain,
! [X0,X1,X2] :
( element(subset_union2(X0,X1,X2),powerset(X0))
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0,X1,X2] :
( element(subset_difference(X0,X1,X2),powerset(X0))
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f67,plain,
! [X0,X1,X2] :
( element(subset_difference(X0,X1,X2),powerset(X0))
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(flattening,[],[f66]) ).
fof(f78,plain,
! [X0,X1,X2] :
( subset_union2(X0,X1,X2) = set_union2(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f28]) ).
fof(f79,plain,
! [X0,X1,X2] :
( subset_union2(X0,X1,X2) = set_union2(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( subset_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f81,plain,
! [X0,X1,X2] :
( subset_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f83,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(flattening,[],[f82]) ).
fof(f84,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f85,plain,
? [X0] : ~ preboolean(powerset(X0)),
inference(ennf_transformation,[],[f35]) ).
fof(f86,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f87,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f86]) ).
fof(f93,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f105,plain,
! [X0] :
( ( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_union2(X1,X2),X0)
| ~ in(set_difference(X1,X2),X0) )
& in(X1,X0)
& in(X2,X0) ) )
& ( ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) )
| ~ preboolean(X0) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f106,plain,
! [X0] :
( ( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_union2(X1,X2),X0)
| ~ in(set_difference(X1,X2),X0) )
& in(X1,X0)
& in(X2,X0) ) )
& ( ! [X3,X4] :
( ( in(set_union2(X3,X4),X0)
& in(set_difference(X3,X4),X0) )
| ~ in(X3,X0)
| ~ in(X4,X0) )
| ~ preboolean(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( preboolean(X0)
| ( ( ~ in(set_union2(sK10(X0),sK11(X0)),X0)
| ~ in(set_difference(sK10(X0),sK11(X0)),X0) )
& in(sK10(X0),X0)
& in(sK11(X0),X0) ) )
& ( ! [X3,X4] :
( ( in(set_union2(X3,X4),X0)
& in(set_difference(X3,X4),X0) )
| ~ in(X3,X0)
| ~ in(X4,X0) )
| ~ preboolean(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0))],[f106]) ).
fof(f108,plain,
~ preboolean(powerset(sK12)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f85]) ).
fof(f117,plain,
! [X2,X0,X1] :
( element(subset_union2(X0,X1,X2),powerset(X0))
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f118,plain,
! [X2,X0,X1] :
( element(subset_difference(X0,X1,X2),powerset(X0))
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(cnf_transformation,[],[f67]) ).
fof(f121,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f149,plain,
! [X2,X0,X1] :
( subset_union2(X0,X1,X2) = set_union2(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f150,plain,
! [X2,X0,X1] :
( subset_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f154,plain,
! [X0] :
( in(sK11(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f155,plain,
! [X0] :
( in(sK10(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f156,plain,
! [X0] :
( ~ in(set_difference(sK10(X0),sK11(X0)),X0)
| ~ in(set_union2(sK10(X0),sK11(X0)),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f158,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f159,plain,
~ preboolean(powerset(sK12)),
inference(cnf_transformation,[],[f108]) ).
fof(f160,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
fof(f167,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f196,plain,
! [X0] :
( preboolean(X0)
| ~ empty(X0) ),
inference(resolution,[],[f167,f154]) ).
fof(f208,plain,
! [X2,X0,X1] :
( element(set_union2(X0,X1),powerset(X2))
| ~ element(X0,powerset(X2))
| ~ element(X1,powerset(X2))
| ~ element(X0,powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(superposition,[],[f117,f149]) ).
fof(f209,plain,
! [X2,X0,X1] :
( element(set_union2(X0,X1),powerset(X2))
| ~ element(X0,powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(duplicate_literal_removal,[],[f208]) ).
fof(f212,plain,
! [X2,X0,X1] :
( element(set_difference(X0,X1),powerset(X2))
| ~ element(X0,powerset(X2))
| ~ element(X1,powerset(X2))
| ~ element(X0,powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(superposition,[],[f118,f150]) ).
fof(f213,plain,
! [X2,X0,X1] :
( element(set_difference(X0,X1),powerset(X2))
| ~ element(X0,powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(duplicate_literal_removal,[],[f212]) ).
fof(f265,plain,
! [X0] :
( empty(X0)
| ~ element(set_difference(sK10(X0),sK11(X0)),X0)
| ~ in(set_union2(sK10(X0),sK11(X0)),X0)
| preboolean(X0) ),
inference(resolution,[],[f160,f156]) ).
fof(f266,plain,
! [X0] :
( preboolean(X0)
| ~ in(set_union2(sK10(X0),sK11(X0)),X0)
| ~ element(set_difference(sK10(X0),sK11(X0)),X0) ),
inference(forward_subsumption_resolution,[],[f265,f196]) ).
fof(f383,plain,
( ~ in(set_union2(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12))
| ~ element(set_difference(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12)) ),
inference(resolution,[],[f266,f159]) ).
fof(f387,definition,
( spl13_5
<=> element(set_difference(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).
fof(f389,plain,
( ~ element(set_difference(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12))
| spl13_5 ),
inference(avatar_component_clause,[],[f387]) ).
fof(f391,definition,
( spl13_6
<=> in(set_union2(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_6])],[avatar_definition]) ).
fof(f393,plain,
( ~ in(set_union2(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12))
| spl13_6 ),
inference(avatar_component_clause,[],[f391]) ).
fof(f394,plain,
( ~ spl13_5
| ~ spl13_6 ),
inference(avatar_split_clause,[],[f383,f391,f387]) ).
fof(f398,plain,
( ~ element(sK10(powerset(sK12)),powerset(sK12))
| ~ element(sK11(powerset(sK12)),powerset(sK12))
| spl13_5 ),
inference(resolution,[],[f389,f213]) ).
fof(f403,definition,
( spl13_7
<=> element(sK11(powerset(sK12)),powerset(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_7])],[avatar_definition]) ).
fof(f404,plain,
( element(sK11(powerset(sK12)),powerset(sK12))
| ~ spl13_7 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f405,plain,
( ~ element(sK11(powerset(sK12)),powerset(sK12))
| spl13_7 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f407,definition,
( spl13_8
<=> element(sK10(powerset(sK12)),powerset(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_8])],[avatar_definition]) ).
fof(f408,plain,
( element(sK10(powerset(sK12)),powerset(sK12))
| ~ spl13_8 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f409,plain,
( ~ element(sK10(powerset(sK12)),powerset(sK12))
| spl13_8 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f410,plain,
( ~ spl13_7
| ~ spl13_8
| spl13_5 ),
inference(avatar_split_clause,[],[f398,f387,f407,f403]) ).
fof(f417,plain,
( ~ in(sK11(powerset(sK12)),powerset(sK12))
| spl13_7 ),
inference(resolution,[],[f405,f158]) ).
fof(f425,plain,
( preboolean(powerset(sK12))
| spl13_7 ),
inference(resolution,[],[f417,f154]) ).
fof(f427,plain,
( $false
| spl13_7 ),
inference(forward_subsumption_resolution,[],[f425,f159]) ).
fof(f428,plain,
spl13_7,
inference(avatar_contradiction_clause,[],[f427]) ).
fof(f433,plain,
( ~ in(sK10(powerset(sK12)),powerset(sK12))
| spl13_8 ),
inference(resolution,[],[f409,f158]) ).
fof(f471,plain,
( preboolean(powerset(sK12))
| spl13_8 ),
inference(resolution,[],[f433,f155]) ).
fof(f473,plain,
( $false
| spl13_8 ),
inference(forward_subsumption_resolution,[],[f471,f159]) ).
fof(f474,plain,
spl13_8,
inference(avatar_contradiction_clause,[],[f473]) ).
fof(f475,plain,
( empty(powerset(sK12))
| ~ element(set_union2(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12))
| spl13_6 ),
inference(resolution,[],[f393,f160]) ).
fof(f476,plain,
( ~ element(set_union2(sK10(powerset(sK12)),sK11(powerset(sK12))),powerset(sK12))
| spl13_6 ),
inference(forward_subsumption_resolution,[],[f475,f121]) ).
fof(f478,plain,
( ~ element(sK10(powerset(sK12)),powerset(sK12))
| ~ element(sK11(powerset(sK12)),powerset(sK12))
| spl13_6 ),
inference(resolution,[],[f476,f209]) ).
fof(f482,plain,
( ~ element(sK11(powerset(sK12)),powerset(sK12))
| spl13_6
| ~ spl13_8 ),
inference(forward_subsumption_resolution,[],[f478,f408]) ).
fof(f483,plain,
( $false
| spl13_6
| ~ spl13_7
| ~ spl13_8 ),
inference(forward_subsumption_resolution,[],[f482,f404]) ).
fof(f484,plain,
( spl13_6
| ~ spl13_7
| ~ spl13_8 ),
inference(avatar_contradiction_clause,[],[f483]) ).
cnf(s3,plain,
( ~ spl13_5
| ~ spl13_6 ),
inference(sat_conversion,[],[f394]) ).
cnf(s4,plain,
( spl13_5
| ~ spl13_7
| ~ spl13_8 ),
inference(sat_conversion,[],[f410]) ).
cnf(s5,plain,
spl13_7,
inference(sat_conversion,[],[f428]) ).
cnf(s9,plain,
spl13_8,
inference(sat_conversion,[],[f474]) ).
cnf(s10,plain,
( spl13_6
| ~ spl13_7
| ~ spl13_8 ),
inference(sat_conversion,[],[f484]) ).
cnf(s11,plain,
spl13_6,
inference(rat,[],[s10,s9,s5]) ).
cnf(s12,plain,
spl13_5,
inference(rat,[],[s4,s9,s5]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s3,s11,s12]) ).
fof(f485,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU108+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.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:35:45 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.87/1.36 % (2991998)Detected formulas, will run a generic FOF schedule.
% 2.87/1.36 % (2992103)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3016292999:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.87/1.36 % (2992103)Instruction limit reached!
% 2.87/1.36 % (2992103)------------------------------
% 2.87/1.36 % (2992103)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.36 % (2992103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.36 % (2992103)CaDiCaL version: 2.1.3
% 2.87/1.36 % (2992103)Termination reason: Instruction limit
% 2.87/1.36 % (2992103)Termination phase: Saturation
% 2.87/1.36 % (2992103)Time elapsed: 0.038 s
% 2.87/1.36 % (2992103)Peak memory usage: 89 MB
% 2.87/1.36 % (2992103)Instructions burned: 119 (million)
% 2.87/1.36 % (2992105)dis-21_1_sil=8000:lcm=predicate:random_seed=4206630447: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.87/1.36 % (2992102)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1595514879:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.87/1.36 % (2992099)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=3392497505:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.87/1.36 % (2992101)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=2902464011:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.87/1.36 % (2992100)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=2503290723:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.87/1.36 % (2992102)Refutation not found, incomplete strategy
% 2.87/1.36 % (2992102)------------------------------
% 2.87/1.36 % (2992102)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.36 % (2992102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.36 % (2992102)CaDiCaL version: 2.1.3
% 2.87/1.36 % (2992102)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.36 % (2992102)Time elapsed: 0.001 s
% 2.87/1.36 % (2992102)Peak memory usage: 87 MB
% 2.87/1.36 % (2992104)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3033634690:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.87/1.36 % (2992104)First to succeed.
% 2.87/1.36 % (2992104)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2991998"
% 2.87/1.36 % (2992105)Instruction limit reached!
% 2.87/1.36 % (2992105)------------------------------
% 2.87/1.36 % (2992105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.36 % (2992105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.36 % (2992105)CaDiCaL version: 2.1.3
% 2.87/1.36 % (2992105)Termination reason: Instruction limit
% 2.87/1.36 % (2992105)Termination phase: Saturation
% 2.87/1.36 % (2992105)Time elapsed: 0.074 s
% 2.87/1.36 % (2992105)Peak memory usage: 90 MB
% 2.87/1.36 % (2992105)Instructions burned: 130 (million)
% 2.87/1.36 % (2992134)lrs+10_1_sil=8000:sp=occurrence:random_seed=1048903792:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.87/1.36 % (2992134)Instruction limit reached!
% 2.87/1.36 % (2992134)------------------------------
% 2.87/1.36 % (2992134)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.36 % (2992134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.36 % (2992134)CaDiCaL version: 2.1.3
% 2.87/1.36 % (2992134)Termination reason: Instruction limit
% 2.87/1.36 % (2992134)Termination phase: Saturation
% 2.87/1.36 % (2992134)Time elapsed: 0.087 s
% 2.87/1.36 % (2992134)Peak memory usage: 92 MB
% 2.87/1.36 % (2992134)Instructions burned: 288 (million)
% 2.87/1.36 % (2992102)------------------------------
% 2.87/1.36 % (2992102)------------------------------
% 2.87/1.36 % (2992144)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2187243240:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.87/1.36 % (2992144)Refutation not found, incomplete strategy
% 2.87/1.36 % (2992144)------------------------------
% 2.87/1.36 % (2992144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.36 % (2992144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.36 % (2992144)CaDiCaL version: 2.1.3
% 2.87/1.36 % (2992144)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.36 % (2992144)Time elapsed: 0.002 s
% 2.87/1.36 % (2992144)Peak memory usage: 88 MB
% 2.87/1.36 % (2992144)Instructions burned: 1 (million)
% 2.87/1.36 % (2992104)Refutation found. Thanks to Tanya!
% 2.87/1.36 % SZS status Theorem for theBenchmark
% 2.87/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 3.98/1.46 % (2992104)------------------------------
% 3.98/1.46 % (2992104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.98/1.46 % (2992104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.98/1.46 % (2992104)CaDiCaL version: 2.1.3
% 3.98/1.46 % (2992104)Termination reason: Refutation
% 3.98/1.46 % (2992104)Time elapsed: 0.014 s
% 3.98/1.46 % (2992104)Peak memory usage: 90 MB
% 3.98/1.46 % (2992104)Instructions burned: 17 (million)
% 3.98/1.46 % (2992104)------------------------------
% 3.98/1.46 % (2992104)------------------------------
% 3.98/1.46 % (2991998)Success in time 0.489 s
% 3.98/1.46 % Vampire exiting
%------------------------------------------------------------------------------