%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU159+1 : 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 : n018.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:29 PM UTC 2026
% Result : Theorem 2.57s 1.29s
% Output : Refutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 73 ( 7 unt; 5 def)
% Number of atoms : 244 ( 62 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 274 ( 103 ~; 123 |; 35 &)
% ( 11 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 91 ( 0 sgn 77 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X0,X2)
& in(X1,X2) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X3 = X0
| X3 = X1
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( X2 = unordered_pair(X0,X1)
| ( ( ( sK0(X0,X1,X2) != X0
& sK0(X0,X1,X2) != X1 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X0
| sK0(X0,X1,X2) = X1
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f15]) ).
fof(f17,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,[],[f11]) ).
fof(f18,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,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f18]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ( ~ in(X0,X2)
| ~ in(X1,X2)
| ~ subset(unordered_pair(X0,X1),X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ( ~ in(X0,X2)
| ~ in(X1,X2)
| ~ subset(unordered_pair(X0,X1),X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
( ( ~ in(sK2,sK4)
| ~ in(sK3,sK4)
| ~ subset(unordered_pair(sK2,sK3),sK4) )
& ( ( in(sK2,sK4)
& in(sK3,sK4) )
| subset(unordered_pair(sK2,sK3),sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f21]) ).
fof(f25,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
( in(sK3,sK4)
| subset(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
( in(sK2,sK4)
| subset(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
( ~ in(sK2,sK4)
| ~ in(sK3,sK4)
| ~ subset(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f27]) ).
fof(f39,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f38]) ).
fof(f40,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f26]) ).
fof(f41,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f25]) ).
fof(f44,definition,
( spl5_1
<=> subset(unordered_pair(sK2,sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f45,plain,
( ~ subset(unordered_pair(sK2,sK3),sK4)
| spl5_1 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f46,plain,
( subset(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f48,definition,
( spl5_2
<=> in(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f50,plain,
( in(sK3,sK4)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f51,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f35,f48,f44]) ).
fof(f53,definition,
( spl5_3
<=> in(sK2,sK4) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f55,plain,
( in(sK2,sK4)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f56,plain,
( spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f36,f53,f44]) ).
fof(f57,plain,
( ~ spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f37,f53,f48,f44]) ).
fof(f75,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X1,X0),X2)
| sK1(unordered_pair(X1,X0),X2) = X1
| sK1(unordered_pair(X1,X0),X2) = X0 ),
inference(resolution,[],[f42,f32]) ).
fof(f91,definition,
( spl5_4
<=> sK3 = sK1(unordered_pair(sK2,sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f93,plain,
( sK3 = sK1(unordered_pair(sK2,sK3),sK4)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f95,definition,
( spl5_5
<=> sK2 = sK1(unordered_pair(sK2,sK3),sK4) ),
introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).
fof(f97,plain,
( sK2 = sK1(unordered_pair(sK2,sK3),sK4)
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f99,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK2,sK3))
| in(X0,sK4) )
| ~ spl5_1 ),
inference(resolution,[],[f46,f31]) ).
fof(f100,plain,
( in(sK2,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f99,f39]) ).
fof(f101,plain,
( in(sK3,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f99,f41]) ).
fof(f105,plain,
( spl5_3
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f100,f44,f53]) ).
fof(f106,plain,
( spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f101,f44,f48]) ).
fof(f109,plain,
( sK2 = sK1(unordered_pair(sK2,sK3),sK4)
| sK3 = sK1(unordered_pair(sK2,sK3),sK4)
| spl5_1 ),
inference(resolution,[],[f45,f75]) ).
fof(f110,plain,
( spl5_4
| spl5_5
| spl5_1 ),
inference(avatar_split_clause,[],[f109,f44,f95,f91]) ).
fof(f112,plain,
( ~ in(sK3,sK4)
| subset(unordered_pair(sK2,sK3),sK4)
| ~ spl5_4 ),
inference(superposition,[],[f33,f93]) ).
fof(f114,plain,
( subset(unordered_pair(sK2,sK3),sK4)
| ~ spl5_2
| ~ spl5_4 ),
inference(forward_subsumption_resolution,[],[f112,f50]) ).
fof(f115,plain,
( $false
| spl5_1
| ~ spl5_2
| ~ spl5_4 ),
inference(forward_subsumption_resolution,[],[f114,f45]) ).
fof(f116,plain,
( spl5_1
| ~ spl5_2
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f127,plain,
( ~ in(sK2,sK4)
| subset(unordered_pair(sK2,sK3),sK4)
| ~ spl5_5 ),
inference(superposition,[],[f33,f97]) ).
fof(f129,plain,
( subset(unordered_pair(sK2,sK3),sK4)
| ~ spl5_3
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f127,f55]) ).
fof(f130,plain,
( $false
| spl5_1
| ~ spl5_3
| ~ spl5_5 ),
inference(forward_subsumption_resolution,[],[f129,f45]) ).
fof(f131,plain,
( spl5_1
| ~ spl5_3
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[],[f130]) ).
cnf(s1,plain,
( spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f51]) ).
cnf(s2,plain,
( spl5_1
| spl5_3 ),
inference(sat_conversion,[],[f56]) ).
cnf(s3,plain,
( ~ spl5_1
| ~ spl5_2
| ~ spl5_3 ),
inference(sat_conversion,[],[f57]) ).
cnf(s6,plain,
( ~ spl5_1
| spl5_3 ),
inference(sat_conversion,[],[f105]) ).
cnf(s7,plain,
( ~ spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f106]) ).
cnf(s8,plain,
( spl5_1
| spl5_4
| spl5_5 ),
inference(sat_conversion,[],[f110]) ).
cnf(s9,plain,
( spl5_1
| ~ spl5_2
| ~ spl5_4 ),
inference(sat_conversion,[],[f116]) ).
cnf(s10,plain,
( spl5_1
| ~ spl5_3
| ~ spl5_5 ),
inference(sat_conversion,[],[f131]) ).
cnf(s11,plain,
spl5_1,
inference(rat,[],[s8,s9,s10,s1,s2]) ).
cnf(s12,plain,
spl5_2,
inference(rat,[],[s7,s11]) ).
cnf(s13,plain,
spl5_3,
inference(rat,[],[s6,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s3,s13,s12,s11]) ).
fof(f132,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU159+1 : 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.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:50:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.57/1.29 % (2976765)Detected formulas, will run a generic FOF schedule.
% 2.57/1.29 % (2976774)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3073640419:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.57/1.29 % (2976774)Instruction limit reached!
% 2.57/1.29 % (2976774)------------------------------
% 2.57/1.29 % (2976774)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.29 % (2976774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.29 % (2976774)CaDiCaL version: 2.1.3
% 2.57/1.29 % (2976774)Termination reason: Instruction limit
% 2.57/1.29 % (2976774)Termination phase: Saturation
% 2.57/1.29 % (2976774)Time elapsed: 0.030 s
% 2.57/1.29 % (2976774)Peak memory usage: 88 MB
% 2.57/1.29 % (2976774)Instructions burned: 120 (million)
% 2.57/1.29 % (2976771)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=3026711422:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.57/1.29 % (2976773)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=388718468:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.57/1.29 % (2976775)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4058303802:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.57/1.29 % (2976772)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=3587679932:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.57/1.29 % (2976770)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=1418561008:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.57/1.29 % (2976776)dis-21_1_sil=8000:lcm=predicate:random_seed=3150099271: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.57/1.29 % (2976773)Refutation not found, incomplete strategy
% 2.57/1.29 % (2976773)------------------------------
% 2.57/1.29 % (2976773)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.29 % (2976773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.29 % (2976773)CaDiCaL version: 2.1.3
% 2.57/1.29 % (2976773)Termination reason: Refutation not found, incomplete strategy
% 2.57/1.29 % (2976773)Time elapsed: 0.001 s
% 2.57/1.29 % (2976773)Peak memory usage: 88 MB
% 2.57/1.29 % (2976775)First to succeed.
% 2.57/1.29 % (2976775)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2976765"
% 2.57/1.29 % (2976776)Instruction limit reached!
% 2.57/1.29 % (2976776)------------------------------
% 2.57/1.29 % (2976776)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.29 % (2976776)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.29 % (2976776)CaDiCaL version: 2.1.3
% 2.57/1.29 % (2976776)Termination reason: Instruction limit
% 2.57/1.29 % (2976776)Termination phase: Saturation
% 2.57/1.29 % (2976776)Time elapsed: 0.075 s
% 2.57/1.29 % (2976776)Peak memory usage: 89 MB
% 2.57/1.29 % (2976776)Instructions burned: 131 (million)
% 2.57/1.29 % (2976778)lrs+10_1_sil=8000:sp=occurrence:random_seed=2623862391:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.57/1.29 % (2976778)Also succeeded, but the first one will report.
% 2.57/1.29 % (2976773)------------------------------
% 2.57/1.29 % (2976773)------------------------------
% 2.57/1.29 % (2976785)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2873219711:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.57/1.29 % (2976775)Refutation found. Thanks to Tanya!
% 2.57/1.29 % SZS status Theorem for theBenchmark
% 2.57/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.48 % (2976775)------------------------------
% 3.63/1.48 % (2976775)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.48 % (2976775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.48 % (2976775)CaDiCaL version: 2.1.3
% 3.63/1.48 % (2976775)Termination reason: Refutation
% 3.63/1.48 % (2976775)Time elapsed: 0.006 s
% 3.63/1.48 % (2976775)Peak memory usage: 90 MB
% 3.63/1.48 % (2976775)Instructions burned: 6 (million)
% 3.63/1.48 % (2976775)------------------------------
% 3.63/1.48 % (2976775)------------------------------
% 3.63/1.48 % (2976765)Success in time 0.432 s
% 3.63/1.48 % Vampire exiting
%------------------------------------------------------------------------------