%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU159+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 0.78s 1.02s
% Output : Refutation 3.33s
% 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(f8,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(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f13,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X0,X2)
& in(X1,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
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(nnf_transformation,[],[f3]) ).
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) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X0 != X3
& X1 != X3 ) )
& ( X3 = X0
| X3 = X1
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f14]) ).
fof(f16,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,[],[f15]) ).
fof(f17,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))],[f16]) ).
fof(f18,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,[],[f12]) ).
fof(f19,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,[],[f18]) ).
fof(f20,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))],[f19]) ).
fof(f23,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,[],[f13]) ).
fof(f24,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,[],[f23]) ).
fof(f25,plain,
( ( ~ in(sK4,sK6)
| ~ in(sK5,sK6)
| ~ subset(unordered_pair(sK4,sK5),sK6) )
& ( ( in(sK4,sK6)
& in(sK5,sK6) )
| subset(unordered_pair(sK4,sK5),sK6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f24]) ).
fof(f28,plain,
! [X2,X0,X1,X4] :
( X0 = X4
| X1 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f30,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f35,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X0,X1] :
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f40,plain,
( in(sK5,sK6)
| subset(unordered_pair(sK4,sK5),sK6) ),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
( in(sK4,sK6)
| subset(unordered_pair(sK4,sK5),sK6) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
( ~ in(sK4,sK6)
| ~ in(sK5,sK6)
| ~ subset(unordered_pair(sK4,sK5),sK6) ),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f30]) ).
fof(f44,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f43]) ).
fof(f45,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f29]) ).
fof(f46,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f28]) ).
fof(f49,definition,
( spl7_1
<=> subset(unordered_pair(sK4,sK5),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f50,plain,
( ~ subset(unordered_pair(sK4,sK5),sK6)
| spl7_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f51,plain,
( subset(unordered_pair(sK4,sK5),sK6)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f53,definition,
( spl7_2
<=> in(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f55,plain,
( in(sK5,sK6)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f56,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f40,f53,f49]) ).
fof(f58,definition,
( spl7_3
<=> in(sK4,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f60,plain,
( in(sK4,sK6)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f61,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f41,f58,f49]) ).
fof(f62,plain,
( ~ spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f42,f58,f53,f49]) ).
fof(f80,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,[],[f47,f35]) ).
fof(f96,definition,
( spl7_4
<=> sK5 = sK1(unordered_pair(sK4,sK5),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f98,plain,
( sK5 = sK1(unordered_pair(sK4,sK5),sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f100,definition,
( spl7_5
<=> sK4 = sK1(unordered_pair(sK4,sK5),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f102,plain,
( sK4 = sK1(unordered_pair(sK4,sK5),sK6)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f100]) ).
fof(f104,plain,
( ! [X0] :
( ~ in(X0,unordered_pair(sK4,sK5))
| in(X0,sK6) )
| ~ spl7_1 ),
inference(resolution,[],[f51,f34]) ).
fof(f105,plain,
( in(sK4,sK6)
| ~ spl7_1 ),
inference(resolution,[],[f104,f44]) ).
fof(f106,plain,
( in(sK5,sK6)
| ~ spl7_1 ),
inference(resolution,[],[f104,f46]) ).
fof(f110,plain,
( spl7_3
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f105,f49,f58]) ).
fof(f111,plain,
( spl7_2
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f106,f49,f53]) ).
fof(f114,plain,
( sK4 = sK1(unordered_pair(sK4,sK5),sK6)
| sK5 = sK1(unordered_pair(sK4,sK5),sK6)
| spl7_1 ),
inference(resolution,[],[f50,f80]) ).
fof(f115,plain,
( spl7_4
| spl7_5
| spl7_1 ),
inference(avatar_split_clause,[],[f114,f49,f100,f96]) ).
fof(f117,plain,
( ~ in(sK5,sK6)
| subset(unordered_pair(sK4,sK5),sK6)
| ~ spl7_4 ),
inference(superposition,[],[f36,f98]) ).
fof(f119,plain,
( subset(unordered_pair(sK4,sK5),sK6)
| ~ spl7_2
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f117,f55]) ).
fof(f120,plain,
( $false
| spl7_1
| ~ spl7_2
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f119,f50]) ).
fof(f121,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f132,plain,
( ~ in(sK4,sK6)
| subset(unordered_pair(sK4,sK5),sK6)
| ~ spl7_5 ),
inference(superposition,[],[f36,f102]) ).
fof(f134,plain,
( subset(unordered_pair(sK4,sK5),sK6)
| ~ spl7_3
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f132,f60]) ).
fof(f135,plain,
( $false
| spl7_1
| ~ spl7_3
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f134,f50]) ).
fof(f136,plain,
( spl7_1
| ~ spl7_3
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f135]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f56]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f61]) ).
cnf(s3,plain,
( ~ spl7_1
| ~ spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f62]) ).
cnf(s6,plain,
( ~ spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f110]) ).
cnf(s7,plain,
( ~ spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f111]) ).
cnf(s8,plain,
( spl7_1
| spl7_4
| spl7_5 ),
inference(sat_conversion,[],[f115]) ).
cnf(s9,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_4 ),
inference(sat_conversion,[],[f121]) ).
cnf(s10,plain,
( spl7_1
| ~ spl7_3
| ~ spl7_5 ),
inference(sat_conversion,[],[f136]) ).
cnf(s11,plain,
spl7_1,
inference(rat,[],[s8,s9,s10,s1,s2]) ).
cnf(s12,plain,
spl7_2,
inference(rat,[],[s7,s11]) ).
cnf(s13,plain,
spl7_3,
inference(rat,[],[s6,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s3,s13,s12,s11]) ).
fof(f137,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU159+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.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.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 03:48:30 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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
% 0.78/1.02 % (2643945)Detected formulas, will run a generic FOF schedule.
% 0.78/1.02 % (2643954)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2716569912:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.78/1.02 % (2643955)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3286661595:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.78/1.02 % (2643956)dis-21_1_sil=8000:lcm=predicate:random_seed=3307687974: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)
% 0.78/1.02 % (2643953)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=281705246:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.78/1.02 % (2643952)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=1613847099:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.78/1.02 % (2643950)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=1270928476:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.78/1.02 % (2643951)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=2652423241:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.78/1.02 % (2643953)Refutation not found, incomplete strategy
% 0.78/1.02 % (2643953)------------------------------
% 0.78/1.02 % (2643953)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.78/1.02 % (2643953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.78/1.02 % (2643953)CaDiCaL version: 2.1.3
% 0.78/1.02 % (2643953)Termination reason: Refutation not found, incomplete strategy
% 0.78/1.02 % (2643953)Time elapsed: 0.001 s
% 0.78/1.02 % (2643953)Peak memory usage: 88 MB
% 0.78/1.02 % (2643955)First to succeed.
% 0.78/1.02 % (2643955)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2643945"
% 0.78/1.02 % (2643954)Instruction limit reached!
% 0.78/1.02 % (2643954)------------------------------
% 0.78/1.02 % (2643954)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.78/1.02 % (2643954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.78/1.02 % (2643954)CaDiCaL version: 2.1.3
% 0.78/1.02 % (2643954)Termination reason: Instruction limit
% 0.78/1.02 % (2643954)Termination phase: Saturation
% 0.78/1.02 % (2643954)Time elapsed: 0.057 s
% 0.78/1.02 % (2643954)Peak memory usage: 87 MB
% 0.78/1.02 % (2643954)Instructions burned: 119 (million)
% 0.78/1.02 % (2643956)Instruction limit reached!
% 0.78/1.02 % (2643956)------------------------------
% 0.78/1.02 % (2643956)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.78/1.02 % (2643956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.78/1.02 % (2643956)CaDiCaL version: 2.1.3
% 0.78/1.02 % (2643956)Termination reason: Instruction limit
% 0.78/1.02 % (2643956)Termination phase: Saturation
% 0.78/1.02 % (2643956)Time elapsed: 0.075 s
% 0.78/1.02 % (2643956)Peak memory usage: 88 MB
% 0.78/1.02 % (2643956)Instructions burned: 130 (million)
% 0.78/1.02 % (2643964)lrs+10_1_sil=8000:sp=occurrence:random_seed=2579029615:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 0.78/1.02 % (2643964)Also succeeded, but the first one will report.
% 0.78/1.02 % (2643965)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4150292716:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.78/1.02 % (2643953)------------------------------
% 0.78/1.02 % (2643953)------------------------------
% 0.78/1.02 % (2643955)Refutation found. Thanks to Tanya!
% 0.78/1.02 % SZS status Theorem for theBenchmark
% 0.78/1.02 % SZS output start Proof for theBenchmark
% See solution above
% 3.33/1.22 % (2643955)------------------------------
% 3.33/1.22 % (2643955)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.22 % (2643955)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.22 % (2643955)CaDiCaL version: 2.1.3
% 3.33/1.22 % (2643955)Termination reason: Refutation
% 3.33/1.22 % (2643955)Time elapsed: 0.006 s
% 3.33/1.22 % (2643955)Peak memory usage: 90 MB
% 3.33/1.22 % (2643955)Instructions burned: 6 (million)
% 3.33/1.22 % (2643955)------------------------------
% 3.33/1.22 % (2643955)------------------------------
% 3.33/1.22 % (2643945)Success in time 0.414 s
% 3.33/1.22 % Vampire exiting
%------------------------------------------------------------------------------