%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU144+2 : 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 : n008.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:24 PM UTC 2026
% Result : Theorem 2.73s 1.24s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 68 ( 7 unt; 2 def)
% Number of atoms : 236 ( 52 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 268 ( 100 ~; 113 |; 41 &)
% ( 11 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 100 ( 0 sgn 87 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f12,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f28,axiom,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f29,conjecture,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f30,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f42,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f76,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f81,plain,
? [X0,X1] :
( subset(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f89,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f106,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X2 = X0
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f107,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X2 = X0
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f106]) ).
fof(f108,plain,
! [X0,X1] :
( ( X1 = singleton(X0)
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f107]) ).
fof(f109,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f110,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f109]) ).
fof(f111,plain,
! [X0] :
( ( X0 = empty_set
| in(sK1(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f110]) ).
fof(f120,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,[],[f76]) ).
fof(f121,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,[],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK4(X0,X1),X1)
& in(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f121]) ).
fof(f123,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f124,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f123]) ).
fof(f125,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f124]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X1)
| ~ in(sK5(X0,X1,X2),X2) )
& ( ( in(sK5(X0,X1,X2),X0)
& in(sK5(X0,X1,X2),X1) )
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f125]) ).
fof(f132,plain,
? [X0,X1] :
( ( ~ in(X0,X1)
| ~ subset(singleton(X0),X1) )
& ( in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f133,plain,
( ( ~ in(sK7,sK8)
| ~ subset(singleton(sK7),sK8) )
& ( in(sK7,sK8)
| subset(singleton(sK7),sK8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f132]) ).
fof(f151,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f108]) ).
fof(f156,plain,
! [X0] :
( in(sK1(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f111]) ).
fof(f170,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f171,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f172,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f126]) ).
fof(f193,plain,
! [X0] : singleton(X0) != empty_set,
inference(cnf_transformation,[],[f28]) ).
fof(f194,plain,
( in(sK7,sK8)
| subset(singleton(sK7),sK8) ),
inference(cnf_transformation,[],[f133]) ).
fof(f195,plain,
( ~ in(sK7,sK8)
| ~ subset(singleton(sK7),sK8) ),
inference(cnf_transformation,[],[f133]) ).
fof(f208,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f89]) ).
fof(f243,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f151]) ).
fof(f255,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f172]) ).
fof(f260,definition,
( spl14_1
<=> subset(singleton(sK7),sK8) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f261,plain,
( ~ subset(singleton(sK7),sK8)
| spl14_1 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( subset(singleton(sK7),sK8)
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f264,definition,
( spl14_2
<=> in(sK7,sK8) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f265,plain,
( ~ in(sK7,sK8)
| spl14_2 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
( in(sK7,sK8)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f194,f264,f260]) ).
fof(f268,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f195,f264,f260]) ).
fof(f290,plain,
! [X0] :
( sK1(singleton(X0)) = X0
| singleton(X0) = empty_set ),
inference(resolution,[],[f243,f156]) ).
fof(f291,plain,
! [X0] : sK1(singleton(X0)) = X0,
inference(forward_subsumption_resolution,[],[f290,f193]) ).
fof(f319,plain,
( in(sK4(singleton(sK7),sK8),singleton(sK7))
| spl14_1 ),
inference(resolution,[],[f170,f261]) ).
fof(f322,plain,
( sK7 = sK4(singleton(sK7),sK8)
| spl14_1 ),
inference(resolution,[],[f319,f243]) ).
fof(f325,plain,
( ~ in(sK7,sK8)
| subset(singleton(sK7),sK8)
| spl14_1 ),
inference(superposition,[],[f171,f322]) ).
fof(f326,plain,
( subset(singleton(sK7),sK8)
| spl14_1
| ~ spl14_2 ),
inference(forward_subsumption_resolution,[],[f325,f266]) ).
fof(f327,plain,
( $false
| spl14_1
| ~ spl14_2 ),
inference(forward_subsumption_resolution,[],[f326,f261]) ).
fof(f328,plain,
( spl14_1
| ~ spl14_2 ),
inference(avatar_contradiction_clause,[],[f327]) ).
fof(f329,plain,
( singleton(sK7) = set_intersection2(singleton(sK7),sK8)
| ~ spl14_1 ),
inference(resolution,[],[f262,f208]) ).
fof(f352,plain,
( ! [X0] :
( ~ in(X0,singleton(sK7))
| in(X0,sK8) )
| ~ spl14_1 ),
inference(superposition,[],[f255,f329]) ).
fof(f354,plain,
( in(sK1(singleton(sK7)),sK8)
| empty_set = singleton(sK7)
| ~ spl14_1 ),
inference(resolution,[],[f352,f156]) ).
fof(f355,plain,
( in(sK1(singleton(sK7)),sK8)
| ~ spl14_1 ),
inference(forward_subsumption_resolution,[],[f354,f193]) ).
fof(f358,plain,
( in(sK7,sK8)
| ~ spl14_1 ),
inference(forward_demodulation,[],[f355,f291]) ).
fof(f359,plain,
( $false
| ~ spl14_1
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f358,f265]) ).
fof(f360,plain,
( ~ spl14_1
| spl14_2 ),
inference(avatar_contradiction_clause,[],[f359]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f267]) ).
cnf(s2,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(sat_conversion,[],[f268]) ).
cnf(s3,plain,
( spl14_1
| ~ spl14_2 ),
inference(sat_conversion,[],[f328]) ).
cnf(s5,plain,
( ~ spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f360]) ).
cnf(s6,plain,
spl14_1,
inference(rat,[],[s1,s3]) ).
cnf(s7,plain,
spl14_2,
inference(rat,[],[s5,s6]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s2,s7,s6]) ).
fof(f361,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU144+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.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 03:44:25 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.73/1.24 % (1847188)Detected formulas, will run a generic FOF schedule.
% 2.73/1.24 % (1847196)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2795520339:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.73/1.24 % (1847196)Instruction limit reached!
% 2.73/1.24 % (1847196)------------------------------
% 2.73/1.24 % (1847196)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.24 % (1847196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.24 % (1847196)CaDiCaL version: 2.1.3
% 2.73/1.24 % (1847196)Termination reason: Instruction limit
% 2.73/1.24 % (1847196)Termination phase: Saturation
% 2.73/1.24 % (1847196)Time elapsed: 0.038 s
% 2.73/1.24 % (1847196)Peak memory usage: 89 MB
% 2.73/1.24 % (1847196)Instructions burned: 110 (million)
% 2.73/1.24 % (1847198)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=533491971:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.73/1.24 % (1847197)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=174485543:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.73/1.24 % (1847199)dis-21_1_sil=8000:lcm=predicate:random_seed=2327956403: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.73/1.24 % (1847193)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=3331941634:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.73/1.24 % (1847195)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=1039342721:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.73/1.24 % (1847194)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=3205451423:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.73/1.24 % (1847198)First to succeed.
% 2.73/1.24 % (1847198)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1847188"
% 2.73/1.24 % (1847197)Instruction limit reached!
% 2.73/1.24 % (1847197)------------------------------
% 2.73/1.24 % (1847197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.24 % (1847197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.24 % (1847197)CaDiCaL version: 2.1.3
% 2.73/1.24 % (1847197)Termination reason: Instruction limit
% 2.73/1.24 % (1847197)Termination phase: Saturation
% 2.73/1.24 % (1847197)Time elapsed: 0.074 s
% 2.73/1.24 % (1847197)Peak memory usage: 89 MB
% 2.73/1.24 % (1847197)Instructions burned: 119 (million)
% 2.73/1.24 % (1847199)Instruction limit reached!
% 2.73/1.24 % (1847199)------------------------------
% 2.73/1.24 % (1847199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.24 % (1847199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.24 % (1847199)CaDiCaL version: 2.1.3
% 2.73/1.24 % (1847199)Termination reason: Instruction limit
% 2.73/1.24 % (1847199)Termination phase: Saturation
% 2.73/1.24 % (1847199)Time elapsed: 0.081 s
% 2.73/1.24 % (1847199)Peak memory usage: 89 MB
% 2.73/1.24 % (1847199)Instructions burned: 129 (million)
% 2.73/1.24 % (1847202)lrs+10_1_sil=8000:sp=occurrence:random_seed=2125113038:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.73/1.24 % (1847202)Also succeeded, but the first one will report.
% 2.73/1.24 % (1847208)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3063797260:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.73/1.24 % (1847208)Also succeeded, but the first one will report.
% 2.73/1.24 % (1847210)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3608807198:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.73/1.24 % (1847198)Refutation found. Thanks to Tanya!
% 2.73/1.24 % SZS status Theorem for theBenchmark
% 2.73/1.24 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.44 % (1847198)------------------------------
% 3.48/1.44 % (1847198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.44 % (1847198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.44 % (1847198)CaDiCaL version: 2.1.3
% 3.48/1.44 % (1847198)Termination reason: Refutation
% 3.48/1.44 % (1847198)Time elapsed: 0.008 s
% 3.48/1.44 % (1847198)Peak memory usage: 90 MB
% 3.48/1.44 % (1847198)Instructions burned: 9 (million)
% 3.48/1.44 % (1847198)------------------------------
% 3.48/1.44 % (1847198)------------------------------
% 3.48/1.44 % (1847188)Success in time 0.408 s
% 3.48/1.44 % Vampire exiting
%------------------------------------------------------------------------------