%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET015-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:39:33 PM UTC 2026
% Result : Unsatisfiable 2.95s 1.31s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of formulae : 84 ( 12 unt; 8 def)
% Number of atoms : 183 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 177 ( 78 ~; 91 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
| member(member_of_1_not_of_2(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsets_axiom1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
| ~ member(member_of_1_not_of_2(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsets_axiom2) ).
fof(f7,axiom,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_set1_is_member_of_union) ).
fof(f8,axiom,
! [X2,X0,X1] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_set2_is_member_of_union) ).
fof(f9,axiom,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_union_is_member_of_one_set) ).
fof(f13,axiom,
! [X0,X1] :
( subset(X0,X1)
| ~ equal_sets(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_equal_sets_are_subsets1) ).
fof(f14,axiom,
! [X0,X1] :
( subset(X1,X0)
| ~ equal_sets(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_equal_sets_are_subsets2) ).
fof(f15,axiom,
! [X0,X1] :
( equal_sets(X1,X0)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsets_are_set_equal_sets) ).
fof(f16,axiom,
! [X0] : equal_sets(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_for_set_equal) ).
fof(f17,axiom,
! [X0,X1] :
( equal_sets(X1,X0)
| ~ equal_sets(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_for_set_equal) ).
fof(f18,axiom,
! [X2,X0,X1] :
( equal_sets(X0,X2)
| ~ equal_sets(X1,X2)
| ~ equal_sets(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_for_set_equal) ).
fof(f22,axiom,
equal_sets(union(as,bs),cs),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_union_b_is_c) ).
fof(f23,axiom,
equal_sets(union(bs,as),ds),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_union_a_is_d) ).
fof(f24,negated_conjecture,
~ equal_sets(cs,ds),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
fof(f25,plain,
~ equal_sets(ds,cs),
inference(resolution,[],[f17,f24]) ).
fof(f46,plain,
! [X0] :
( ~ equal_sets(X0,cs)
| ~ equal_sets(ds,X0) ),
inference(resolution,[],[f18,f25]) ).
fof(f163,definition,
( spl0_7
<=> subset(union(as,bs),ds) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f164,plain,
( ~ subset(union(as,bs),ds)
| spl0_7 ),
inference(avatar_component_clause,[],[f163]) ).
fof(f166,definition,
( spl0_8
<=> subset(ds,union(as,bs)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f167,plain,
( ~ subset(ds,union(as,bs))
| spl0_8 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f206,plain,
( ~ equal_sets(union(as,bs),ds)
| spl0_7 ),
inference(resolution,[],[f164,f13]) ).
fof(f387,definition,
( spl0_9
<=> subset(union(bs,as),union(as,bs)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f388,plain,
( ~ subset(union(bs,as),union(as,bs))
| spl0_9 ),
inference(avatar_component_clause,[],[f387]) ).
fof(f390,definition,
( spl0_10
<=> subset(union(as,bs),union(bs,as)) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f391,plain,
( ~ subset(union(as,bs),union(bs,as))
| spl0_10 ),
inference(avatar_component_clause,[],[f390]) ).
fof(f415,plain,
( ~ member(member_of_1_not_of_2(union(bs,as),union(as,bs)),union(as,bs))
| spl0_9 ),
inference(resolution,[],[f388,f4]) ).
fof(f416,plain,
( member(member_of_1_not_of_2(union(bs,as),union(as,bs)),union(bs,as))
| spl0_9 ),
inference(resolution,[],[f388,f3]) ).
fof(f557,plain,
( ~ equal_sets(union(as,bs),ds)
| spl0_8 ),
inference(resolution,[],[f167,f14]) ).
fof(f1244,plain,
( ! [X0] :
( ~ equal_sets(union(as,bs),X0)
| ~ equal_sets(X0,ds) )
| spl0_8 ),
inference(resolution,[],[f557,f18]) ).
fof(f1253,plain,
~ equal_sets(ds,union(as,bs)),
inference(resolution,[],[f46,f22]) ).
fof(f1352,plain,
( ! [X0,X1] :
( ~ equal_sets(X0,ds)
| ~ equal_sets(X1,X0)
| ~ equal_sets(union(as,bs),X1) )
| spl0_8 ),
inference(resolution,[],[f1244,f18]) ).
fof(f1895,plain,
( ~ member(member_of_1_not_of_2(union(bs,as),union(as,bs)),bs)
| spl0_9 ),
inference(resolution,[],[f415,f8]) ).
fof(f1896,plain,
( ~ member(member_of_1_not_of_2(union(bs,as),union(as,bs)),as)
| spl0_9 ),
inference(resolution,[],[f415,f7]) ).
fof(f1991,plain,
( member(member_of_1_not_of_2(union(bs,as),union(as,bs)),bs)
| member(member_of_1_not_of_2(union(bs,as),union(as,bs)),as)
| spl0_9 ),
inference(resolution,[],[f416,f9]) ).
fof(f1993,definition,
( spl0_77
<=> member(member_of_1_not_of_2(union(bs,as),union(as,bs)),as) ),
introduced(definition,[new_symbols(definition,[spl0_77])],[avatar_definition]) ).
fof(f1994,plain,
( member(member_of_1_not_of_2(union(bs,as),union(as,bs)),as)
| ~ spl0_77 ),
inference(avatar_component_clause,[],[f1993]) ).
fof(f1996,definition,
( spl0_78
<=> member(member_of_1_not_of_2(union(bs,as),union(as,bs)),bs) ),
introduced(definition,[new_symbols(definition,[spl0_78])],[avatar_definition]) ).
fof(f1997,plain,
( member(member_of_1_not_of_2(union(bs,as),union(as,bs)),bs)
| ~ spl0_78 ),
inference(avatar_component_clause,[],[f1996]) ).
fof(f1998,plain,
( spl0_77
| spl0_78
| spl0_9 ),
inference(avatar_split_clause,[],[f1991,f387,f1996,f1993]) ).
fof(f2005,plain,
( $false
| spl0_9
| ~ spl0_77 ),
inference(resolution,[],[f1994,f1896]) ).
fof(f2008,plain,
( spl0_9
| ~ spl0_77 ),
inference(avatar_contradiction_clause,[],[f2005]) ).
fof(f2015,plain,
( $false
| spl0_9
| ~ spl0_78 ),
inference(resolution,[],[f1997,f1895]) ).
fof(f2018,plain,
( spl0_9
| ~ spl0_78 ),
inference(avatar_contradiction_clause,[],[f2015]) ).
fof(f2037,plain,
( ! [X0] :
( ~ equal_sets(X0,union(bs,as))
| ~ equal_sets(union(as,bs),X0) )
| spl0_8 ),
inference(resolution,[],[f1352,f23]) ).
fof(f2055,plain,
( ~ equal_sets(union(as,bs),union(bs,as))
| spl0_8 ),
inference(resolution,[],[f2037,f16]) ).
fof(f2072,plain,
( ~ subset(union(as,bs),union(bs,as))
| ~ subset(union(bs,as),union(as,bs))
| spl0_8 ),
inference(resolution,[],[f2055,f15]) ).
fof(f2074,plain,
( ~ spl0_9
| ~ spl0_10
| spl0_8 ),
inference(avatar_split_clause,[],[f2072,f166,f390,f387]) ).
fof(f2076,plain,
( member(member_of_1_not_of_2(union(as,bs),union(bs,as)),union(as,bs))
| spl0_10 ),
inference(resolution,[],[f391,f3]) ).
fof(f2161,plain,
( member(member_of_1_not_of_2(union(as,bs),union(bs,as)),as)
| member(member_of_1_not_of_2(union(as,bs),union(bs,as)),bs)
| spl0_10 ),
inference(resolution,[],[f2076,f9]) ).
fof(f2163,definition,
( spl0_80
<=> member(member_of_1_not_of_2(union(as,bs),union(bs,as)),bs) ),
introduced(definition,[new_symbols(definition,[spl0_80])],[avatar_definition]) ).
fof(f2164,plain,
( member(member_of_1_not_of_2(union(as,bs),union(bs,as)),bs)
| ~ spl0_80 ),
inference(avatar_component_clause,[],[f2163]) ).
fof(f2166,definition,
( spl0_81
<=> member(member_of_1_not_of_2(union(as,bs),union(bs,as)),as) ),
introduced(definition,[new_symbols(definition,[spl0_81])],[avatar_definition]) ).
fof(f2167,plain,
( member(member_of_1_not_of_2(union(as,bs),union(bs,as)),as)
| ~ spl0_81 ),
inference(avatar_component_clause,[],[f2166]) ).
fof(f2168,plain,
( spl0_80
| spl0_81
| spl0_10 ),
inference(avatar_split_clause,[],[f2161,f390,f2166,f2163]) ).
fof(f2208,plain,
( ~ subset(ds,union(as,bs))
| ~ subset(union(as,bs),ds) ),
inference(resolution,[],[f1253,f15]) ).
fof(f2210,plain,
( ~ spl0_7
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f2208,f166,f163]) ).
fof(f2239,plain,
( ! [X0] :
( ~ equal_sets(union(as,bs),X0)
| ~ equal_sets(X0,ds) )
| spl0_7 ),
inference(resolution,[],[f206,f18]) ).
fof(f2266,plain,
( ! [X0,X1] :
( ~ equal_sets(X0,ds)
| ~ equal_sets(X1,X0)
| ~ equal_sets(union(as,bs),X1) )
| spl0_7 ),
inference(resolution,[],[f2239,f18]) ).
fof(f2354,plain,
( ! [X0] :
( ~ equal_sets(X0,union(bs,as))
| ~ equal_sets(union(as,bs),X0) )
| spl0_7 ),
inference(resolution,[],[f2266,f23]) ).
fof(f2367,plain,
( ~ equal_sets(union(as,bs),union(bs,as))
| spl0_7 ),
inference(resolution,[],[f2354,f16]) ).
fof(f2390,plain,
( ~ subset(union(as,bs),union(bs,as))
| ~ subset(union(bs,as),union(as,bs))
| spl0_7 ),
inference(resolution,[],[f2367,f15]) ).
fof(f2392,plain,
( ~ spl0_9
| ~ spl0_10
| spl0_7 ),
inference(avatar_split_clause,[],[f2390,f163,f390,f387]) ).
fof(f2394,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),union(bs,as)),union(bs,as))
| spl0_10 ),
inference(resolution,[],[f391,f4]) ).
fof(f2754,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),union(bs,as)),as)
| spl0_10 ),
inference(resolution,[],[f2394,f8]) ).
fof(f2755,plain,
( ~ member(member_of_1_not_of_2(union(as,bs),union(bs,as)),bs)
| spl0_10 ),
inference(resolution,[],[f2394,f7]) ).
fof(f2825,plain,
( $false
| spl0_10
| ~ spl0_80 ),
inference(resolution,[],[f2755,f2164]) ).
fof(f2827,plain,
( spl0_10
| ~ spl0_80 ),
inference(avatar_contradiction_clause,[],[f2825]) ).
fof(f2828,plain,
( $false
| spl0_10
| ~ spl0_81 ),
inference(resolution,[],[f2167,f2754]) ).
fof(f2834,plain,
( spl0_10
| ~ spl0_81 ),
inference(avatar_contradiction_clause,[],[f2828]) ).
cnf(s110,plain,
( spl0_9
| spl0_77
| spl0_78 ),
inference(sat_conversion,[],[f1998]) ).
cnf(s111,plain,
( spl0_9
| ~ spl0_77 ),
inference(sat_conversion,[],[f2008]) ).
cnf(s112,plain,
( spl0_9
| ~ spl0_78 ),
inference(sat_conversion,[],[f2018]) ).
cnf(s113,plain,
( spl0_8
| ~ spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f2074]) ).
cnf(s117,plain,
( spl0_10
| spl0_80
| spl0_81 ),
inference(sat_conversion,[],[f2168]) ).
cnf(s118,plain,
( ~ spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f2210]) ).
cnf(s126,plain,
( spl0_7
| ~ spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f2392]) ).
cnf(s145,plain,
( spl0_10
| ~ spl0_80 ),
inference(sat_conversion,[],[f2827]) ).
cnf(s146,plain,
( spl0_10
| ~ spl0_81 ),
inference(sat_conversion,[],[f2834]) ).
cnf(s147,plain,
spl0_9,
inference(rat,[],[s110,s111,s112]) ).
cnf(s148,plain,
spl0_10,
inference(rat,[],[s117,s145,s146]) ).
cnf(s150,plain,
spl0_7,
inference(rat,[],[s126,s147,s148]) ).
cnf(s151,plain,
spl0_8,
inference(rat,[],[s113,s147,s148]) ).
cnf(s153,plain,
$false,
inference(rat,[],[s118,s151,s150]) ).
fof(f2835,plain,
$false,
inference(avatar_sat_refutation,[],[s153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET015-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n017.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 : Sun Sep 27 23:59:51 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.95/1.31 % (3095689)Input is clausal, will run a generic CNF schedule.
% 2.95/1.31 % (3095698)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=799285119:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.95/1.31 % (3095700)dis-21_1_sil=8000:lcm=predicate:random_seed=3118702637:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.95/1.31 % (3095695)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3874500735:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.95/1.31 % (3095696)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1060075783:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.95/1.31 % (3095697)lrs+10_1_sil=8000:sp=occurrence:random_seed=3523228731:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.95/1.31 % (3095694)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=638965109:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.95/1.31 % (3095697)Refutation not found, incomplete strategy
% 2.95/1.31 % (3095697)------------------------------
% 2.95/1.31 % (3095697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.31 % (3095697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.31 % (3095697)CaDiCaL version: 2.1.3
% 2.95/1.31 % (3095697)Termination reason: Refutation not found, incomplete strategy
% 2.95/1.31 % (3095697)Time elapsed: 0.002 s
% 2.95/1.31 % (3095697)Peak memory usage: 88 MB
% 2.95/1.31 % (3095697)Instructions burned: 2 (million)
% 2.95/1.31 % (3095698)Instruction limit reached!
% 2.95/1.31 % (3095698)------------------------------
% 2.95/1.31 % (3095698)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.31 % (3095698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.31 % (3095698)CaDiCaL version: 2.1.3
% 2.95/1.31 % (3095698)Termination reason: Instruction limit
% 2.95/1.31 % (3095698)Termination phase: Saturation
% 2.95/1.31 % (3095698)Time elapsed: 0.037 s
% 2.95/1.31 % (3095698)Peak memory usage: 87 MB
% 2.95/1.31 % (3095698)Instructions burned: 116 (million)
% 2.95/1.31 % (3095699)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=301158524:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.95/1.31 % (3095700)First to succeed.
% 2.95/1.31 % (3095700)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3095689"
% 2.95/1.31 % (3095708)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3835145795:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.95/1.31 % (3095708)Also succeeded, but the first one will report.
% 2.95/1.31 % (3095699)Instruction limit reached!
% 2.95/1.31 % (3095699)------------------------------
% 2.95/1.31 % (3095699)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.31 % (3095699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.31 % (3095699)CaDiCaL version: 2.1.3
% 2.95/1.31 % (3095699)Termination reason: Instruction limit
% 2.95/1.31 % (3095699)Termination phase: Saturation
% 2.95/1.31 % (3095699)Time elapsed: 0.124 s
% 2.95/1.31 % (3095699)Peak memory usage: 89 MB
% 2.95/1.31 % (3095699)Instructions burned: 181 (million)
% 2.95/1.31 % (3095697)------------------------------
% 2.95/1.31 % (3095697)------------------------------
% 2.95/1.31 % (3095710)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2208953055:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 2.95/1.31 % (3095710)Refutation not found, incomplete strategy
% 2.95/1.31 % (3095710)------------------------------
% 2.95/1.31 % (3095710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.31 % (3095710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.31 % (3095710)CaDiCaL version: 2.1.3
% 2.95/1.31 % (3095710)Termination reason: Refutation not found, incomplete strategy
% 2.95/1.31 % (3095710)Time elapsed: 0.002 s
% 2.95/1.31 % (3095710)Peak memory usage: 87 MB
% 2.95/1.31 % (3095710)Instructions burned: 2 (million)
% 2.95/1.31 % (3095700)Refutation found. Thanks to Tanya!
% 2.95/1.31 % SZS status Unsatisfiable for theBenchmark
% 0.17/1.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.41 % (3095700)------------------------------
% 0.17/1.41 % (3095700)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.41 % (3095700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.41 % (3095700)CaDiCaL version: 2.1.3
% 0.17/1.41 % (3095700)Termination reason: Refutation
% 0.17/1.41 % (3095700)Time elapsed: 0.057 s
% 0.17/1.41 % (3095700)Peak memory usage: 89 MB
% 0.17/1.41 % (3095700)Instructions burned: 89 (million)
% 0.17/1.41 % (3095700)------------------------------
% 0.17/1.41 % (3095700)------------------------------
% 0.17/1.41 % (3095689)Success in time 0.453 s
% 0.17/1.41 % Vampire exiting
%------------------------------------------------------------------------------